{"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