Optimal robust policies for bandwidth allocation and admission control in wireless networks
Article No.: 25, Pages 1 - 9
Abstract
We consider joint strategies of bandwidth allocation and admission control for elastic users competing for a downlink data channel in a cellular network. For the sake of robustness and generality of the results we focus on the set of strategies whose performance does not depend on the detailed traffic characteristics beyond the traffic intensity. Performance is studied at the flow level in a dynamic setting where users come and go over time. A number of user classes are considered, which are characterized by their achievable bit rate, guaranteed throughput, arrival rate and mean flow size. We aim at characterizing a strategy which is optimal in the sense of having the lowest blocking probability. Such characterization provides some interesting insights into the optimal policy and its evolution as the system load increases. Unfortunately, from a practical perspective computing the optimal policy can be exceedingly complex except for lightly loaded systems. Alternatively, we propose a computationally feasible suboptimal policy that achieves a good relative performance.
References
[1]
S. Aalto, U. Ayesta, S. Borst, V. Misra, and R. Núñez-Queija. Beyond processor sharing. SIGMETRICS Performance Evaluation Review, 34(4):36--43, 2007.
[2]
E. Altman, K. Avrachenkov, and U. Ayesta. A survey on discriminatory processor sharing. Queueing Systems, 53(1):53--63, 2006.
[3]
K. Avrachenkov, U. Ayesta, P. Brown, and R. Núñez-Queija. Discriminatory processor sharing revisited. In Proceedings of IEEE INFOCOM 2005, volume 2, pages 784--795, 2005.
[4]
T. Bonald. Insensitive queueing models for communication networks. In Valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, page 57, New York, NY, USA, 2006. ACM Press.
[5]
T. Bonald, S. Borst, N. Hegde, and A. Proutière. Wireless data performance in multi-cell scenarios. In SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems, pages 378--380, New York, NY, USA, 2004. ACM.
[6]
T. Bonald, S. C. Borst, and A. Proutière. How mobility impacts the flow-level performance of wireless data systems. In INFOCOM 2004, volume 3, pages 1872--1881. IEEE, 2004.
[7]
T. Bonald, M. Jonckheere, and A. Proutière. Insensitive load balancing. In SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems, pages 367--377, New York, NY, USA, 2004. ACM Press.
[8]
T. Bonald, L. Massoulié, A. Proutière, and J. Virtamo. A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Systems: Theory and Applications, 53(1--2):65--84, 2006.
[9]
T. Bonald and A. Proutière. Insensitivity in processor-sharing networks. Performance Evaluation, 49(1--4):193--209, 2002.
[10]
T. Bonald and A. Proutière. Insensitive bandwidth sharing in data networks. Queueing Systems: Theory and Applications, 44(1):69--100, 2003.
[11]
T. Bonald and A. Proutière. Wireless downlink data channels: user performance and cell dimensioning. In MobiCom '03: Proceedings of the 9th annual international conference on Mobile computing and networking, pages 339--352, New York, NY, USA, 2003. ACM Press.
[12]
T. Bonald and J. W. Roberts. Congestion at flow level and the impact of user behaviour. Computer Networks, 42:521--536, 2003.
[13]
T. Bonald and J. W. Roberts. Scheduling network traffic. SIGMETRICS Performance Evaluation Review, 34(4):29--35, 2007.
[14]
S. Borst. User-level performance of channel-aware scheduling algorithms in wireless data networks. IEEE/ACM Transactions on Networking, 13(3):33--47, June 2005.
[15]
S. Borst and N. Hegde. Integration of streaming and elastic traffic in wireless networks. In INFOCOM 2007, pages 1884--1892. IEEE, 2007.
[16]
S. Borst, A. Proutière, and N. Hegde. Capacity of Wireless Data Networks with Intra-and Inter-Cell Mobility. In INFOCOM 2006, pages 1--12. IEEE, 2006.
[17]
S. C. Borst, K. L. Clarkson, J. M. Graybeal, H. Viswanathan, and P. A. Whiting. User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems. Bell Labs Technical Journal, 8(2):33--47, 2003.
[18]
G. Fayolle, I. Mitrani, and R. Iasnogorodski. Sharing a processor among many job classes. J. ACM, 27(3):519--532, 1980.
[19]
M. Jonckheere and J. Virtamo. Optimal insensitive routing and bandwidth sharing in simple data networks. In SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 193--204, New York, NY, USA, 2005. ACM Press.
[20]
F. P. Kelly. Reversibility and Stochastic Networks. Wiley New York, 1979.
[21]
J. Leino and J. Virtamo. Insensitive load balancing in data networks. Computer Networks, 50(8):1059--1068, June 2006.
[22]
S. Liu and J. Virtamo. Performance analysis of wireless data systems with a finite population of mobile users. In Proceedings of the 19th International Teletraffic Congress ITC 19, pages 1295--1304, 2005.
[23]
L. Massoulié and J. W. Roberts. Arguments in favour of admission control for TCP flows. In Proceedings of ITC 16, 1999.
[24]
R. Nelson. Probability, Stochastic Processes and Queueing Theory. Springer-Verlag, 1995.
[25]
R. Núñez-Queija and H.-P. Tan. Location-based admission control for differentiated services in 3G cellular networks. In Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (MSWiM'06), pages 322--329, New York, NY, USA, 2006. ACM.
[26]
J. W. Roberts. Traffic theory and the Internet. Communications Magazine, IEEE, 39(1):94--99, 2001.
[27]
S. M. Ross. Applied probability models with optimization applications. Holden-Day, 1970.
[28]
Y. Wu, C. Williamson, and J. Luo. On processor sharing and its applications to cellular data network provisioning. Performance Evaluation, 64(9--12):892--908, Oct. 2007.
[29]
S. F. Yashkov and A. S. Yashkova. Processor sharing: A survey of the mathematical theory. Autom. Remote Control, 68(9):1662--1731, 2007.
Index Terms
- Optimal robust policies for bandwidth allocation and admission control in wireless networks
Recommendations
Optimal robust policies for bandwidth allocation and admission control in wireless networks
We consider joint strategies of bandwidth allocation and admission control for elastic users competing for a downlink data channel in a cellular network. For the sake of robustness and generality of the results we focus on the set of strategies whose ...
Bandwidth Reallocation for Bandwidth Asymmetry Wireless Networks Based on Distributed Multiservice Admission Control
This paper addresses when and how to adjust bandwidth allocation on uplink and downlink in a multi-service mobile wireless network under dynamic traffic load conditions. Our design objective is to improve system bandwidth utilization while satisfying ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- Create-Net
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 20 October 2008
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 53Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Reflects downloads up to 28 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in