THE WAY OF CALCULATING THE TRAFFIC AND SIGNALING NETWORK DIMENSION OF COMMON CHANNEL SIGNALING NO.7 (CCS7)

Size: px
Start display at page:

Download "THE WAY OF CALCULATING THE TRAFFIC AND SIGNALING NETWORK DIMENSION OF COMMON CHANNEL SIGNALING NO.7 (CCS7)"

Transcription

1 The Way of Calculatig The Traffic... THE WAY OF CALCULATIG THE TRAFFIC AD SIGALIG ETWORK DIMESIO OF COMMO CHAEL SIGALIG O.7 (CCS7) Departeme Tekik Elektro, Fakultas Tekik, Uiversitas Sumatera Utara Abstract: Calculatig the traffic ad dimesio eeds to be doe at the plaig of telecommuicatio etwork, because, by calculatig the traffic we will fid out the amout of the traffic which will be trasferred ad by calculatig the dimesio we will fig out the amout of the etwork eeds to be provided. Ad at the CCS7 sigalig etwork as well, calculatig the traffic ad dimesio eeds to be implemeted. CCS7 costitutes multi-fuctio sigalig type which eables to the trasfer the whole iformatio data such as voice, computer data i high speed, ad visio, which ca be cotrolled through the CCS7 sigalig etwork. CCS7 sigalig system is oly able to work i digital cetral, costitutes the last sigalig system of the group of telephoe sigalig recommeded by Iteratioal Telecommucatio Uio (ITU) which previously amed Committee Cosultative /Iteratioal Telegraph ad Telephoe (CITT), which works by out of bad (commo chael) so the etwork supported ca efficietly work. I calculatig the traffic ad dimesio CCS7 ivolves four objects, i.e. by calculatig the traffic iter ed ode called Sigalig Ed Poit (SEP) iter traffic, calculatig the traffic i coectio lie iter ode called likset traffic, ad calculatig the ode dimesio called Sigalig Poit () dimesio. is geeral ode, which ca be SEP or Sigalig Trasfer Poit (). The method of calculatig the four objects i calculatig the traffic ad dimesio of CCS7 lies i this paper.. ITRODUCTIO The eed of telecommuicatio service for the user is more various, thus the high speed, effective, ad efficiet sigalig system is eeded. CCS7 costitutes a solutio of sigalig system which has the ability to give excellet telecommuicatio service which: Has optimal ability to use i digital commuicatio etwork together with cetral digital of stored program cotrol, used the digital caal of 64 Kbps Is desiged for iformatio trasfer call cotrol provisio for ow ad i the future, remote cotrol, maagemet ad maiteace Has the good ability i trasferrig the iformatio with correct sequece without loss. Some applicatios which ca be supported by CCS7 are Public Switch Telephoe. etwork (PST), Itegrated Switch Digital etwork (ISD), Itelligece etwork (I), Persoal Commuicatio etwork (PC). (CCITT, 98). I desigig the sigalig etwork CCS7, we eed to calculate the traffic ad dimesio. First of all, we will discuss the calculatio of the traffic iter SEP. With the result of the calculatio, we cotiue calculatig the likest traffic. Furthermore, accordig to the result of likset traffic calculatig we will discuss about the calculatig of Likset Dimesio ad Dimesio. Traffic iter SEP is calculated by fidig out the iput data i.e. callig ad sigalig data ; the calculatio is doe by multiplyig the callig data ad sigalig data. Whereas, likset traffic is calculated by fidig out the iput data i.e. iter traffic SEP ad route arragemet ; the calculatio is doe by summig up every SEP iter traffic which is routed to the likset. Likset dimesio is faster calculated, which is determied by the iput data i.e. the byte itegratio likset traffic. The determiatio is doe by usig the table of maximum likset capacity made by ITU. dimesio is calculated by the iput data i.e. traffic likset itegratio of Message Sigal Uit (), ad the calculatig is doe by summig up all the likset traffic set ad received by.. CCS7 ARCHITECTURE Telecommuicatio etwork is made from several switchig ad processig ode itercoected by the lik trasmissio. I this 73

