THE INCREASED demand for more bandwidth and bandwidth

Size: px
Start display at page:

Download "THE INCREASED demand for more bandwidth and bandwidth"

Transcription

1 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY Dynamc Wavelength and Bandwdth Allocaton n Hybrd TDM/WDM EPON Networks Ahmad R. Dhan, Chad M. Ass, Member, IEEE, Martn Maer, Member, IEEE, and Abdallah Sham, Member, IEEE Abstract We dscuss a wavelength-dvson-multplexed-based passve-optcal-network (PON) archtecture that allows for ncremental upgrade from sngle-channel tme-dvson multpleaccess PONs n order to provde hgher bandwdth n the access network. Varous dynamc-wavelength and bandwdth-allocaton algorthms (DWBAs) for wave-dvson multplexed PON are presented; they explot both nterchannel and ntrachannel statstcal multplexng n order to acheve better performance, especally when the load on varous channels s not symmetrc. Three varants of the DWBA are presented, and ther performance s compared. Whle the frst varant ncurs larger dle tmes (and, hence, poor performance), the other two algorthms acheve better but dfferent performance wth crtcal dssmlartes. Our analyss also focuses on the far assgnment of excessve bandwdth n the upstream drecton to hghly loaded optcal network unts. We compare the performance of DWBA to another algorthm that reles on statc-channel allocaton. Furthermore, a study s presented wheren the number of wavelengths ncreases, and a comparson wth nterleaved pollng wth adaptve cycle tme s shown. We use extensve smulatons throughout ths paper. Index Terms Dynamc-bandwdth allocaton (DBA), ethernet passve optcal network (EPON), smulaton and modelng, wavelength-dvson-multplexed (WDM)-passve optcal network (PON). I. INTRODUCTION THE INCREASED demand for more bandwdth and bandwdth servces [1] n the access network has been growng rapdly, and there have been great efforts to develop economcal subscrber networks based on optcal technology [2] [6]. Currently, the predomnant broadband-access solutons developed are the dgtal-subscrber-lne and cable-modem-based networks. Both of these technologes have lmtatons, because they are based on nfrastructure that was orgnally bult for carryng voce and analog TV sgnals, and ther retroftted versons to carry data are not optmal [2]. Passve optcal networks (PONs) and Ethernet PONs (EPONs) [4], [8] are vewed by many as an attractve and promsng soluton for the broadband-access-network bottleneck. EPON s a pont-tomultpont access network wth no actve element n the sgnal s Manuscrpt receved January 23, 2006; revsed September 12, A. R. Dhan and C. M. Ass are wth the Faculty of Engneerng and Computer Scence, Concorda Insttute for Informaton Systems Engneerng, Concorda Unversty, Montreal, QC H3G 1M8, Canada (e-mal: a_dhan@ cse.concorda.ca; ass@cse.concorda.ca). M. Maer s wth INRS Énerge, Matéraux et Télécommuncatons, Montreal, QC H5A 1K6, Canada (e-mal: Martn.Maer@emt.nrs.ca). A. Sham s wth the Department of Electrcal and Computer Engneerng, Unversty of Western Ontaro, London, ON N6A 5B9, Canada. Color versons of one or more of the fgures n ths paper are avalable onlne at Dgtal Object Identfer /JLT path from source to destnaton; the only nteror elements used n ths archtecture are passve components such as optcal spltters and optcal fbers. EPON has been standardzed by the IEEE 802.3ah workng group, and t comprses one optcallne termnal (OLT) and multple optcal-network unts (ONUs). Currently, EPON systems deploy two wavelengths: typcally 1310 nm for the upstream transmsson and 1550 nm for the downstream transmsson. In the downstream, Ethernet frames are broadcast by the OLT and are selectvely receved by each ONU. Alternatvely, n the upstream, multple ONUs share the same transmsson channel to s data and control packets to the OLT. Snce ONUs are unable to detect collson occurrng at the OLT, and due to the dffculty to mplement a carrersense multple access wth collson detecton, t s necessary to desgn a mechansm that arbtrates the access of ONUs to the shared medum. Ths s acheved by desgnng medumaccess-control (MAC) protocols to prevent collson between Ethernet frames of dfferent ONUs transmttng smultaneously. Current MAC supports tme-dvson multplexng (TDM), where each ONU s allocated a fxed or dynamc tme slot (transmsson wndow). Transmssons from dfferent ONUs to the OLT are arbtrated through the use of the multpont-control protocol (MPCP). Gven the steadly ncreasng number of users and emergng bandwdth ntensve applcatons, current sngle-channel TDM EPONs are lkely to be upgraded n order to satsfy the growng traffc demands n the future. One approach for upgradng EPON systems s to ncrease the current lne rate from 1 to 10 Gb/s [2]. However, ths mples that all EPON nodes need to be upgraded by nstallng new hgher speed transcevers, resultng n a rather costly upgrade. Another approach s to deploy multple wavelengths n the upstream/downstream drectons, resultng n a wavelength-dvson-multplexed (WDM)-based topology. WDM provdes a cautous upgrade, wheren wavelengths can be added as needed. Furthermore, only EPON nodes wth hgher traffc may be WDM upgraded by ether deployng fxed-tuned and/or tunable transcevers [7]. In ths paper, we ntroduce an archtecture for ncremental mgraton from TDM-PON to TDM/WDM-PON. Dynamcbandwdth-allocaton (DBA) algorthms ntally desgned for EPON requre approprate modfcatons to handle the multplechannel archtecture and to explot the nterwavelength statstcal multplexng. We present the new bandwdth-allocaton schemes for the hybrd WDM/TDM PON, and we show ther dfferences. These schemes enable dfferent ONUs to effcently share (both n tme and wavelength domans) the access-network bandwdth. In Secton II, we do an overvew /$ IEEE

