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

Size: px
Start display at page:

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

Transcription

1 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 for Broadband Wreless Communcaton Bader Al-Manthar, Najah Abu Al, Ndal Nasser, Hossam Hassanen Telecommuncatons Research Laboratory School of Computng, Queen s Unversty ngston, ON, Canada 7L N6 {manthar, hossam}@cs.queensu.ca College of Informaton Technology UAE Unversty, Al-An P.O. 7555, UAE najah@uaeu.ac.ae Department of Computng & Informaton Scence Unversty of Guelph Guelph, ON, Canada NG W nasser@cs.uoguelph.ca Abstract The success of emergng wreless broadband communcaton systems such as.5g wreless cellular systems and 80.6 broadband wreless systems (WMAX) wll depend, among other factors, on ther ablty to manage ther shared wreless resources n the most effcent way. Ths s a complex task due to the heterogeneous nature and, hence, dverse bandwdth urements of applcatons that these communcaton systems support and the relance on hgh speed shared channels for data delvery nstead of dedcated ones. Therefore, bandwdth provsonng s crucal for the success of such communcaton systems. In ths paper, we propose a novel dynamc bandwdth provsonng scheme for broadband wreless communcaton. The proposed scheme spans multple tme slots/frames and optmally allocates them to the dfferent classes of traffc dependng on ther weghts, the real-tme bandwdth urements of ther connectons, ther channel qualty condtons and the expected obtaned revenues. Smulaton results are provded to show the potental and effectveness of our scheme. eywords - Bandwdth provsonng; farness; opportunty cost. I. INTRODUCTION Emergng wreless broadband communcaton systems such as Hgh Speed Downlnk Packet Access (HSDPA) [] and 80.6 broadband wreless access systems (WMAX) [], pose a myrad of new opportuntes for leveragng the support of a wde range of multmeda applcatons that have dfferent bandwdth urements. Ths s due to the hgh data rates that are supported by these systems whch were only avalable to wrelne users. To mze ther effcency and reduce the cost of data delvery, these systems utlze hgh speed downlnk channels that are shared among moble connectons through packet schedulng. Packet schedulng s one of the most mportant components of resource management that affects system capacty and potental bandwdth allocated to moble connectons. A centralzed downlnk packet scheduler s mplemented at the base statons of broadband wreless communcaton systems to control the allocaton of the downlnk shared channels to the moble connectons by decdng whch of them should transmt durng a gven tme slot/frame. Therefore, packet schedulng can be thought of as a short-term resource sharng scheme snce t only checks the current tme frame to make ts decson. However, to enhance the schedulng performance and satsfy the bandwdth urements of dfferent applcatons n broadband wreless systems, packet schedulng must be coupled wth a long-term resource sharng or bandwdth provsonng scheme to span multple tme frames and decde how resources are shared among the dfferent traffc classes and, hence, ther correspondng connectons. The bandwdth provsonng scheme must dvde the bandwdth or the correspondng tme frames between dfferent classes of traffc n an effcent, prortzed and far way. Thus, the scheme works as a long-term nter-class selecton algorthm. Most of the work on bandwdth provsonng has been done at the admsson level [,, 5, 6, 7], where these schemes mplement the call admsson control functon (CAC) and am at reducng the call blockng and droppng probabltes whle satsfyng the bandwdth urements of dfferent QoS classes. There s a need, however, for bandwdth provsonng at the frame level. Ths s due to the varyng bandwdth urements of moble connectons durng ther calls as a result of ther traffc burstness and also due to ther varyng channel qualty condtons, whch affect the capacty of the base staton and, hence, the amount of bandwdth that t can sustan to each one of them. Few works, have consdered the problem of bandwdth provsonng at the frame level [8, 9, 0]. Nevertheless, none of whch has consdered the varyng channel qualty condtons of moble connectons. Hence, they cannot acheve optmzed bandwdth provsonng. In ths paper, we propose a dynamc bandwdth provsonng scheme for future broadband wreless systems. Our proposed scheme s desgned to accommodate mult-class traffc wth multple connectons havng dfferent bandwdth urements and varyng channel qualty condtons. The man objectve of our scheme s to optmally allocate bandwdth or the correspondng tme frames for each class of traffc n order to satsfy the bandwdth urements of ther Ths research s supported by the government of the Sultanate of Oman, Natural Scences and Engneerng Research Councl of Canada and by a grant from Bell Unversty Labs /08/$ IEEE 08