2 Jural Sistem Tekik Idustri Volume 7, o. April 006 case, commuicatio by usig CCS7, the odes eed feature CCS7 so that they ca be fuctioed as. is a ode which is able to hadle the cotrol message of CCS7. I order make the iformatio or the data ca be set or received iter, the itercoectio through lik sigalig is eeded. I CCS7, the cotrol message is routed i shape of packages through the etwork for formig call maagemet fuctio (set up, maiteace, termiatio) ad maagemet etwork fuctio. Oe circuit is determied by the local cetral i which oe user is coected to aother user by passig oe or more other circuit switchig ode used as Trasit Ceter (TC). Figure shows the architecture of CCS7 i telecommuicatio etwork (). USER USER CCS7 TC TC Cotrol Plae Iformatio Plae TC USER USER Figure. Architecture of CCS7 i telecommuicatio etwork 3. ETWORK MODEL OF PST, I, AD CCS7 I calculatig the traffic ad dimesio of CCS7, we ca see the etwork model i Figure to help the discussio: SEP D LIKSET CIRCUIT GROUP SEP D SCP LIKSET E SEP D LIKSET LIKSET CIRCUIT GROUP S SEP LT Figure. etwork model: Public Switch Telephoe etwork (PST); Itelliget etwork (I), ad Commo Chael Sigalig o.7 (CCS7). I figure, there are 3 etworks i.e. PST, I, ad CCS7 etwork. PST ad I etwork represet the etwork served by CCS7, ad CCS7 etwork itself i.e. the etwork which will discuss for the traffic ad dimesio calculatig. PST etwork i Figure, is determied by three ode, i.e. ode A as Local Exchage () called A (), ode B as Local Trasit exchage (LT) called ode B (LT); ad ode C as Local Exchage () called ode C (). I PST etwork, the coectio lies of ode A (),B (LT) ad C () is represeted by thick lie i the shape of circuit group.(itu,99) I etwork i figure is determied by odes, i.e. ode B as Service Switchig Poit (S) called ode B (S), ad ode D as Service Cotrol Poit (SCP) called ode D (SCP). I this etwork, betwee ode B (S) ad ode D (SC) (broke lie) there is o coectio lie iter odes, because the likset coectig S ad SCP through Sigalig Trasfer Poit () cosidered as a part of CCS7 etwork. CCS7 etwork i figure is represeted by 5 odes, i.e.: ode A, ode B, ode C, ad ode D, as Sigalig Ed Poit (SEP) called as ode A (SEP), B (SEP), C (SEP), D (SEP), ad ode E as Sigalig Trasfer Poit () which is called as ode E (). I this etwork, the coectio lie iter ode A (SEP), B (SEP), C (SEP), D (SEP), ad E () i the shape of likset is represeted by broke lies. The model of CCS7 etwork is arraged i star cofiguratio, where SEP is oly coected to, which meas sigalig iter SEP is always routed through. (ITU, 99) Although the model above oly describe the service of CCS7 to PST ad I etwork. But it also ca represet the service to cellular D 74

3 The Way of Calculatig The Traffic... etwork. For example GSM (Global System for Mobile Commuicatio), where S ad SCP i I ca be equalized respectively with MSC/VLR (Mobile Switchig Ceter/Visitor Locatio Register) ad HLR (Home Locatio Register). Whereas, ad LT i PST ca be equalized with MSC i GSM. 4. CALCULATIG THE TRAFFIC AD DIMESIO OF CCS7 ETWORK Calculatig the traffic ad dimesio of CCS7 ivolves 4 objects, i.e.: Calculatig the traffic iter ed ode called traffic iter SE Calculatig the traffic i coectio lie iter ode called likset traffic Calculatig the dimesio of coectio lie iter ode called likset dimesio Calculatig the ode dimesio called dimesio The ways of calculatig the 4 objects above will be discussed i this paper. 4. The way of Calculatig the Traffic iter ed ode (Traffic iter SEP) (Message Sigal Uit) curret which moves from a SEP to other SEP through likset is the shape of sigalig traffic of CCS7, where i this curret of CCS7 etwork, there are kids of traffic, amely: The traffic from oe SEP to aother SEP by igorig likset (traffic iter SEP). Traffic iter SEP oly coected to the source ad destiatio ode, ot iflueced by the etwork cofiguratio ad traffic routig patter i the etwork. The traffic that flows to the likset (likset traffic) costitutes routig result of some traffic iter SEP to the likset. The calculstio of traffic iter SEP must be calculated for each sigalig directios. Because callig directio (circuit occupatio) occurred betwee two PST odes is two directios, so sigalig directio servig PST is also directios. Whereas, because the callig directio (traslatio digit demad) occurred betwee two odes I is oly oe directio (from S to SCP), so sigalig directio betwee two SEP servig I is oe directo. (ITU, 99) Because of iteractive feature of sigalig. -forward traffic ad -reverse traffic occurred i every sigalig directios. Cosequetly, -forward traffic ad reverse traffic must be calculated i every sigalig directios. Thus, for example, the model i Figure, traffic iter SEP which must be calculated ca be see i Table. The data eeded to calculate iter SEP are: Callig data (occupatio of circuit for PST ad digit traslatio demad I) Sigalig demad ( data/callig ad byte/) For the callig data, it eeds: The umber of callig/sec = P Success callig ratio = PS (%) Table. Traffic Iter SEP Which Must be Calculated for the Model i Figure Sigalig directio o sigalig directio Traffic Calculated otes A to B - Traffic - forward - A to B - Traffic - reverse - B to A - Traffic -forward - B to A - Traffic -reverse - B to C - Traffic -forward - B to C - Traffic -reverse - C to D - Traffic -forward - C to D - Traffic -reverse - B to D - Traffic -forward - B to D - Traffic -reverse - - D to B - Because i I the callig (digit traslatio demad) from SCP to S ever occurs - A to C C to A - Because there is o circuit betwee A () ad C (), so that there is o callig (sirsuit occupatio) betwee the odes 75

