基于信息传播的WiMAX网状网络瞬时呼叫接纳控制

R. Manickam, C. Murthy
{"title":"基于信息传播的WiMAX网状网络瞬时呼叫接纳控制","authors":"R. Manickam, C. Murthy","doi":"10.1109/COMSNETS.2011.5716482","DOIUrl":null,"url":null,"abstract":"Although the IEEE 802.16 standard defines various QoS classes and their associated parameters, it does not define the scheduling, routing, and Call Admission Control (CAC) algorithms to be used in the network. It is left unstandardized for vendor differentiation. Currently, scalable distributed scheduling and routing algorithms are available for IEEE 802.16 mesh networks. But, the existing CAC algorithms are not entirely distributed and hence are not scalable. The algorithms not only create a bottleneck at the first hop nodes, but may also introduce an unbounded delay during the connection setup phase. In this paper, we propose an Instantaneous CAC algorithm which uses per-hop multi path routing for IEEE 802.16 mesh networks. Also, the proposed CAC algorithm eliminates the unbounded connection initiation delay and generates information for distributed routing tables. Finally, using extensive simulations, we compare the proposed protocol with Shortest Widest Efficient Bandwidth (SWEB) and Greedy Choice with Bandwidth Availability aware Defragmentation (GCAD). Simulations show that the proposed protocol eliminates the CAC delay and also improves the system throughput. The proposed protocol, reduces the number of packets (VBR and CBR) exceeding the delay requirements by about 15% and the connection delay by about 40%.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An instantaneous call admission control using information dissemination for WiMAX mesh networks\",\"authors\":\"R. Manickam, C. Murthy\",\"doi\":\"10.1109/COMSNETS.2011.5716482\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although the IEEE 802.16 standard defines various QoS classes and their associated parameters, it does not define the scheduling, routing, and Call Admission Control (CAC) algorithms to be used in the network. It is left unstandardized for vendor differentiation. Currently, scalable distributed scheduling and routing algorithms are available for IEEE 802.16 mesh networks. But, the existing CAC algorithms are not entirely distributed and hence are not scalable. The algorithms not only create a bottleneck at the first hop nodes, but may also introduce an unbounded delay during the connection setup phase. In this paper, we propose an Instantaneous CAC algorithm which uses per-hop multi path routing for IEEE 802.16 mesh networks. Also, the proposed CAC algorithm eliminates the unbounded connection initiation delay and generates information for distributed routing tables. Finally, using extensive simulations, we compare the proposed protocol with Shortest Widest Efficient Bandwidth (SWEB) and Greedy Choice with Bandwidth Availability aware Defragmentation (GCAD). Simulations show that the proposed protocol eliminates the CAC delay and also improves the system throughput. The proposed protocol, reduces the number of packets (VBR and CBR) exceeding the delay requirements by about 15% and the connection delay by about 40%.\",\"PeriodicalId\":302678,\"journal\":{\"name\":\"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-02-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2011.5716482\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2011.5716482","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

虽然IEEE 802.16标准定义了各种QoS类及其相关参数,但它没有定义网络中使用的调度、路由和呼叫允许控制(CAC)算法。由于供应商的差异,它没有标准化。目前,可扩展的分布式调度和路由算法可用于IEEE 802.16 mesh网络。但是,现有的CAC算法不是完全分布式的,因此不具有可扩展性。这些算法不仅在第一跳节点上造成瓶颈,而且还可能在连接建立阶段引入无界延迟。在本文中,我们提出了一种基于IEEE 802.16网状网络的每跳多路径路由的瞬时CAC算法。此外,所提出的CAC算法消除了无界连接发起延迟,并为分布式路由表生成信息。最后,通过广泛的仿真,我们将所提出的协议与最短最宽有效带宽(SWEB)和贪婪选择与带宽可用性感知碎片整理(GCAD)进行了比较。仿真结果表明,该协议消除了CAC延迟,提高了系统吞吐量。该协议将超过延迟要求的数据包(VBR和CBR)减少约15%,连接延迟减少约40%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An instantaneous call admission control using information dissemination for WiMAX mesh networks
Although the IEEE 802.16 standard defines various QoS classes and their associated parameters, it does not define the scheduling, routing, and Call Admission Control (CAC) algorithms to be used in the network. It is left unstandardized for vendor differentiation. Currently, scalable distributed scheduling and routing algorithms are available for IEEE 802.16 mesh networks. But, the existing CAC algorithms are not entirely distributed and hence are not scalable. The algorithms not only create a bottleneck at the first hop nodes, but may also introduce an unbounded delay during the connection setup phase. In this paper, we propose an Instantaneous CAC algorithm which uses per-hop multi path routing for IEEE 802.16 mesh networks. Also, the proposed CAC algorithm eliminates the unbounded connection initiation delay and generates information for distributed routing tables. Finally, using extensive simulations, we compare the proposed protocol with Shortest Widest Efficient Bandwidth (SWEB) and Greedy Choice with Bandwidth Availability aware Defragmentation (GCAD). Simulations show that the proposed protocol eliminates the CAC delay and also improves the system throughput. The proposed protocol, reduces the number of packets (VBR and CBR) exceeding the delay requirements by about 15% and the connection delay by about 40%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信