2 278 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY 2007 of related lterature. Secton III presents the proposed archtecture, and n Secton IV, we present our bandwdth-allocaton schemes. Secton V presents a comparson between the proposed schemes. In Secton VI, we study numercally the performance of these schemes, and fnally, Secton VII concludes ths paper. II. RELATED WORK Varous early work has consdered the deployment of WDM technology n the access network, and some WDM-PON archtectures have been proposed, namely the composte PON, the local-access router network, the remote ntegraton of termnal network, the multstage AWG-based WDM-PON, and, more recently, the WDM-Super PON. See [2] for a lterature overvew of these technologes. One straghtforward approach to buld a hgh performance WDM-PON s to employ a separate wavelength channel from the OLT to each ONU for each of the upstream and downstream drectons [9]. Ths approach effectvely creates a pont-to-pont lnk between the central offce (CO) and each ONU; ths archtecture results, however, n a poor resource utlzaton and hgh deployment cost. The authors of [5] proposed a new hybrd archtecture (referred to as SUCCESS), whch provdes a practcal mgraton from current TDM PONs to future WDM access networks whle mantanng backward compatblty for users on exstng TDM PONs. The SUCCESS archtecture s based on a collector rng and several dstrbuton stars connectng the CO and the users. The authors proposed a partcular WDM-PON MAC protocol for ths archtecture but, however, dd not present any WDM-DBA algorthms. Furthermore, the archtecture does not allow for any nterchannel statstcal multplexng to better harness the avalable bandwdth on dfferent PONs. More recently, the authors of [6] proposed a SUCCESS-DWA PON that employs dynamcwavelength allocaton (DWA) to further provde bandwdth sharng across multple physcal PONs and, hence, acheve both cost-effectve and hgh-performance archtecture. The authors presented an upstream and downstream system upgrade; tunable lasers, arrayed-wavegude gratng, and coarse/fne flterng are combned to create a flexble access n the downstream. Alternatvely, several dstrbuted and centralzed-access schemes are proposed for the upstream upgrade. The authors of [3] have smlarly proposed a new WDM-PON, n whch each upstreamwavelength channel can be shared among multple ONUs by means of TDM. Here, the ONUs can use ther wavelengthselecton-free (.e., wthout wavelength tunng) transmtters to operate on any wavelength. No WDM-DBAs algorthms were dscussed, however. Wth respect to bandwdth and resource management, access control, and qualty of servce (QoS), some work only recently started to appear and remans very lmted. The authors of [7] have presented extensons to the MPCP protocol for WDM- PON, where wavelength channels, n addton to tme wndows, can be assgned; they presented both onlne and offlne schedulng. The authors of [10] proposed WDM IPACT-ST scheme, based on the nterleaved pollng wth adaptve cycle tme (IPACT) [12]. Here, IPACT protocol was adopted and appled on a multchannel WDM-PON, where the ONUs are equpped wth fxed transcevers. Furthermore, they appled strct prorty schedulng to support QoS n WDM-PON. A byte-sze clock (BSC) protocol [11] wth QoS support that allocates wavelengths on a user-bass rather than ONU-bass s proposed. The approach s scalable n bandwdth assgnment and acheves reducton n packet delays; however, n BSC, all nodes need to be synchronzed and, as a result, the TDM frame does not comply wth IEEE 802.3ah. III. WDM-PON ARCHITECTURE The protocols and algorthms for WDM-PON are currently at ther ntal stage of study, and whle varous types of archtectures have been proposed, no specfc one s domnant yet [2]. We assume two dfferent archtectures [14] for ths paper: The frst (scheme A 1 ) assumes a fxed groupng of ONUs [6, scheme A]. Here, the ONUs are dvded nto multple subsets, each allocated a fxed wavelength channel for upstream transmsson. Hence, every ONU mantans a fxed transcever, whereas the OLT mantans a bank of fxed transcevers. Wthn each subset, the transmsson of dfferent ONUs s arbtrated by the OLT through ether a fxed or dynamc tme-dvson slot-assgnment scheme. Clearly, ths archtecture lmts the shareablty of dfferent wavelengths among ONUs, snce a sngle wavelength s statcally allocated to each subset of ONUs, and hence, no nterchannel statstcal multplexng s possble. Ths archtecture can be vewed as a straghtforward upgrade from conventonal TDM-PON and provdes a baselne for comparson wth the proposed WDM-DBAs. The second archtecture (scheme A 2 ) s more flexble and allows for smultaneous tme-sharng and wavelength sharng [14]. Ths archtecture s smlar to scheme C presented n [6]. For upstream transmsson, every ONU can be equpped wth one or more fxed transmtters, allowng for an ncremental upgrade depng on the traffc demand at the ONU. In ths case, the ONU nforms, durng the regstraton process, the OLT of the wavelength(s) t can support for approprate resource allocaton and management. The OLT, upon recevng bandwdth requests, allocates transmsson wndows for the varous ONUs, takng nto account the wavelengths they support. Alternatvely, the ONU could optonally mantan a fast tunable laser to allow for more flexblty. To develop our dynamc-wavelength and bandwdth-allocaton (DWBA) algorthms, we assume n ths paper the latter approach and we assume a tunng speed n the range of mcroseconds. Ths archtecture enables the ONU to tune ts upstream transmsson from one wavelength to another at dfferent tmes depng on the DWBA algorthm deployed at the OLT. Here, the WDM-PON resources act as a pool, and all ONUs share these resources; resource sharng s arbtrated by the OLT usng DWBA. Ths scheme makes the mplementaton of the DWBA more challengng and requres an upgrade n the MAC. In our archtecture, we upgrade the MAC to support both tme and wavelength assgnment, where each ONU wll be allocated both a transmsson wndow and a wavelength. The OLT may have a bank of fxed transcevers to be able to smultaneously receve data from the varous ONUs on dfferent wavelengths and transmt data and control messages to the ONUs.