4 Jural Sistem Tekik Idustri Volume 7, o. April 006 Table. The Data eeded to the Calculatio Iter SEP for Callig Data i the Model i Figure Callig Directios Kids of service Callig/sec = (P) Success Callig Ratio = (PS) % A () to B (LT) B (LT) to A () B(LT) to C () C () to B (LT) B (S) to D (SCP) Table 3. Data eeded for Iter SEP Calculatio for Sigalig Data i the Model Sample i Figure Sigalig Directio Kids of Service Success Callig Fail Callig A(SEP) to B(SEP) B(SEP) to A(SEP) B(SEP) to C(SEP) C(SEP) to B(SEP) B(SEP) to D(SEP) forward/ callig Byte/ forward reverse/ callig Byte/ reverse forward/ callig Byte/ forward reverse/ callig Byte / reverse The complete data eeded for the calculatio of ite SE for Callig Data i the example of Figure ca be see i Table. That is so the complete data eeded to calculate traffic iter SEP for Sigalig Data i the model i Figure : The average umber of -forward/the callig for success callig = _MS (/Callig) The average umber of Byte/-forward for success callig = Byte_MS (Byte/) The average umber of -reverse/the callig for success callig = _BS (/Calllig) The average umber of Byte/-reverse for success callig = Byte_BS (Byte/) The average umber of -forward/the callig for fail callig = _MG (/callig) The average umber of Byte/-forward for fail callig = Byte_MG (Byte/) The average umber of -reverse/the callig for fail callig = _BG (/Callig) The average umber of Byte /-reverse for fail callig = Byte_BG (Byte/) For the calculatig of traffic iter SEP for Sigalig Data above, for example i Figure ca be see i Table 3. The sigalig data eeded is data /callig ad byte/. Byte/ is used to chage uit to byte. Because of the traffic calculatio output is stated i two uits, 76

5 The Way of Calculatig The Traffic... i.e. ad byte, so we eed to chage from to byte, whereas is later for calculatig the likset dimesio. The callig ad sigalig data above is eeded for every callig directio or sigalig ad kids of services, because every callig directio or sigalig has differet callig characteristics or sigalig although they are i the same service. Ad also every kid of services has differet callig or sigalig characteristics, although the callig or sigalig directio are the same. (ITU 99). I PST, if the callig data/secod is ot provided, for data istead ca be used is the data volume traffic i erlag or data of circuit umber, ad because the data eeded is the umber of callig/secod, the data of erlag traffic or the umber of circuit must be chaged first ito the shape of callig/secod before used for the calculatio iter SEP. I order to chage erlag traffic data ito the shape of callig/secod, we eed the data of average circuit held time i secod (W). Thus, the chage of erlag traffic data ito the form of callig/secod ca be doe by usig formula (Siemes AG, 994): Callig/sec = traffic (erlag) = W (sec) () By addig the circuit umber data first ito the erlag traffic ad from the traffic erlag the chaged ito the callig/secod, we ca chage the circuit umber data ito callig/secod. The chagig of circuit umber data ito the erlag traffic is usig circuit efficiecy parameter obtaied by usig the formula (Siemes, 994): Erlag traffic = Efficiecy (%) X total circuit () The calculatio of traffic iter SEP for every directios of must be doe two times because the output respectively result i output with uit ad byte. So, the calculatio of traffic which must be doe for every sigalig directios became two directio of MS with two calculatio each, results i the calculatio of traffic for every sigalig directios became four times calculatio. The callig data ad sigalig data provided by every sigalig directios are the data per kid of service. So, the traffic iter SE per sigalig directio costitutes the agregasio from traffic per kid of service (Siemes AG, 994). The calculatio of traffic iter SEP for every sigalig directios which cotais four calculatio (every sigalig directios becomes two directios of with two calculatios each) ca be doe by the formula below. Sigalig X to Y: Traffic -forward (/sec) = = Pi {PSi x _MSi + (-PSi) x _MGi} (3) i= traffic -forward (bytesec)= = Pi {PSi x _MSi x Byte_MSi+ (- PSi)x_MGixyte_MGi}..(4) i= Traffic -reverse (sec)= = Pi {PSi x _BSi + (-PSi) x _BGi}...(5) i= traffic -reverse (bytesec)= = Pi {PSi x _BSi xbyte_bsi+(- PSi)x_BGixByte_BGi}..(6) i=kid of service Where: _MS (/Callig) = the average umber of -forwardthe callig for success callig Byte_MS (Byte/) = the average umber of Byte/-forward for success callig. _BS (/Callig) = the average umber of -reverse/the callig for success callig. Byte_BS (Byte/) = the average umber of Byte/-reverse for success callig. _MG (/Callig) = the average umber of -forward/the callig for fail callig. Byte_MG (Byte/) = the average umber of Byte/-forward for fail callig. _BG (/Callig) = the average umber of -reverse for fail callig. 77