2 Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. connectons. In addton, the proposed scheme unquely ncorporates and bounds the cost (n terms of revenue loss) of bandwdth provsonng through an opportunty cost functon. Ths provdes greater flexblty to servce provders to determne the levels of bandwdth provsonng to dfferent traffc classes that wll guarantee a certan level of revenues. The rest of ths paper s organzed as follows. Secton II provdes an overvew of the proposed scheme. Secton III presents a descrpton of the proposed scheme. Performance results are presented n Secton IV. Fnally, conclusons and future work are dscussed n Secton V. II. OVERVIEW OF DYNAMIC BANDWIDTH PROVISIONING SCHEME In ths secton, we provde an overvew of our proposed dynamc bandwdth provsonng scheme. We assume that there are classes of traffc, where class has hgher prorty than class +, and +. We consder that connectons wthn the same class may have dfferent bandwdth urements dependng on the type of applcatons they are runnng. Suppose that the servce provder wants to provson SL tme frames between the classes of traffc to satsfy ther long-term bandwdth urements. We assume that SL s gven. The proposed dynamc bandwdth provsonng scheme works as follows. At tme t (where t s the begnnng of SL frames), the dynamc bandwdth provsonng scheme wll partton the next SL frames among the classes of traffc based on the bandwdth urements of ther connectons, ther weghts, ther channel qualty condtons and the expected revenues. It should be noted that the parttoned frames can be assgned to connectons of each class n any order. For example, connectons may be served based on the delay or packet loss urements of the traffc classes. In ths paper, however, the frames of the class wth the hghest prorty are served frst, then those of the class of the second hghest prorty, and so on. Once each class s assgned a number of frames, these frames wll be dstrbuted to connectons wthn each class accordng to the packet schedulng scheme whch s executed every tme frame. The servce provder may utlze any exstng packet schedulng scheme for dstrbutng the parttoned frames among connectons as our bandwdth provsonng scheme s ndependent of the schedulng algorthm beng utlzed. Fgure shows an abstract tmelne data flow chart of the proposed dynamc bandwdth provsonng scheme. Fgure. Dynamc Bandwdth Provsonng III. DYNAMIC BANDWIDTH PROVISIONING Before proceedng wth descrbng the proposed bandwdth provsonng scheme, we make the followng defntons. Let: N : number of connectons n class. N = N, total number of connectons n the system. = S : mum ured bandwdth of connecton j of j class, j =,..., N. mn S : mnmum ured bandwdth of connecton j of class j, j =,..., N. SL : number of frames assgned to class. R () t : effectve average estmated data rate (per second) that the base staton can transmt to connectons of class durng the next SL frames. Ths data rate wll depend on the estmated nstantaneous channel qualty condtons of the connectons. R () t can be computed usng a movng average (.e., R () t = α R ( t ) + ( α) R () t ) or usng channel predcton schemes proposed n [], [] and []. c : charge per bt for connecton j of class. j B : total ured mum bandwdth per frame of all connectons n class at the begnnng of the SL frames. Let N j= S j = the total ured bandwdth per second of all connectons n class, and let D be the frame duraton n frame N second, then B = S j // D frame. B determnes j = how much the ured transmsson rate base staton should be sendng at per frame n the next SL frames n order to satsfy the connectons of class. mn B : total ured mnmum bandwdth per frame of all connectons n class at the begnnng of the SL frames. Therefore, N mn mn // j frame. j= B S D B (( R ( t)/(/ D )) frame ) = = : actual (.e. effectve) total transmtted bt rate per frame for connectons n class. That s, B determnes the actual transmsson rate per frame of the base staton n the next SL frames for the connectons of class. Re v : total mum revenue per frame of connectons n class at the begnnng of the SL frames. Therefore, N Re v = ( // ) c S D j j frame. That s, Re v = 09