3 DHAINI et al.: DYNAMIC WAVELENGTH AND BANDWIDTH ALLOCATION IN HYBRID TDM/WDM EPON NETWORKS 279 IV. WDM/TDM DBA To develop our DWBAs, we assume MPCP extensons for WDM-PON, as proposed n [7]. The MPCP GATE message proposed n the standard s modfed by addng an addtonal feld (1 B) ndcatng the channel number assgned by the OLT to the ONU. Thus, the OLT wll provde each ONU wth ts approprate transmsson start tme T start, transmsson length T length, and correspondng wavelength-channel dentfer. A. Statc Wavelength Dynamc Tme (SWDT) Ths scheme reles on the smple archtecture A 1 ;theolt allocates wavelengths statcally among ONUs, and the upstream bandwdth s assgned dynamcally depng on the request of each ONU. Here, ONUs are dvded nto as many classes as the number of wavelengths, and each class wll share a predetermned wavelength. Snce the number of ONUs on each wavelength s dentfed, SWDT runs on each channel separately (the OLT wats untl all reports from one subset s receved and then runs the allocaton algorthm). Ths scheme s easy to mplement; however, t may under utlze the network bandwdth, snce t does not explot the nterchannel statstcal multplexng. Namely, when the load on one partcular channel s lght and hgh on another, the OLT cannot use the avalable bandwdth on that lghtly loaded channel and reassgn t to hghly loaded ONUs on another wavelength, whch therefore, could result n better performance. Note that ths scheme although does not allow for dynamc channel allocaton, t however allows for DBA [13] on one partcular wavelength. Hence, SWDT s used as a bass for our comparatve study. In order to motvate the need for dynamc channel allocaton, we frst consder a rather uncommon case, wheren the ONUs (hghly loaded and lghtly loaded) 1 are not symmetrcally dstrbuted on the channels. Ths scheme s referred to as SWDT-WC (WC for worst case). We also consder a more common case, where the ONUs are evenly dstrbuted on the channels (SWDT-BC, where BC means best case). Now, although ths case s lkely more common, t essentally s smlar to multple EPON networks, where each EPON runs a sngle DBA for optmal performance. It s worth notng that SWDT falls short n the case where the load on varous channels s not symmetrc or not evenly dstrbuted. B. Dynamc Wavelength Dynamc Tme (DWDT) Unlke the prevous approach where the channel s predetermned and fxed for every ONU and the OLT arbtrates only the transmsson of ONUs, the second approach reles on the second archtecture A 2 and enables the dynamc allocaton of bandwdth for dfferent ONUs n both wavelength and tme domans. Here, the OLT mantans a varable for every channel that desgnates the tme Tfree k for wavelength k when the next transmsson s possble on that partcular channel. For every 1 A hghly (lghtly) loaded ONU s one that requests bandwdth more (less) than the mnmum bandwdth guaranteed [B MIN, (2)] by the OLT n each cycle. REPORT message receved from any ONU, the OLT allocates a channel wth the least Tfree k to ths ONU; furthermore, t also determnes the length (e.g., n bytes) of the transmsson wndow allocated to ths ONU on the assgned channel. We refer to ths procedure as DWBA, and we present three varants namely DWBA-1, DWBA-2, and DWBA-3. In these varants, the mnmum bandwdth guaranteed B MIN defned n [8] s depent on the weght assgned to each ONU, based on the servce-level agreement (SLA) between the servce provder and users. We consder a PON access network wth N ONUs. The transmsson speed of the PON s R N (n Megabts per second). Let T cycle be the grantng cycle, whch s the tme durng whch all ONUs can transmt data or/and s REPORTs to the OLT. Let T g be the guard tme that separates the transmsson wndow for ONU n and ONU n+1 and w be the weght assgned to each ONU based on ts SLA such that N =1 w =1. Therefore, the mnmum bandwdth guaranteed per cycle the OLT can allocate for an ONU() s computed as follows: B MIN = (T cycle N T g ) R N K w 8 where K s the total number of wavelengths. In case of no SLA classfcaton per ONU, w = w =1/N,, and N =1 w =1; then B MIN (1) = B MIN = (T cycle N T g ) R N K. (2) 8 N 1) DWBA-1: The OLT wats untl all the REPORTs are receved from all ONUs (on all channels). Upon that, the OLT runs a bandwdth-allocaton algorthm to determne the bandwdth and channel for every ONU. Here, f Breq B MIN, where Breq s the requested bandwdth by ONU, and B MIN s the mnmum bandwdth guaranteed [4], [8], then Bassgn = Breq, and a GATE message s sent to ONU. Alternatvely, f Breq >B MIN, then the OLT computes the excessve bandwdth resultng from the lghtly loaded ONUs and assgns to ONU a bandwdth Bassgn, depng on the excess bandwdthallocaton type, and ss a GATE message accordngly. There are two ways to assgn transmsson wndows usng the excess bandwdth, namely controlled excess (CE) and uncontrolled excess (UE). In UE scheme, the OLT collects from the receved REPORTs all the excessve bandwdth avalable for the next cycle and assgns ths total excess unformly to all hghly loaded ONUs, regardless of ther requested bandwdth. The total excess bandwdth s Then B total excess = N (B MIN Breq) B req B MIN. (3) =1 B excess = B total excess/m (4) where M denotes the number of overloaded ONUs. The advantage of ths uncontrolled scheme s that hghly loaded ONUs are assgned enough bandwdth to satsfy ther hgh demands

4 280 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY 2007 Fg. 1. DWBA-2 protocol. (assumng the excess s enough); however, f some ONUs are only slghtly hghly loaded, they are beng assgned an unfar share of the excess bandwdth that could ultmately be not utlzed. Hence, the assgnment of the excess bandwdth must be controlled (.e., CE) by the OLT n order to guarantee a far bandwdth allocaton for all hghly loaded ONUs. A more controlled scheme may work as follows: B assgn Breq, = Breq, B MIN +Bexcess, f Breq B MIN f B MIN <Breq B MIN +Bexcess f B MIN <B MIN +B excess <B req where the assgnment of the excess bandwdth s controlled n the followng way. Let χ = {ONU } =0,...,M 1 be the set of hghly loaded ONUs. Then, B excess s computed as follows: B excess { B total = Breq B MIN, excess/(m ), (5) f B MIN + ( Bexcess/(M total ) ) <Breq otherwse (6a) where the total excess B total excess s updated as follows every tme B excess s assgned B excess total = B excess total B excess. (6b) However, the CE scheme allocates the excessve bandwdth n a round-robn fashon. Thus, some hghly loaded ONUs mght not have the chance to receve any share of ths bandwdth due to the fact that Btotal excess wll be 0 before vstng all ONUs, or n a very common case, these last ONUs mght get a less share than the frst ones. For that reason, we propose a far-excess (FE)-allocaton scheme that assgns portons to hghly loaded ONUs accordng to ther bandwdth demand. Let Breq excess, = Breq B MIN be the excess bandwdth requested from a hghly loaded ONU and Bexcess req = N =0 Bexcess, req be the total excess requested bandwdth from all ONUs; then B porton, excess = Bexcess, req B excess total Bexcess req (7a) where Bexcess porton, s the computed porton of excess bandwdth for each hghly loaded ONU. Hence, to prevent the waste of bandwdth, Bexcess s computed as follows: B excess = mn ( B excess, req,bexcess porton, ). (7b) As a result, FE wll ensure far excess bandwdth allocaton among all hghly loaded ONUs. Note that unlke CE, FE ensures a far bandwdth allocaton but mght not satsfy any hghly loaded ONU; on the other hand, CE makes sure to satsfy the demand of a hghly loaded ONU, f enough excess bandwdth s avalable, but not all ONUs, n case all the total excess bandwdth s fully exploted. Now, for the wavelength selecton crtera, as mentoned before, the OLT mantans, for every wavelength k, the tme t becomes avalable for next transmsson Tfree k,k =1,...,K, where K s the total number of wavelengths n the WDM PON. The channel wth smallest s selected for next transmsson. 2) DWBA-2 (see Fg. 1) : Here, upon recevng a REPORT from ONU, the OLT checks whether Breq B MIN ;nths case, the OLT assgns on the fly a GATE to that ONU wth Tfree k

