AQuA: aggregated queueing algorithm for CDMA2000 base station controll

Vikas Paliwal, B. Nandy, I. Lambadaris
{"title":"AQuA: aggregated queueing algorithm for CDMA2000 base station controll","authors":"Vikas Paliwal, B. Nandy, I. Lambadaris","doi":"10.1109/GLOCOM.2005.1578286","DOIUrl":null,"url":null,"abstract":"The increasing need for enhanced data services in cellular networks requires sharing of scarce wireless channel resources among the mobile users by dynamic channel assignments. It has been shown in previous works that such a scheme causes queue management problems in the buffers shared by multiple mobiles, e.g. the input buffer at base station controller (BSC), when their rates are increased after a period of lower aggregate data rate in radio links. Traditionally buffer management techniques like random early detection (RED) are used for a single buffer only. In this paper, we extend the RED algorithm to an aggregated queueing algorithm (AQuA) that simultaneously regulates the queueing discipline in both the shared and individual link buffers so that buffer overflow problems after aggregate link rate increase do not occur. Our algorithm relies on standard information on queueing backlog in link buffers available at BSC to perform buffer management in a unified manner with shared buffer. Furthermore, we demonstrate that our approach provides significantly greater determinism in packet transit delays over BSC and greater throughputs and similar levels of fairness as RED mechanism in shared buffers in conjunction with unregulated link buffers","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"14 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2005.1578286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The increasing need for enhanced data services in cellular networks requires sharing of scarce wireless channel resources among the mobile users by dynamic channel assignments. It has been shown in previous works that such a scheme causes queue management problems in the buffers shared by multiple mobiles, e.g. the input buffer at base station controller (BSC), when their rates are increased after a period of lower aggregate data rate in radio links. Traditionally buffer management techniques like random early detection (RED) are used for a single buffer only. In this paper, we extend the RED algorithm to an aggregated queueing algorithm (AQuA) that simultaneously regulates the queueing discipline in both the shared and individual link buffers so that buffer overflow problems after aggregate link rate increase do not occur. Our algorithm relies on standard information on queueing backlog in link buffers available at BSC to perform buffer management in a unified manner with shared buffer. Furthermore, we demonstrate that our approach provides significantly greater determinism in packet transit delays over BSC and greater throughputs and similar levels of fairness as RED mechanism in shared buffers in conjunction with unregulated link buffers
AQuA:用于CDMA2000基站控制的聚合排队算法
蜂窝网络对增强型数据业务的需求日益增长,这就要求移动用户通过动态信道分配来共享稀缺的无线信道资源。在以前的工作中已经表明,这种方案会导致多个移动共享缓冲区中的队列管理问题,例如基站控制器(BSC)的输入缓冲区,当它们的速率在无线电链路中较低的总数据速率一段时间后增加时。传统上,像随机早期检测(RED)这样的缓冲区管理技术只用于单个缓冲区。在本文中,我们将RED算法扩展为一种聚合排队算法(AQuA),该算法同时调节共享和单个链路缓冲区中的排队规则,从而避免聚合链路速率增加后的缓冲区溢出问题。我们的算法依赖于BSC可用的链路缓冲区中排队积压的标准信息,以共享缓冲区的方式进行统一的缓冲区管理。此外,我们证明了我们的方法在BSC上的数据包传输延迟方面提供了更大的确定性,并且在与非管制链路缓冲区一起使用的共享缓冲区中提供了更大的吞吐量和类似级别的公平性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信