Downlink Admission/Congestion Control and Maximal Load in CDMA Networks (2003)
| Venue: | In Proceedings of the IEEE Conference on Computer Communications (INFOCOM ’03), March 30 – April 3 |
| Citations: | 17 - 9 self |
BibTeX
@INPROCEEDINGS{Baccelli03downlinkadmission/congestion,
author = {François Baccelli and Bartlomiej Blaszczyszyn and Florent Tournois},
title = {Downlink Admission/Congestion Control and Maximal Load in CDMA Networks},
booktitle = {In Proceedings of the IEEE Conference on Computer Communications (INFOCOM ’03), March 30 – April 3},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper is focused on the influence of geometry on the combination of inter-cell and intra-cell interferences in the downlink of large cdma networks. We use an exact representation of the geometry of the downlink channels to define scalable admission and congestion control schemes, namely schemes that allow each base station to decide independently of the others what set of voice users to serve and/or what bit rates to offer to elastic traffic users competing for bandwidth. We then study the load of these schemes when the size of the network tends to infinity using stochastic geometry tools. By load, we mean here the distribution of the number of voice users that each base station can serve and that of the bit rate offered to each elastic traffic user.
