Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
|
|
- Gloria Page
- 5 years ago
- Views:
Transcription
1 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, Hsn-Chu 3000, Tawan Department of Informaton and Computer Engneerng Chung-Yuan Chrstan Unversty, Chung-L, Tao-Yuan 303, Tawan Informaton and Communcatons Research Laboratores Industral Technology Research Insttute, Chu-Tung, Hsn-Chu 3040, Tawan Emal: {jmlang, chencz, wangyc, yctseng}@cs.nctu.edu.tw, bpln@tr.org.tw Abstract The IEEE 80.6 standard s proposed to provde a wde-range broadband wreless servce, but t leaves the mplementaton of the wreless resource scheduler as an open ssue. We thus propose a prorty-based schedulng algorthm to arrange resources for downlnk traffcs n an IEEE 80.6 broadband wreless network. The dea s to dfferentate the moble subscrber statons wth good condtons from those wth bad condtons, and to dfferentate the urgent real-tme traffcs from the non-real-tme ones. Thus, the network throughput can be mproved whle the delays of real-tme traffcs can be allevated. In addton, our desgn also keeps farness n mnd, so non-real-tme traffcs wll not be starved. Smulaton results show that our schedulng algorthm can ncrease the network throughput, mantan the long-term farness, and keep packet droppng ratos of real-tme traffcs low, as compared wth exstng results. Index Terms IEEE 80.6, far schedulng, qualty of servce (QoS), resource management, WMAX. I. INTRODUCTION Recently, the IEEE 80.6 standard [], [] has been proposed to support wde-range broadband wreless access. The standard s objectve s to use a more flexble and economcal way to solve the last mle problem n a metropoltan area network, as compared wth tradtonal wred access networks such as fber optcs or T lnks [3], [4]. IEEE 80.6 supports the pont-to-multpont (PMP) mode, where one base staton (BS) can drectly communcate wth several moble subscrber statons (MSSs). The BS wll manage network resources for these MSSs. Based on the standard, the resource unt s defned by physcal layer specfcatons. In ths paper, we use slot as the resource unt whch s defned by the mandatory physcal layer specfcaton, called orthogonal frequency dvson multplexng (OFDM) and orthogonal frequency dvson multplexng access (OFDMA). The IEEE 80.6 standard also defnes fve types of schedulng servces to support QoS (qualty of servce). They are unsolcted grant servce (UGS), real-tme pollng servce (rtps), extended rtps (ertps), non-real-tme pollng servce (nrtps), and best effort (BE). Brefly, these fve types of schedulng servces can be classfed nto real-tme servces (ncludng UGS, rtps, and ertps) and non-real-tme servces (ncludng nrtps and BE). In the IEEE 80.6 MAC layer, a scheduler s defned to manage wreless resources for these servces. However, how to mplement the scheduler leaves an open ssue n the standard. Therefore, n ths paper, we propose a schedulng algorthm to arrange resources for downlnk traffcs n an IEEE 80.6 broadband wreless network. In the lterature, several studes also consder schedulng downlnk traffcs n an IEEE 80.6 broadband wreless network. The work n [5] proposes a modfed proportonal far () method to ncrease the network throughput whle mantanng farness. In [6], a utlty functon s proposed to evaluate the tradeoff between network throughput and farness. In [7], a proportonal farness scheme based on sgnal-to-nose rato s proposed to acheve rate maxmzaton. However, the above studes consder only non-real-tme traffcs. The work n [8] assgns prortes to dfferent traffcs to satsfy ther QoS requrements, but t does not consder the farness ssue. The work n [9] models the schedulng problem as an M/M//K queung system, whose objectve s to mnmze the blockng probablty. However, t may not guarantee the delays of realtme traffcs. In ths paper, we propose a prorty-based schedulng algorthm to manage downlnk traffcs n IEEE 80.6 broadband wreless networks. Our objectves are to mprove the network throughput, to satsfy the delay constrants of real-tme traffcs, and to acheve far resource dstrbuton among MSSs. The basc dea s to assgn prortes to MSSs accordng to ther condtons and buffered traffcs. In partcular, the MSSs wth good condtons wll have a hgher prorty compared wth those wth bad condtons, so the network throughput can be ncreased snce MSSs can use a hgher rate to transmt ther data. In addton, the MSSs wth urgent real-tme traffcs wll be assgned wth a hgh prorty to allevate ther traffc delays. On the other hand, the prortes of those MSSs that have queued a large amount of non-realtme traffcs wll be rased to prevent them from starvng. In ths way, both the delays of real-tme traffcs can be allevated whle the long-term farness can be mantaned. The rest of ths paper s organzed as follows. Secton II formally defnes our resource allocaton problem. Secton III presents our schedulng algorthm. Smulaton results are gven n Secton IV. Secton V concludes ths paper.
2 TABLE I SUMMARY OF NOTATIONS. notaton n M r R, rn b R, bn a R, an c c avg s N δ F f c f T w R, w N defnton the number of admtted MSSs n the system the th MSS n ths system the request average real-tme data rate and the request mnmal non-real-tme data rate of M, respectvely the amounts of real-tme and non-real-tme buffered data of M, respectvely the amounts of resources allocated to M for real-tme and non-real-tme data, respectvely the current rate of M the average rate of M n the recent f T frames the non-real-tme rate satsfacton rato of M n the most recent f T frames the rato of MSSs for pror real-tme data allocaton the number of free slots n the current downlnk subframe the current frame ndex the wndow sze for farness measurement the weghts of real-tme and non-real-tme data, repsectvely II. PROBLEM STATEMENT We consder the downlnk communcaton n an IEEE 80.6 OFDMA system wth one BS supportng multple MSSs under the PMP mode. When an MSS needs to ntate a traffc flow, t has to ask for the BS s permsson. The BS can admt the connecton f t has enough resource to support the QoS requrement of that traffc flow; otherwse, the traffc flow wll be dropped. We are gven n MSSs, where each of them requests an average real-tme data rate of r R (n bts/frame) and a mnmum non-real-tme data rate of r N (n bts/frame), and uses a rate of c,k (n bts/slot) at frame k. The schedulng problem asks how to determne the resource a,k (n bts) allocated to each MSS M, =..n, n every frame k, such that the network throughput s maxmzed, the long-term farness among MSSs s satsfed, and the delays of real-tme traffcs are guaranteed. Here, referrng to [0], [], we defne a farness ndex (FI) to evaluate the long-term farness of a schedulng algorthm as: F I = ( n = SD ) n n = (SD ), () SD = wr f T a R,f c j f T r R a N,f c j + wn f T f T r N where f c s the current frame ndex, f T s the wndow sze (n frames) that we measure farness, a R,f c j and an,f c j (both n bts) are the resources allocated to M for real-tme and nonreal-tme traffcs at frame f c j, respectvely, and w R and w N are weghts that we put on real-tme and non-real-tme traffcs, respectvely, such that w R + w N =. In partcular, 0 < F I and a schedulng algorthm s consdered to be more far f ts FI s larger. Table I summarzes the notatons used n ths paper. III. THE PRIORITY-BASED SCHEDULING ALGORITHM Fg. llustrates the system archtecture of our proposed scheduler. Snce the scheduler wll handle each downlnk subframe, we omt the frame ndex k n the followng. When schedulng each frame, the scheduler wll frst query the MAC/physcal layers for the current rate c of each, () rate c Fg.. () rate requrement r & r scheduler (3) buffered data b & b. determne the prorty of each MSS accordng to ()-(3). run the prorty-based schedulng algorthm to allocate bandwdth ( a, a ) for each MSS R (5) decson a & a MAC/physcal layers packets The system archtecture of our proposed scheduler. MSS and the total free space F (n slots) of the current downlnk subframe. Then, gven the rate requrement (r R, rn ) and the buffered data (b R, bn ) of each MSS, the scheduler wll calculate ts prorty. Based on these prortes, the scheduler can execute our proposed prorty-based schedulng algorthm to determne the bandwdth (a R, an ) allocated to each MSS. Such a decson wll be sent to the MAC/physcal layers to arrange free slots for transmsson. Gven the current rate c, buffered real-tme data b R (n bts), real-tme data rate r R, and non-real-tme traffc satsfacton rato s N of an MSS M, we can calculate ts prorty p as follows: p = c c c avg br r R s N N (4) free space F, () where c avg s the average rate of M and s N s defned
3 as s N = mn {, ft } a N,f c j f T r N. (3) Note that M has a hgher prorty f ts p s larger. In the above Eq. (), the frst term means that we wll assgn a hgher prorty to those MSSs that can use hgher rates. The second term means that we wll assgn a hgher prorty to those MSSs that have a better condton (as compared wth ther hstorcal condtons). These two terms beneft the MSSs wth good qualtes to mprove the network throughput. The thrd term means that we wll assgn a hgher prorty to those MSSs that requre more tme to transmt ther buffered real-tme data. Ths term s to allevate the delays of real-tme traffcs. The last term means that we wll gve a hgher prorty to those MSSs that have queued a large amount of non-real-tme data. Ths term s to prevent non-real-tme traffcs from starvaton. The scheduler then allocates slot resources to MSSs accordng to ther prortes. However, to allevate the delays of realtme traffcs, we should frst allocate resources to those MSSs that have urgent data, whch are real-tme data that wll be dropped f they are not sent n the current frame. Then, we should select a δ rato of hgh-prorty MSSs to serve ther realtme data, where 0 δ <. If we stll have free resource, we can dstrbute t to MSSs accordng to ther prortes. In partcular, our proposed prorty-based schedulng algorthm nvolves n the followng steps:. We sort n MSSs by ther prortes n a descendng order. Below, we examne each MSS usng ths order.. Let d be the sze of M s urgent data, =..n. For each M wth d > 0, we allocate t wth a resource of a = mn {c (F σ ), d }, (4) where F s the number of free slots n the current downlnk subframe and σ s the summaton of allocated slots for all MSSs except M, that s, σ = aj. j,j Here, c (F σ ) means the total remanng bts that the BS can gve M n the current downlnk subframe, usng M s rate c. 3. We then select the frst δn MSSs to serve ther realtme data. For each such MSS M, we allocate t wth a resource of a = mn { c (F σ ), b R }. (5) 4. For each M, =..n, we allocate t wth a resource of a = mn { c (F σ ), b R + b N }. (6) 5. For each M, =..n, we set a R = mn{b R, a } and a N = a a R. Note that n step 3, we serve the real-tme traffcs of the frst δn MSSs f there stll remans free space. Ths s to avod cumulatng too much urgent real-tme data n the followng frames. If there are free slots after step 3, we can dstrbute c j pt pt condton x- condton x condton x+ Fg.. The three-state Markov chan to model the change of condtons of MSSs. them among MSSs, as shown n step 4. Fnally, n step 5, we transform the result of assgnment a nto (a R, an ) to serve the real-tme and non-real-tme traffcs of each MSS M. Snce d b R b R + b N, we have Eq. (4) Eq. (5) Eq. (6). So, M can be allocated wth enough slots by Eq. (5) to support ts urgent data. Smlarly, M can be allocated wth enough slots by Eq. (6) to support all ts real-tme data. IV. SIMULATION RESULTS In ths secton, we present some smulaton results to verfy the effectveness of our algorthm. We develop a smulator by C++ language. Table II lsts the system parameters used n our smulator, whch follows those defned n the IEEE 80.6 standard. For each MSS, ts admtted real-tme data rate r R and nonreal-tme data rate r N are randomly selected from [0, 400] bts per frame. The condton of an MSS wll change durng the smulatons. We use a three-state Markove chan [] to model the change of condtons, as shown n Fg.. In partcular, let MCS = {QPSK/, QPSK3/4, 6QAM/, 6QAM3/4, 64QAM/, 64QAM3/4} be the lst of modulaton and codng schemes and M CS[x] denote the scheme wth ndex x. Suppose that an MSS uses the scheme of MCS[x] under ts condton at the current frame. There s a probablty of that t has to use the scheme of M CS[x ] when the condton becomes worse at the next frame. Also, there s a probablty of that t can use the scheme of M CS[x + ] when the condton becomes better at the next frame. In addton, there s a probablty of that the condton of the MSS remans the same at the next frame. We set the transton probablty = 0.5 and the x value of each MSS s randomly selected from to 5. The (.e., n) s ranged from 0 to 70. Due to the lmted resource, the system can totally serve at most 70 MSSs. We compare our proposed algorthm aganst the Max-Throughput () scheme and the scheme [5]. The scheme always selects the MSS wth the best condton c to serve. The scheme assgns prortes to MSSs accordng to ther c values and data rates. In our smulatons, the values of weghts w R and w N are set to 0.9 and 0., respectvely.
4 TABLE II SYSTEM PARAMETERS USED IN OUR SIMULATOR. parameter value FFT (fast Fourer transform) sze 04 zone category PUSC (partal usage of sub) wth reuse modulaton and codng scheme QPSK/, QPSK3/4, 6QAM/, 6QAM3/4, 64QAM/, and 64QAM3/4 frame duraton 5 ms types of real-tme traffcs UGS and rtps types of non-real-tme traffcs nrtps and BE netowrk throughput (Mbps) Fg. 3. Comparson on network throughput of dfferent schedulng schemes. farness ndex Fg Comparson on farness ndces of dfferent schedulng schemes. A. Network Throughput We frst compare the network throughput of these three schedulng schemes. Fg. 3 llustrates the effect of dfferent numbers of MSSs on the network throughput. We can observe that when the s smaller than 40, the network throughput of all schedulng schemes are smlar. Ths s because qute few MSSs ask for transmsson, so the effect of dfferent schedulng schemes s not sgnfcant. However, when the grows, our schedulng algorthm can mprove the network throughput as compared wth the and schemes. Ths s because our scheduler wll assgn a hgher prorty to two knds of MSSs: ) the MSSs that have a better condton (.e., a larger c ) and ) the MSSs whose current condton s better than ther hstorcal condtons (.e., c > c avg ). In ths way, the MSSs can use a hgher data rate to transmt ther packets, so the network throughput can be ncreased. B. Farness Index Although our schedulng algorthm benefts those MSSs that can transmt data usng hgh data rates, t stll can mantan long-term farness among all MSSs. Ths s verfed n Fg. 4, whch demonstrates the effect of dfferent numbers of MSSs on the farness ndex (.e., Eq. ()). We can observe that the farness ndex of our schedulng algorthm s stll close to, even though there are 70 MSSs n the system. Ths s because our scheduler wll assgn a hgher prorty to those MSSs that have queued a large amount of data. On the other hand, the farness ndces of both the and schemes drop sgnfcantly when the grows, because they only allow the MSSs wth better condtons to transmt ther data frst. C. Packet Droppng Ratos of Real-Tme Traffcs We then compare the packet droppng ratos of real-tme traffcs under dfferent schedulng schemes. Fg. 5 llustrates the effect of dfferent numbers of MSSs on the packet droppng ratos of real-tme traffcs. When the s more than or equal to 50, the network starts saturated. We can observe that the packet droppng ratos of both the and schemes ncrease when the ncreases. Ths s because they do not dfferentate real-tme traffcs from non-real-tme ones, causng a large amount of non-realtme traffcs to contend wth urgent real-tme traffcs. On the other hand, by makng MSSs transmt ther urgent real-tme traffcs frst, our schedulng algorthm can result n zero packet droppng rato, even though there are 70 MSSs n the system. Ths verfes the effectveness of our algorthm. D. Satsfacton Ratos of Non-Real-Tme Traffcs Although our schedulng algorthm benefts real-tme traffcs, t does not starve non-real-tme traffcs. Ths s verfed n Fg. 6, whch demonstrates the effect of dfferent numbers of MSSs on the satsfacton rato of non-real-tme traffcs (.e., Eq. (3)). We can observe that the satsfacton rato of our schedulng algorthm s stll close to, even though there are 70 MSSs n the system. Ths s because our scheduler wll assgn a hgher prorty to those MSSs that have queued a large amount of non-real-tme data. On the other hand, the
5 packet droppng rato Fg. 5. Comparson on packet droppng ratos of real-tme traffcs under dfferent schedulng schemes. satsfacton rato Fg. 6. Comparson on satsfacton rato of non-real-tme traffcs under dfferent schedulng schemes. satsfacton rato of both the and schemes drop sgnfcantly when the grows, especally when the s more than 50. Ths s because they do not consder the queue lengths of MSSs, makng nonreal-tme traffcs starvaton. ACKNOWLEDGEMENT Y.-C. Tseng s research s co-sponsored by MoE ATU Plan, by NSC grants 96-8-E , E , 97- -E MY3, and 98-9-E , by MOEA under grant 98-EC-7-A-0-S-0048, and by ITRI, Tawan. REFERENCES [] IEEE Std , IEEE Standard for Local and Metropoltan Area Networks Part 6: Ar Interface for Fxed Broadband Wreless Access Systems, 004. [] IEEE Std 80.6e-005, IEEE Standard for Local and Metropoltan Area Networks Part 6: Ar Interface for Fxed and Moble Broadband Wreless Access Systems Amendment : Physcal and Medum Access Control Layers for Combned Fxed and Moble Operaton n Lcensed Bands and Corrgendum, 006. [3] A. Ghosh, D. Wolter, J. G. Andrews, and R. Chen, Broadband wreless access wth WMax/80.6: current performance benchmarks and future potental, IEEE Communcatons Magazne, vol. 43, no., pp. 9 36, 005. [4] C. Eklund, R. B. Marks, K. L. Stanwood, and S. Wang, IEEE Standard 80.6: a techncal overvew of the WrelessMAN TM ar nterface for broadband wreless access, IEEE Communcatons Magazne, vol. 40, no. 6, pp , 00. [5] J. Km, E. Km, and K. S. Km, A new effcent BS scheduler and schedulng algorthm n WBro systems, n IEEE Internatonal Conference on Advanced Communcaton Technology, vol. 3, 006, pp [6] J. Sh and A. Hu, Maxmum utlty-based resource allocaton algorthm n the IEEE 80.6 OFDMA System, n IEEE Internatonal Conference on Communcatons, 008, pp [7] Y. Ma, Rate-maxmzaton schedulng for downlnk OFDMA wth long term rate proportonal farness, n IEEE Internatonal Conference on Communcatons, 008, pp [8] X. Zhu, J. Huo, S. Zhao, Z. Zeng, and W. Dng, An adaptve resource allocaton scheme n OFDMA based multservce WMAX systems, n IEEE Internatonal Conference on Advanced Communcaton Technology, 008, pp [9] N. A. Al, M. Hayajneh, and H. Hassanen, Cross layer schedulng algorthm for IEEE 80.6 broadband wreless networks, n IEEE Internatonal Conference on Communcatons, 008, pp [0] D. M. Chu and R. Jan, Analyss of the ncrease and decrease algorthms for congeston avodance n computer networks, Journal of Computer Networks and ISDN, vol. 7, no., pp. 4, 989. [] Y. C. Wang, Y. C. Tseng, and W. Chen, MR-FQ: a far schedulng algorthm for wreless networks wth varable transmsson rates, SCS Smulaton, vol. 8, no. 8, pp , 005. [] P. Y. Wu, J. J. Chen, Y. C. Tseng, and H. W. Lee, Desgn of QoS and admsson control for VoIP Servces over IEEE 80.e WLANs, Journal of Informaton Scence and Engneerng, vol. 4, no. 4, pp , 008. V. CONCLUSIONS In ths paper, we have proposed a prorty-based schedulng algorthm for the downlnk communcaton n an IEEE 80.6 broadband wreless network. Our schedulng algorthm can allocate resources to MSSs based on ther condtons and buffered data. The MSSs wth good condtons and urgent real-tme data wll be served frst. In ths way, we can not only ncrease the network throughput but also allevate the delays of real-tme traffcs. Our schedulng algorthm also addresses the farness ssue, so non-real-tme traffcs are not starved. Smulaton results have shown that our schedulng algorthm can mprove the network throughput, mantan the long-term farness, allevate the packet droppng ratos of realtme traffcs, and ncrease the satsfacton ratos of non-realtme traffcs.
Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationEnhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More 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 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 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 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 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 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 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 informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More 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 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 informationBuffer Management Algorithm Design and Implementation Based on Network Processors
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Buffer Management Algorthm Desgn and Implementaton Based on Network Processors Yechang Fang, Kang Yen Dept. of Electrcal and Computer
More 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 informationHigh 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationQoS-aware composite scheduling using fuzzy proactive and reactive controllers
Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve
More informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More information[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 informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More 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 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 informationLearning 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 informationCognitive Radio Resource Management Using Multi-Agent Systems
Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North
More informationUtility 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 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 informationA Frame Packing Mechanism Using PDO Communication Service within CANopen
28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The
More informationNeural 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 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 informationUSER CLASS BASED QoS DIFFERENTIATION IN e WLAN
USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee
More 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 informationWIRELESS communication technology has gained widespread
616 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 6, NOVEMBER/DECEMBER 2005 Dstrbuted Far Schedulng n a Wreless LAN Ntn Vadya, Senor Member, IEEE, Anurag Dugar, Seema Gupta, and Paramvr Bahl, Senor
More 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 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 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 informationInterclass Collision Protection for IEEE e Wireless LANs
Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based
More 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 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 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 informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationGateway Algorithm for Fair Bandwidth Sharing
Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca
More informationQoS-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 information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationHigh Performance DiffServ Mechanism for Routers and Switches: Packet Arrival Rate Based Queue Management for Class Based Scheduling
Hgh Performance DffServ Mechansm for Routers and Swtches: Packet Arrval Rate Based Queue Management for Class Based Schedulng Bartek Wydrowsk and Moshe Zukerman ARC Specal Research Centre for Ultra-Broadband
More 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 informationClustering 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 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 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 informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More 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 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 informationEfficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks
1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.
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 informationUse of Genetic Algorithms in Efficient Scheduling for Multi Service Classes
Use of Genetc Algorthms n Effcent Schedulng for Mult Servce Classes Shyamale Thlakawardana and Rahm Tafazoll Centre for Communcatons Systems Research (CCSR), Unversty of Surrey, Guldford, GU27XH, UK Abstract
More 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 informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
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 informationDesign and implementation of priority and timewindow based traffic scheduling and routingspectrum allocation mechanism in elastic optical networks
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Desgn and mplementaton of prorty and tmewndow based traffc schedulng and routngspectrum allocaton mechansm n elastc optcal networks To cte ths artcle:
More informationAdaptive 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 informationA 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 informationA 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 informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leadng publsher of Open Access books Bult by scentsts, for scentsts 3,500 108,000 1.7 M Open access books avalable Internatonal authors and edtors Downloads Our authors are
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 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 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 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 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 informationARTICLE IN PRESS. Computer Networks xxx (2008) xxx xxx. Contents lists available at ScienceDirect. Computer Networks
Computer Networks xxx (28) xxx xxx Contents lsts avalable at ScenceDrect Computer Networks journal homepage: www.elsever.com/locate/comnet On applyng far queung dscplne to schedule requests at access gateway
More informationResource 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 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 informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
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 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 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 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 informationABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN*
ARC: An End-to-End Rate Adaptaton Scheme for Multmeda Streamng over Wreless LAN We Wang Soung C Lew Jack Y Lee Department of Informaton Engneerng he Chnese Unversty of Hong Kong Shatn N Hong Kong {wwang2
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 informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More 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 informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More information