Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
|
|
- Sophia Perkins
- 5 years ago
- Views:
Transcription
1 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 {yya, haoyu, hewe, ladt}@fotonk.dtu.dk Abstract The hybrd optcal wreless (HOW) network has been vewed as a promsng soluton to meet the ncreasng user bandwdth and moblty demands. Due to the basc dfferences n the optcal and wreless technologes, a challengng problem les n the Meda Access Control (MAC) protocol desgn so that t can support strngent Qualty of Servce (QoS) requrements. In ths paper, we descrbe and evaluate a resource management framework desgned for the HOW networks. There are two parts n the resource management framework The frst part s the Enhanced MPCP (E-MPCP) scheme amng at mprovng sgnalng ablty between the optcal and wreless networks. The second part s an Integrated Optcal Wreless Admsson Control (IOW-AC) scheme amng at provdng the ntegrated bandwdth allocaton n the HOW networks. Our results show that the performances of the system n terms of throughput, delay and packet droppng probablty depend on several factors. These factors nclude the frame duraton, the traffc load and the total number of shared users. The results also hghlght that our proposed system acheves sgnfcant mprovements over the tradtonal approach n terms of user QoS guarantee and network resource utlzaton. Keywords- call admsson control, MPCP, resource allocaton, the hybrd optcal wreless network I. INTRODUCTION Recent years have wtnessed the explosve growth of the multmeda applcatons, whch are characterzed wth hgh speed and strngent QoS requrements. An ntegraton of optcal and wreless technologes has been vewed as a vable soluton to delvery the quadruple play servces (data, voce, vdeo and moblty). In the HOW networks, complementary characterstcs of the optcal network and wreless network are combned. In optcal access network, such as Ethernet Passve Optcal Network (EPON), has been deployed to satsfy bandwdth demands for broadband servces, but t has a fxed archtecture and lmted coverage. Among varous avalable wreless technologes, the recent Worldwde Interoperablty for Mcrowave Access (WMAX) technology has promsed ubqutous and hgh data rate connectons for both fxed and moble communcaton. A hybrd EPON and WMAX network s an example of the HOW network, whch s a convergence of an EPON deployed as a backhaul and multple WMAX networks connected as the front-end networks. Snce the optcaland wreless-access technologes are orgnally desgned to address dfferent ssues and deployed n dfferent scenaros, any smple combnaton of them cannot derve optmal network performances. One major challenge n the HOW network s how to desgn a heterogeneous resource management framework, whch can be exploted to maxmze the overall resource utlzaton and optmze QoS performances n both the optcal doman and the wreless doman smultaneously. There are several aspects needed to be addressed n advance to acheve an effcent resource management. The man techncal ssues are as follows: (1) routng algorthm, (2) packet classfcaton and schedulng and (3) resource management. Frst, the ntegrated routng algorthm has been proposed n [1,2] to select the optmum routes for transmssons n both optcal and wreless doman. A rsk- and delay- aware routng algorthm s proposed for the front-end wreless network n [3, 4]. Second, schedulng algorthm s also mproved to consder the network condton jontly n the optcal and wreless doman [5]. In [6], we proposed a scheduler, whch prortzes connectons n the optcal doman, whle takng wreless channel qualty nto account. At last, for the resource management, as proposed n [7], a central controller s desgned n the optcal doman to have a vew of the hybrd network. The connecton requests submtted n the wreless doman are delvered to the optcal doman. As desgned for the HOW network, a utlty-based bandwdth allocaton scheme s proposed n [8]. Capacty analyss and wavelength multplexng are exploted n [9] for flexble bandwdth allocaton. Although the dea of an ntegrated resource management s proposed, how to realze such scheme has /09/$
2 not been addressed. In ths paper, we presents our study and desgn of a resource management framework for the HOW networks. Our proposed scheme can jontly and optmally admt the request connectons and allocate the network resources for both the optcal network and the wreless network wth an overall consderaton. Under an ntegrated resource management framework, the potental network congeston s able to be avoded, the resource utlzaton can be maxmzed and the prescrbed QoS requrements are able to be successfully satsfed. The rest of ths paper s organzed as follows. Secton II ntroduces our proposed resource management framework. Secton III presents the smulaton results and analyss. Fnally, concluson s gven n Secton IV. II. ENHANCED SIGNALLING SCHEME WITH AC A. Hybrd EPON and WMAX Network Archtecture The hybrd EPON and WMAX network archtecture s llustrated n Fgure 1. In EPON, a centralzed Optcal Lne Termnal (OLT) communcates wth multple connected Optcal Network Users (ONUs) va a passve optcal spltter. In the Pont-to-Multpont (PMP) WMAX network, a Base Staton (BS) manages channel allocaton to Subscrber Statons (SSs) as a central controller [14]. In hybrd network archtecture, the ONU functons and BS functons are ntegrated nto a sngle devce, namely an Access Gateway (AG), whch handles connectons wthn the wreless network, and connectons cross both EPON and WMAX network. The upstream traffc s frst aggregated at an AG and then forwarded to the OLT. For the downstream traffc, packets are frst transmtted to the AG and then forwarded to each SS n the allocated channel slots. Tradtonally network control mechansms are desgned separately and exclusvely for ether optcal Fgure 1. Integrated optcal wreless network model networks or wreless networks. The characterstcs and challenges of the HOW network are gnored. To acheve desred network performances, the exstng control planes n EPON and WMAX should be ntegrated and mproved wth advanced admnstraton functons. Fgure 2. shows an overvew of operatons mplemented n the OLT and the AG for schedulng, resource allocaton and admsson control. In ths paper, we propose a modfed resource negotaton scheme at the optcal uplnk bandwdth allocator block n the OLT and a delay-aware admsson control at the CAC block n the AG. B. Basc MPCP Operatons A typcal EPON system s a tree-based archtecture, whch conssts of one Optcal Lne Termnal (OLT) functonalzed as a central control staton, one 1:N (for example, N=16 or 32) passve optcal spltter and multple Optcal Network Users (ONUs). The framework of the EPON MAC layer, known as the MultPont Control Protocol (MPCP), s defned n IEEE 802.3ah Ethernet n the Frst Mle (EFM) Task Force [10]. MPCP s a sgnalng access protocol, whch uses two 64-byte MAC control messages to regster the connected ONUs and allocaton upstream bandwdth among ONUs (va GATE and REPORT messages). Snce the upstream transmssons from multple ONUs to the OLT share a common optcal lnk, an mportant ssue n EPON s to effcently allocate resources to mult-users, whch s not specfed n the standard. Two control messages, REPORT and GATE, are defned n the MultPont Control Protocol (MPCP) as sgnalng between the OLT and AGs n the hybrd network. The REPORT message s n the downstream drected to the OLT and the GATE message s n the upstream ntated from the OLT. The OLT regsters attached AGs wthn the dscovery perod, whch s repeated perodcally so that newly connected AGs can seamlessly be added wthout nterruptng the current network operaton. After dscoverng and regsterng the connected AGs, the OLT sets up an entry table, whch contans the AG node dentfcaton (NID) and the round trp tme (T rtt ). Snce multple AGs share a common optcal lnk n the upstream drecton, the OLT requres assgnng the bandwdth n a manner of farness and wthout conflct. The upstream transmsson perod s dvded nto multple tme slots and each ONU can only transmt durng ts own slot tme. In the normal processng state, the OLT polls regstered AGs and assgns tme slots ether statcally based on the TDMA scheme or dynamcally based on the desgned resource requrement negotaton [11-13]. In ths paper, we use the TDMA n the EPON doman. In TDMA scheme, one AG s granted a fxed tme slot length and s polled n order. In ths paper, a cycle (T cycle ) refers to a perod n whch all
3 Fgure 2. Functonal overvew of an ntegrated control framework AGs are served and a subframe refers to a perod, whch s assgned to an AG for the uplnk transmsson. C. Enhanced MPCP Scheme In the ntegrated archtecture, an AG performs resource management operatons for both optcal and wreless networks. In order to calculate the packet transmsson delay n the optcal doman, the AG needs to know the estmated watng tme for ts next poll. Ths extra nformaton can be derved from the OLT usng a modfed GATE message. Orgnally defned n MPCP, the GATE message conssts of a 1-byte granted start tme (t start ) and a 2-byte granted bandwdth (BW). We add a 3- byte feld, the next cycle tme (T next ), whch s the nterval between two adjacent pollng operatons to an AG. After the OLT computes the start tme and subframe length for each AG, the OLT can obtan the total transmsson length (T cycle ) for all k AGs. We use t to ndcate the tme and T to ndcate the duraton BW T cycle = ( + Tg ) (1) R k 1 = 0 where R o s the transmsson rate of the optcal uplnk and T g s the guard tme between two successve upstream transmssons. After a perod of T cycle, an AG s polled agan. The nterval between two adjacent pollng operatons, the next cycle tme, can be calculated and added nto the orgnal GATE message as a new feld. The GATE control message can be embedded wthn an Ethernet frame. The recever recognzes the GATE control message and then extracts the followng 6-byte grant nformaton. The o enhanced MPCP scheme under the TDMA s shown n Fgure 3. The pollng sequence of AGs s scheduled n the OLT. The value of granted bandwdth s fxed and same to all k AGs. In other words, each AG has to wat T cycle as the pollng wat tme. The value of t start and T cycle are updated and changed once there are new AGs regstered and scheduled. The expected next cycle tme for the th AG s calculated n Eq. (2). The entry table s updated after the perodc dscovery process. The value of t next for each AG s computed at the begnnng of each cycle. t next TDMA = t = t start start + T + k cycle BW R ( + T g o ) (2) D. Integrated Optcal Wreless Admsson Control A key characterstc of our proposed resource management s to provde overall consderatons of both optcal and wreless network condtons. Although EPON and WMAX use dfferent channel access mechansms, they both need admsson control to determne how much traffc can be handled n the optcal and the wreless domans separately, so that the prescrbed QoS for each traffc stream can be mantaned. Implementng two ndvdual admsson control schemes for each network s not effectve and effcent. An Integrated Optcal Wreless Admsson Control (IOW-AC) scheme s proposed to cope wth ths problem, whch provdes delay bounds to multdoman connectons. We frst present a model to evaluate the delays experenced by SSs and then descrbe the proposed IOW-AC scheme.
4 When traffc arrves at the AG from the SSs, AG s able to estmate the watng tme for the traffc to be served. The overall estmated delay (d est ) ncludes the watng tme untl AG s polled by the OLT (d pollng ), the watng tme for the pror data n the same queue beng served (d queueng ) and the wreless transmsson (d tx-wreless ) and propagaton delay (d prop-wreless, ). d est = d + d + d d (3) pollng queung tx wreless + prop wreless Where d pollng s calculated based on the next cycle tme (t next ) and the packet arrval tme (t). The t next s computed as we explaned earler. d queueng s determned by the current subqueue sze and the assgned bandwdth wthn a subframe. If the subframe has enough empty space, the new comng packet can be served rght after the queued packets n the followng subframe. Snce the queung delay s not our focus, we assume the avalable buffer sze n AG s enough. d tx-wreless s calculated based on the packet sze and the wreless lnk rate. d pollng s determned by the nformaton (e.g. the startng transmsson tme t 0, the granted slot tme t granted and the next transmsson tme t next ) provded n the GATE message. In the case t [t 0, t 0+T granted), the request arrves at the tme when the AG s beng polled. the request of j th SS, SS j, arrves when the AG s beng polled. A request can be accepted and served wthn the current subframe only f the correspondng packets can be receved before the current subframe s fnshed. Thus, d pollng = 0.Otherwse, d pollng = t next -t. If the request of SS arrves at the AG, whch s watng to be polled,.e., t [ t 0 +T granted, t 0 +T next-tx), the packet has to wat untl the remanng part of an uplnk transmsson from other AGs to the OLT s completed. The earlest tme for the request to get served s the next pollng tme. Thus, d pollng = t next -t It s noted that an ncrease on the subframe sze T granted can result n a larger number of accepted requests, but t also ncreases the pollng delay. In order to support and protect the QoS of real-tme traffc streams, n addton to bandwdth allocaton, an AC scheme s requred to decde whether to admt a realtme traffc stream based on both admsson polces and QoS requrements suppled by the applcaton at the end users. Assumng for real-tme servces, QoS metrcs are predefned and varous thresholds are specfed. The realtme traffc flows are characterzed by the demand QoS parameters, for example, the delay bound (d mn ). The AG can perform rate-based AC that s based on the delay requrement of the new arrvng flow and the estmated delay. The IOW-AC provdes guaranteed QoS and ncreases the network throughput by acceptng requests wthout volatng the delay constrants. The proposed IOW-AC scheme can be accomplshed as follows. As llustrated n Fgure 4., when there s a new request receved at AG. The transmsson and propagaton delay are frst calculated accordng to the wreless network Fgure 3. Enhanced MPCP wth TDMA scheme Fgure 4. Operatons of the proposed uplnk IOW-AC scheme.
5 condtons and traffc profle. Secondly, the queung delay s evaluated based on the current buffer occupancy. Then, usng the pollng status nformaton, the expected pollng delay s computed as explaned n Eq. (1) and Eq. (2). Fnally, when the IOW-AC approach determnes the overall delay, d est, for a multdoman connecton request, t compares the delay wth the delay bound, d mn. If the requred delay bound s satsfed, the request s accepted (d est < d mn ). Otherwse, the request s rejected. III. PERFORMANCE EVALUATION Extensve smulatons have been conducted usng OPNET modeler [15] to evaluate the performance of the proposed enhanced MPCP and IOW-AC scheme for the HOW network. Smulaton results are shown to compare the proposed framework wth the tradtonal separated resource management schemes. Smulatons are carred out for dfferent network szes and traffc loads. The total number of AGs K s 32 and the EPON lnk rate s assumed as 1 Gb/s. The guard tme between two adjacent transmssons on the optcal uplnk fber s 5 s. We assume that the AG supports a 70 Mb/s WMAX uplnk data rate. Based on the IEEE standard, both rtps and BE traffc are consdered. For users of rtps traffc, e.g. vdeo streamng servce, the traffc profle has a varable packet sze, unformly dstrbuted between 1200 and 1500 bytes. The delay bound for the real tme traffc s set as 75ms. Fgure 5a. shows the rato of admtted requests n the total receved requests for both real-tme traffc and BE traffc, usng the two dfferent AC schemes. The ncomng requests can be admtted only when ther QoS requrements are met. Ths fgure shows that the IOW- AC admtted larger amount of conformng traffc than the Normal-AC for both the real-tme and BE traffc. The dfferences become more sgnfcant when the traffc arrval rate ncreases. The channel utlzaton becomes better n the IOW-AC because there s wastage n the Normal-AC scheme taken by the nonconformng traffc. In Fgure 5b we compare the smulaton results for the droppng probablty for the real-tme traffc and BE traffc when there s lmted buffer sze at an AG node. IOW-AC scheme acheves lower droppng probablty for both real tme traffc and best effort (BE) traffc. Ths s because that IOW-AC only accepts conformng traffc and saves more bandwdth for the conformng real tme traffc wthout any drop even under hgh real-tme traffc rate. We observe the smlar result, whch s that IOW- AC yelds better bandwdth utlzaton. In Fgure 5c we plot the percentage of accepted requests for dfferent length of subframe perod rangng from 1 ms to 5 ms. As we mentoned before, when the subframe perod (T granted ) ncreases, there are more requests can be served n the uplnk optcal lnk. However, the total cycle tme (T cycle ) becomes larger and the pollng delay ncreases smultaneously. In ths fgure, the IOW-AC scheme blocks nonconformng traffc especally when the subframe perod s large. Under the Normal-AC scheme, the accepted real-tme traffc s most of nonconformng traffc. In Fgure 6a we examne the pollng delay (d pollng ) experenced at the AG node n the IOW-AC scheme. The buffer sze s specfed as unlmted. Therefore, the T queung of voce and vdeo traffc wll not be a domnatng Fgure 5. (a) Admtted request Vs. traffc arrval rate. (b) Packet droppng probablty Vs. traffc rate. (c) Admtted request Vs. subframe length Fgure 6. (a) Pollng delay Vs. subframe length. (b) Admtted RT request Vs. number of AGs. (c) Admtted BE request Vs. number of AGs
6 factor n the AC. On the contrary, the nfluence of T pollng on AC s hghlghted, whch s mportant to observe n smulatons. The value of the pollng delay s zero f the request packet s receved durng the subframe perod. Otherwse, the pollng delay s the nterval between the current tme and the next poll tme. In ths fgure, the pollng delay s a tme average value. As the subframe perod ncreases, the pollng delay becomes larger because t takes longer tme for the OLT to serve all AGs. Therefore, the pollng delay s also dependng on the number of connected AGs. The more the number of AG, the longer the pollng delay. In Fgure 6b and Fgure 6c we compare admtted realtme traffc and the BE traffc under dfferent number of AGs and dfferent length of subframes, n the IOW-AC scheme. The number of blocked requests s ncreased usng the IOW-AC scheme when the number of AGs and the perod of subframe become larger. We have observed that the beneft of our proposed ntegrated resource management framework s hghly depends on the network sze and traffc profle. IV. CONCLUSION In ths paper we present an ntegrated resource management framework for the hybrd optcal wreless networks amng for maxmum user QoS and maxmum network throughput. Smulatons conducted usng the OPNET modeler show that the proposed system acheves sgnfcant mprovements over the tradtonal admsson control approach n terms of user QoS guarantee and network resource utlzaton. These gans are acheved wthout complex modfcaton on the exsted network protocols. Another nterestng observaton s that f the number of AGs and the assgned subframe perod for each AG are ncreased, the proposed admsson control scheme acheves more sgnfcant mprovements. Snce the network throughput s relevant to the AG parameters, an operator can estmate the performance based on ths smulaton results. The beneft of our proposed ntegrated resource management framework hghly depends on the network sze and traffc profle. The analyss could be a good assstance or gudance n future research n many felds of hybrd optcal wreless network archtecture, ncludng resource management, optmzng QoS and demandng servce provsonng. REFERENCES [1] W.-T. Shaw, D. Guterrez, K. S. Km, N. Cheng, S.-H. Wong, S.-H. Yen, and L. G. Kazovsky, GROW-Net A hybrd optcal wreless access network, n Proc. 9th Jont Conf. Informaton Scences. (Invted Paper), Oct [2] W.-T. Shaw, S.-H. Wong, N. Cheng, K. Balasubramanan, X. Zhu, M. Maer and L. G. Kazovsky, Hybrd archtecture and ntegrated routng n a scalable optcal wreless access network, Journal of Lghtwave Technology, Vol. 25, No. 11, Nov [3] S. Sarkar, S. Dxt and B. Mukherjee, Hybrd wreless-optcal broadband-access network (WOBAN): a revew of relevant challenges, Journal of Lghtwave Technology (nvted paper), Vol. 25, No.11, Nov [4] S. Sarkar, H. Yen, S. Dxt and B. Mukherjee, DARA: delayaware routng algorthm n a hybrd wreless-optcal broadband access network (WOBAN), n Proc. IEEE Internatonal Conference on Communcatons, Jun [5] G. Shen, R. S. Tucker and C. Chae, Fxed moble convergence archtectures for broadband access: ntegraton of EPON and WMAX, IEEE Communcatons Magazne, pp , Aug [6] Y. Yan, H. Yu and L. Dttmann. "Wreless channel condton aware schedulng algorthm for hybrd optcal/wreless networks", n Proc. 3rd Internatonal Conference on Access Networks, Oct [7] Y. Luo, S. Yn, T. Wang, Y. Suemura, S. Nakamura and M. Cvjectc, QoS-aware schedulng over hybrd optcal wreless networks, n Proc. Optcal Fber Communcaton Conference and Natonal Fber Optc Engneers Conf., 2006, pp 1-7. [8] P. Ln, C. Qao, T. Wang and J. Hu. Optmal utlty-based bandwdth allocaton over ntegrated optcal and WMAX networks, n Proc. Optcal Fber Communcaton Conference and Natonal Fber Optc Engneers Conf., 2006, pp 3. [9] H. Km and A. Wolsz. "A rado over fber based wreless access network archtecture for rural areas", n Proc. 14 th IST Moble and Wreless Communcatons Summt, Jun [10] Ethernet n the Frst Mle Allance (EFMA), Ethernet Passve Optcal Network (EPON) tutoral, Revson 4, (2004). [11] Kramer Glen, Mukherjee Bswanath, and Pesavento Gerry. IPACT: a dynamc protocol for an Ethernet PON (EPON), IEEE Communcaton Magazne 40(2), (2002). [12] C. Ass et al., Dynamc bandwdth allocaton for qualty-ofservce over Ethernet PON, IEEE JSAC, vol. 12, no. 9, pp (2003). [13] M. Ma, Y. Zhu, and T. H. Cheng, A systematc scheme for multple access n ethernet passve optcal access networks, J. Lghtwave Tech., vol. 23, no. 11, pp (2005). [14] Jeffrey G. Andrews, Arunabha Ghosh and Ras Muhamed, [Fundamentals of WMAX], Prentce Hall (2007). [15] OPNET Modeler 14.0, ACKNOWLEDGMENT Ths work was supported n part by the European Commttee through project ALPHA (Archtectures for flexble Photonc Home and Access networks).
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 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 informationDynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks
Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,
More 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 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 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 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 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 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 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 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 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 informationBandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks
Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: nowakd@eengdcue Phlp
More 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 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 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 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 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 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 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 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 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 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 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 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 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 informationAlgorithms for Routing and Centralized Scheduling to Provide QoS in IEEE Mesh Networks
Algorthms for Routng and Centralzed Schedulng to Provde QoS n IEEE 802.16 Mesh Networks Harsh Shetya Dept of Electrcal Communcaton Engneerng Indan Insttute of Scence Bangalore, Inda. 560012 harsh@pal.ece.sc.ernet.n
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 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 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 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 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 informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More 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 informationInternet Traffic Managers
Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John
More informationA 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 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 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 informationComparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet
Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate
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 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 informationOn the Exact Analysis of Bluetooth Scheduling Algorithms
On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of
More informationDesign and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm
Desgn and Expermental Evaluaton of a Cross-Layer Deadlne-Based Jont Routng and Spectrum Allocaton Algorthm Jthn Jagannath, Sean Furman, Tommaso Meloda, and Andrew Drozd Abstract The desgn and mplementaton
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 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 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 informationImproving Load Balancing mechanisms in Wireless Packet Networks 1
Improvng Load Balancng mechansms n Wreless Packet etworks 1 Guseppe Banch, Ilena Tnnrello Dept. Electrcal Engneerng, Unversty of Palermo Vale Delle Scenze, Parco D'Orleans, 90128 Palermo, Italy Abstract
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 informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationwith `ook-ahead for Broadcast WDM Networks TR May 14, 1996 Abstract
HPeR-`: A Hgh Performance Reservaton Protocol wth `ook-ahead for Broadcast WDM Networks Vjay Svaraman George N. Rouskas TR-96-06 May 14, 1996 Abstract We consder the problem of coordnatng access to the
More informationNew Method Based on Priority of Heterogeneous Traffic for Scheduling Techniques in M2M Communications over LTE Networks
Receved: July 28, 2018 209 New Method Based on Prorty of Heterogeneous Traffc for Schedulng Technques n M2M Communcatons over LTE Networks Maryam Ouassa 1 * Abdallah Rhattoy 2 1 Informaton 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 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 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 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 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 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 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 informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationTechnical 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 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 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 informationAdvanced radio access solutions for the new 5G requirements
Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,
More informationAn Online Delay Efficient Multi-Class Packet Scheduler for Heterogeneous M2M Uplink Traffic
An Onlne Delay Effcent Mult-Class Packet Scheduler for Heterogeneous M2M Uplnk Traffc Akshay Kumar, Ahmed Abdelhad and Charles Clancy Hume Center, Vrgna Tech Emal:{akshay2, aabdelhad, tcc}@vt.edu Abstract
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 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 informationOn Achieving Fairness in the Joint Allocation of Buffer and Bandwidth Resources: Principles and Algorithms
On Achevng Farness n the Jont Allocaton of Buffer and Bandwdth Resources: Prncples and Algorthms Yunka Zhou and Harsh Sethu (correspondng author) Abstract Farness n network traffc management can mprove
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 informationPerformance Analysis of a Managed Bandwidth Service for ATM Networks
Performance Analyss of a Managed Bandwdth Servce for ATM Networks Chrstos Bouras Chryss Chantz Vaggels Kapoulas Alexandros Panagopoulos Ioanna Sampraku Afrodte Sevast Research Academc Computer Technology
More informationQoS Bandwidth Estimation Scheme for Delay Sensitive Applications in MANETs
Communcatons and Network, 2013, 5, 1-8 http://dx.do.org/10.4236/cn.2013.51001 Publshed Onlne February 2013 (http://www.scrp.org/journal/cn) QoS Bandwdth Estmaton Scheme for Delay Senstve Applcatons n MANETs
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More 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 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 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 informationA Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes
A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,
More informationPerformance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks
Communcatons and Network, 2016, 8, 45-55 Publshed Onlne February 2016 n ScRes. http://www.scrp.org/journal/cn http://dx.do.org/10.4236/cn.2016.81006 Performance Comparson of a QoS Aware Routng Protocol
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 informationIJCTA Nov-Dec 2016 Available
Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,
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 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 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 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 informationEnhancing Class-Based Service Architectures with Adaptive Rate Allocation and Dropping Mechanisms
Enhancng Class-Based Servce Archtectures wth Adaptve Rate Allocaton and Droppng Mechansms Ncolas Chrstn, Member, IEEE, Jörg Lebeherr, Senor Member, IEEE, and Tarek Abdelzaher, Member, IEEE Abstract Class-based
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 informationAn Admission Control Framework Integrating Radio and IP-Transport in 3GPP-based Networks
An Admsson Framework Integratng Rado and IP-Transport n 3GPP-based Networks R. Ferrús, J. Olmos, O. Sallent, J. Pérez-Romero, F. Casadevall Sgnal Theory and Communcatons Department, UPC, Barcelona e-mal:
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 informationPerformance 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 informationIEEE C802.16e-04/213r1. IEEE Broadband Wireless Access Working Group <
Project Ttle IEEE 802.16 Broadband Wreless Access Workng Group QoS Management Subheader for Facltaton of Uplnk Schedulng Date Submtted 04-06-25 Source(s) Re: Yongjoo Tcha, Yong-Bum
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationABSTRACT 1. INTRODUCTION RESEARCH ARTICLE
WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wrel. Commun. Mob. Comput. 2015; 15:2111 2124 Publshed onlne 5 May 2014 n Wley Onlne Lbrary (wleyonlnelbrary.com)..2479 RESEARCH ARTICLE Optmzed bandwdth allocaton
More informationQuantifying Performance Models
Quantfyng Performance Models Prof. Danel A. Menascé Department of Computer Scence George Mason Unversty www.cs.gmu.edu/faculty/menasce.html 1 Copyrght Notce Most of the fgures n ths set of sldes come from
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationState of the Art in Differentiated
Outlne Dfferentated Servces on the Internet Explct Allocaton of Best Effort Packet Delvery Servce, D. Clark and W. Fang A Two bt Dfferentated Servces Archtecture for the Internet, K. Nchols, V. Jacobson,
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 informationAdaptive Resource Allocation Control with On-Line Search for Fair QoS Level
Adaptve Resource Allocaton Control wth On-Lne Search for Far QoS Level Fumko Harada, Toshmtsu Usho, Graduate School of Engneerng Scence Osaka Unversty {harada@hopf, usho@}sysesosaka-uacjp Yukkazu akamoto
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationBANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION
ARPN Journal of Engneerng and Appled Scences 2006-2009 Asan Research Publshng Network (ARPN). All rghts reserved. BANDWIDTH OPTIMIZATION OF INDIVIDUA HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICA APPICATION
More informationSupport Strong Consistency for Mobile Dynamic Contents Delivery Network
Nnth IEEE Internatonal Symposum on Multmeda 27 Support Strong Consstency for Moble Dynamc Contents Delvery Networ Zhou Su, Jro Katto and Yasuho Yasuda Graduate School of Scence and Engneerng, Waseda Unversty,
More informationAUTONOMOUS ROUTING ALGORITHMS FOR NETWORKS WITH WIDE-SPREAD FAILURES
AUTONOMOUS ROUTNG ALGORTHMS FOR NETWORKS WTH WDE-SPREAD FALURES Wajahat Khan, Long Bao Le and Eytan Modano Communcatons and Networkng Research Group Massachusetts nsttute of Technology Cambrdge, MA, USA
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 information