Towards Efficient Optical Burst-Switched Networks without All-Optical Wavelength Converters
|
|
- Megan Harvey
- 6 years ago
- Views:
Transcription
1 Towards Effcent Optcal Burst-Swtched Networks wthout All-Optcal Wavelength Converters João Pedro 1,2, Paulo Montero 1,3, and João Pres 2 1 D1 Research, Semens Networks S.A., R. Irmãos Semens 1, Amadora, Portugal {oao.pedro, paulo.montero}@semens.com 2 Insttuto de Telecomuncações, Insttuto Superor Técnco, Av. Rovsco Pas 1, Lsboa, Portugal pres@lx.t.pt 3 Insttuto de Telecomuncações, Unversdade de Avero, Campus Unverstáro de Santago, Avero, Portugal Abstract. Optcal Burst Swtchng (OBS) s a promsng swtchng paradgm to effcently support Internet Protocol (IP) packets over optcal networks, under current and foreseeable lmtatons of optcal technology. The prospects of OBS networks would greatly beneft, n terms of cost and ease of mplementaton, from lmtng the wavelength converson capabltes at the network nodes. Ths paper presents a framework for contenton mnmzaton/resoluton combnng traffc engneerng n the wavelength doman to mnmze contenton n advance and optcal bufferng at the core nodes to resolve contenton. Smulaton results show that wth the proposed contenton mnmzaton/resoluton framework the large number of expensve all-optcal wavelength converters used at the core nodes of an OBS network can be replaced by a moderate number of shared optcal delay lnes wthout compromsng network performance. Keywords: optcal burst swtchng, traffc engneerng, wavelength contenton mnmzaton, wavelength contnuty constrant. 1 Introducton The Optcal Burst Swtchng paradgm [1] has attracted consderable nterest as an optcal networkng archtecture for effcently supportng IP packet traffc, whle explotng the huge transmsson capacty provded by optcal fbres and Wavelength Dvson Multplexng (WDM) technology [2]. OBS bandwdth utlzaton effcency and technologcal requrements are n between those of coarse-graned Optcal Crcut Swtchng (OCS) and fne-graned Optcal Packet Swtchng (OCS). At the OBS edge nodes, multple IP packets are assembled nto bursts, whch are the traffc unts routed and swtched nsde the OBS core network. Thus, OBS provdes sub-wavelength granularty, renderng hgher bandwdth utlzaton effcency than OCS n supportng IP traffc. Moreover, bandwdth for data burst transmsson s reserved n advance and usng out-of-band sgnallng, avodng complex optcal processng capabltes at the core nodes, whch are mandatory n OPS networks. I. Tomkos et al. (Eds.): ONDM 2007, LNCS 4534, pp , IFIP Internatonal Federaton for Informaton Processng 2007
2 Towards Effcent Optcal Burst-Swtched Networks 349 OBS networks use one-way resource reservaton mechansms for settng up the resources for each burst transmsson [1]. Therefore, the burst s ngress node starts transmttng soon after the burst has been assembled, nstead of watng for an acknowledgment of successful resource reservaton n the entre burst path. Hence, two or more bursts may contend for the same resources at a core node. Gven that unsolved contenton leads to burst loss, degradng the network performance, t s clear that effcent contenton resoluton strateges are of paramount mportance n these networks. Wavelength converson was shown to be the most effectve contenton resoluton strategy for OBS/OPS networks [3] and, as a result, most OBS proposals and studes assume the use of full-range wavelength converters at the network core nodes to resolve contenton. However, because all-optcal wavelength converson devces are stll undergong research and development [4], they reman complex and expensve. Consequently, avodng wavelength converson would greatly reduce the complexty/cost of mplementng OBS networks n the near future. Recently, strateges for mnmzng wavelength contenton n advance have been nvestgated [5], [6], and even tested n an OBS network demonstrator [7], wth the am of reducng burst loss n the absence of wavelength converson and optcal bufferng. Stll, despte the reported performance mprovements, an OBS network n these condtons only acheves low burst blockng probabltes at the expense of very small offered traffc loads [6], thus becomng a less attractve networkng soluton. In ths paper, we propose a novel framework for contenton mnmzaton and resoluton n OBS networks wthout all-optcal wavelength converters at the network nodes. Smulaton results show that the proposed framework enables the desgn of effcent OBS networks employng a moderate number of shared Fber Delay Lne (FDL) buffers nstead of a large number of expensve wavelength converters. The remander of the paper s organzed as follows. Secton 2 outlnes the OBS contenton resoluton strateges and correspondng node archtectures. A contenton mnmzaton/resoluton framework talored for OBS networks wthout wavelength converters s descrbed n secton 3, whereas secton 4 assesses the performance of ths framework and compares ts network resource requrements wth those of a network wth wavelength converson, for the same obectve performance. Fnally, secton 5 presents some concludng remarks. 2 OBS Contenton Resoluton and Node Archtecture The performance of OBS networks s manly hampered by contenton at the network nodes, whch arses whenever two or more data bursts, overlappng n tme, are drected to the same wavelength on the same output fbre. Contenton can be resolved usng strateges actng n one or several of three domans: wavelength, tme, and space. Thus, contendng bursts can be converted to other wavelengths avalable at the output fbre, delayed usng optcal buffers, or deflected to other output fbres/lnks of the node. Wavelength converson requres all-optcal wavelength converters, whereas optcal bufferng demands FDLs, whch unlke Random-Access Memory (RAM) only provde fxed delays. Deflecton routng does not requre addtonal hardware, but ts effectveness s heavly dependent on network topology and traffc pattern.
3 350 J. Pedro, P. Montero, and J. Pres The complexty of the OBS network nodes depends on the strateges employed for contenton resoluton n the wavelength and tme domans. Fg. 1 (a) shows the key blocks of the smplest node archtecture, comprsng a fast space swtch matrx wth a number of transt ports gven by two tmes MW, where M s the number of nput and output fbres and W s the number of wavelengths per fbre. Fg. 1 (b) depcts the most common OBS node archtecture, whch ncludes a set of MW dedcated wavelength converters, one per output transt port. It has been shown n [8] that sgnfcant savngs n the number of converters can be acheved, wthout notceable performance degradaton, by sharng the converters among all output transt ports, as llustrated n Fg. 1 (c). However, ths s realzed at the expense of ncreasng the sze of the space swtch matrx by addng 2C transt ports, where C s the number of shared converters. Fg. 1 (d) depcts a node usng F shared FDL buffers for resolvng contenton n the tme doman, whch also requres a larger space swtch matrx. Node archtectures combnng wavelength converters wth FDL buffers can also be devsed [3], [8]. (a) wthout wavelength converters and buffers (b) wth dedcated wavelength converters (c) wth shared wavelength converters Fg. 1. OBS network node archtectures. (d) wth shared FDL buffers
4 Towards Effcent Optcal Burst-Swtched Networks 351 In vew of the above smplfed node archtectures, the complexty and cost of the OBS network depends of: () the swtch matrces sze, () the number of wavelength converters, and () the number of FDL buffers. Moreover, snce a FDL buffer s bascally an optcal fbre wth a length desgned to provde a specfc delay, t s smpler than an all-optcal wavelength converter. Ths fact motvated us to nvestgate the feasblty of an OBS network usng only shared FDL buffers to resolve contenton. In the followng, we descrbe a framework for contenton mnmzaton and resoluton talored for networks based on ths archtecture and show evdence that, usng a moderate number of FDLs, t enables the same bandwdth utlzaton effcency of an OBS network usng dedcated full-range wavelength converters. 3 Contenton Mnmzaton and Resoluton Framework for OBS Networks under the Wavelength Contnuty Constrant In all-optcal networks, the absence of wavelength converson at the network nodes mposes the wavelength contnuty constrant on the data path, that s, the same wavelength must be used n all lnks of the path, from the ngress node to the egress node. The resultng wavelength assgnment problem has been extensvely studed n the context of OCS networks [9], where wavelength avalablty n the entre path s known and exploted by the wavelength assgnment strategy. However, due to the one-way nature of resource reservaton n OBS networks, the ngress node knows the wavelengths avalablty on ts output lnks, but t s not aware of ther avalablty on the downstream lnks of the burst path. Thus, bursts gong through overlappng paths can be assgned the same wavelength by ther ngress nodes, resultng n contenton for that wavelength at some common lnk. The probablty of wavelength contenton can be mnmzed n advance by explotng the followng prncple [5]: f two or more burst paths share one or more network lnks, contenton on those lnks wll be reduced f each burst path preferably uses wavelengths dfferent from those preferred by the other overlappng burst paths. In practce, ths s acheved by mantanng at the burst path s ngress node an optmzed prorty-based orderng of the wavelengths and usng t to search for an avalable wavelength (on ts output fbre lnk) for transmttng data bursts towards the egress node. The work n [5] ntroduced a strategy for optmzng the wavelength orderngs usng nformaton of network and traffc condtons that usually reman unchanged over relatvely long tme scales, such as network topology, routng paths, and average offered traffc load between nodes. Recently, we proposed a new strategy [6] that uses the same nput nformaton and was shown to be sgnfcantly more effectve n mnmzng wavelength contenton than that of [5]. In the followng, we descrbe a strategy smpler than that of [6], but that was found to attan smlar performance. Consder an OBS network wth N nodes, L undrectonal lnks, and W wavelengths per lnk. Let Π denote the set of paths used to transmt bursts, and let E denote the set of lnks traversed by path π Π. Let also γ denote the average traffc load offered to burst path π. The extent of wavelength contenton from bursts of a path π on bursts of a path π s expected to ncrease wth both the average traffc load offered to the paths and the number of common lnks. Defne the nterference level of π on π as
5 352 J. Pedro, P. Montero, and J. Pres I( π,π ) = γ E E,, (1) where E E denotes the number of lnks shared by both paths. Let 1 P(π,λ ) W denote the prorty of wavelength λ on path π, that s, the ngress node of π only assgns λ to a burst on ths path f the frst W P(π,λ ) wavelengths, ordered by decreasng prorty, are not avalable. Based on the problem nputs, the strategy determnes the nterference level of each path on every other path and reorders the paths of Π such that f < the followng condton holds I( π,π k ) > I(π,π k ) or I π,π k ) = π Π k π Π k π Π k ( I(π,π ) and E > E. (2) π Π k k Intally, no prortes are assgned to the wavelengths, that s, P(π,λ )=0 for all π and λ. The followng steps are executed for every prorty 1 p W n decreasng order, and for every ordered path π Π: (S1) Let = { λ : P(π, λ ) = 0, 1 W } Λ denote the ntal set of canddate wavelengths contanng all wavelengths that were not assgned a prorty on π. If Λ =1 go to (S7). PΛ = pk : πl, l, P(πl, λ ) = pk, El E > 0, λ Λ denote the set of prortes already assgned to canddate wavelengths on paths that overlap wth π. ρ = mn λ max{ P(πl, λ ) : l, El E > 0} Λ be the lowest prorty from the set of the hghest prortes assgned to canddate wavelengths on the paths that use lnks of π. Update the set of canddate wavelengths as follows (S2) Let { } (S3) Let { } { λ : π, l, P(π, λ ) > ρ, E E > 0, λ Λ} Λ Λ \. (3) l l If Λ =1 go to (S7). C ( em, λ ) = γl : El em, El E > 0, P(πl, λ ) = ρ be the cost assocated wth wavelength λ on lnk em E. Thus, the mnmum cost among the hghest costs assocated wth the canddate wavelengths on the lnks of (S4) Let { } path π s mn { max { C( e, λ ) : e E }} αe λ m m l = Λ. Update the set of canddate wavelengths as follows { λ : e, C( e, λ ) > α, e E, λ Λ} Λ Λ \. (4) m m If Λ =1 go to (S7). (S5) Let C ( π, λ ) = C( em, λ ) be the cost assocated wth wavelength λ m E e on π. Thus, α = mn C(π, λ ) s the mnmum cost among the costs π λ Λ assocated wth the canddate wavelengths on π. Update the set of canddate wavelengths as follows If Λ =1 go to (S7). { λ : (π, λ ) > α, Λ} m Λ Λ \ C π λ. (5)
6 Towards Effcent Optcal Burst-Swtched Networks 353 (S6) Update the set of prortes assgned to the canddate wavelengths as follows P Λ { p : p ρ p P } P, Λ \ k k k Λ. (6) If P Λ >0 go to (S3). Else, randomly select a canddate wavelength λ Λ. (S7) Assgn prorty p to the canddate wavelength λ Λ on path π, that s (, λ ) p P π =. (7) Each executon of the above steps, selects the wavelength that wll be used wth prorty p on path π. Therefore, these steps are executed W Π tmes to determne all wavelength orderngs. The hghest prorty wavelengths are the frst to be selected and preference n wavelength selecton s gven to the burst paths wth larger nterference level over the other paths. The wavelength selecton s made by frst defnng a set of canddate wavelengths, and then successvely reducng ther number untl there s only one. The crterons used to reduce ths set sze are such that the canddate wavelength selected mnmzes the prorty nterference on the lnks of the path. In other words, the wavelength selected s one that has preferably been assgned low prortes on paths that share lnks wth the burst path π. In the followng, ths greedy strategy s named Heurstc Mnmum Prorty Interference (HMPI). Upon assemblng a data burst, drected to a gven egress node, the ngress node wll search for an avalable wavelength usng the wavelength orderng optmzed for the correspondng path. Snce a burst transmtted over a hgh prorty wavelength wll have greater chances of avodng wavelength contenton, we use a proper schedulng algorthm at the ngress node to ncrease the amount of traffc carred on these wavelengths. The ngress burst schedulng algorthm s allowed to delay assembled bursts at the electronc buffer of the ngress node by any amount of tme bounded to D ngress. Hence, the algorthm wll frst try to assgn the hghest prorty wavelength to the burst f ths wavelength s avalable durng the requred tme for burst transmsson startng at some tme n the future not exceedng the addtonal D ngress delay. If ths wavelength s stll not avalable, the algorthm wll proceed n the same manner for the second hghest prorty wavelength and so on, untl ether an avalable wavelength s found or all wavelengths have been searched. In vew of the wavelength contnuty constrant, contenton at a transt node can only be resolved by delayng contendng bursts at the shared FDL buffers. Several FDL buffer confguratons have been presented [3]. Here, we adopt a pragmatc approach to optcal bufferng. Thus, only sngle-wavelength FDL buffers are used, whch cannot accommodate bursts overlappng n tme usng dfferent wavelengths, but avod a larger swtch fabrc and extra multplexng and demultplexng equpment requred by mult-wavelength buffers. Moreover, snce a larger delay demands ether a longer fbre or buffer recrculaton, ncreasng optcal sgnal degradaton and the amount of extra hardware for compensatng t, we mpose a lower bound D mn and an upper bound D max on the FDL delay, rrespectve of the number of buffers per node, and nhbt buffer recrculaton. Hence, n a node wth F shared FDL buffers, the FDLs delay s unformly dstrbuted between D mn and D max. Contenton s resolved by delayng the contendng burst usng the smallest avalable FDL buffer that enables the burst to be transmtted through the next lnk of ts path usng the same wavelength.
7 354 J. Pedro, P. Montero, and J. Pres 4 Results and Dscusson The performance of OBS networks usng dedcated wavelength converters, shared wavelength converters, and shared FDL buffers, s evaluated n ths secton usng network smulaton [10]. A 10-node rng topology wth a unform traffc pattern s used n the performance studes. Moreover, the network employs Just Enough Tme (JET) resource reservaton [1] and bursts are routed through the shortest paths. In all cases, each of the L=20 undrectonal lnks has W=32 wavelengths, a wavelength capacty of B=10 Gb/s, a swtch fabrc confguraton tme of 10 µs, and an average burst sze of 100 kb, whch gves an average burst duraton of T=80 µs. A negatve exponental dstrbuton s used for both burst sze and burst nterarrval tme. The average offered traffc load normalzed to the network capacty s gven by γ E Π Γ = π. (8) L W B The OBS rng network usng shared wavelength converters (SWC) or shared FDL buffers (SFB) s desgned to match the bandwdth utlzaton effcency of usng dedcated wavelength converters (DWC). Ths s acheved by determnng the number of shared converters or FDL buffers requred to attan the same average burst blockng probablty at the expense of the same average offered traffc load than that of usng dedcated converters. In ths case, we set the obectve average burst blockng probablty to 10-3 and 10-4, whch s obtaned wth dedcated wavelength converters for an average offered traffc load of Γ=0.40 and Γ=0.47, respectvely. Fg. 2 and Fg. 3 plot the average burst blockng probablty of the 10-node rng network as a functon of the number of shared wavelength converters and the number of shared FDL buffers, respectvely. In the latter case, the mnmum and maxmum FDL delays are set to D mn =T and D max =10T. The average burst blockng probabltes were obtaned by smulatng 20 ndependent burst traces for Γ=0.40 and Γ= E SWC Average burst blockng probablty 1.0E E E E-4 10 Γ=0.40 Γ=0.47 DWC 1.0E Number of shared wavelength converters per node Fg. 2. Network performance usng shared wavelength converters.
8 Towards Effcent Optcal Burst-Swtched Networks E SFB Average burst blockng probablty 1.0E E E E-4 10 Γ=0.40 Γ=0.47 DWC 1.0E Number of shared FDL buffers per node Fg. 3. Network performance usng shared FDL buffers. The curves n these plots show that as the number of shared wavelength converters or shared FDL buffers s ncreased, the average burst blockng probablty s reduced and eventually the bandwdth utlzaton effcency of usng dedcated wavelength converters s acheved. The results also suggest that larger numbers of ether shared converters or FDL buffers are needed when the obectve burst blockng probablty s hgher. Moreover, n both cases the curves tend to a lower boundary of burst loss performance. In the SWC node archtecture, ths boundary corresponds exactly to the performance of DWC, whereas n the SFB node archtecture the lower boundary s a result of mposng a maxmum FDL delay rrespectve of the number of FDL buffers. Fg. 4 plots the performance of the 10-node rng network usng shared FDL buffers and the HMPI strategy to optmze the wavelength orderngs of each burst path. The mnmum and maxmum FDL delays are also set to D mn =T and D max =10T, whereas the maxmum ngress delay s gven by D ngress =T. 1.0E SFB - HMPI Average burst blockng probablty 1.0E E E E-4 10 Γ=0.40 Γ=0.47 DWC 1.0E Number of shared FDL buffers per node Fg. 4. Network performance usng shared FDL buffers and the HMPI strategy.
9 356 J. Pedro, P. Montero, and J. Pres These curves exhbt a decrease of several orders of magntude n terms of average burst blockng probablty, as compared to the ones of Fg. 3. More to the pont, they show a remarkable decrease on the number of shared FDL buffers requred to match the bandwdth utlzaton effcency of usng dedcated wavelength converters. For nstance, for an obectve average burst blockng probablty of 10-4 the SFB node archtecture needs around 19 shared FDL buffers, whereas wth the use of wavelength orderngs optmzed wth the HMPI strategy, ths number s reduced to only 5. Thus, buffer requrements are reduced by almost a factor of 4. The reported FDL buffer savngs are due to the effectveness of the prorty-based wavelength assgnment and burst schedulng strategy n mnmzng contenton n the wavelength doman. In order to gan further nsght on the complexty of each of the node archtectures under study, Fg. 5 presents the number of transt swtchng ports, the number of wavelength converters, and the number of FDL buffers per node that s needed to acheve an average burst blockng probablty of 10-4 when the average offered traffc load s Number of unts per network node Transt swtchng ports Wavelength converters FDL buffers 20 0 DWC SWC SFB SFB-HMPI Fg. 5. Node resource requrements for an average burst blockng probablty of 10-4 and an average offered traffc load of The node resource requrements plotted n Fg. 5 show that the use of dedcated wavelength converters requres a very large number of converters, although wth the beneft of avodng an ncrease on the number of transt swtchng ports. On the other hand, sharng the wavelength converters allows reducng ther number to less than half, but demands a sgnfcant ncrease on the number of transt swtchng ports. The node archtecture wth shared FDL buffers needs slghtly less transt swtchng ports and successfully replaces the expensve wavelength converters by smpler FDL buffers. However, the best compromse between the expanson of the space swtch matrx and the number of ether wavelength converters or FDL buffers s clearly gven by usng the prorty-based wavelength assgnment and burst schedulng strategy for mnmzng wavelength contenton combned wth shared FDL buffers to resolve contenton n the tme doman.
10 Towards Effcent Optcal Burst-Swtched Networks Conclusons In vew of the current lmtatons of all-optcal wavelength converson technology, OBS networks would greatly beneft, n terms of cost and ease of mplementaton, from avodng the use of wavelength converters at the network nodes. Ths paper has presented a framework from contenton mnmzaton/resoluton combnng traffc engneerng n the wavelength doman to mnmze contenton n advance and optcal bufferng at the core nodes to resolve contenton. Moreover, a performance study wth node archtectures that use ether dedcated wavelength converters, shared wavelength converters, or shared FDL buffers to resolve contenton was presented. Smulaton results show that the proposed contenton mnmzaton/resoluton framework only requres a moderate number of shared FDL buffers and a small ncrease n the space swtch matrx to acheve the same bandwdth utlzaton effcency of a network usng dedcated full-range wavelength converters. Therefore, t can contrbute to lower the complexty/cost of deployng OBS networks n the near future. Acknowledgments. The authors acknowledge the fnancal support from Semens Networks S.A. and Fundação para a Cênca e a Tecnologa (FCT), Portugal, through research grant SFRH/BDE/15584/2006. References 1. C. Qao and M. Yoo, Optcal Burst Swtchng (OBS) A new paradgm for an optcal Internet, Journal of Hgh Speed Networks, vol. 8, no. 1, pp , January R. Ramaswam and K. Svaraan, Optcal Networks: A Practcal Perspectve, 2 nd edton. San Francsco, CA: Morgan Kaufmann, S. Yao, B. Mukheree, S. Yoo and S. Dxt, A unfed study of contenton-resoluton schemes n optcal packet-swtched networks, IEEE Journal of Lghtwave Technology, vol. 21, no. 3, pp , March A. Pouste, Semconductor devces for all-optcal sgnal processng, n Proc. of ECOC 2005, paper We3.5.1, Glasgow, Scotland. 5. J. Teng and G. Rouskas, Wavelength selecton n OBS networks usng traffc engneerng and prorty-based concepts, IEEE Journal of Selected Areas n Communcatons, vol. 23, no. 8, pp , August J. Pedro, P. Montero, and J. Pres, Wavelength contenton mnmzaton strateges for optcal burst-swtched networks, n Proc. of IEEE GLOBECOM 2006, paper OPNp1-5, San Francsco, USA. 7. Y. Sun, T. Hashguch, V. Mnh, X. Wang, H. Morkawa, and T. Aoyama, Desgn and mplementaton of an optcal burst-swtched network testbed, IEEE Communcatons Magazne, vol. 43, no. 11, pp. s48-s55, November C. Gauger, Performance of converter pools for contenton resoluton n optcal burst swtchng, n Proc. of SPIE OptComm 2002, pp , Boston, USA. 9. H. Zang, J. Jue, and B. Mukheree, A revew of routng and wavelength assgnment approaches for wavelength-routed optcal WDM networks, Optcal Networks Magazne, vol 1, no. 1, pp , January J. Pedro, J. Castro, P. Montero, and J. Pres, On the modellng and performance evaluaton of optcal burst-swtched networks, n Proc. of IEEE CAMAD 2006, pp , Trento, Italy.
Simulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationDesign and implementation of priority and timewindow based traffic scheduling and routingspectrum allocation mechanism in elastic optical networks
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Desgn and mplementaton of prorty and tmewndow based traffc schedulng and routngspectrum allocaton mechansm n elastc optcal networks To cte ths artcle:
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationSession 5.3. Switching/Routing and Transmission planning
ITU Regonal Semnar Belgrade Serba and Montenegro 20-24 24 June 2005 Sesson 5.3 Swtchng/Routng and Transmsson plannng volvng nfrastructures to NGN and related Plannng Strateges and Tools I.S. Sesson 5.3-1
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationDynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks
Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,
More informationIntegrated Congestion-Control Mechanism in Optical Burst Switching Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subect matter experts for publcaton n the IEEE GLOBECOM 2005 proceedngs Integrated Congeston-Control Mechansm n Optcal Burst
More informationBAIMD: A Responsive Rate Control for TCP over Optical Burst Switched (OBS) Networks
AIMD: A Responsve Rate Control for TCP over Optcal urst Swtched (OS) Networks asem Shhada 1, Pn-Han Ho 1,2, Fen Hou 2 School of Computer Scence 1, Electrcal & Computer Engneerng 2 U. of Waterloo, Waterloo,
More informationScheduling and queue management. DigiComm II
Schedulng and queue management Tradtonal queung behavour n routers Data transfer: datagrams: ndvdual packets no recognton of flows connectonless: no sgnallng Forwardng: based on per-datagram forwardng
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationMaximum Weight Matching Dispatching Scheme in Buffered Clos-Network Packet Switches
Maxmum Weght Matchng Dspatchng Scheme n Buffered Clos-Network Packet Swtches Roberto Roas-Cessa, Member, IEEE, E Ok, Member, IEEE, and H. Jonathan Chao, Fellow, IEEE Abstract The scalablty of Clos-network
More informationCS 268: Lecture 8 Router Support for Congestion Control
CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationA Frame Packing Mechanism Using PDO Communication Service within CANopen
28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 12, December-2013 ISSN
833 Polynomal Tme Algorthm (PTA) to generate a survvable rng vrtual topology for Optcal WDM based on Hamltonan Crcut Detecton Heurstcs(HCDH) *Sajal Kanta Das, Department of Computer Scence & Technology,
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationWITH rapid improvements of wireless technologies,
JOURNAL OF SYSTEMS ARCHITECTURE, SPECIAL ISSUE: HIGHLY-RELIABLE CPS, VOL. 00, NO. 0, MONTH 013 1 Adaptve GTS Allocaton n IEEE 80.15.4 for Real-Tme Wreless Sensor Networks Feng Xa, Ruonan Hao, Je L, Naxue
More informationOnline Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks
12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele
More informationA fair buffer allocation scheme
A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres
More informationUsing Memory and Random Sampling for Load Balancing in High-radix Switches
Unversty of Toronto SNL Techncal Report TR-SN-UT-7--2. c Soudeh Ghorban Khaled et al. Usng Memory and Random Samplng for Load Balancng n Hgh-radx Swtches Soudeh Ghorban Khaled, Yashar Ganjal Department
More informationMULTIHOP wireless networks are a paradigm in wireless
400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationwith `ook-ahead for Broadcast WDM Networks TR May 14, 1996 Abstract
HPeR-`: A Hgh Performance Reservaton Protocol wth `ook-ahead for Broadcast WDM Networks Vjay Svaraman George N. Rouskas TR-96-06 May 14, 1996 Abstract We consder the problem of coordnatng access to the
More informationPricing Network Resources for Adaptive Applications in a Differentiated Services Network
IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More informationMinimum Cost Optimization of Multicast Wireless Networks with Network Coding
Mnmum Cost Optmzaton of Multcast Wreless Networks wth Network Codng Chengyu Xong and Xaohua L Department of ECE, State Unversty of New York at Bnghamton, Bnghamton, NY 13902 Emal: {cxong1, xl}@bnghamton.edu
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationCongestion Aware Priority Flow Control in Data Center Networks
Congeston Aware Prorty Flow Control n Data Center Networks Serhat Nazm Avc, Zhenjang L, Fangpng Lu Futurewe Technologes {serhat.avc,andy.z.l,julus.f.lu}@huawe.com Abstract The data center brdgng (DCB)
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationOn the Exact Analysis of Bluetooth Scheduling Algorithms
On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationEFT: a high throughput routing metric for IEEE s wireless mesh networks
Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon
More informationA Centrally-Scheduled Photonic Container Switched Architecture For The Core Transport Network
A entrally-scheduled Photonc ontaner Swtched Archtecture For The ore Transport Network Preetam Ghosh, Amn R. Mazloom, Kalyan Basu and Saal K. Das The Unversty of Texas at Arlngton USA Abstract: We use
More informationBandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks
Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: nowakd@eengdcue Phlp
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationUSER CLASS BASED QoS DIFFERENTIATION IN e WLAN
USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee
More informationTapping into the Router s Unutilized Processing Power
Tappng nto the Router s Unutlzed Processng Power Marat Radan, Isaac Keslassy Technon {radan@tx, saac@ee}.technon.ac.l Abstract The growng demand for network programmablty has led to the ntroducton of complex
More informationStitch-n-Sync: Discreetly Disclosing Topology Information Using Logically Centralized Controllers
Sttch-n-Sync: Dscreetly Dsclosng Topology Informaton Usng Logcally Centralzed Controllers Presented at The 3 rd Internatonal Workshop on Capacty Sharng (CSWS'13) n conjuncton wth ICNP'13 by Yvon GOURHANT
More informationA Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI
216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent
More informationRoutability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2-layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationExtending Network Life by Using Mobile Actors in Cluster-based Wireless Sensor and Actor Networks
Extendng Networ Lfe by Usng Moble Actors n Cluster-based Wreless Sensor and Actor Networs Nauman Aslam, Wllam Phllps, Wllam Robertson and S. Svaumar Department of Engneerng Mathematcs & Internetworng Dalhouse
More informationBuffer-aided link selection with network coding in multihop networks
Loughborough Unversty Insttutonal Repostory Buffer-aded lnk selecton wth network codng n multhop networks Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Ctaton:
More informationInterclass Collision Protection for IEEE e Wireless LANs
Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationCognitive Radio Resource Management Using Multi-Agent Systems
Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North
More informationTransit Networking in ATM/B-ISDN based on Service Category
Transt Networkng n ATM/B-ISDN based on Servce Category Young-Tak Km Dept. of Informaton and Communcaton Engneerng, College of Engneerng, YeungNam Unv. E-mal : ytkm@ynucc.yeungnam.ac.kr ABSTRACT The ATM
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationQoS-aware composite scheduling using fuzzy proactive and reactive controllers
Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationDelay Analysis and Time-Critical Protocol Design for In-Vehicle Power Line Communication Systems
Delay Analyss and Tme-Crtcal Protocol Desgn for In-Vehcle Power Lne Communcaton Systems Zhengguo Sheng, Daxn Tan, Vctor C.M. Leung and Gaurav Bansal Abstract Wth the emergng automated tasks n vehcle doman,
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationChannel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks
Channel-Qualty Dependent Earlest Deadlne Due Far Schedulng Schemes for Wreless Multmeda Networks Ahmed K. F. Khattab Khaled M. F. Elsayed ahmedkhattab@eng.cu.edu.eg khaled@eee.org Department of Electroncs
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationUse of Genetic Algorithms in Efficient Scheduling for Multi Service Classes
Use of Genetc Algorthms n Effcent Schedulng for Mult Servce Classes Shyamale Thlakawardana and Rahm Tafazoll Centre for Communcatons Systems Research (CCSR), Unversty of Surrey, Guldford, GU27XH, UK Abstract
More informationInternet Traffic Managers
Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John
More informationA Fair MAC Algorithm with Dynamic Priority for e WLANs
29 Internatonal Conference on Communcaton Software and Networks A Far MAC Algorthm wth Dynamc Prorty for 82.e WLANs Rong He, Xumng Fang Provncal Key Lab of Informaton Codng & Transmsson, Southwest Jaotong
More informationAn Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems
An Investgaton nto Server Parameter Selecton for Herarchcal Fxed Prorty Pre-emptve Systems R.I. Davs and A. Burns Real-Tme Systems Research Group, Department of omputer Scence, Unversty of York, YO10 5DD,
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationMixed-Criticality Scheduling on Multiprocessors using Task Grouping
Mxed-Crtcalty Schedulng on Multprocessors usng Task Groupng Jankang Ren Lnh Th Xuan Phan School of Software Technology, Dalan Unversty of Technology, Chna Computer and Informaton Scence Department, Unversty
More information