6 Jural Sistem Tekik Idustri Volume 7, o. April The Way to Calculate the Traffic i Coectio Lie iter ode (Traffic Likset) Likset is the coectio lie iter ay ode CCS7 to SEP as well as. The Traffict that flows i likset traffic costitutes the traffic preset i the etwork, ad obtaied from the traffic routig iter SEP to the likset. So, the Likset traffic will be iflueced by the etwork cofiguratio ad the traffic rouig patter as well. Likset traffic is ot calculated for every sigalig directios, but for every likset. This is because the likset traffic costitutes the traffic iter ay ode is ot always the sigalig passer ode or SEP. Although the two directio is always i every likset, the directio of traffic ca ot be stated as -forward traffic ad reverse traffic. The directio of traffic is oly stated as two SEP/ which flaks the likset. This is because the -forward traffic ad -reverse traffic preset i oe sigalig directio i the traffic iter SEP is routed i oe idetic likset. Ad there is o sigalig directio referece because the traffic iter ay ode is ot always sigalig ode. (Siemes AG,994). For the sample model i Figure, the likset traffic calculatio must calculated ad ca be see i Table 4. Table 4. Likset Traffic Which Must be Calculated for Model Sample i Figure Likset Likset Traffic Which Must be calculated AE traffic from A to E AE traffic from E to A CE traffic from C to E CE traffic from E to C BE traffic from B to E BE traffic from E to B DE traffic from D to E DE traffic from E to D All traffic iter SEP is always routed through, so for the model sample i Figure, the Likset traffic calculatio for every likset is: Table 5. The Calculatio of Likset Traffic for Model Sample i Figure Likset Traffic Likset Traffic Calculatio from. AE A to E = -forward traffic A to B sigalig + -reverse traffic B to A sigalig (7) AE E to A = -forward traffic B to A sigalig + -reverse traffic A to B sigalig (8) CE C to E = -forward traffic C to B sigalig + -reverse traffic B to C sigalig (9) CE E to C = -forward traffic B to C sigalig + -reverse traffic C to B sigalig (0) BE B to E = -forward traffic B to A sigalig + -reverse traffic A to B sigalig + -reverse traffic C to B sigalig + forward traffic B to D sigallig () BE E to B = -forward traffic A to B sigalig + -reverse traffic B to A sigalig + -forward traffic C to B sigalig + reverse traffic B to D sigallig () DE D to E = -forward traffic B to D sigalig (3) DE E to D = -forward traffic B to D sigalig (4) The calculatio i Table 5 is respectively doe by usig: first, the uit, ad secod, the output byte from the traffic iter SEP. 78