3 Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. determnes the revenue of the servce provder per frame n the next SL frames f t grants all the connectons n class ther mum ured data rates. Therefore, SL* Re v s the upper bound of the total revenue of the servce provder durng the SL frames. N Re v = ( ( ) // ) c R t D j frame : actual (.e. effectve) = total revenue per frame actually generated from servng all connectons of class. Therefore, SL * Re v s the actual total revenue that the servce provder attans from servng all connectons of class provded that class s assgned SL frames. Rev= {Re v } = : ordered set of the actual effectve total revenue per frame for the classes n descendng order. To satsfy all connectons, the base staton should assgn SL* B bandwdth per SL frames. However, ths may not be possble n practce due to the hgh demand of applcatons that have hgh bandwdth urements and also due to the lmtatons of the base staton s capacty, whch s determned by the channel qualty condtons of the moble connectons. Therefore, the man objectve of our bandwdth provsonng scheme s to dvde the SL frames between the classes of traffc such that SL = SL and the satsfacton of dfferent = classes of traffc s mzed. To do so, our bandwdth provsonng scheme wll dvde the SL frames between the SL * B classes of traffc such that t mzes (.e., the SL * B rato between the uested bandwdth of class connectons gven that SL frames are assgned to class to the bandwdth that the base staton should transmt at durng SL frames to satsfy the mum bandwdth urements of class ). The frames assgned to class (.e., SL ) should guarantee that no class of traffc s assgned less than ts mnmum ured mn bandwdth (.e., SL * B SL * B ) or assgned more than ts mum ured bandwdth (.e., SL * B SL * B ). In addton, t s mportant to realze there s an opportunty cost of frame assgnment. The opportunty cost (n terms of revenue) of frame assgnment s the mum revenue that the servce provder wll get f t serves the hghest revenue generatng classes mnus the revenue that t would get by assgnng the frames otherwse. To compute the mum revenue that the servce provder could get n the next SL The opportunty cost for a good s defned as the value of any other goods or servces that a person must gve up n order to produce or get that good []. frames, we frst need to know the number of frames needed for each class n order to acheve ts mum ured SL * B bandwdth (.e., SL * B = SL * B ). Hence, SL =. B Therefore, the mum revenue, Max Rev, s equal to Max Re v = SL Re v, SL SL = = () That s, the mum revenue s obtaned, by assgnng the frames to the class wth the hghest actual revenue. If ths class can be served by less number of frames than SL frames, the avalable frames are assgned to the class wth the second hghest actual revenue and so on. Therefore, the opportunty cost ( OC( SL ) ) of the frames assgnment s equal to OC( SL) = Max Re v SL Re v () = Ths should be less than or equal to a predefned value H. For example, the servce provder could restrct the revenue loss to be no more than 50% of the mum obtanable revenue (.e., H = Max Re v where = 0.5 ). To summarze, n our bandwdth provsonng scheme, the followng optmzaton problem wll be solved: SL * B Objectve: w SL, = SL * B Subject to: SL = SL, =, and mn * * * SL B SL B SL B OC( SL) H () where w s a weght assgned to class to gve t prorty over class + n the frame assgnment process. Therefore, the weghts n our bandwdth provsonng scheme can be used to determne the approprate level of nter-class farness (.e., farness between dfferent classes) accordng to the urements of the servce provders. Snce the objectve functon and the constrants are lnear, our bandwdth provsonng scheme could be solved usng Lnear Programmng (LP) technques. The proposed bandwdth provsonng scheme s adaptve to the varyng urements of dfferent classes snce the objectve functon s evaluated every SL frames and, therefore, f the ured bandwdth (or frames) for class changes durng the current frames (due to new admtted connectons and completed ones or bandwdth adaptve uests as t s the case n WMAX), ts new total ured bandwdth wll be reflected n the next SL frames. 00

4 Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. IV. PERFORMANCE EVALUATION In ths secton, we evaluate the performance of our proposed scheme by means of dynamc dscrete event smulaton. We tested our scheme on Hgh-Speed Downlnk Packet Access (HSDPA) system. HSDPA s a.5g wreless system that has been ntroduced by the rd Generaton Partnershp Project (GPP) as an extenson to the G cellular system Unversal Moble Telecommuncaton System (UMTS) []. A. Smulaton Model For smplcty, we smulated one-cell and gnored handoffs. The base staton s located at the center of the cell. Therefore, only one base staton s nvolved n allocatng the rado resources. The cell radus s m and the base staton s transmsson power s 8 dbm. Four classes of traffc are consdered (.e. =). For demonstraton purposes, we assume that connectons wthn each class uest a bandwdth of 8 bps and there are 0 connectons n each class. We also assume that c j =,, and unts of money for connectons of classes,,, and, respectvely. These values are chosen such that connectons of hgher prorty classes are charged more than those of lower prorty classes. Packets for connectons are generated as a Posson process wth a mean value of 0.5 s. The packet sze s fxed at 000 bytes. The call duraton of each connecton s modeled by an exponental dstrbuton wth a mean value of 0 s. Connectons are unformly dstrbuted n the cell. We choose SL=0 tme frames (.e. 0 x ms) and we use a movng average to compute R () t (.e., R () t = α R ( t ) + ( α) R () t ). We adopt the same channel model as n [5]. The smulaton tme step s one tme frame, whch s ms (.e., the tme frame of HSDPA []), and the smulaton tme s 00 s. Other smulaton parameters are lsted n Table I. TABLE I SIMULATION PARAMETER S Smulaton tme 00s Base Staton Transmsson power 8 dbm Antenna gan 7 db Base Staton buffer sze 0 MB Shadowng Lognormal dstrbuton Intra-cell nterference 0 dbm Inter-cell nterference -70 dbm α B. Performance Metrcs To demonstrate the ablty of our scheme to satsfy the dynamc bandwdth urements of dfferent classes and acheve nter-class farness, t suffces to show the: Average utlty ( U ): the average of the receved bandwdth to the mum uested one by class. Proporton of assgned frames ( P ): the average percentage of assgned frames to class of the total number of frames assgned to all classes. Another mportant metrc s the amount of earned revenue. However, and for lack of space, we do not report such results n ths paper. The servce charge values are used to valdate our scheme and show the effect of opportunty cost on bandwdth provsonng. C. Smulaton Results Table II shows the average utlty of each traffc class wth the correspondng weghts. In general, all classes acheve acceptable performance levels. As t can be seen however, the average utltes of low prorty classes (.e., classes and ) can be ncreased by ncreasng ther weghts. However, ths occurs at the expense of decreasng the average utltes of hgher prorty classes (.e., classes and ). Ths shows the mportant role of class weghts and how they can be used to ensure nter-class farness. In addton, the effect of opportunty cost on bandwdth provsonng can be controlled by controllng H where we let H = Max Re v as shown n Table III. When =, ths means that the servce provder can tolerate a revenue loss as hgh as the mum revenue that could be obtaned. That s, n ths case, the opportunty cost of bandwdth provsonng s gnored. However, as s decreased, then the servce provder can tolerate less revenue loss and, hence, more frames are gven to the hghest revenue generatng classes (.e., hgher prorty classes). When = 0, then the servce provder cannot tolerate any revenue loss and, hence, only the classes that make the mum revenue (.e., Max Rev n Eq..) whch are classes and are assgned frames. Therefore, the servce provder can choose the level at whch t can tolerate revenue loss as a result of bandwdth provsonng by controllng and hence, controllng H. These results are also confrmed n Tables IV and V whch show the proporton of assgned frames for each class for dfferent class weghts and values. These results show that the proposed dynamc provsonng scheme can satsfy the bandwdth urements of dfferent classes of traffc whle allowng the servce provder to bound the cost of allocatng bandwdth to dfferent classes. Results also show that by controllng the class weghts, the servce provder can acheve ts desred levels n nter-class farness. V. CONCLUSIONS AND FUTURE WOR Future broadband wreless systems wll enhance the moble connectons wreless experence by supportng a wde range of multmeda applcatons. However, to satsfy the bandwdth urements of such applcatons, bandwdth provsonng s crtcal. In ths paper, a novel bandwdth provsonng scheme for broadband wreless network s proposed. The proposed scheme allows for prortzed bandwdth provsonng to dfferent classes of traffc supportng multple connectons wth dfferent bandwdth urements. It also ncorporates a unque opportunty cost functon to bound the cost of allocatng bandwdth to dfferent classes as to mantan a certan revenue level to the servce provder. Smulaton results show that the proposed dynamc provsonng scheme can satsfy the bandwdth urements of dfferent classes of traffc whle 0

5 Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. allowng the servce provder to bound the cost of allocatng bandwdth to dfferent classes. Fxed class weghts allow the servce provder to control nter-class farness as demonstrated n our experments. They however, cannot acheve optmzed farness snce the performance of each class s not fxed due to the varyng bandwdth urements and channel qualty condtons. Therefore, n our future work, we wll work on a dynamc weght update scheme to dynamcally compute the weghts of dfferent classes of traffc based on ther performance hstory n order to mze nter-class farness. Ths way, the resultng farness s more adaptve to the performance of classes snce t s based on ther performance hstory. REFERENCES [] GPP TS 5.08, Hgh Speed Downlnk Packet Access (HSDPA); Overall Descrpton, Release 5, March 00. [] IEEE 80.6 Workng Group, IEEE e Standard for Local and Metropoltan Area Networks: Ar nterface for fxed broadband wreless access systems amendment for physcal and medum access control layers for combned fxed and moble operaton n lcensed bands. December 005. [] C. Chou and. G. Shn, Analyss of Combned Adaptve Bandwdth Allocaton and Admsson Control n Wreless Networks, Proceedngs of Annual Jont Conference of the IEEE Computer Socetes (INFOCOM), New York, U.S.A, vol., pp , June 00. [] R. Hutchens and S. Sngh, Bandwdth Reservaton Strateges for Moblty Support of Wreless Connectons wth QoS Guarantees, Proceedngs of the Australasan Computer Scence Conference (ACSC), Melbourne, Australa, vol., pp. 9-8, January 00. [5] M. R. Sherf, I. W. Habb, M. Nagshneh, and P. erman, Adaptve Allocaton of Resources and Call Admsson Control for Wreless ATM Usng Genetc Algorthms, IEEE Journal of Selected Areas n Communcatons, vol. 8,no., pp. 68-8, February 000 [6] N. Nasser, H. Hassanen; Mult-class Bandwdth Allocaton Polcy for G Wreless Networks, Proceedngs of th IEEE Internatonal Conference on Local Computer Networks (LCN), Bonn, Germany, pp. 0-09, October 00. [7] C. Olvera, J. m, and T. Suda, An Adaptve Bandwdth Reservaton Scheme for Hgh Speed Multmeda Wreless Networks, IEEE Journal of Selected Areas n Communcatons, vol. 6, no. 6, pp , August 998. [8] B. rameche and M. Schwartz, Bandwdth Allocaton Strateges n Wde-Band Integrated Networks, IEEE Journal on Selected Areas n Communcatons, vol., no.6, pp , September 986. [9] Y. Afek, M. Cohen, E. Hallman and Y. Mansour, Dynamc Bandwdth Allocaton Polces, Proceedngs of the Annual Jont Conference of the IEEE Computer Socetes (INFOCOM), San Francsco, U.S.A, vol., pp , March 996. [0] X. Xu, D. Lang, H. Jang and X. Ln,, Dynamc Bandwdth Allocaton n Fxed BWA Systems, Proceedngs of the Internatonal Conference on Communcaton Technolog (ICCT), Bejng, Chna, vol., pp , Aprl 00. [] A. Duel-Hallen, S. Hu, and H. Hallen, Long-range predcton of fadng sgnals, IEEE Sgnal Processng Magazne, vol. 7, pp. 6 75, May 000. [] R. Vaughan, P. Teal, and R. Rach, Short-term moble channel predcton usng dscrete scatterer propagaton model and subspace sgnal processng algorthms, Proceedngs. of the IEEE Vehcular Technology Conference (VTC), Boston, MA, USA, September 000. [] T. Ekman, Predcton of moble rado channels, modelng and desgn, Ph.D. thess, Uppsala Unversty, Sweden, 00. [] H. Varan, Intermedate Mcroeconomcs: A Modern Approach, 6th edton, W.W. Norton & Company, 00. [5] B. Al-Manthar, N. Nasser and H. Hassanen, Packet Schedulng n.5g Hgh-Speed Downlnk Packet Access Networks: Breadth and Depth, IEEE Network Magazne, vol., no., pp. -6, January 007. TABLE II AVERAGE UTILITIES w w w w U U U U TABLE III AVERAGE UTILITIES WITH DIFFERENT OPPORTUNITY COST VALUES w w w w U U U U w w w w TABLE IV PROPORTION OF ASSIGNED FRAMES P P P P % % 5.%.6% 7 5.%.% 8.7%.8%.% 6.%.% 9.% TABLE V PROPORTION OF ASSIGNED FRAMES WITH DIFFERENT OPPORTUNITY COST VALUES w w w w P P P P 9.% 8.7% 0.%.8% % 6.%.6% 6.% %.5% 0% 0% 0 0

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

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

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

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

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

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network

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

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

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

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

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

A Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks

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

Combined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks

Combined 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

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

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

Cognitive Radio Resource Management Using Multi-Agent Systems

Cognitive Radio Resource Management Using Multi-Agent Systems Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North

More 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

Use of Genetic Algorithms in Efficient Scheduling for Multi Service Classes

Use of Genetic Algorithms in Efficient Scheduling for Multi Service Classes Use of Genetc Algorthms n Effcent Schedulng for Mult Servce Classes Shyamale Thlakawardana and Rahm Tafazoll Centre for Communcatons Systems Research (CCSR), Unversty of Surrey, Guldford, GU27XH, UK Abstract

More information

Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks

Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks Journal of Computer Scence 2012, 8 (12), 2025-2031 ISSN 1549-3636 2012 do:10.3844/cssp.2012.2025.2031 Publshed Onlne 8 (12) 2012 (http://www.thescpub.com/cs.toc) Utlty Based Schedulng and Call Admsson

More information

NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK

NETWORK 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 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

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

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

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

Adaptive Network Resource Management in IEEE Wireless Random Access MAC

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

Adaptive Energy and Location Aware Routing in Wireless Sensor Network

Adaptive Energy and Location Aware Routing in Wireless Sensor Network Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}

More information

Advanced radio access solutions for the new 5G requirements

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

Support Strong Consistency for Mobile Dynamic Contents Delivery Network

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

QoS-aware composite scheduling using fuzzy proactive and reactive controllers

QoS-aware composite scheduling using fuzzy proactive and reactive controllers Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve

More information

Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach

Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen,

More information

Algorithms for Routing and Centralized Scheduling to Provide QoS in IEEE Mesh Networks

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

ABSTRACT 1. INTRODUCTION RESEARCH ARTICLE

ABSTRACT 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 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

[2009] IEEE. Reprinted, with permission, from Basukala, Riyaj., Mohd Ramli Huda Adibah & Sandrasegaran, Kumbesan. 2009, 'Performance of Well Known

[2009] IEEE. Reprinted, with permission, from Basukala, Riyaj., Mohd Ramli Huda Adibah & Sandrasegaran, Kumbesan. 2009, 'Performance of Well Known [2009] IEEE. Reprnted, wth permsson, from Basukala, Ryaj., Mohd Raml Huda Adbah & Sandrasegaran, Kumbesan. 2009, 'Performance of Well Known Packet Schedulng Algorthms n the Downlnk 3GPP LTE System', Proceedngs

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

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

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

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

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

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

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

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

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

A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems

A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems Proceedngs of the Internatonal Conference on Parallel and Dstrbuted Processng Technques and Applcatons, PDPTA 2008, Las Vegas, Nevada, USA, July 14-17, 2008, 2 Volumes. CSREA Press 2008, ISBN 1-60132-084-1

More information

sensors ISSN

sensors ISSN Sensors 2011, 11, 5383-5401; do:10.3390/s110505383 OPEN ACCESS sensors ISSN 1424-8220 www.mdp.com/journal/sensors Artcle FRCA: A Fuzzy Relevance-Based Cluster Head Selecton Algorthm for Wreless Moble Ad-Hoc

More information

High Utility Video Surveillance System on Public Transport using WiMAX technology

High Utility Video Surveillance System on Public Transport using WiMAX technology Edth Cowan Unversty Research Onlne ECU Publcatons Pre. 2011 2010 Hgh Utlty Vdeo Survellance System on Publc Transport usng WMAX technology Iftekhar Ahmad Edth Cowan Unversty Daryoush Habb Edth Cowan Unversty

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

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

More information

Resource Allocation in Hybrid Macro/Femto Networks 1

Resource Allocation in Hybrid Macro/Femto Networks 1 Resource Allocaton n Hybrd acro/femto Networks Xaol Chu, Yuhua Wu Department of Electronc Engneerng Kng s College ondon ondon WCR S, UK E-mal: {xaol.chu, yuhua.wu}@kcl.ac.uk ama Benmesbah, Wng-Kuen ng

More information

Relational Analysis based Concurrent Multipath Transfer over Heterogeneous Vehicular Networks

Relational Analysis based Concurrent Multipath Transfer over Heterogeneous Vehicular Networks www.ijcsi.org 1 Relatonal Analyss based Concurrent Multpath Transfer over Heterogeneous Vehcular Networks Yuanlong Cao 1, Changqao Xu 1,2, Janfeng Guan 1, Ja Zhao 3, We Quan 1, Mngchuan Zhang 1 and Hongke

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

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks

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

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

Clustering Based Adaptive Power Control for Interference Mitigation in Two-Tier Femtocell Networks

Clustering Based Adaptive Power Control for Interference Mitigation in Two-Tier Femtocell Networks KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 8, NO. 4, Apr. 2014 1424 Copyrght c 2014 KSII Clusterng Based Adaptve Power Control for Interference Mtgaton n Two-Ter Femtocell Networks Hong

More information

New Method Based on Priority of Heterogeneous Traffic for Scheduling Techniques in M2M Communications over LTE Networks

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

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

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

Control strategies for network efficiency and resilience with route choice

Control strategies for network efficiency and resilience with route choice Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve

More information

MULTIHOP wireless networks are a paradigm in wireless

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

A New Transaction Processing Model Based on Optimistic Concurrency Control

A New Transaction Processing Model Based on Optimistic Concurrency Control A New Transacton Processng Model Based on Optmstc Concurrency Control Wang Pedong,Duan Xpng,Jr. Abstract-- In ths paper, to support moblty and dsconnecton of moble clents effectvely n moble computng envronment,

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

Efficient Routing Algorithm Based on Decisionmaking Sequence in Wireless Mesh Networks

Efficient Routing Algorithm Based on Decisionmaking Sequence in Wireless Mesh Networks 502 JOURNAL OF NETWORKS, VOL. 7, NO. 3, MARCH 2012 Effcent Routng Algorthm Based on Decsonmang Sequence n Wreless Mesh Networs Yngyng Qn, Rongbo Zhu * College of Computer Scence, South-Central Unversty

More information

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor

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

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

IJCTA Nov-Dec 2016 Available

IJCTA 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 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

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

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

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

Adaptive Subband Allocation in FH-OFDMA with Channel Aware Frequency Hopping Algorithm

Adaptive Subband Allocation in FH-OFDMA with Channel Aware Frequency Hopping Algorithm Internatonal Journal on Communcatons Antenna and Propagaton (I.Re.C.A.P.), Vol. 2,. ISS 2039-5086 February 202 Adaptve Subband Allocaton n FH-OFDMA wth Channel Aware Frequency Hoppng Algorthm Ardalan Alzadeh,

More information

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet

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

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons

More information

Enhancing Class-Based Service Architectures with Adaptive Rate Allocation and Dropping Mechanisms

Enhancing 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 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 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

ON THE IMPACT OF PRIORITISED RADIO RESOURCE CONTROL ON TCP CONNECTIONS IN A DOWNLINK UMTS CHANNEL

ON THE IMPACT OF PRIORITISED RADIO RESOURCE CONTROL ON TCP CONNECTIONS IN A DOWNLINK UMTS CHANNEL ON THE IMPACT OF PRIORITISED RADIO RESOURCE CONTROL ON TCP CONNECTIONS IN A DOWNLINK UMTS CHANNEL Ramon Ferrús, Juan Rendon 2, Anna Sfaropoulou 2, Xaver Revés, Ferran Casadevall Department of Sgnal Theory

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES

PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES ISSN 1819-668 www.arpnjournals.com PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES L. Audah 1, A.A.M. Kamal 1, J. Abdullah 1, S.A. Hamzah 1 and M.A.A. Razak 2 1 Optcal Communcaton

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

A proportional fair scheduling algorithm based on QoS utility function in wireless networks

A proportional fair scheduling algorithm based on QoS utility function in wireless networks Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal esearch, 2014, 6(5):1957-1963 esearch Artcle ISSN : 0975-7384 CODEN(USA) : JCPC5 A proportonal far schedulng algorthm based on QoS utlty

More information

Neural Network Control for TCP Network Congestion

Neural Network Control for TCP Network Congestion 5 Amercan Control Conference June 8-, 5. Portland, OR, USA FrA3. Neural Network Control for TCP Network Congeston Hyun C. Cho, M. Sam Fadal, Hyunjeong Lee Electrcal Engneerng/6, Unversty of Nevada, Reno,

More information

Improving Load Balancing mechanisms in Wireless Packet Networks 1

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

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks

MobileGrid: 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 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

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

Evaluation of Parallel Processing Systems through Queuing Model

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

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs

More information

Applications and Challenges of the e EDCA Mechanism: An Experimental Study

Applications and Challenges of the e EDCA Mechanism: An Experimental Study Applcatons and Challenges of the 80.e EDCA Mechansm: An Expermental Study Albert Banchs, Arturo Azcorra, Carlos García, and Rubén Cuevas, Unversty Carlos III of Madrd Abstract In ths artcle we conduct

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

Cost-Effective Lifetime Prediction Based Routing Protocol for Wireless Network

Cost-Effective Lifetime Prediction Based Routing Protocol for Wireless Network Cost-Effectve Lfetme Predcton Based Routng Protocol for Wreless Network ABU MD. ZAFOR ALAM, MUHAMMAD ARIFUR RAHMAN, MOHAMMED ABUL HASAN 2,M. LUTFAR RAHMAN Faculty of Scence and IT, Daffodl Internatonal

More information

DUE to the recent popularization of hand-held mobile

DUE to the recent popularization of hand-held mobile IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 15, NO. 4, APRIL 2016 803 Contact Duraton Aware Data Replcaton n DTNs wth Lcensed and Unlcensed Spectrum Jng Zhao, Student Member, IEEE, Xuejun Zhuo, Qnghua

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

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

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

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