面向WiMAX网状网络的端到端QoS感知贪婪分布式调度框架

A. Kapoor, V. Ribeiro
{"title":"面向WiMAX网状网络的端到端QoS感知贪婪分布式调度框架","authors":"A. Kapoor, V. Ribeiro","doi":"10.1109/COMSNETS.2010.5431964","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a greedy framework for distributed scheduling in the IEEE 802.16 MeSH mode, which uses a novel “End-to-end QoS aware bandwidth Reservation Protocol” (EQRP) to provide end-to-end QoS guarantee to intramesh flows. The proposed framework provides an efficient and integrated solution to QoS aware routing and call admission control in distributed WiMAX mesh networks. The framework does not rely on any special node for resource management which makes it more scalable and robust to node failures. To save expensive control overheads, EQRP learns from previous bandwidth reservation failures to maintain a rank list of next hops for every destination and uses the “Greedy Forwarding” algorithm to do bandwidth reservation using slot information from only two hop neighbor routers'. We compare EQRP with Race Free Protocol (RFP) and evaluate its performance with extensive simulations in ns2. Simulations show that for static WiMAX mesh network, the “Greedy Forwarding” algorithm used by EQRP admits approximately 10% more VOIP calls. For a random topology of 25 mesh routers, the aggregate signaling overhead generated by EQRP at a high call arrival rate of 1/2000 (calls/milli-seconds) is 76% less than that generated by RFP. In comparison with RFP, EQRP took 200 milli-seconds less average call setup time.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"An end-to-end QoS aware greedy distributed scheduling framework for WiMAX mesh networks\",\"authors\":\"A. Kapoor, V. Ribeiro\",\"doi\":\"10.1109/COMSNETS.2010.5431964\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a greedy framework for distributed scheduling in the IEEE 802.16 MeSH mode, which uses a novel “End-to-end QoS aware bandwidth Reservation Protocol” (EQRP) to provide end-to-end QoS guarantee to intramesh flows. The proposed framework provides an efficient and integrated solution to QoS aware routing and call admission control in distributed WiMAX mesh networks. The framework does not rely on any special node for resource management which makes it more scalable and robust to node failures. To save expensive control overheads, EQRP learns from previous bandwidth reservation failures to maintain a rank list of next hops for every destination and uses the “Greedy Forwarding” algorithm to do bandwidth reservation using slot information from only two hop neighbor routers'. We compare EQRP with Race Free Protocol (RFP) and evaluate its performance with extensive simulations in ns2. Simulations show that for static WiMAX mesh network, the “Greedy Forwarding” algorithm used by EQRP admits approximately 10% more VOIP calls. For a random topology of 25 mesh routers, the aggregate signaling overhead generated by EQRP at a high call arrival rate of 1/2000 (calls/milli-seconds) is 76% less than that generated by RFP. In comparison with RFP, EQRP took 200 milli-seconds less average call setup time.\",\"PeriodicalId\":369006,\"journal\":{\"name\":\"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2010.5431964\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2010.5431964","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

本文提出了一种基于IEEE 802.16 MeSH模式的贪婪分布式调度框架,该框架使用一种新颖的“端到端QoS感知带宽保留协议”(EQRP)为网内流提供端到端的QoS保证。该框架为分布式WiMAX网状网络中的QoS感知路由和呼叫接纳控制提供了一种高效、集成的解决方案。该框架不依赖于任何特殊的节点进行资源管理,这使得它在节点故障时更具可扩展性和鲁棒性。为了节省昂贵的控制开销,EQRP从以前的带宽保留失败中学习,维护每个目的地的下一跳的秩列表,并使用“贪婪转发”算法,只使用来自两个邻居路由器的槽位信息来进行带宽保留。我们将EQRP与RFP (Race Free Protocol)进行了比较,并在ns2中进行了大量的仿真,评估了其性能。仿真结果表明,对于静态WiMAX网状网络,EQRP采用的“贪婪转发”算法可多接收约10%的VOIP呼叫。对于25个网状路由器的随机拓扑,EQRP在1/2000(呼叫/毫秒)的高呼叫到达率下产生的总信令开销比RFP产生的总信令开销少76%。与RFP相比,EQRP的平均呼叫建立时间减少了200毫秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An end-to-end QoS aware greedy distributed scheduling framework for WiMAX mesh networks
In this paper, we propose a greedy framework for distributed scheduling in the IEEE 802.16 MeSH mode, which uses a novel “End-to-end QoS aware bandwidth Reservation Protocol” (EQRP) to provide end-to-end QoS guarantee to intramesh flows. The proposed framework provides an efficient and integrated solution to QoS aware routing and call admission control in distributed WiMAX mesh networks. The framework does not rely on any special node for resource management which makes it more scalable and robust to node failures. To save expensive control overheads, EQRP learns from previous bandwidth reservation failures to maintain a rank list of next hops for every destination and uses the “Greedy Forwarding” algorithm to do bandwidth reservation using slot information from only two hop neighbor routers'. We compare EQRP with Race Free Protocol (RFP) and evaluate its performance with extensive simulations in ns2. Simulations show that for static WiMAX mesh network, the “Greedy Forwarding” algorithm used by EQRP admits approximately 10% more VOIP calls. For a random topology of 25 mesh routers, the aggregate signaling overhead generated by EQRP at a high call arrival rate of 1/2000 (calls/milli-seconds) is 76% less than that generated by RFP. In comparison with RFP, EQRP took 200 milli-seconds less average call setup time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信