Service discovery in ad hoc networks
|
|
- Griselda Rogers
- 6 years ago
- Views:
Transcription
1 Service discovery i ad hoc etworks Mohammed Haddad ad Hamamache Kheddouci Laboratoire PRISMa - Uiversité Claude Berard Lyo, Bât. 7, 843, Bd. du ov. 98, Villeurbae Cedex Abstract. Various researches treatig of the commuicatio protocols try to defie a certai orgaizatio over the etwork to improve its geeral behavior. The cocept of service is frequetly used as a abstractio of software ad hardware resources. Service discovery offers service advertisemet ad locatio mechaisms. So, it represets a major challege i highly dyamic etworks. I this paper, we preset a ew service discovery protocol for ad hoc etwork. This protocol, first, costructs ad maitais a adapted dyamic virtual topology, the, it achieves service discovery o it. We propose a ew costructio method for the topology. This method is fully distributed ad based o the cocepts of idepedet sets ad cliques. Also, we propose the itroductio of various mechaisms allowig the improvemet of service discovery. I additio, our protocol was simulated o NS-2. Key words: ad hoc etworks, service discovery, dyamic virtual topologies.. Itroductio A challegig research area i computer etworks is Ad hoc etworks (or MANETs: Multihop Ad hoc NETworks). These are defied to be spotaeous ad totally autoomous etworks. Nodes ca move radomly ad so, etwork coectivity may chage frequetly. Various commuicatios protocols such as the routig, the resource sharig, the service discovery, mobility predictio etc. uses the floodig to broadcast or gather iformatio. For this reaso, recet works try to optimize these exchages of data flows. Ideed, various researches treatig of the commuicatios protocols try to defie a certai orgaizatio over the etwork. Differet protocols of routig, resource allocatio ad maagemet etc. use the cocept of virtual dyamic topology to improve the geeral behavior of the etwork. Ideed, if the various exchages of data flows are doe via a adapted virtual topology, the total performace of the etwork may icrease cosiderably. I additio, the cocept of service is used as abstractio of the resources (software or hardware). The service discovery offerig of the mechaisms of publicatio ad localizatio represets a major problem which must be solved to succeed i implemetig very dyamic etworks such as the ad hoc etworks. The majority of the service discovery protocols are based o the Cliet/Server paradigm. I this last, the Cliets ca sed their requests i a reactive way (Pull model) or ca remai, proactively, listeig to the advertisemets of the geerated services (Push model). I these two models, the adopted approach is decetralized. Salutatio [] ad UPP [2] use this approach. A alterative scheme would imply a cetral directory which would have the resposibility of idex all the services preset i the etwork. Protocols like Jii [3] ad SLP [4] specify the presece of such a server. However, these various protocols caot be directly applied i dyamic eviromets such as the ad hoc etworks. For that, several protocols were proposed: Allia [5], GSD [6] ad Koark [7] offer solutios holdig ito accout the peep to peer ature of the ad hoc etworks. The protocol of Kozat et al. [8] defies a mesh structure based o the cocept of domiat sets. The protocol of Leders et al. [9] uses a electrostatic modelig of the services i order to illustrate their availability. We studied the whole of works beig based o dyamic virtual topologies. We classified them i two great families. The first gathers the techiques basig o coverig odes which seek to build a virtual support of commuicatio (virtual backboe). The secod gathers the techiques seekig to miimize the umber of liks used i commuicatio. I this paper, we preset a ew protocol of service discovery for the mobile ad hoc etworks which is based o a mixed topology. This topology aims at combiig the advatages offered by the two classes of topologies (to miimize the umber of participatig odes i topology as well as the umber of used liks). The protocol thus proposed builds ad maitais, iitially, a adapted virtual dyamic topology the achieves the service discovery itself via the latter. 2. Our Solutio I our approach, we traslate the fact of idexig the services to a problem of cover i.e to fid a subset such as if each oe of its odes kew oly the services offered i its eighborhood, the uio of collected iformatio would iclude all the services of the etwork. From the service discovery poit of view, this subset plays the part of a distributed directory o the etwork. As, we admit as i additio to its property of cover, the iduced subgraph of the - -
2 subset must be coected. Ideed, that is ecessary to esure a lower cost itra-directory commuicatio, to esure access ad exchage of iformatio (gradually betwee direct eighbors) ad to balace the loads i the etwork. For that, we propose the adoptio of the cocept of coected domiatig sets (CDS). These odes will have the resposibility to record ad seek the services. Each ode of the etwork will have at least a ode of the CDS i its eighborhood. The odes of the CDS form, betwee them, a peer to peer etwork. They maitai local caches which are useful, maily, to record iformatio cocerig the services. The sectios which follow preset the detailed operatio of the protocol. 2.. Costructio ad maiteace of the virtual topology (b) (c) (d) Virtual lik Itermediate ode Elected coector ode Dyamic virtual topology cosists of a coected domiatig set. To build it we choose a rather traditioal approach. The latter seeks, iitially, to determie a Maximal Idepedet Set (MIS) the to iter-coect it. However, the pricipal difficulty i our problem is that this costructio must be doe by miimizig the umber of coectors ad i distributed way. Costructio is doe as follows (see Figure ): a) Choose a subset which forms a MIS. b) Form the 3-closure (to add virtual liks betwee ay pair of remote odes withi two or three hops oe from the other) of the graph modelig the etwork (but we do this oly for the iduced subgraph by the MIS odes). c) Regroup MIS odes ito cliques i the 3- closure. d) Fid a miimal core of coectors for each clique i the 3-closure. e) The uio of the MIS odes ad the coectors thus selected forms the CDS. (a) Amog the whole of itermediate odes formig the virtual liks (routes) betwee the MIS odes, we choose oly some which will be eough to avoid, as possible, the presece of redudat routes. (e) Figure : Virtual topology costructio. To select the MIS, we privilege the odes which cover the most eighbors. Iitially, all the odes are regarded as potetially idepedet. A ode remais idepedet oly if it has a maximum degree amog its idepedet eighbors (Step a). I the case of equality, we use a rule to decide betwee the eighbors who are i coflict. The latter ca be based o the idetifiers of the odes. I the phase of itercoectio of the MIS odes, we rest o the priciple that the distace betwee two complemetary partitios of the MIS is 3 hops at maximum. I order to reduce the size of the built CDS, we proposed a optimizatio which reduces the umber of coector odes. Each ode ot belogig to the MIS is regarded as potetially coector. We cosider the virtual liks formed by the 3-closure of the graph modelig the etwork, i particular those relatig to the MIS odes (Step b). We regroup these odes ito cliques i the 3-closure. It is importat to ote that ay distributed algorithm of maximal cliques determiatio ca be used (Step c). At this stage, it is a questio of fidig a core of coectors for each clique i the 3-closure (Step d). This last must guaratee the coexity of the odes of cliques i the 3-closure. Oly oe MIS ode by clique is elected to select the itermediate odes which will joi the CDS. I the phase of maiteace of topology, we privilege the maiteace of MIS because these odes form lad marks i the topology. The maiteace of coectios betwee these lad marks is the performed. The same rule by which we select the MIS - 2 -
3 odes, maitais it i time. Ideed, if two or several idepedet odes are foud i the same locality, oly oe of them remais idepedet ad the others lose this privilege. If, o the cotrary, a ode is foud without ay eighbor who domiates it the it proposes itself for becomig idepedet. I additio, a coector ot receivig coectio messages, lastig certai time duratio, leaves the CDS. This mechaism is implemeted to offer a certai latecy which is useful durig the data exchages of service discovery. Let G = (V, E) be the graph modelig the etwork. We defie as beig the maximum degree i the graph ad MIS the maximum degree i the graph of 3-closure iduced by the MIS odes. O the level of each ode, the steps (a) ad (b) are doe out of O( 3 ), the step (c) is doe out of O( MIS ²), it is the same for the stage (D). 2.2 Service Discovery Peers: servers/cliets Service discovery protocol Dyamic topology CDS MAC layer LL Physical layer () Recordig message Directory Aget Recordig Peer (2) Requestig Peer Requestig Message Others (3) Figure 2: Architecture ad mechaisms of service discovery. The figure 2. illustrates the total architecture which we propose for our protocol of service discovery. The lik layer is resposible for the hello messages ad the eighborhood tables (tables used by the upper layer). The dyamic topology layer offers the access to the distributed directory ad esures that each ode is, at most, withi oe hop of this last. The service discovery layer receives the recordigs of the services, the requests ad the replies. These messages are coveyed via the topology. With each ode of the CDS a directory aget (or DA) is associated. The directory agets form betwee them a peer to peer etwork which esures the correct operatio of all the mechaisms of service discovery. A peer watig to make available oe of its services, must register it. For that, it chooses a directory aget (local or eighbor, iformatio provided by the topology layer) the seds a registerig message to it (see Figure 2.2). By receivig this message, the cocered aget saves the iscriptio i its services cache. I additio ad because of dyamic ature of ad hoc etworks, the directory agets do ot tolerate a service registratio whose lifetime is higher tha a certai value TTLmax (maximum Time to live). This value represets a refresh timer (for example, if a service has lifetime equivalet to four times the refresh timer, the the service will have to be registered oce ad to be refreshed three times). I order to optimize its services re-registratios, a server calculates a umber of hops (radius of the cocered locality). This last relates to the umber of service access durig the previous refresh timer. I fact, more a service is requested, more it should be diffused o the etwork. A peer seekig access to a service chooses a directory aget (local or eighbor) the asks it. The aget thus chose is regarded as the oe i charge for this request. At receivig the latter, the aget cosults its cache of services. I the case where desired iformatio is ot available locally, the aget diffuses that request o the backboe (liks i clear gray i Figure 2.3). So, to optimize this diffusio, the aget calculates a research radius from the cache of requests without replies. Ideed, if aother ode has previously formulated a similar request, the there would be strog chaces that iformatio is preset i its locality. Itermediate agets receivig requests havig a ifiite research radius, ca try to calculate a local radius. However, the aget resposible for the request egages a timer. At the ed of this timer, if o reply has bee obtaied, it geerates aother type of request message which will ot be limited i hops. This last esures the request diffusio o all the backboe. If after a certai time, o reply arrived, the aget aswers its cliet by o-presece of requested service. The replies are routed accordig to the opposite directio of routes take by the requests. If a ode hostig a directory aget leaves the backboe (CDS), it must try to trasfer its caches to aother CDS ode (for this reaso, at the phase of topology maiteace, we let sped a certai latecy time before a ode leaves the CDS). To achieve this treatmet, the ode privileges its "substitute" eighbors. We defie these odes as beig the odes which recetly joied the CDS. The reaso of this choice is that these odes have a great chace to ot hold much iformatio. Therefore, each ode of the CDS maitais a list of eighbors thus defied
4 State chages Hops per Reply Hello Cycles CDS Ratio 2.3 Protocol Simulatio I this sectio, we evaluate the performace of our implemetatio with a etwork simulator. Two mai aspects are evaluated. We look at topology layer performace by varyig etwork desity ad mobility, the, the behavior of service discovery mechaisms which ru over the topology. Let G = (V, E) be the graph, o order V = N, modelig the etwork. Let A x (t) be the average of the distaces separatig a ode x from all the other odes at the time t ( is the umber of odes). Let M X be the average mobility of a ode x durig the simulatio (i the followig formula t represets the step of calculatio) Ax( t) Dist( x, i) i T t Mx Ax( t t) Ax( t) T t t So, average mobility is: Mob Mi i For our simulatios, we proposed three values of mobility:, 3.5 ad 7. These lasts correspod respectively to low, medium ad high mobility. So to evaluate the impact of the mobility of the odes o topology, we propose to measure the umber of state chages of a ode (state of the ode = i backboe or out of backboe) accordig to mobility Mobility Figure 3: Mobility impact More mobility icreases more the umber of state chages per ode icreases. The graph shows that this icrease is liear. The pricipal goal of our dyamic topology is to offer, to each ode, a access poit to a backboe icludig all iformatio of service discovery. The graph shows the mobility impact absorbed by the virtual topology. Ideed, theses chages occur trasparetly to service discovery layer. Also, i additio to the mobility, we vary the followig parameters: - Network desity: betwee 2% ad 8% - Network odes umber: 2, 4 ad 6 odes To calculate the followig Metrics: - Backboe (CDS) odes ratio - Backboe stabilizatio time - The average umber of hops carried out per reply % 2% 4% 6% 8% % Desity Figure 4: Backboe odes ratio % 2% 4% 6% 8% % Desity Figure 5: Stabilizatio time Load Figure 6: Average hops per reply Mob= Mob=3,5 Mob=7 The groups of Figure 4 curves are decreasig. This shows that the umber of odes belogig to backboe decrease as the desity icrease. This result is completely ormal cosiderig the way i which odes are chose. Ideed, ode s coverig capacity allows it to maximize its chaces to joi backboe. Icreasig desity ivolves reducig the umber of ecessary odes to cover the etire etwork. From the groups of curves of Figure 5, we ca ote that the umber of odes composig the etwork do ot ifluece much over the stabilizatio times. The total stabilizatio time is of twelve cycles for 2% ad 4% desity, ad the decreases gradually util reachig the value of six cycles for 8% of desity
5 Figure 6 shows that the umber of hops carried out by a reply is stable eough for various mobility levels. This umber varies betwee.5 ad 2.5 hops for all load values. This is due to diffusio of the most asked services. 3. Coclusio The first objective of this work was to give a ew solutio to service discovery problem i ad hoc etworks. I fact, i additio to kow problems of static etworks, mobile ad hoc etworks are characterized by mobility, absece of ifra-structures ad limited capacities i badwidth ad eergy... etc. This makes more difficult the desig of commuicatio ad cotrol protocols. The preseted protocol build, iitially, a virtual dyamic topology, maitais it i time the completes service discovery. The basic idea of our protocol of service discovery is based o cocept of coected domiatig sets (for their coverig ad coectio properties). The odes of the coected domiatig set (CDS) form a etwork backboe (i our case, a coected sub-etwork cotaiig all iformatio cocerig the services). These odes will have the resposibility to register ad seek the services. Each ode will have at least oe CDS ode i its eighborhood. For ay operatio cocerig the services, a ode chooses a CDS ode to represet it i the backboe. For the topology costructio, we propose a origial method. This method is completely distributed ad based o the cocepts of idepedet sets ad cliques. Also, we proposed the itroductio of various mechaisms allowig the improvemet of service discovery (to wide the diffusio of the most asked services, to seek the services where they were recetly asked... etc.). The protocol esures symmetry of the roles played by the differet odes. Ideed, all the odes are able, at various momets, to joi or leave the CDS. Also, all odes ca be servers ad/or cliets ad, therefore, form a peer to peer etwork. The use of dyamic virtual topology makes service discovery easier. Ideed, it is just eough to reach the backboe. The services declaratio ad locatio are doe gradually o the backboe. The fact that a ode ca be covered by several backboe odes offers some robustess ad decreases collisio risks. The CDS quality ca oly improve the service discovery. The suggested approach remais compatible with commuicatio ad service pilotig techiques used i the directory orieted protocols such as: Jii, SLP... etc. mobility. The umber of odes formig the backboe is rather weak ad this for differet etwork desities ad sizes. The stabilizatio times are also reasoable. Number of hops carried out by a reply is relatively weak. Amog the prospects for our work, thorough simulatios are cosidered. It would be iterestig to evaluate the protocol i greater scale dyamic eviromets. Thus, a compariso with the other existig protocols of service discovery for the mobile ad hoc etworks, would allow a better evaluatio of our protocol. I additio, we estimate that the itegratio of odes eergy cosumptio i their domiace ad coectio factors would allow a better load balacig betwee odes. Refereces [] Salutatio Architecture Specificatio Versio 2., the Salutatio Cosortium, 999. [2] Uderstadig Uiversal Plug ad Play White Paper, Microsoft Corporatio, Jue 2. [3] Jii Architecture Specificatio, Su Microsystems, Jue 23. [4] Erik Guttma, The Service Locatio Protocol, IEEE Iteret Computig July 999. [5] O. Ratsimor, D. Chakraborty, S. Tolia, D. Kushraj, A. Kujithapatham, G. Gupta, A. Joshi, T. Fii, Allia: Alliace-based Service Discovery for Ad-Hoc Eviromets, Secod ACM Iteratioal Workshop o Mobile Commerce, i cojuctio with Mobicom 22, Sep 28, 22, Atlata GA, USA. [6] D. Chakraborty, A. Joshi, GSD: A Novel Groupbased Service Discovery Protocol for MANETS, 4th IEEE Coferece o MWCN. Stockholm. Swede. September 22. [7] S. Helal, N. Desai, V. Verma ad C. Lee, Koark--A Service Discovery ad Delivery Protocol for Ad-hoc Networks, Proceedigs of the Third IEEE Coferece o WCNC, New Orleas, March 23. [8] U C. Kozat ad L Tassiulas, Service discovery i mobile ad hoc etworks: a overall perspective o architectural choices ad etwork layer support issues, Ad Hoc Networks, Volume 2, Issue, Jauary 24, Pages [9] V. Leders, M. May., B. Platter. Service discovery i mobile ad hoc etworks: A field theoretic approach, Pervasive ad Mobile Computig (25) Simulatio showed that our protocol gives well satisfyig results. Ideed, from differet test series, it releases a rather good adaptatio to the various costraits imposed by etwork load, desity ad - 5 -
Course Site: Copyright 2012, Elsevier Inc. All rights reserved.
Course Site: http://cc.sjtu.edu.c/g2s/site/aca.html 1 Computer Architecture A Quatitative Approach, Fifth Editio Chapter 2 Memory Hierarchy Desig 2 Outlie Memory Hierarchy Cache Desig Basic Cache Optimizatios
More informationOnes 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 informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationPrevention 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 informationSession Initiated Protocol (SIP) and Message-based Load Balancing (MBLB)
F5 White Paper Sessio Iitiated Protocol (SIP) ad Message-based Load Balacig (MBLB) The ability to provide ew ad creative methods of commuicatios has esured a SIP presece i almost every orgaizatio. The
More informationAdaptive 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 informationA 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 informationEvaluation 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 informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationTransitioning 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 informationperformance 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 informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More information3D 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 informationService 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 informationImage 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 informationCMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 11: More Caches Prof. Yajig Li Uiversity of Chicago Lecture Outlie Caches 2 Review Memory hierarchy Cache basics Locality priciples Spatial ad temporal How to access
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationMaster Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1
Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Memory Hierarchy (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Itroductio Programmers wat ulimited amouts
More information1 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 informationThe University of Adelaide, School of Computer Science 22 November Computer Architecture. A Quantitative Approach, Sixth Edition.
Computer Architecture A Quatitative Approach, Sixth Editio Chapter 2 Memory Hierarchy Desig 1 Itroductio Programmers wat ulimited amouts of memory with low latecy Fast memory techology is more expesive
More informationEvaluation 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 informationAn 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 informationOperating 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 informationIS-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 informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationCopyright 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 information1. 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 informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationGoals of the Lecture UML Implementation Diagrams
Goals of the Lecture UML Implemetatio Diagrams Object-Orieted Aalysis ad Desig - Fall 1998 Preset UML Diagrams useful for implemetatio Provide examples Next Lecture Ð A variety of topics o mappig from
More informationCOSC 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 informationGE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III
GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-
More informationIPv6 Autoconfiguration in Large Scale Mobile Ad-Hoc Networks
IPv6 Autocofiguratio i Large Scale Mobile Ad-Hoc Networks Kilia Weiger, Martia Zitterbart Istitute of Telematics Uiversity of Karlsruhe, 768 Karlsruhe, Germay Ph:++9 7 608-{65/600}, Email: {weiger,zit}@tm.uka.de
More informationIntroduction to OSPF. ISP Training Workshops
Itroductio to OSPF ISP Traiig Workshops 1 OSPF p Ope Shortest Path First p Lik state or SPF techology p Developed by OSPF workig group of IETF (RFC 1247) p OSPFv2 stadard described i RFC2328 p Desiged
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationThe 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 informationSecurity 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 informationCMSC 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 informationElementary 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 informationThe 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 informationPattern 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 informationOctahedral 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 informationMulticast Tree Reconfiguration in Distributed Interactive Applications
Multicast Tree Recofiguratio i Distributed Iteractive Applicatios Carste Griwodz 1,2, Kut-Helge Vik 1, Pål Halvorse 1,2 1 IFI, Uiversity of Oslo, Norway 2 imula Research aboratory, Norway Email: Email:
More informationPartition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration
Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Partitio i mobile adhoc etwork with mobility-a ew approach for effective use of fast IP address autocofiguratio Mukesh Chad *, HL
More informationChapter 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 informationReliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1
Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More information1 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 informationA PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT
GSJ: Computer Sciece ad Telecommuicatios 03 No.3(39) ISSN 5-3 A PRDICTION MODL FOR USR S SHAR ANALYSIS IN DUAL- SIM NVIRONMNT Thakur Sajay, Jai Parag Orietal Uiversity, Idore, Idia sajaymca00@yahoo.com
More informationInterference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks
Iterferece Aware Chael Assigmet Scheme i Multichael Wireless Mesh Networks Sumyeg Kim Departmet of Computer Software Egieerig Kumoh Natioal Istitute of Techology Gum South Korea Abstract Wireless mesh
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationChapter 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 informationA 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 informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationTHE deployment of router-based IP multicast has been
88 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 8, NO. 9, SEPTEMBER 2007 ACOM: Ay-Source Capacity-Costraied Overlay Multicast i No-DHT P2P Networks Shipig Che, Baile Shi, Shigag Che, ad
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead
More information. 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 informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationTable 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 informationSecurity and Communication. Ultimate. Because Intercom doesn t stop at the hardware level. Software Intercom Server for virtualised IT platforms
Because Itercom does t stop at the hardware level by Commed Software Itercom Server for virtualised IT platforms Ready for VMware Ready for Hyper-V VoIP Ultimate availability Itercom Server as a app The
More informationFAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS
SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG
More informationOn Nonblocking Folded-Clos Networks in Computer Communication Environments
O Noblockig Folded-Clos Networks i Computer Commuicatio Eviromets Xi Yua Departmet of Computer Sciece, Florida State Uiversity, Tallahassee, FL 3306 xyua@cs.fsu.edu Abstract Folded-Clos etworks, also referred
More informationFast 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 informationLecture 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 informationCopyright 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 informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationChapter 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 informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationCMSC Computer Architecture Lecture 10: Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 10: Caches Prof. Yajig Li Uiversity of Chicago Midterm Recap Overview ad fudametal cocepts ISA Uarch Datapath, cotrol Sigle cycle, multi cycle Pipeliig Basic idea,
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationTerm Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.
CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More information% Sun Logo for. X3T10/95-229, Revision 0. April 18, 1998
Su Microsystems, Ic. 2550 Garcia Aveue Moutai View, CA 94045 415 960-1300 X3T10/95-229, Revisio 0 April 18, 1998 % Su Logo for Joh Lohmeyer Chairperso, X3T10 Symbios Logic Ic. 1635 Aeroplaza Drive Colorado
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationAn 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 informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,
More informationXiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation
Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio
More informationAppendix 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 informationA QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services
A QoS Provisioig mechaism of Real-time Wireless USB Trasfers for Smart HDTV Multimedia Services Ji-Woo im 1, yeog Hur 2, Jog-Geu Jeog 3, Dog Hoo Lee 4, Moo Sog Yeu 5, Yeowoo Lee 6 ad Seog Ro Lee 7 1 Istitute
More informationIMP: 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 informationLecture 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 informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationGlobal Optimization of File Availability Through Replication for Efficient File Sharing in MANETs
Global Optimizatio of File Availability Through Replicatio for Efficiet File Sharig i MANETs Kag Che ad Haiyig She Departmet of Electrical ad Computer Egieerig Clemso Uiversity Clemso, South Carolia 29631
More informationPolitecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects
Politecico di Milao Advaced Network Techologies Laboratory Iteret of Thigs Projects 2016-2017 Politecico di Milao Advaced Network Techologies Laboratory Geeral Rules Geeral Rules o Gradig 26/30 are assiged
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationRandom Network Coding in Wireless Sensor Networks: Energy Efficiency via Cross-Layer Approach
Radom Network Codig i Wireless Sesor Networks: Eergy Efficiecy via Cross-Layer Approach Daiel Platz, Dereje H. Woldegebreal, ad Holger Karl Uiversity of Paderbor, Paderbor, Germay {platz, dereje.hmr, holger.karl}@upb.de
More informationMulti-Threading. Hyper-, Multi-, and Simultaneous Thread Execution
Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationSCI Reflective Memory
Embedded SCI Solutios SCI Reflective Memory (Experimetal) Atle Vesterkjær Dolphi Itercoect Solutios AS Olaf Helsets vei 6, N-0621 Oslo, Norway Phoe: (47) 23 16 71 42 Fax: (47) 23 16 71 80 Mail: atleve@dolphiics.o
More information% Sun Logo for Frame. X3T10/95-229, Revision 2. September 28, 1995
Su Microsystems, Ic. 2550 Garcia Aveue Moutai View, CA 94045 415 960-1300 X3T10/95-229, Revisio 2 September 28, 1995 % Su Logo for Frame Joh Lohmeyer Chairperso, X3T10 Symbios Logic Ic. 1635 Aeroplaza
More informationAn Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network
A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless
More informationThroughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding
Throughput-Delay Tradeoffs i Large-Scale MANETs with Network Codig Chi Zhag ad Yuguag Fag Departmet of Electrical ad Computer Egieerig Uiversity of Florida, Gaiesville, FL 326 Email: {zhagchi@, fag@ece.}ufl.edu
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationApplication Mapping for Express Channel-Based Networks-on-Chip
Applicatio Mappig for Express Chael-Based Networks-o-Chip Di Zhu, Lizhog Che, Siyu Yue, ad Massoud Pedram Uiversity of Souther Califoria Los Ageles, Califoria, USA 9009 {dizhu, lizhogc, siyuyue, pedram}@usc.edu
More informationThe 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 informationTHE WAY OF CALCULATING THE TRAFFIC AND SIGNALING NETWORK DIMENSION OF COMMON CHANNEL SIGNALING NO.7 (CCS7)
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:
More information