7 The Way of Calculatig The Traffic The Way to Calculated the Dimesio of Iter ode Coectio Lie (Likset Dimesio) Coectio lie iter ay ode (likset) coectig costitutes the sigalig lik horde, ay the digital trasmissio caal costitutes the shape of sigalig lik, i which the are two trasmissio directio which has the speed of 64 Kbit/secod or 8Kbyte/secod. The speed of sigalig lik trasmissio besides the bearer of the traffic is also stated as the capacity of sigalig lik traffic, ad the capacity of sigalig lik of 8Kbyte/secod as metioed above ca ot etirely be allocated to carry the traffic whe thr coditio of the etwork is ormal. This meas the maximum utilizatio rate of the sigalig lik of the ormal coditio of the etwork (im) is allowed less tha 00%. This is to accommodate additio traffic whe the disturbace is occurred, such as disruptio of which cause retrasfer or disruptio of sigalig lik, which is caused the movemet of the traffic from oe sigalig to aother sigalig. The capacity of maximum sigalig lik (KImax) i the traffic whe the coditio of the ormal etwork is: Kl-max=im x 8 Kbyte/sec...(5) The value of this im umber betwee 0 % ad 40% is accordig to ITU recommedatio. The small im umber (0%) is used if lik disturbace ad retrasfer of ofte occurred where the coditio of the etwork is predicted bad ad it eeds a huge umber of reserve capacity, where as this big im umber (40%) is used if the lik disturbace ad the retrasfer of is rarely occurred where the coditio of the etwork is predicted good ad does ot eed the huge umber of reserve capacity. Thus, we eed to cosider the coditio of the etwork i determiig the value of the umber. (ITU,99). The capacity of maximum likset (Klsmax) preset i the likset is which states the likset maximum load. If Kls-max is distributed to the lik, cosequetly, every liks get the Klmax load. Ad if the load of the result of distributio get the load iter lik ca be equal, cosequetly every lik will get the Kl-max load ad the value of Kls-max is: Kls-max= x Kl-max.(6) Where as, if the load of distributio result gets the load iter lik uequal, there will be lik which gets the load= Kl-max ad aother lik gets the load<kl-max ad Kls-max< x Klmax. By cosiderig the load distributio is equal, the calculatio formula of the lik dimesio is as follow: Likset Dimesio= Likset Traffic(Byte/sec)...(7) Kl-Max(Byte/sec) But i applyig, the result of load distributio is ot equal, so the calculatio of likset dimesio of the formula (7) above ca ot be used. If we use the calculatio of likset dimesio by usig the table 6,i.e the table of maximum likset capacity made by ITU, we will get more exact result (ITU,99). Table 6 showws the relatioship betwee Kls-max i Kl-max uit toward the total sigalig lik, where Kls-max is ot always added toward the total lik accretio. Table 6. Maximum Likset Capacity Toward the Total Lik Total Lik Kls-max Distirbutio System 4 it Distributio System 3 Bit Kl-max Kl-max 8/3 Kl-max Kl-max 6/3 Kl-max 6/3 Kl-max 8 Kl-max Kl-max Kl-max 8/3 Kl-max 8 Kl-max By usig Table 6, we ca be determied the likset dimesio by: First, we idetify the distributio system used whether the system is 4 bit or 3 bit Based o the estimate soditio of the etwork, determied the value of Kl-max Chage the resultof likset traffic calculatio with byte/sec uit, ito Kl-max uit Based o distributio system which used 4 bit or 3 bit, we determie i appropriate colum with distributio system, the same Kls-max value with the value of likset traffic or higher After we get the value of Kl-max, thus we ca determie the umber of lik or likset dimesio As a sample, to determie the likset dimesio ca be see o the clarificatio below: 79

8 Jural Sistem Tekik Idustri Volume 7, o. April 006 Example : Load distributio system used is 4 bit The coditio of the etwork is estimated well, im is determied 35%, so Kl-max 35% x 8 Kbyte/sec =.8Kbyte/sec If the likset traffic is 8.4 Kbyte/sec (3Klmax), 3 Kl-max ca ot be foud i Table 6 i the colum of distributio system of 4 bit, so we take the larger umber, i.e. Parallel with i distributio system colum i Tabe, we ca see i the colum of total lik, i.e.4 liks or 5 liks, i.e. he likset dimesio obtaied is 4 or 5 liks, ad we choose 4 liks for retrechmet. Example : Load distributio system used is 3 bit We estimate the bad coditio of the etwork, i is determied 0%, so Kl-max = 0% x 8 Kbyte/sec =.6Kbyte/sec If the likset traffic is 4.8Kbyte/sec (3 Klmax), there is ot 3 Kl-max i Table6 i the colum of 3 bit distributio system, so we take the higher umber, i.e. 4 Kl-ma Parallel with Kl-max i the colum of distributio system i Table6, we ca see i colum of total lik, 4 lik, 5 lik, 6 lik, 7 lik. It meas likset obtaied is 4 lik, 5 lik, 6 lik, 7 lik, ad we choose 4 lik for retrechmet. I calculatig likset dimesio, the likset traffic data used is eough if we use the data oly from oe directio, we do ot eed the data from two directios of, because the likset has two directios of trasmissio which respectively has the sama capacity of traffic. I figure, if the traffic fom E to C is bigger that the traffic from C to E, the data used is the bigger data, so the small traffic from the reverse directio ca be remaied trasferred. Cosequetly, the liket dimesio calculatio of CE is merely eeded by the traffic data from E to C. (Siemes AG, 994) 4.4 The Way to Calculate the ode Dimesio (Sigalig Poit Dimesio/ Dimesio) Oe of the ode which is fuctioed to sed ad receivig by calculatig the dimesio ca determie the capacity of. To calculate dimesio, we eed iput data of likset traffic i the uit of. trasfer capacity is obtaied by summig up all the likset traffic from, whereas receiver capacity is obtaied by summig up all the likset traffic to, so the calculatio of dimesio is merely doe by summig up (ITU, 99 ; Siemes G, 994) ad the formulas as follows: -X: (trasfer capacity) -X: (trasfr capacity) = traffic from X to Y..(8) Y= = traffic from Y to X (9) Y= For the sample i Figure, the calculatio of dimesio cab be see below: SEP-A: (trasfer capacity) = traffic from A to E.(0) SEP-A: (receive capacity) = traffic from E to A..() SEP-C: (trasfer capacity) = traffic from C to E.() SEP-C: (receive capacity) = traffic from E to C..(3) SEP-B: (trasfer capacity) = traffic from B to E.(4) SEP-B: (receivecapacity) = traffic from E to B...(5) SEP-D: (trasfer capacity) = traffic from D to E.(6) SEP-D: (receive capacity) = traffic from E to D.(7) SEP-E: (trasfer capacity) = traffic from E to A + traffic from E to B + traffic from E to C + traffic from E to D.. (8) SEP-E: (receive capacity) = traffic from A to E + traffic from B to E + traffic from C to E + traffic from D to E.(9) 80