5 DHAINI et al.: DYNAMIC WAVELENGTH AND BANDWIDTH ALLOCATION IN HYBRID TDM/WDM EPON NETWORKS 281 bandwdth Bassgn = B req. Otherwse, the OLT wats untl all the REPORTs from the other ONUs are receved and, then, assgns a bandwdth of Bassgn computed usng UE, CE, or FE. The dfference here s that ONUs that are lghtly loaded can be scheduled mmedately on the partcular channel wthout watng for the rest of the ONUs to s REPORTs. Ths early allocaton wll result n mproved delay performance. However, such a scheme may ncrease the complexty of the desgn and mplementaton of the DWBA due to the fact that the OLT wll have to keep track of each REPORT message receved from each ONU (e.g., sometmes one ONU can s two or more REPORTs before the OLT receves all the other REPORTs because of the grant-on-the-fly manner). Hence, the OLT wll have to store excess nformaton that holds the status of each ONU (hghly or lghtly loaded) to be able to assgn the approprate transmsson wndow. 3) DWBA-3: Here, the OLT wll always assgn on the fly, a GATE to the ONU regardless of ts requested bandwdth. However, the sze of the transmsson wndow s depent on the requested bandwdth. Upon recevng a REPORT from ONU, the OLT checks f Breq B MIN. In ths case, as n DWBA-2, the OLT wll assgn, on the fly, a GATE wth Bassgn = B req; otherwse, t wll assgn, on the fly, a GATE wth Bassgn = B MIN. Subsequently, the OLT wats untl t receves all the REPORTs from all ONUs and collects the nformaton about the excess bandwdth from each channel as well as the number of hghly loaded ONUs M. Each hghly loaded ONU s allocated ts share of the excess bandwdth n ether an uncontrolled manner [Bexcess as n (4)], n a controlled manner as n (6a), or n a far manner as n (7b). Note, here, the REPORT message s always transmtted once by the ONU n the frst assgned transmsson wndow (.e., not n the excess wndow) regardless of whether an excess bandwdth s assgned or not. Ths s because 1) the allocaton of the excess wndow cannot be guaranteed for a partcular ONU and 2) snce the OLT ss a GATE upon the recept of a REPORT (.e., on the fly), the ONU should not s a second REPORT (.e., n the excess wndow) n the same cycle. That s because the OLT may already have done the schedulng of other ONUs over the same channel, and ths second REPORT cannot vod the frst receved one. Ths scheme s consdered complex as well, snce the OLT wll have to use ts excess table and, at the same tme, wll have to keep track of the two to-be-sent (f applcable) GATE messages to each ONU. V. C OMPARISON AND ANALYSIS As mentoned earler, SWDT reles on a statc and predetermned allocaton of wavelengths to the ONUs and the OLT performs DBA on each channel. In the case where the load on dfferent wavelengths s not symmetrc (.e., some wavelength channels are more loaded than others), SWDT cannot explot the bandwdth avalable on one channel (.e., the lghtly loaded) to allocate t for ONUs resdng on another more congested channel. Ths results n under utlzng the avalable resources and, hence, n ncreased delays on the congested channel, and t s manly attrbuted to the lack of nterchannel statstcal multplexng. Note that when the load s evenly dstrbuted among the PON wavelengths, the problem reduces to performng effcent bandwdth allocaton on each ndvdual channel. Alternatvely, DWDT enables ONUs to share the network resources both n tme and wavelength domans. Frst, DWBA- 1 s straghtforward; the OLT allocates GRANT messages only after recevng all the REPORTs from all the ONUs (N) n the network. Evdently, ths smple algorthm has defcences; namely, consder a two-channel PON network, where t 1 and t 2 are the tmes where each of the channels s avalable (assume t 1 t 2 ) for transmssons. We can compute the perod durng whch channel 1 s not beng utlzed: T dle 1 =(t 2 t 1 )+ζ (8) where ζ = τ + T transmsson + T DWBA. Here, τ and T transmsson are the RTT and the transmsson tme of a GATE message from the OLT to the ONU. T DWBA s the computaton tme. Clearly, the upper bound of T1 dle corresponds to the maxmum of (t 2 t 1 ). Ths maxmum, n turn, corresponds to the case where the last ONU n ths cycle starts ts transmsson (on channel 2) at tme t start t 1. Accordngly, the upper bound of (t 2 t 1 ) s Tassgn N (the tme wndow n seconds assgned to the last ONU). Therefore T dle 1 T N assgn + ζ. (9) Moreover, f t 2 t 1 s large (e.g., when the majorty of ONUs on channel 1 are lghtly loaded and hghly loaded on channel 2), then the perod of tme where channel 1 s dle s much larger than that of (8). Overall, ths dle tme experenced by a channel results n poor bandwdth utlzaton and, thus, ncreased overall packet delays. DWBA-2 and DWBA-3 solve ths effcency problem by sng GATE messages on the fly to all ONUs requestng bandwdth less than the mnmum guaranteed (B MIN ).Ths on the fly bandwdth assgnment mtgates the effects of the channel dle tme experenced by DWBA-1 and results n a better throughput and delay performance. However, these two schemes exhbt dfferent behavors. Namely, under DWBA-2, the OLT defers ONUs wth B req >B MIN untl all REPORTs are receved, and then, t performs ts assgnment. DWBA-3 rather assgns on the fly all ONUs ncludng those wth B req >B MIN. In other words, the bandwdth allocated to a hghly loaded ONU n DWBA-2 s a sngle entty, whereas DWBA-3 segregates the excess from the mnmum bandwdth. Ths results n two transmsson wndows beng allocated at dfferent tmes to a hghly loaded ONU n the same cycle. The mmedate mplcaton of ths segregaton s that a large packet may not ft n the frst granted wndow and gets deferred to the second granted wndow (or perhaps to a subsequent cycle), blockng other packets and wastng a fracton of the allocated bandwdth. Ths mplcaton ncreases the packet delays by holdng unnecessarly these packets. On the other hand, n DWBA-2, every ONU s allocated only one transmsson wndow n the same cycle; ths wndow (combnng both B MIN and B excess ) s large enough and may thus mtgate the mpact of the

