Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks
|
|
- Dwayne Reed
- 6 years ago
- Views:
Transcription
1 Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: Phlp Perry Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: John Murphy Performance Engneerng Laboratory Department of Computer Scence Unversty College Dubln Emal: Abstract Passve Optcal Networks (PON) are thought to be the next step n the development of access networks and provdng broadband access n the last mle area Ethernet PONs (EPONs) are ganng the most attenton from ndustry as they offer a hghly flexble, cost effectve soluton In ths paper, we present a new approach to the problem of optmal bandwdth allocaton n EPONs We show that by movng all the access control functonalty to the Optcal Lne Termnator, a flexble soluton could be acheved whch offers full support for Servce Level Agreements and removes the burden of managng the confguraton of every Optcal Network Unt We nclude results of smulatons that show that such an approach can delver good performance n terms of average and maxmum packet delay We show that, a novel Grant Multplexng scheme can sgnfcantly reduce jtter and end-to-end delay experenced by the hgh prorty classes of traffc To prove these ponts we present results of detaled experments that were run on a C++ event drven smulator, that we haveloped 1 INTRODUCTION Wth the ncreasng popularty of the Internet, the traffc generated by domestc and small busness users has been growng constantly over the last couple of years Varous technologes have been deployed to provde broadband access to the network n the area known as the last mle As network operators strve for cost effcences, Passve Optcal Networks (PONs) seem to be the next step n the development of access networks (AN) A PON s a pont-to-multpont all optcal network wth no actve elements n the path between the sgnal source and the destnaton On the network sde there s an Optcal Lne Termnator (OLT) unt The OLT s usually placed n the local exchange and t acts as a pont of access to the Wde or Metropoltan Area Network On the customer s sde there s an Optcal Network Unt (ONU) An ONU can be placed ether n the curb, buldng or home and ts prmary task s to convert data between the optcal and electrcal domans Two protocols, Asynchronous Transfer Mode (ATM) and Ethernet, have been proposed as the transmsson protocol n PONs In recent years Ethernet based PONs (EPONs) have ganed more attenton from ndustry The archtecture of an Ethernet network s smple yet extremely effcent Interpretablty between old and new networks can easly be mantaned and legacy solutons can be used as EPON data s carred n standard Ethernet frames In a downstream transmsson, the OLT uses all the avalable bandwdth to broadcast packets through the spltter/coupler to every ONU Each ONU extracts packets from the stream based on the Logcal Lnk Identfer (LLID) that has been assgned durng the dscovery phase In the upstream drecton packets sent by an ONU can only reach the OLT as the optcal spltter prevents an ONU from recevng packets from other ONUs In order to avod collsons between frames from dfferent ONUs, at the optcal spltter, the avalable bandwdth must be shared among all ONUs The OLT s responsble for assgnng a non overlappng tme-slot to each ONU, and ONUs can only transmt durng that tme-slot Durng an off perod packets are buffered and when the tme arrves, the ONU sends a burst usng all the avalable bandwdth One of the key features of EPON networks s ther ablty to support Dfferentated Servces (DffServ) [1] archtecture and offer varous levels of qualty of servce (QoS) Generally three classes of traffc can be dstngushed: Expedted Forwardng (EF), Assured Forwardng (AF), and Best Effort (BE) EF servces (prmarly voce and vdeo) have very strct requrements and demand a constant, low end-to-end delay and jtter AF servces tend to be less senstve to packet delay but requre a guaranteed amount of bandwdth BE traffc s generated by applcatons that have no strong requrements regardng traffc propertes In ths paper we present a new approach to the problem of bandwdth assgnment We propose to keep the ONU s functonalty as smple as possble and move all necessary access control mechansms to the OLT for two man reasons: As no access control or packet schedulng s done n an ONU, varous algorthms can be deployed n the OLT wthout the need for reconfguraton of the equpment on the customer s sde It also allows for SLAs to be created, modfed and deleted durng normal network operaton An ONU wth a smple and generc archtecture s less expensve to produce and thus EPON becomes a more affordable choce
2 2 BACKGROUND Due to the archtecture lmtatons of EPONs, only one ONU can transmt at the tme, as sgnals from dfferent ONUs would nterfere wth each other leadng to errors at the OLT It s the OLT s responsblty to dvde the avalable bandwdth between ONUs The OLT must assgn a nonoverlappng tme-slot to every ONU and ths assgnment can be statc or dynamc In a statc allocaton a fxed amount of tme s assgned to every ONU Algorthms wth and wthout support for DffServ based on a fxed bandwdth allocaton were studed n [2], [3] Although the jtter s qute small, the avalable bandwdth s not utlzed n an effcent manner In [4], a dynamc bandwdth allocaton algorthm called Interleaved Pollng wth Adaptve Cycle Tme (IPACT) was presented Ths algorthm allocates tme-slots based on nformaton receved from ONUs durng a pollng cycle IPACT provdes statstcal multplexng and gves good bandwdth utlzaton but due to a varable pollng cycle delay senstve servces are hampered Dynamc Bandwdth Allocaton (DBA) combned wth prorty schedulng algorthms was studed n [4], [5] In both papers the OLT s responsble for grantng tme-slots to ONUs Every ONU assgns packets to dfferent queues based on ther QoS demands The man dsadvantage of ths approach s that to fully support DffServ, an ONU wll have to have knowledge about the SLA between a customer and the network provder A DBA scheme wth partal support for SLAs was studed n [6] The author proposed the statc bandwdth allocaton for EF traffc, whch could lead to neffcent bandwdth usage For non-real tme servces the bandwdth was allocated proportonally to the bandwdth requested In ths approach, a malcous user requestng a large amount of bandwdth can serously dsturb the performance of other ONUs A centralzed approach to the bandwdth allocaton was presented n [7] In ths scheme the OLT assgns bandwdth to an ONU not to a partcular queue whch s the man feature of our approach Two messages from Mult-Pont Control Protocol (MPCP) [8] sute are used n a bandwdth allocaton mechansm The REPORT message s used to report the status of queues at a partcular ONU Based on ths nformaton and the SLA, the algorthm makes a decson about the sze of a tme-slot dedcated to a partcular class of traffc n the next grantng cycle The notfcaton about the tme-slots assgnment s sent back to an ONU n the GATE message Upon recept of GRANT message every ONU allocates bandwdth to ts queues and the decson s made based only on the local knowledge and the comprehensve knowledge of utlzaton network resources s not taken nto account In ths paper we consder OLT-centrc bandwdth assgnment algorthm, where the resources are allocated to a partcular queue rather than to an ONU Ths feature makes t unque and dstngushes our approach from those already presented Octets GATE message REPORT message Octets 6 Destnaton Address Destnaton Address 6 6 Source Address Source Address 6 2 Length/Type(88 8) Length/Type(88 8) 2 2 Opcode( 2) Opcode( 2) 4 Tmestamp Tmestamp 4 1 Number of grants Number of reports 1 1 Grant map Report map 1 4 Start tme Queue Length -2 2 Length Queue Length -2 4 Start tme Queue Length -2 2 Length Queue Length -2 1 Grant map Report map 1 4 Start tme Queue Length -2 2 Length Queue Length -2 4 Start tme Queue Length -2 2 Length Queue Length -2 Fg 1 MPCP GATE and REPORT packet formats n lterature bandwdth assgnment algorthms In Fg 1 we propose the modfed verson of GRANT message that allows for per queue bandwdth assgnment 3 SLA AWARE DYNAMIC BANDWIDTH ALLOCATION ALGORITHM () The algorthm presented n ths secton s based on a proportonal allocaton of bandwdth to a class of traffc as ths provdes better utlzaton of the avalable resources The constrants agreed n the SLA are taken nto account n the second stage to ensure that classes conformng to ther SLA receve enough bandwdth The pseudocode of the scheduler s presented n Fg 2 Let Q (j) be the number of bytes reported by queue j by ONU and βk (j) s the number of bytes allocated to ths queue n step k of the algorthm Let γmn (j) and γ max(j) be the mnmum and maxmum number of bytes guaranteed to the partcular queue Let β max s the maxmum number of bytes that can be sent n a gve a gven grantng cycle such that β max = Q (j) (1),j and τ mn βmax C l τ max, (2) where τ mn and τ max s a mnmum and maxmum tme of a grantng cycle and C max s a lnk capacty In phase I, the OLT assgns number of bytes proportonally to reported queue length Q (j) β I(j) = Q (j),j Q (j) βmax (3) In the second phase the constrants gven n the SLA are appled Three dstnct stuatons have to be consdered: 1) β I (j) γ max(j) Number of assgned bytes has exceeded the maxmum The number of allocated bytes to a partcular queue s thus reduced to β II (j) = γ max(j)
3 Requre: Q j > for = to Onu do for j = to Queue do Req Req + Q j for = to Onu do for j = to Queue do β I(j) 1/Req Q j β max (a) PROP DBA :STEP I call PROP DBA :STEP II for = to Onu do for j = to Queue do f βi(j) γmax(j) then βii(j) γmax(j) β ex β ex + (βi(j) γmax(j)) f βi(j) γmn(j) βi(j) < γmax(j) then βii(j) βi(j) f βi(j) < γmn then f βi(j) < Q ( j) then βii(j) Q ( j) else βii(j) βi(j) :STEP III f β ex > then for = to Onu do for j = to Queue do βiii(j) βii(j)+ β ex Q (j),j Q (j) (b) OLT DBA Fg 2 Pseudocode for SLAs aware DBA scheduler 2) β I (j) γ mn (j) and β I (j) < γ max(j) Number of assgned bytes s wthn the lmts of the SLA No changes are made and β II (j) = β I (j) 3) β I (j) < γ mn (j) In a stuaton where Q (j) > β (j) number of bytes assgned s equal to β II (j) = Q (j) as t s smaller than the mnmum Otherwse no changes are made and β II (j) = β I (j) Bytes that reman unallocated durng the second step are dvded among all queues n phase three The total number of bytes allocated to a queue could be thus expressed as: β III(j) = β II(j) + β ex Q (j),j Q (j) 4 GRANT MULTIPLEXING Voce and real-tme vdeo servces are delay senstve and requre low values of jtter Snce a DBA scheme may result (4) Fg 3 EF AF BE GRANTING CYCLE (a) no Grant Multplexng GRANTING CYCLE (b) Grant Multplexng Bandwdth assgnment wth and wthout Grant Multplexng n consderable varaton n the assgned bandwdth n consecutve grantng cycles, t s dffcult to mantan good traffc parameters for the hgh prorty classes Here, we propose a mechansm whch could mprove the qualty of servce offered to jtter senstve classes In the GATE message,we proposed, the bandwdth granted to a partcular queue s descrbed by a two felds: start tme and length The frst nforms an ONU when t could start sendng packets from a partcular queue and the second specfes how long the tme-slot lasts for As the OLT assgns a bandwdth to a queue, not to an ONU, t s possble to grant tme-slots for hgh prorty queues from dfferent ONUs at the begnnng of the grantng cycle An example of a possble effect of Grant Multplexng mechansm on jtter reducton s shown n Fg 3 1, 2 and 3 show the varaton n tme when consecutve ONUs started sendng ther EF packets Because of the bursty nature of the AF and BE traffc, the amount of bandwdth assgned to those classes may vary consderably Ths can result n an ncrease n jtter experenced by EF classes (Fg 3(a)) Hgh prorty traffc generally demands a constant amount of bandwdth and t s less bursty n nature A sgnfcant decrease n jtter could be acheved f EF queues were assgned to consecutve tme-slots (Fg 3(b)) Improved traffc parameters comes at the prce of more bandwdth beng used for guardng ntervals that separate successve transmssons from dfferent ONUs 5 PERFORMANCE EVALUATION To measure the performance of each bandwdth allocaton algorthm we desgned an event-drven C++ based EPON smulator In our research we used 16 ONUs connected n a tree topology to a sngle OLT operatng at a speed of 1Gb/s Each ONU had three queues wth an ndependent bufferng space The guard tme between transmssons from dfferent ONUs was set to 1µs and the value of Inter-Frame Gap (IFG) between Ethernet packets was 96 bts It was shown that most network traffc (e, http, ftp and VBR servces) was best characterzed by self-smlarty and long-range dependence [9] To model a hgh prorty EF class of traffc (eg, voce applcatons) a Posson dstrbuton s
4 Average delay (ms) wth GM Maxmum delay (ms) wth GM (a) EF (a) EF Average delay (ms) wth GM Maxmum delay (ms) wth GM (b) AF (b) AF Fg 4 Average delay comparson Maxmum grantng cycle length 2ms Fg 5 Maxmum delay comarson Maxmum grantng cycle length 2ms generally used In our smulaton EF traffc consttuted 2% of the load The remanng load was dvded equally between AF and BE classes The length of hgh prorty traffc packets was fxed at 7 bytes The length of AF and BE packets was unformly dstrbuted between 64 and 1518 bytes The grantng cycle tme was changng dynamcally dependng on the amount of requested bandwdth We assumed that an ONU sent REPORT message for every queue at the end of the tme slot allocated to a partcular queue The grantng cycle tme was varable but t could not exceed the maxmum value We compare the performance of the algorthm aganst statc bandwdth assgnment () and proportonal dynamc bandwdth allocaton () algorthms The algorthm allocates a fxed share of bandwdth to a queue The amount allocated s based on parameters specfed upfront and the assgnment does not depend on the current length of the queue In our smulatons the bandwdth s dvded equally among all queues In, a source s assgned a bandwdth proportonally to a queue length reported by an ONU n a last REPORT message We measured the average and maxmum delay experenced by EF and AF class of traffc The BE traffc has the lowest prorty and receves the worst QoS In Fgs 4 and 5 we show the results of smulatons n a stuaton where none of the users was exceedng ts SLA The algorthm gves a very good results as long as there was enough bandwdth assgned to a partcular class of traffc (Fgs4(a) and 5(a)) but otherwse the values of average and maxmum delay are growng fast as shown n (Fgs4(b) and 5(b)) Moreover, on average gves the smallest throughput The algorthms based on proportonal bandwdth assgnment perform very well for small and medum loads For large loads above 8% the average delay s ncreasng very fast Ths s explaned by the fact that the grantng cycle tme s lmted from the top and as more packets arrve and they cannot be sent they have to be buffered untl the next cycle leadng to a dramatc ncrease n the average delay The shows much better performance than P- DBA for hgh and medum prorty traffc, whch comes at the expense of QoS receved by the best effort servces To compare the behavor of varous algorthms where some classes exceed the lmts mposed n the SLA, we ncreased transmsson rate of 8 ONUs by 1% The results of the smulatons are presented n Tables I and II The algorthm showed the best performance of all algorthms compared, although ths comes at the prce of much lower throughput as shown n Fg 6 The algorthm provded no protecton as the dfference n average delay tme for faster and slower ONUs was
5 TABLE I AVERAGE DELAY FOR EF CLASS FOR ONUS IN(I) AND OUTSIDE(II) OF Bandwdth utlzaton % THE LIMITS OF THE SLA TIMES IN ms (I) (II) (I) (II) (I) (II) TABLE II AVERAGE DELAY FOR AF CLASS FOR ONUS IN(I) AND OUTSIDE(II) OF Bandwdth utlzaton % THE LIMITS OF THE SLA TIMES IN ms (I) (II) (I) (II) (I) (II) small The algorthms provded good protecton and classes were always allocated the amount of bandwdth whch was agreed n the SLA Ths was especally true for samples where the total bandwdth requested was bgger than the total lnk capacty The results show that for small loads t was possble that more bandwdth was allocated to classes whch exceeded ther SLAs Ths was due to the fact that n the frst phase of the algorthm presented n ths paper, bandwdth was allocated proportonally to the reported length of queues Despte ths detal, classes that conformed to ther SLAs receved enough bandwdth In order to show the mpact of Grant Multplexng mechansm on the amount of jtter experenced by the hgh prorty classes we measured the standard devaton from the average perod of tme that elapses between the start the grantng cycle and the moment where a partcular tme-slot allocated to a hgh prorty class starts The smulaton results presented n Fg 7 show that wth Grant Multplexng mechansm the jtter could be reduced by as much as 1% Throughput wth GM Fg 6 Throughput comparson Jtter (ms) wth Grant Multplexng 1 Fg 7 Jtter comparson 6 CONCLUSION We beleve that the ONU should be a very smple unt and all access control should be the responsblty of the OLT Ths knd of approach allows for a smooth update of the exstng polcy wthout a burden of changng the confguraton of every ONU In ths paper we proposed an algorthm based on such an approach It provdes dynamc bandwdth allocaton and access control, but all processng s done at the OLT The results of the smulatons showed that n comparson to other algorthms, the proposed algorthm offers better performance n terms of average packet delay and throughput In ths paper we also ntroduced the dea of Grant Multplexng Ths mechansm allows the OLT to assgn the bandwdth to hgh prorty queues at the begnnng of the gatng cycle The experments showed that the values of jtter experenced by hgh prorty class were consderably lower when the GM scheme was used REFERENCES [1] S Blake, D Black, M Carlson, E Daves, Z Wang, and WWess, RFC An Archtecture for Dfferentated Servces, 1998, [2] GKramer, BMukherjee, and AMaslos, Ethernet Passsve Optcal Networks (EPON): a mssng lnk n an end-to-end optcal nternet, n Mul- Protocol Over WDM: Buldng the Next Generaton Internet, S Dxt, Ed John Wley & Sons, Inc, Mar 23, ch 8 [3] GKramer and BMukherjee, Ethernet PON: desgn and analyss of an optcal access network, Photonc Network Communcaton, vol 3, no 3, pp , July 21 [4] GKramer, BMukherjee, SDxt, YYe, and RHrth, On supportng dfferentated classes of servce n EPON-based access network, OSA Journal of Optcal Networkng, vol 1, no 8/9, pp , 22 [5] ChMAss, YYe, SDxt, and MAAl, Dynamc Bandwdth Allocaton for Qualty-of-Servce Over Ethernet PONs, IEEE Journal on Selected Areas n Communcatons, vol 21, no 9, pp , Nov 23 [6] Su-l Cho, Cyclc Pollng-Based Dynamc Bandwdth Allocaton for Dfferentated Classes of Servce n Ethernet Passve Optcal Networks, Photonc Network Communcatons, vol 7, no 1, pp 87 96, 24 [7] Yongqung Zhu, Maode Ma, and Tee Hang Cheng, A novel multple access scheme for Ethernet Passve Optcal Networks, n GLOBECOM 23 - IEEE Global Telecommuncatons Conference, vol 22, no 1, Dec 23, pp [8] IEEE 823ah - draft, 23 [9] W Leland, M Taqqu, W Wllnger, and D Wlson, On the Self-Smlar Nature of Ethernet Traffc (extended verson), IEEE/ACM Transactons on Networkng, vol 2, no 1, pp 1 15, Feb 1994
Dynamic 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 informationA Distributed Dynamic Bandwidth Allocation Algorithm in EPON
www.ccsenet.org/mas Modern Appled Scence Vol. 4, o. 7; July 2010 A Dstrbuted Dynamc Bandwdth Allocaton Algorthm n EPO Feng Cao, Demng Lu, Mnmng Zhang, Kang Yang & Ynbo Qan School of Optoelectronc Scence
More informationSimulation 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 informationPARNIAN: A TWO-STAGE NESTED-AUCTION FOR DYNAMIC BANDWIDTH ALLOCATION IN ETHERNET PASSIVE OPTICAL NETWORKS *
IJST, Transactons of Electrcal Engneerng, Vol. 35, No. E1, pp 45-61 Prnted n The Islamc Republc of Iran, 2011 Shraz Unversty PARNIAN: A TWO-STAGE NESTED-AUCTION FOR DYNAMIC BANDWIDTH ALLOCATION IN ETHERNET
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 informationEnhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark
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 informationTHE INCREASED demand for more bandwidth and bandwidth
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY 2007 277 Dynamc Wavelength and Bandwdth Allocaton n Hybrd TDM/WDM EPON Networks Ahmad R. Dhan, Chad M. Ass, Member, IEEE, Martn Maer, Member, IEEE,
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 informationReal-time interactive applications
Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
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 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 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 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 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 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 informationShortest Propagation Delay (SPD) First Scheduling for EPONs with Heterogeneous Propagation Delays
1 Shortest Propagaton Delay () Frst Schedulng for EPONs wth Heterogeneous Propagaton Delays Mchael P. McGarry, Martn Resslen, Frank Aurzada, and Mchael Scheutzow Abstract Due to the geographc dstrbuton
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 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 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 informationShortest Propagation Delay (SPD) First Scheduling for EPONs with Heterogeneous Propagation Delays
1 Shortest Propagaton Delay () Frst Schedulng for EPONs wth Heterogeneous Propagaton Delays Mchael P. McGarry, Martn Resslen, Frank Aurzada, and Mchael Scheutzow Abstract Due to the geographc dstrbuton
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 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 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 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 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 informationHIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM *
Copyrght Notce c 1999 IEEE. Personal use of ths materal s permtted. However, permsson to reprnt/republsh ths materal for advertsng or promotonal purposes or for creatng new collectve wors for resale or
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
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 informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
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 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 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 informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationQoS-aware energy-saving mechanism for hybrid optical-wireless broadband access networks
DOI.07/s117-017-0690-3 ORIGINAL PAPER QoS-aware energy-savng mechansm for hybrd optcal-wreless broadband access networks Ruyan Wang 1 Ale Lang 1 Chao Zhou 1 Dapeng Wu 1 Hong Zhang 1 Receved: 5 September
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 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 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 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 informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationA Sub-Critical Deficit Round-Robin Scheduler
A Sub-Crtcal Defct ound-obn Scheduler Anton Kos, Sašo Tomažč Unversty of Ljubljana, Faculty of Electrcal Engneerng, Ljubljana, Slovena E-mal: anton.kos@fe.un-lj.s Abstract - A scheduler s an essental element
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 informationWhy Congestion Control. Congestion Control and Active Queue Management. TCP Congestion Control Behavior. Generic TCP CC Behavior: Additive Increase
Congeston Control and Actve Queue Management Congeston Control, Effcency and Farness Analyss of TCP Congeston Control A smple TCP throughput formula RED and Actve Queue Management How RED works Flud model
More informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
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 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 informationDesign of the Application-Level Protocol for Synchronized Multimedia Sessions
Desgn of the Applcaton-Level Protocol for Synchronzed Multmeda Sessons Chun-Chuan Yang Multmeda and Communcatons Laboratory Department of Computer Scence and Informaton Engneerng Natonal Ch Nan Unversty,
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 informationAdaptive Network Resource Management in IEEE Wireless Random Access MAC
Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract
More informationA Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks
11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda
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 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 informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationAdvanced Computer Networks
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
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 informationVoice capacity of IEEE b WLANs
Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local
More informationHigh Performance DiffServ Mechanism for Routers and Switches: Packet Arrival Rate Based Queue Management for Class Based Scheduling
Hgh Performance DffServ Mechansm for Routers and Swtches: Packet Arrval Rate Based Queue Management for Class Based Schedulng Bartek Wydrowsk and Moshe Zukerman ARC Specal Research Centre for Ultra-Broadband
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 informationTowards Efficient Optical Burst-Switched Networks without All-Optical Wavelength Converters
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, 2720-093
More informationGateway Algorithm for Fair Bandwidth Sharing
Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca
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 informationSolution Brief: Creating a Secure Base in a Virtual World
Soluton Bref: Creatng a Secure Base n a Vrtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Abstract The adopton rate of Vrtual Machnes has exploded at most organzatons, drven by the mproved
More informationBuffer Management Algorithm Design and Implementation Based on Network Processors
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Buffer Management Algorthm Desgn and Implementaton Based on Network Processors Yechang Fang, Kang Yen Dept. of Electrcal and Computer
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 informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
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 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 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 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 informationRegional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism
ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 Regonal Load Balancng Crcutous Bandwdth Allocaton ethod Based on Dynamc Aucton echansm Wang Chao, Zhang Dalong, Ran Xaomn atonal Dgtal
More informationIEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS
ACCEPTED FROM O PEN C ALL IEEE 802.11E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS ess AIFS[j] AIFS[] PIFS SIFS AIFS[] Content 0 to CW Bac Slot Select s The emergng IEEE 802.11e
More informationOn the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources
On the Farness-Effcency Tradeoff for Packet Processng wth Multple Resources We Wang, Chen Feng, Baochun L, and Ben Lang Department of Electrcal and Computer Engneerng, Unversty of Toronto {wewang, cfeng,
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 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 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 informationSRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions
SRB: Shared Runnng Buffers n Proxy to Explot Memory Localty of Multple Streamng Meda Sessons Songqng Chen,BoShen, Yong Yan, Sujoy Basu, and Xaodong Zhang Department of Computer Scence Moble and Meda System
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 informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationAn Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network
Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh
More informationNetwork-Driven Layered Multicast with IPv6
Network-Drven Layered Multcast wth IPv6 Ho-pong Sze and Soung C. Lew Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Shatn, N.T., Hong Kong {hpsze8, soung}@e.cuhk.edu.hk Abstract.
More informationIntelligent Traffic Conditioners for Assured Forwarding Based Differentiated Services Networks 1
Intellgent Traffc Condtoners for Assured Forwardng Based Dfferentated Servces Networks B. Nandy, N. Seddgh, P. Peda, J. Ethrdge Nortel Networks, Ottawa, Canada Emal:{bnandy, nseddgh, ppeda, jethrdg}@nortelnetworks.com
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 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 informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
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 informationNETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK
NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton,
More informationEfficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks
Effcent QoS Provsonng at the MAC Layer n Heterogeneous Wreless Sensor Networks M.Soul a,, A.Bouabdallah a, A.E.Kamal b a UMR CNRS 7253 HeuDaSyC, Unversté de Technologe de Compègne, Compègne Cedex F-625,
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 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 informationCombined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks
Combned SINR Based Vertcal Handoff Algorthm for Next Generaton Heterogeneous Wreless Networks Kemeng Yang, Iqbal Gondal, Bn Qu and Laurence S. Dooley Faculty of Informaton Technology Monash Unversty Melbourne,
More informationImproved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment
JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School
More informationLecture 7 Real Time Task Scheduling. Forrest Brewer
Lecture 7 Real Tme Task Schedulng Forrest Brewer Real Tme ANSI defnes real tme as A Real tme process s a process whch delvers the results of processng n a gven tme span A data may requre processng at a
More informationSample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationShared Running Buffer Based Proxy Caching of Streaming Sessions
Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationQuality of service for voice over IP in networks with congestion avoidance
Ann. Telecommun. (2009) 64:225 237 DOI 0.007/s2243-008-0054- Qualty of servce for voce over IP n networks wth congeston avodance Vtalo A. Reguera Evelo M. G. Fernandez Felx A. Palza Walter Godoy Jr. Eduardo
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationTECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai
TECHNICAL REPORT AN OPTIMAL DISTRIUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION Jord Ros and We K Tsa Department of Electrcal and Computer Engneerng Unversty of Calforna, Irvne 1 AN OPTIMAL
More information