9 The Way of Calculatig The Traffic COCLUSIOS To calculate the traffic ad etwork dimesio of CCS7, is by: - calculatig the traffic iter ed ode called SEP - calculatig the traffic i coectio lie iter ode called likset traffic - calculatig the dimesio of coectio lie iter ode called likset dimesio - calculatig ode dimesio called dimesio To calculate the traffic iter SEP, we eed two kids of data i.e. callig data ad sigalig data as iput data ad the calculatio by multiplyig callig data ad sigalig data To calculate likset traffic, we do by summig up the iput data i the shape of traffic iter SEP ad route arragemet, which the calculatio is by summig up every liks iter SEP routed to likset To calculate likset dimesio, we eed iput data i the sihape of likset traffic i byte uit, whereas the determiatio of likset dimesio is doe by usig Table 6, i.e. the table of maximum likset capacity toward the total lik To calculate the dimesio, we eed iput data i the shape of likset traffic i uit, the calculatio by summig up all the traffic likset set ad received by. 6. OTATIO CCS7 : Commo Chael Sigallig o. 7 ITU : Iteratio Telecommuicatio Uio CCITT : Committee Cosultative Iteratioal Telegraph ad Telephoe SEP : Sigallig Ed Poit : Sigallig Poit PST : Public Switch Telephoe etwork ISD : Itegrated Switch Digital etwork I : Iteleget etwork PC : Persoal Commuicatio etwork : Message Sigal Uit TC : Trasit Cetre : Sigallig Trasfer Poit : Local Exchage LT : Local Trasit Exchage S : Service Switchig Poit SCP : Service Cotrol Poit GSM : Global System for Mobile Commuicatio MSC : Mobile Switchig Cetre VLR : Visitor Locatio Register HLR : Home Locatio Register Kl-max : Maximum Capacity of Sigallig Lik Im : The Maximum utility level of Sigallig lik i ormal Coditio of etwork KLs-max : Maximum Likset Capacity : Total Lik i Likset y : All coected to -x P : Total Callig/sec PS : Success Callig Ratio (%) MS : Success Forward BS : Success Reverse MG : Fail Forward BG : Fail Reserve REFERECES CCITT: Specificatios of Sigallig System o.7 Yellow Book Vol.VI 6.98 ITU. Methods for Dimesioig Resources i Sigallig System o.7 etworks-e 73, Geeva,99 Siemes G. Plaig of Commo Chael Sigallig System o. 7 etworks Moche,

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

The CCITT Communication Protocol for Videophone Teleconferencing Equipment

The CCITT Communication Protocol for Videophone Teleconferencing Equipment The CCITT Commuicatio Protocol for Videophoe Telecoferecig Equipmet Ralf Hiz Daimler-Bez AG Istitut ffir Iformatiostechik Tcl. 0731 / 505-21 32 Fax. 0731 / 505-41 04 Wilhelm-R.uge-Str. 11 7900 Ulm Abstract

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

Introduction to Network Technologies & Layered Architecture BUPT/QMUL

Introduction to Network Technologies & Layered Architecture BUPT/QMUL Itroductio to Network Techologies & Layered Architecture BUPT/QMUL 2018-3-12 Review What is the Iteret? How does it work? Whe & how did it come about? Who cotrols it? Where is it goig? 2 Ageda Basic Network