6 282 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY 2007 prevous problem. We demonstrate ths through an example. Frst, let BMIN Total be the total number of bytes of transmtted data n the wndow allocated for B MIN ;letbexcess Total be the total number of bytes of transmtted data n the wndow assgned for the excess bandwdth B excess.letbmin+excess Total be the total number of bytes of transmtted data n the wndow assgned for B MIN combned wth B excess. Let x be the remanng bandwdth from B MIN, y from B excess (when DWBA-3 s used), and z from B MIN+excess (when DWBA-2 s used). In DWBA-3, snce the allocated bandwdth n one cycle s splt nto two wndows (B MIN and B excess ), one packet P of large sze p may not ft n x and, hence, gets deferred to the next transmsson wndow. Ths wll effectvely prevent other packets from beng transmtted and result n neffcent use of the allocated bandwdth. A total bandwdth of (x + y) s, hence, not beng utlzed by the ONU under DWBA-3. On the other hand, n DWBA-2 combnng B MIN and B excess n one transmsson wndow, enables the transmsson of P and, hence, releases or unblocks the rest of the buffered packets. Ths ultmately allows the transmsson of larger number of packets; therefore, reduced packet delays and ncreased bandwdth effcency (wasted allocated bandwdth s only z, z x + y). Another mplcaton of allocatng two wndows n the same cycle for a hgh loaded ONU stems from the fact that the ONU reports ts buffer occupancy n the frst wndow of cycle n 1, and subsequently, after some tme, some already reported packets for the next cycle wll be transmtted durng the excess wndow. The OLT wll allocate bandwdth for cycle n based on the reported traffc from the prevous cycle. Ths wll result n grantng bandwdth more than needed snce the buffer occupancy has decreased. Let t 1,n 1 be the tme where the REPORT message s transmtted by the ONU n cycle n 1 and Q(t 1,n 1 ) be the buffer occupancy (n bytes) at tme t 1,n 1. Smlarly, let t 2,n 1 be the tme where the same ONU fnshes sng traffc n the excess wndow of cycle n 1 and Q(t 2,n 1 ) be the buffer occupancy (n bytes) at tme t 2,n 1. Here, the requested bandwdth for cycle n s Breq n = Q(t 1,n 1 ). Now, we can wrte ( ( B req n = Breq n Q t 1,n 1 ) ( Q t 2,n 1 )) (10) where B req n s the amed value of Breq n before the OLT performs DBA n cycle n, and Q(t 1,n 1 ) Q(t 2,n 1 ) s the sze of the excess wndow of cycle n 1, whch s known by the OLT. Hence, the OLT wll allocate more bandwdth than the ONU requres at the tme t 2,n 1. Ths wll result n ncreasng the cycle tme and, hence, neffcent use of the allocated bandwdth. To overcome ths defcency, we propose a modfed verson of DWBA-3 (DWBA-3a) that elmnates the effect of the outdated nformaton at the OLTs. Here, the OLT keeps track of the allocated excess bandwdth Bexcess,n 1 n cycle n 1 and, then, extracts ths excess out of the allocated bandwdth n cycle n. Consequently, the allocated bandwdth, n cycle n, B,n alloc s computed as follows: B,n alloc = Bn req B,n 1 excess. (11) Fg. 2. Average packet delay comparson (K =2). VI. PERFORMANCE EVALUATION In ths secton, we study the performance of the dfferent wavelength and bandwdth-allocaton algorthms we presented. We developed a WDM-PON event drven smulator n C++. The followng are some parameters used n our smulaton: number of ONUs N =64; number of wavelengths K =(2, 4, 6, 8); maxmum cycle tme =2ms; speed of each wavelength s 1 Gb/s; guard tme =1 µs; dstance between OLT and ONU s 20 km; dstance between ONU and -users s 5 km; and bufferng queue sze s 1 MB. Out of the 64 ONUs, 32 ONUS are lghtly loaded, whereas the remanng ONUs are hghly loaded. A lghtly loaded ONU generates traffc at a rate of 10 Mb/s(load =0.1). We consder bursty traffc; to model ts bursty nature, we generated self-smlar traffc based on a Pareto dstrbuton wth a hurst parameter H =0.8, and packet szes are unformly dstrbuted between 64 and 1518 B. Fg. 2 presents the network average delay for the varous allocaton algorthms presented earler when K =2, all under the UE scheme. The traffc load of a hgh loaded ONU s vared between 0.1 and 1 (.e., 10 and 100 Mb/s). The results frst show clearly that when the traffc load s not symmetrc and evenly dstrbuted on the varous channels, SWDT shows the worst performance (.e., SWDT-WC), especally at medum and hgher loads. Ths s due to the lack of nterchannel statstcal multplexng, wheren the OLT could allocate avalable resources on one channel and ONUs on another channel, snce the channels n SWDT are already preallocated and the allocaton s fxed. Alternatvely, when the load s more evenly dstrbuted (.e., lghtly and hghly loaded ONUs are unformly dstrbuted on the channels), SWDT (SWDT-BC here) exhbts a good performance, n comparson wth the other schemes, especally DWBA-1. Ths shows that under such crcumstance, there s no need for dynamc channel allocaton, and hence, only DBA on each channel s requred. However, as the load becomes less symmetrc, dynamc channel allocaton becomes essental (as shown n the other extreme, SWDT-WC) n order to explot all the avalable network resources. It s worth notng that SWDT-WC and SWDT-BC at very lght load (e.g., 0.1) perform alke snce both channels have smlar lght loads. Note also

7 DHAINI et al.: DYNAMIC WAVELENGTH AND BANDWIDTH ALLOCATION IN HYBRID TDM/WDM EPON NETWORKS 283 Fg. 3. Delay measurements wth CE and FE (K =2). Fg. 4. Delay measurements wth K =4, 6, and 8. that SWDT performs smlar to DWBA-1 at lght load, whle DWBA-2 and DWBA-3 slghtly outperform the other schemes because they both allocate bandwdth on the fly for lghtly loaded ONUs (.e., almost all ONUs are at lght load), whereas the other schemes wat untl all REPORT messages are receved (e.g., SWDT wats untl REPORT from ONUs on each channel are receved and DWBA-1 wats untl REPORTs from all ONUs are receved). As the load gets hgher, DWBA-1 performs better than SWDT-WC because the former allows for sharng the resources on all channels and slghtly underperforms SWDT- BC. Moreover, as the load gets hgher, the DWBA-2 and DWBA-3 schemes outperform both SWDT algorthms; frst, they outperform SWDT-WC, snce the latter lacks the resource sharng property due to the statc-channel allocaton. They also outperform SWDT-BC, although the load s symmetrc under SWDT-BC, for two reasons: 1) DWBA-2 and DWBA-3 allocate lghtly loaded ONUs on the fly, and 2) although the load s evenly dstrbuted among the channels, we have seen n some nstances that a channel could have some free resources that could be mmedately exploted by DWBA to allocate for ONUs on another channel. Ths s manly due to the bursty nature of traffc used n our smulatons. Fg. 2 also shows that at a load of 0.3, the average packet delay under DWBA-2 (DWBA-3) s ms (15.66 ms) better than that under DWBA-1. Furthermore, our smulaton results show a better performance of DWBA-2 over DWBA-3. The man reason s due to the fact that n DWBA-3, the OLT allocates the excess bandwdth to a hgh loaded ONU n a separate wndow n the same cycle. Ths results n under-utlzng the allocated bandwdth. The average packet delay of DWBA-2 s slghtly better than that of DWBA-3; for example, at load =0.4, a dfference of 12.8 ms s shown. Note, when the assgnment of the excess s controlled by the OLT (as dscussed n Secton IV), better results are obtaned n terms of overall average packet delays; however, the relatve dfference between the dfferent algorthms s the same. Fg. 3 shows the delay performance of DWBA-2 and DWBA-3 usng both CE and FE allocaton schemes and presents a comparson wth IPACT-ST [10] when K =2. Clearly, DWBA-2 and DWBA-3 exhbt better per- formance than IPACT-ST. For example, at load =0.4, there s 16-ms mprovement of DWBA-2 (CE) over IPACT-ST. Here, although IPACT-ST assgns bandwdth for every ONU on the fly as soon as t receves ts REPORT, t does not beneft from the excess bandwdth, whch may be avalable n the network to assgn t for hghly loaded ONUs (as n DWBA schemes). Hence, the avalable excess bandwdth n each transmsson cycle s effcently utlzed under DWBA, and as a result, the overall network performance s amelorated. Moreover, FE mproves the performance of DWBA-3 over CE, whle t shows a smlar performance for DWBA-2 usng the CE allocaton. Ths s due to the fact that FE farly allocates the excess bandwdth among hghly loaded ONUs, n contrast to CE, that concentrates on satsfyng hghly loaded ONUs untl the avalable bandwdth s fully consumed. Next, we study and compare the performance of DWBA-2 and IPACT-ST when the number of wavelengths K =4, 6, and 8 (Fg. 4). It s mportant to frst note that ncreasng the number of wavelengths whle usng the same number of ONUs (64 s the lmt) 2 yelds fewer ONUs on the same wavelength channel, and accordngly, the mnmum bandwdth guaranteed [B MIN, (2)] ncreases. Ths has clear mplcatons on the performance of DWBA. Recall that DWBA assgns on the fly, lke IPACT-ST, those ONUs requestng bandwdth less than B MIN and, unlke IPACT-ST, defers the allocaton for ONUs requestng more. Now, as B MIN becomes larger, when an ONU becomes hghly loaded, t would be stll requestng ether less than B MIN or slghtly more than B MIN (the most loaded ONU ss at 100-Mb/s rate). If the ONU requests less than B MIN, t wll then be allocated bandwdth on the fly, just lke IPACT-ST does. Therefore, IPACT-ST and DWBA-2 show smlar performance, as s clearly shown n Fg. 4 for loads varyng between 0.1 and 0.7. However, as the load ncreases further, nterestngly, IPACT-ST outperforms DWBA-2. Ths s manly due to those ONUs requestng more than B MIN, as t s the only dfference wth IPACT-ST. When B MIN s large, as we have mentoned earler, a hghly loaded ONU may only request a bandwdth 2 Ths s determned by the physcal lmtatons of the optcal spltter.

