A dynamic uplink scheduling scheme for WiMAX networks

Nada El-shennawy, M. Youssef, M. El-Derini, M. Fahmy
{"title":"A dynamic uplink scheduling scheme for WiMAX networks","authors":"Nada El-shennawy, M. Youssef, M. El-Derini, M. Fahmy","doi":"10.1109/ICCES.2013.6707183","DOIUrl":null,"url":null,"abstract":"Over the past few years, there has been a rapid growth of new services such as online video games, video conferences, and multimedia services to end users. WiMAX is an emerging technology for next generation wireless networks which supports a large number of users. To achieve Quality of Service (QoS) requirements, an efficient and reliable scheduling algorithm is urgently needed. Among a large number of the proposed approaches in the literature, a variably weighted round robin scheduling algorithm (VWRR) has been proven to provide the best performance in an IP backbone network with no attempts on WiMAX networks. This paper proposes a dynamic uplink scheduling algorithm for WiMAX networks based on VWRR to allocate the bandwidth to users to maximize the throughput and ensure the constraints of delay, jitter, and load. A comparative study between the proposed scheduling algorithm and the two most famous scheduling algorithms: weighted round robin algorithm (WRR) and modified deficit round robin algorithm (MDRR) over WiMAX networks, is presented. Simulation results obtained using OPNET reveal that the proposed algorithm has a superior performance compared with WRR with respect to throughput, delay, jitter, and load. Additionally, the proposed scheduling algorithm is shown to provide an excellent level of reliability and scalability when increasing the number of served subscriber stations.","PeriodicalId":277807,"journal":{"name":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th International Conference on Computer Engineering & Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2013.6707183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Over the past few years, there has been a rapid growth of new services such as online video games, video conferences, and multimedia services to end users. WiMAX is an emerging technology for next generation wireless networks which supports a large number of users. To achieve Quality of Service (QoS) requirements, an efficient and reliable scheduling algorithm is urgently needed. Among a large number of the proposed approaches in the literature, a variably weighted round robin scheduling algorithm (VWRR) has been proven to provide the best performance in an IP backbone network with no attempts on WiMAX networks. This paper proposes a dynamic uplink scheduling algorithm for WiMAX networks based on VWRR to allocate the bandwidth to users to maximize the throughput and ensure the constraints of delay, jitter, and load. A comparative study between the proposed scheduling algorithm and the two most famous scheduling algorithms: weighted round robin algorithm (WRR) and modified deficit round robin algorithm (MDRR) over WiMAX networks, is presented. Simulation results obtained using OPNET reveal that the proposed algorithm has a superior performance compared with WRR with respect to throughput, delay, jitter, and load. Additionally, the proposed scheduling algorithm is shown to provide an excellent level of reliability and scalability when increasing the number of served subscriber stations.
一种用于WiMAX网络的动态上行调度方案
在过去几年中,针对终端用户的在线视频游戏、视频会议和多媒体服务等新业务迅速增长。WiMAX是支持大量用户的下一代无线网络的新兴技术。为了满足服务质量(QoS)的要求,迫切需要一种高效可靠的调度算法。在文献中提出的大量方法中,可变加权轮询调度算法(VWRR)已被证明可以在IP骨干网中提供最佳性能,而无需尝试在WiMAX网络上进行调度。本文提出了一种基于VWRR的WiMAX网络动态上行调度算法,将带宽分配给用户,实现吞吐量最大化,同时保证时延、抖动和负载约束。将该调度算法与WiMAX网络上最著名的加权轮询算法(WRR)和改进赤字轮询算法(MDRR)进行了比较研究。基于OPNET的仿真结果表明,该算法在吞吐量、时延、抖动和负载等方面都优于WRR算法。此外,当增加服务用户站的数量时,所提出的调度算法提供了良好的可靠性和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信