More information

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,

More information

The Value of Peering

The Value of Peering The Value of Peerig ISP/IXP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 25 th

More information

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c Verizo WIreless Global Support Guide For the BlackBerry 8830 World Editio Smartphoe ad the Motorola Z6c For complete iformatio o global services, please refer to verizowireless.com/vzglobal. Whether i

More information

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems

More information

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge

More information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Panel for Adobe Premiere Pro CC Partner Solution

Panel for Adobe Premiere Pro CC Partner Solution Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

University of North Carolina at Charlotte ECGR-6185 ADVANCED EMBEDDED SYSTEMS SMART CARDS. Sravanthi Chalasani

University of North Carolina at Charlotte ECGR-6185 ADVANCED EMBEDDED SYSTEMS SMART CARDS. Sravanthi Chalasani Uiversity of North Carolia at Charlotte ECGR-6185 ADVANCED EMBEDDED SYSTEMS SMART CARDS Overview Itroductio History of smart cards Types of smart cards Categories of smart cards Smart Card Stadards SLE4442

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard 1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries

More information

BGP Attributes and Path Selection. ISP Training Workshops

BGP Attributes and Path Selection. ISP Training Workshops BGP Attributes ad Path Selectio ISP Traiig Workshops 1 BGP Attributes The tools available for the job 2 What Is a Attribute?... Next Hop AS Path MED...... p Part of a BGP Update p Describes the characteristics

More information

Table 2 GSM, UMTS and LTE Coverage Levels

Table 2 GSM, UMTS and LTE Coverage Levels 6 INDICATORS OF QUALITY OF SERVICE This sectio defies quality idicators that characterize the performace of services supported o mobile commuicatio systems i their various phases of access ad use 6. 6.1

More information

ICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002

ICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002 ICS Reget Commuicatios Modules RS-232, RS-422 ad RS-485 (T3150A) Issue 1, March, 06 Commuicatios modules provide a serial commuicatios iterface betwee the cotroller ad exteral equipmet. Commuicatios modules

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Design of efficient, virtual non-blocking optical switches

Design of efficient, virtual non-blocking optical switches Desig of efficiet, virtual o-blockig otical switches Larry F. Lid, Michael Sratt Mobile Systems ad Services Laboratory HP Laboratories Bristol HPL-200-239 March 3 th, 2002* otical switchig, switch desig

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

SERIAL COMMUNICATION INTERFACE FOR ESA ESTRO

SERIAL COMMUNICATION INTERFACE FOR ESA ESTRO Bulleti E708 rev0 7/06/0 SERIAL COMMUNICATION INTERFACE FOR - SERIES FEATURES Supply voltage: 90 40vac Supply frequecy: 40 70 Hz Max. absorbtio: 40W Operatig temperature: 0 50 C Storage temperature: -0

More information

Architectural styles for software systems The client-server style

Architectural styles for software systems The client-server style Architectural styles for software systems The cliet-server style Prof. Paolo Ciacarii Software Architecture CdL M Iformatica Uiversità di Bologa Ageda Cliet server style CS two tiers CS three tiers CS

More information

Multiprocessors. HPC Prof. Robert van Engelen

Multiprocessors. HPC Prof. Robert van Engelen Multiprocessors Prof. Robert va Egele Overview The PMS model Shared memory multiprocessors Basic shared memory systems SMP, Multicore, ad COMA Distributed memory multicomputers MPP systems Network topologies

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems The Peta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems Abdulkarim Ayyad Departmet of Computer Egieerig, Al-Quds Uiversity, Jerusalem, P.O. Box 20002 Tel: 02-2797024,

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Course Information. Details. Topics. Network Examples. Overview. Walrand Lecture 1. EECS 228a. EECS 228a Lecture 1 Overview: Networks

Course Information. Details. Topics. Network Examples. Overview. Walrand Lecture 1. EECS 228a. EECS 228a Lecture 1 Overview: Networks Walrad Lecture 1 Course Iformatio Lecture 1 Overview: Networks Jea Walrad www.eecs.berkeley.edu/~wlr Istructor: Jea Walrad Office Hours: M-Tu 1:00-2:00 Time/Place: MW 2:00-3:30 i 285 Cory Home Page: http://wwwist.eecs.berkeley.edu/~ee228a

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

L5355 Modbus Plus Communications Interface

L5355 Modbus Plus Communications Interface L5355 Modbus Plus Commuicatios Iterface Techical Maual HA470897 Issue 2 Copyright SSD Drives Ic 2005 All rights strictly reserved. No part of this documet may be stored i a retrieval system, or trasmitted