8 284 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY 2007 that s slghtly hgher than B MIN. In such a case, the ONU wll be deferred untl all REPORT messages arrve n order to receve only a small excess bandwdth (ths s not because there s no excess bandwdth avalable, but because the ONU needs only lttle excess). In such a case, there s no clear payoff for a hghly loaded ONU to wat untl all REPORT messages to arrve n order to only receve a small excess bandwdth. IPACT- ST, unlke DWBA-2, allocates bandwdth to all ONUs on the fly. Ths dfference leads IPACT-ST to outperform DWBA-2 at very hgh loads. Now, as the number of wavelengths ncreases further (e.g., 6 and 8), each wavelength wll support fewer ONUs, and the mnmum bandwdth guaranteed gets further larger. Under such a crcumstance, regardless of the load at each ONU (wth an excepton f the load s allowed to go beyond 100 Mb/s), all or most ONUs wll be granted on the fly, smlar to IPACT-ST, and all channels wll be less loaded. For example, when the number of wavelengths s sx (.e., 6 Gb/s of bandwdth avalable), the total hghest load generated n the network s Mb/s Mb/s = Gb/s, whch s much smaller than the total bandwdth avalable. Ths clearly shows that all wavelengths are not fully utlzed, and hence, smaller delays (Fg. 4) are experenced under DWBA-2 and IAPCT-ST. Furthermore, the performance of both DWBA-2 and IPACT-ST become smlar; as K gets larger, the average packet delays reman almost fxed at varous loads. The average delay equals to almost 0.4 ms, whch accounts for the cumulatve guard tmes, the round-trp propagaton delays, as well as the packet-queung delays. Although the average packet delay s small and smlar at varous wavelengths, we note that the maxmum packet delays have exhbted some dfferences. That s, as the number of wavelengths ncreases, the maxmum packet delay slghtly decreases [e.g., a dfference of 2 ms between DWBA-2 (K =6) and DWBA-2 (K =8)]. Fnally, we should note that ncreasng the number of wavelengths beyond the overall hghest load the ONUs can s to the network may not be wse from a desgn and operaton perspectve. We now study the dssmlartes between DWBA-2 and DWBA-3 schemes. Recall that the man dfference between DWBA-2 and DWBA-3 s the effcent use of the total allocated bandwdth for hgh loaded ONUs. Clearly, f the allocated bandwdth s not fully utlzed (as n DWBA-3), the buffer occupancy of the hgh loaded ONU wll ncrease substantally, and therefore, more bandwdth wll be requested for the subsequent cycle(s). Snce n our expermental setup, about half of the ONUs are hghly loaded, more hgh bandwdth requests wll arrve at the OLT and each ONU wll be rewarded excess from whatever s avalable. Ths neffcency of utlzng the allocated bandwdth may occur more often, and thus, may accumulate throughout the duraton of the burst and after. Alternatvely, under DWBA-2, the behavor s conversed. Namely, the allocated bandwdth s used more effcently, and hence, fewer ONUs wll be requestng addtonal bandwdth. To valdate our reasonng, we measure the probablty densty functon (pdf) of the number of ONUs wth B req B mn for both algorthms and under the two allocaton schemes of excess bandwdth (UE and CE) and when K =2. Clearly, as Fg. 5 shows, more ONUs wll be requestng bandwdth more than B mn under DWBA-3 (both under UE and CE). However, under DWBA-2, fewer ONUs Fg. 5. PDF of number of ONUs (wth B req >B MIN )(K =2). are always requestng more than B mn. Ths clearly ndcates that 1) the neffcent use of allocated bandwdth and 2) the msguded allocaton of bandwdth n DWBA-3 both result n ncreased queung of ONUs traffc (hgher occupancy), and hence, more ONUs are requestng bandwdth larger than the mnmum guaranteed from the OLT. To further compare the performance of the two algorthms wth respect to ther effcent use of the allocated bandwdth, we measure the number of bytes wasted n each cycle for a hghly loaded ONU under CE scheme: B wasted = B alloc B sent, where B alloc and B sent are the amount of bandwdth allocated to the ONU and effectvely used by the ONU, respectvely. Fg. 6 shows the results of ths experment, where we plot B wasted collected n each cycle throughout the smulaton at a partcular hgh loaded ONU. Clearly, the fgure shows that, under DWBA-2, there exsts no cycle where B wasted 1518 B (maxmum packet sze). By concluson, DWBA-2 wll defer at most one packet from one transmsson cycle to the followng one; however, there s an excessve waste of allocated bandwdth under DWBA-3. Ths s largely due to the over-allocaton of unnecessary bandwdth by the OLT. Overall, ths allocaton results n ncreased average cycle tmes, neffcent bandwdth utlzaton, and therefore, ncreased overall packet delays. We mtgate ths problem by proposng a modfed verson of DWBA-3, namely DWBA-3a (see Secton V). We have seen (results are skpped) that DWBA- 3a sgnfcantly decreases the waste of bandwdth found n DWBA-3 and shows a smlar behavor to the one observed usng DWBA-2 (.e., B wasted 1518 B). Fnally, to compare the farness of both CE and FE allocaton schemes, we run our smulaton at load =0.5, and we measure the performance of two partcular hghly loaded ONUs. We choose the frst ONU as the frst hghly loaded ONU (namely ONU 1 ) among the 64, snce t s expected to be always satsfed when applyng the CE scheme (see Secton IV), whle the second ONU (namely ONU 2 ) s chosen to be the last one among the 64. As expected and observed, the average packet delay for ONU 1 wth FE s equal to s, and for ONU 2, t s equal to s. Whle wth CE, t s s for ONU 1 and s for ONU 2. Ths shows the advantage of FE that farly allocates the excess bandwdth and, thus, provde

