Abstract
We present an algorithm for scheduling data transmissions on the forward link of a CDMA wireless network. Our algorithm, Rate Processor Sharing (RPS), is based on Generalised Processor Sharing (GPS), a widely adopted method for resource sharing in wire-line networks. Unlike GPS, RPS must take into account user interference and the actions of power control.
RPS allows a natural Call Admission Control (CAC) applicable to heterogenous populations of users, thus providing capacity estimates. However, unlike CDMA voice networks, the heterogeneity amongst data users makes it difficult to devise a natural definition of network capacity. Indeed, as we show, capacity varies substantially depending on the actual definition used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Abate and W. Whitt (1992) The Fourier Series Method for Inverting Transforms of Probability Distributions. Queueing Systems 10 pp 5–88.
D. M.Andrews, K. Kumaran, K. Ramanan, A. Stolyar and P. Whiting. (November 1998) CDMA Data Forward Link Rate Scheduling. Bell Labs Internal Report. April’99.
J. A. Bucklew. Large Deviation Techniques in Decision, Simulation and Estimation. WileyInterscience, New York, 1990.
Kleinrock L. (1975) Queueing Systems,Volume 1, Wiley.
Kelly F.P. (1979) Reversibility and Stochastic Networks Wiley.
Viterbi A.J. (1995) CDMA. Principles of Spread Spectrum Communication Addison-Wesley.
Lucatoni D. (1992) The BMAP/G/1 Queue: A Tutorial Performance 1993.
A. Elwalid and D. Mitra. Design of Generalized Processor Sharing Schedulers which Statistically Multiplex Heterogeneous QoS Classes. Proc. of IEEE INFOCOM’99,March 1999, pp. 12201230.
K. Kumaran, J. Margrave, D. Mitra, and K. Stanley. Novel Techniques for the Design and Control of Generalized Processor Sharing Schedulers for Multiple QoS Classes. To appear in 1999.
S. Keshay. An Engineering Approach to Computer Networking. Addison Wesley, Reading, MA, 1997.
G. Kesidis. ATM Network Performance. Kluwer, Boston, MA, 1996.
D. Stiliadis and A. Vanna. Efficient Fair Queueing Algorithms for Packet Switched Networks. IEEE/ACM Trans. Networking, 6: 175–185, Apr. 1998.
D. Stiliadis and A. Vanna. Rate Proportional Servers: A Design Methodology for Fair Queueing Algorithms. IEEE/ACM Trans. Networking, 6: 164–174, Apr. 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kumaran, K., Whiting, P. (1999). Rate Processor Sharing: A Robust Technique for Scheduling Data Transmissions in CDMA Wireless Networks. In: Biglieri, E., Fratta, L., Jabbari, B. (eds) Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5920-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5920-4_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5109-0
Online ISBN: 978-1-4757-5920-4
eBook Packages: Springer Book Archive