More information

Identifying and Cabling Circuit Cards. Identifying and Cabling Circuit Cards - 1

Identifying and Cabling Circuit Cards. Identifying and Cabling Circuit Cards - 1 Cards Cards - 1 Cards Cards This sectio provides the basic iformatio you eed to coect cables to the faceplates of circuit cards that are istalled i the system. Additioal steps may be required for some

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

Service Oriented Enterprise Architecture and Service Oriented Enterprise

Service Oriented Enterprise Architecture and Service Oriented Enterprise Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE

More information

IS-IS in Detail. ISP Workshops

IS-IS in Detail. ISP Workshops IS-IS i Detail ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 27 th November

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Chapter 4 The Datapath

Chapter 4 The Datapath The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Introduction to The Internet

Introduction to The Internet Itroductio to The Iteret ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 13 th

More information

Switching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1

Switching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1 Switchig Hardware Sprig 208 CS 438 Staff, Uiversity of Illiois Where are we? Uderstad Differet ways to move through a etwork (forwardig) Read sigs at each switch (datagram) Follow a kow path (virtual circuit)

More information

Technical Application Papers No.9 Bus communication with ABB circuit-breakers

Technical Application Papers No.9 Bus communication with ABB circuit-breakers Techical Applicatio Papers No.9 Bus commuicatio with ABB circuit-breakers Techical Applicatio Papers Idex 1 Itroductio... 2 2 Digital commuicatio... 3 2.1 Commuicatio protocols... 4 2.1.1 Physical layer...

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

End Semester Examination CSE, III Yr. (I Sem), 30002: Computer Organization

End Semester Examination CSE, III Yr. (I Sem), 30002: Computer Organization Ed Semester Examiatio 2013-14 CSE, III Yr. (I Sem), 30002: Computer Orgaizatio Istructios: GROUP -A 1. Write the questio paper group (A, B, C, D), o frot page top of aswer book, as per what is metioed

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

performance to the performance they can experience when they use the services from a xed location.

performance to the performance they can experience when they use the services from a xed location. I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

MOTIF XF Extension Owner s Manual

MOTIF XF Extension Owner s Manual MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus

More information

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Our Learning Problem, Again

Our Learning Problem, Again Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Switch Construction CS

Switch Construction CS Switch Costructio CS 00 Workstatio-Based Aggregate badwidth /2 of the I/O bus badwidth capacity shared amog all hosts coected to switch example: Gbps bus ca support 5 x 00Mbps ports (i theory) I/O bus

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

Transitioning to BGP

Transitioning to BGP Trasitioig to BGP ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 24 th April

More information

Operating System Concepts. Operating System Concepts

Operating System Concepts. Operating System Concepts Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the

More information

Computer Systems - HS

Computer Systems - HS What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic

More information

Prevention of Black Hole Attack in Mobile Ad-hoc Networks using MN-ID Broadcasting

Prevention of Black Hole Attack in Mobile Ad-hoc Networks using MN-ID Broadcasting Vol.2, Issue.3, May-Jue 2012 pp-1017-1021 ISSN: 2249-6645 Prevetio of Black Hole Attack i Mobile Ad-hoc Networks usig MN-ID Broadcastig Atoy Devassy 1, K. Jayathi 2 *(PG scholar, ME commuicatio Systems,

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.

More information

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

IXS-6600-C IXS-6700-C

IXS-6600-C IXS-6700-C INTEGRATED ROUTING SYSTEM PACK IXS-6600-C IXS-6700-C INTEGRATED ROUTING SYSTEM IXS-6600 IXS-6700 IKS-6030M IKS-A6011 IKS-A6015 IKS-A6050 IKS-A6061 IKS-V6010M IKS-V6010SD IKS-V6050M IKS-V6050SD IKS-V6060M

More information

top() Applications of Stacks

top() Applications of Stacks CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Overview. Some Definitions. Some definitions. High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks

Overview. Some Definitions. Some definitions. High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks Overview High Performace Computig Programmig Paradigms ad Scalability Part : High-Performace Networks some defiitios static etwork topologies dyamic etwork topologies examples PD Dr. rer. at. habil. Ralf-Peter

More information

DESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO

DESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO DESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO Sagwo Seo, Trevor Mudge Advaced Computer Architecture Laboratory Uiversity of Michiga at A Arbor {swseo, tm}@umich.edu Yumig Zhu, Chaitali

More information

Adaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1

Adaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1 Adaptive Graph Partitioig Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, ad W. J. Dewar 1 1 School of Electrical Egieerig Uiversity of New South Wales, Australia 2 Divisio of Radiophysics

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information