9 DHAINI et al.: DYNAMIC WAVELENGTH AND BANDWIDTH ALLOCATION IN HYBRID TDM/WDM EPON NETWORKS 285 Fg. 6. Wasted bandwdth comparson. almost the same performance for all hghly loaded ONUs, whereas CE satsfes one hghly loaded ONU over the other and manly deps on the avalablty of the remanng excess bandwdth. VII. CONCLUSION We proposed a WDM-PON archtecture whch allows for hgh bandwdth utlzaton among multple wavelengths. We presented new bandwdth-allocaton schemes and provded a thorough comparson between them and studed ther advantages and dsadvantages. We showed that statc-wavelength allocaton may penalze ONUs wth hgh load and wll underutlze the PON resources, especally f the load s not symmetrc. We showed that DWA ncreases the network effcency. We presented three ways to effcently allocate excess bandwdth among hghly loaded ONUs, namely controlled, far, and uncontrolled. We showed that by usng CE bandwdth allocaton, we ncrease the bandwdth utlzaton, and as a result, we mprove the overall network performance. We also studed the performance of our schemes and compared wth IPACT-ST as the number of wavelengths n the network ncreases. [7] M. P. McGarry, M. Maer, and M. Resslen, WDM ethernet passve optcal networks (EPONs), IEEE Commun. Mag., vol. 44, no. 2, pp , Feb [8] C. M. Ass, Y. Ye, S. Dxt, and M. A. Al, Dynamc bandwdth allocaton for Qualty-of-Servce over Ethernet PONs, IEEE J. Sel. AreasCommun., vol. 21, no. 9, pp , Nov [9] J.-I.Kan,M.Teshma,K.Akmoto,N.Takacho,H.Suzuk,K.Iwatsuk, and M. Ish, A WDM-based optcal access network for wde-area ggabt access servces, IEEE Commun. Mag., vol. 41, no. 2, pp. S43 S48, Feb [10] K. H. Kwong, D. Harle, and I. Andonovc, Dynamc bandwdth allocaton algorthm for dfferentated servces over WDM EPONs, n Proc., IEEE ICCS, Sngapore, Sep. 2004, pp [11] C. Xao, B. Bng, and G. K. Chang, An effcent reservaton MAC protocol wth preallocaton for hgh-speed WDM passve optcal networks, n Proc., IEEE INFOCOM, Mam, FL, Mar. 2005, pp [12] G. Kramer, B. Mukherjee, and G. Pesavento, IPACT: A dynamc protocol for an ethernet PON (EPON), IEEE Commun. Mag., vol. 40, no. 2, pp , Feb [13] M. P. McGarry, M. Maer, and M. Resslen, Ethernet PONs: A survey of dynamc bandwdth allocaton (DBA) algorthms, IEEE Commun. Mag., vol. 42, no. 8, pp. S8 S15, Aug [14] A. Dhan, Desgn and analyss of next generaton ethernet-based passve optcal access networks, M.S. thess, Concorda Unv., Montreal, QC, Canada, REFERENCES [1] H. Shnohara, Broadband access n Japan: Rapdly growng FTTH market, IEEE Commun. Mag., vol. 43, no. 9, pp , Sep [2] A. Banerjee, Y. Park, F. Clarke, H. Song, S. Yang, G. Kramer, K. Km, and B. Mukherjee, Wavelength-dvson-multplexed passve optcal network (WDM-PON) technologes for broadband access: A revew, OSA J. Opt. Netw., vol. 4, no. 11, pp , Nov [3] D. J. Shn, D. K. Jung, H. S. Shn, J. W. Kwon, S. Hwang, Y. Oh, and C. Shm, Hybrd WDM/TDM-PON wth wavelength- selecton-free transmtters, J. Lghtw. Technol., vol. 23, no. 1, pp , Jan [4] G. Kramer, B. Mukherjee, and G. Pesavento, Ethernet PON (epon): Desgn and analyss of an optcal access network, Photon. Netw. Commun., vol. 3, no. 3, pp , Jul [5] F. An, K. S. Km, D. Guterrez, S. Yam, E. Hu, K. Shrkhande, and L. G. Kazovsky, SUCCESS: A next-generaton hybrd WDM/TDM optcal access network archtecture, J. Lghtw. Technol., vol. 22, no. 11, pp , Nov [6] Y.-L. Hsueh, M. S. Rogge, S. Yamamoto, and L. G. Kazovsky, A hghly flexble and effcent passve optcal network employng dynamc wavelength allocaton, J. Lghtw. Technol., vol. 23, no. 1, pp , Jan Ahmad R. Dhan receved the B.S. degree n computer scence from the Amercan Unversty of Berut, Berut, Lebanon, n 2004 and the M.S. degree n electrcal and computer engneerng wth a best thess award nomnaton from Concorda Unversty, Montreal, QC, Canada, where he s currently workng toward hs Ph.D. degree. He s wth the Faculty of Engneerng and Computer Scence, Concorda Insttute for Informaton Systems Engneerng, Concorda Unversty. Hs current research nterests are n the areas of wred/wreless-access networks, qualty-of-servce, and schedulng algorthms. More specfcally, he s currently workng n the areas of passve optcal networks.

10 286 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 25, NO. 1, JANUARY 2007 Chad M. Ass (M 03) receved the B.S. degree n engneerng from the Lebanese Unversty, Berut, Lebanon, n 1997 and the Ph.D. degree from the Graduate Center, Cty Unversty of New York, NY, n Aprl He was a Vstng Researcher at Noka Research Center, Boston, MA, from September 2002 to August 2003, workng on qualty-of-servce n optcal-access networks. He joned the Concorda Insttute for Informaton Systems Engneerng, Concorda Unversty, Montreal, QC, Canada, n August 2003, as an Assstant Professor. Hs current research nterests are n the areas of provsonng and restoraton of optcal networks, wreless and ad hoc networks, and securty. Dr. Ass s a recpent of the Mna Rees Dssertaton Award from the Cty Unversty of New York n August 2002 for hs research on wavelengthdvson-multplexng optcal networks. Abdallah Sham (S 01 M 02) receved the B.E. degree n electrcal and computer engneerng from the Lebanese Unversty, Berut, Lebanon, and the Ph.D. degree n electrcal engneerng from the Graduate School and Unversty Center, Cty Unversty of New York, NY, n 1997 and September In September 2002, he joned the Department of Electrcal Engneerng, Lakehead Unversty, Thunder Bay, ON, Canada, as an Assstant Professor. Snce July 2004, he has been wth the Unversty of Western Ontaro, London, ON, where he s currently an Assstant Professor n the Department of Electrcal and Computer Engneerng. Hs current research nterests are n the area of data/optcal networkng, EPON, WIMAX, WLANs, and software tools. Dr. Sham s a recpent of the Irvng Hochberg Dssertaton Fellowshp Award from the Cty Unversty of New York and a GTF Teachng Fellowshp. Martn Maer (M 04) receved the Dpl.-Ing. and Dr.-Ing. degrees (both wth dstnctons) n electrcal engneerng from the Techncal Unversty Berln, Berln, Germany, n 1998 and 2003, respectvely. He s currently an Assocate Professor wth the Insttut Natonal de la Recherche Scentfque, Montreal, QC, Canada. He was a Vstng Researcher at the Unversty of Southern Calforna, Los Angeles, and Arzona State Unversty, Tempe. In summer 2003, he was a Postdoc Fellow at the Masschusetts Insttute of Technology, Cambrdge. Hs research nterests nclude network and node archtectures, routng and swtchng paradgms, protecton, restoraton, multcastng, and the desgn, performance evaluaton, and optmzaton of MAC protocols for optcal wavelength-dvson-multplexng (WDM) networks, automatcally swtched optcal networks (ASONs), and generalzed multprotocol label swtchng (GMPLS), wth partcular focus on metro and access networks. Recently, hs research nterests have concentrated on evolutonary WDM upgrades of optcal metro-rng networks and access networks. He s the author of the book Metropoltan Area WDM Networks An AWG Based Approach (Sprnger, 2003). Dr. Maer s a recpent of the two-year Deutsche Telekom doctoral scholarshp from June 1999 to May He s also a corecpent of the Best Paper Award presented at The Internatonal Socety of Optcal Engneers Photoncs East 2000-Terabt Optcal Networkng Conference. He served on the Techncal Program Commttees of IEEE INFOCOM, IEEE GLOBECOM, and IEEE IPCCC. He s an Edtoral Board Member of the IEEE Communcatons Surveys and Tutorals.

Dynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks

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 information

Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks

Bandwidth 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 information

A Distributed Dynamic Bandwidth Allocation Algorithm in EPON

A 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 information

Simulation Based Analysis of FAST TCP using OMNET++

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 information

Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks

Enhanced 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 information

Efficient Distributed File System (EDFS)

Efficient 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 information

Fibre-Optic AWG-based Real-Time Networks

Fibre-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 information

A Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI

A 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 information

Wishing you all a Total Quality New Year!

Wishing 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 information

PARNIAN: A TWO-STAGE NESTED-AUCTION FOR DYNAMIC BANDWIDTH ALLOCATION IN ETHERNET PASSIVE OPTICAL NETWORKS *

PARNIAN: 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 information

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks

Priority-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 information

Internet Traffic Managers

Internet 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Shortest Propagation Delay (SPD) First Scheduling for EPONs with Heterogeneous Propagation Delays

Shortest 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 information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

Shortest Propagation Delay (SPD) First Scheduling for EPONs with Heterogeneous Propagation Delays

Shortest 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 information

Video Proxy System for a Large-scale VOD System (DINA)

Video 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 information

Routing in Degree-constrained FSO Mesh Networks

Routing 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 information

WIRELESS communication technology has gained widespread

WIRELESS communication technology has gained widespread 616 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 6, NOVEMBER/DECEMBER 2005 Dstrbuted Far Schedulng n a Wreless LAN Ntn Vadya, Senor Member, IEEE, Anurag Dugar, Seema Gupta, and Paramvr Bahl, Senor

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

HIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM *

HIERARCHICAL 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 information

CS 268: Lecture 8 Router Support for Congestion Control

CS 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 information

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication

Dynamic 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 information

A fair buffer allocation scheme

A 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 information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. 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 information

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

A 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 information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING 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 information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-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 information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The 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 information

A Fair MAC Algorithm with Dynamic Priority for e WLANs

A 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 information

EFT: a high throughput routing metric for IEEE s wireless mesh networks

EFT: 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

Scheduling and queue management. DigiComm II

Scheduling 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 information

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems

Fast 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 information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A 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 information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 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 information

IEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS

IEEE 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 information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual 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 information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

Channel 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 information

AADL : about scheduling analysis

AADL : 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 information

Cluster Analysis of Electrical Behavior

Cluster 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 information

Parallel matrix-vector multiplication

Parallel 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 information

USER CLASS BASED QoS DIFFERENTIATION IN e WLAN

USER 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 information

Aggregated traffic flow weight controlled hierarchical MAC protocol for wireless sensor networks

Aggregated traffic flow weight controlled hierarchical MAC protocol for wireless sensor networks Ann. Telecommun. (29) 64:75 721 DOI.7/s12243-9-95- Aggregated traffc flow weght controlled herarchcal MAC protocol for wreless sensor networks M. Abdur Razzaque M. Mamun-Or-Rashd Muhammad Mahbub Alam Choong

More information

WITH rapid improvements of wireless technologies,

WITH 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 information

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks

A 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 information

Gateway Algorithm for Fair Bandwidth Sharing

Gateway 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 information

with `ook-ahead for Broadcast WDM Networks TR May 14, 1996 Abstract

with `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 information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation 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 information

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

Pricing 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 information

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Delay 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 information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE 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 information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More information

Efficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks

Efficient 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 information

THere are increasing interests and use of mobile ad hoc

THere 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 information

Integrated Congestion-Control Mechanism in Optical Burst Switching Networks

Integrated 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 information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Channel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks

Channel-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 information

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December-2013 ISSN

International 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 information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

QoS-aware energy-saving mechanism for hybrid optical-wireless broadband access networks

QoS-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 information

Load-Balanced Anycast Routing

Load-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 information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Session 5.3. Switching/Routing and Transmission planning

Session 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 information

A Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks

A Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,

More information

A Frame Packing Mechanism Using PDO Communication Service within CANopen

A 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 information

Technical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks

Technical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks www.hurray.sep.pp.pt Techncal Report -GAME: An Implct GTS Allocaton Mechansm n IEEE 802.15.4 for Tme- Senstve Wreless Sensor etworks Ans Koubaa Máro Alves Eduardo Tovar TR-060706 Verson: 1.0 Date: Jul

More information

A Sub-Critical Deficit Round-Robin Scheduler

A 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser

More information

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment

Improved 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 information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual 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 information

The Codesign Challenge

The 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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Network Coding as a Dynamical System

Network 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 information

Evaluation of TCP Variants and Bandwidth on Demand over Next Generation Satellite Network

Evaluation of TCP Variants and Bandwidth on Demand over Next Generation Satellite Network Evaluaton of TCP Varants and Bandwdth on Demand over Next Generaton Satellte Network Songrth Kttperachol, Zhl Sun and Hatham Cruckshank Centre for Communcaton Systems Research Unversty of Surrey Guldford,

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

DEAR: 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 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 information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Avoiding congestion through dynamic load control

Avoiding 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 information

Solution Brief: Creating a Secure Base in a Virtual World

Solution 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 information

Design and implementation of priority and timewindow based traffic scheduling and routingspectrum allocation mechanism in elastic optical networks

Design 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 information

IR-HARQ vs. Joint Channel-Network coding for Cooperative Wireless Communication

IR-HARQ vs. Joint Channel-Network coding for Cooperative Wireless Communication Cyber Journals: ultdscplnary Journals n Scence and Technology, Journal of Selected Areas n Telecommuncatons (JSAT), August Edton, 2 IR-HARQ vs. Jont Channel-Network codng for Cooperatve Wreless Communcaton

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Buffer Management Algorithm Design and Implementation Based on Network Processors

Buffer 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 information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Efficient Content Distribution in Wireless P2P Networks

Efficient 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 information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

THE IEEE standard for wireless local area networks

THE IEEE standard for wireless local area networks IEEE RANSACIONS ON VEHICULAR ECHNOLOGY, VOL. 58, NO. 2, FEBRUARY 2009 855 Determnstc Prorty Channel Access Scheme for QoS Support n IEEE 802.11e Wreless LANs Sunmyeng Km, Rongsheng Huang, Student Member,

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Goals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture

Goals 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 information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information