The bandwidth allocation by queue length (BA-QL) for WiMAX network

Hann-Tzong Chern, Bo Xu
{"title":"The bandwidth allocation by queue length (BA-QL) for WiMAX network","authors":"Hann-Tzong Chern, Bo Xu","doi":"10.1109/ICIST.2013.6747722","DOIUrl":null,"url":null,"abstract":"Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here. In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2013.6747722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here. In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.
WiMAX网络按队列长度分配带宽(BA-QL)
全球微波接入互操作性(WiMAX)是一种宽带无线接入(BWA)技术。它提供高数据速率和多媒体服务。它还支持各种类型应用程序的服务质量(QoS)。在这种网络中,为保证实时业务的延时,避免非实时业务的饥饿,对不同类别的业务分配适当的资源是很重要的。在IEEE 802.16中,这部分还有待探索。该网络中有一个连接允许控制(CAC)机制,允许连接预先保留带宽。然而,要很好地预测所需的带宽并不容易。预留带宽可能并不总是满足其负载。因此,本文提出了一种适应负载的算法。本文在第一阶段为每个连接分配预留带宽。然后,提出了两种可能的加权公平队列(WFQ)算法。在第一种方法中,权重由连接的左队列长度决定。在第二种方法中,权重由左队列长度和连接的类别决定。在此阶段,分配将继续,直到帧的带宽耗尽或队列中的所有数据包都已调度。对这两种方法进行了仿真并与轮循算法进行了比较。结果表明,这些算法能够适应网络的负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信