Rate Processor Sharing: A Robust Technique for Scheduling Data Transmissions in CDMA Wireless Networks

  • Krishnan Kumaran
  • Phil Whiting


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.


Power Allocation Admission Control Call Admission Control Single Server Queue Forward Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Abate and W. Whitt (1992) The Fourier Series Method for Inverting Transforms of Probability Distributions. Queueing Systems 10 pp 5–88.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    J. A. Bucklew. Large Deviation Techniques in Decision, Simulation and Estimation. WileyInterscience, New York, 1990.Google Scholar
  4. [4]
    Kleinrock L. (1975) Queueing Systems,Volume 1, Wiley.Google Scholar
  5. [5]
    Kelly F.P. (1979) Reversibility and Stochastic Networks Wiley.Google Scholar
  6. [6]
    Viterbi A.J. (1995) CDMA. Principles of Spread Spectrum Communication Addison-Wesley.Google Scholar
  7. [7]
    Lucatoni D. (1992) The BMAP/G/1 Queue: A Tutorial Performance 1993.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    S. Keshay. An Engineering Approach to Computer Networking. Addison Wesley, Reading, MA, 1997.Google Scholar
  11. [11]
    G. Kesidis. ATM Network Performance. Kluwer, Boston, MA, 1996.CrossRefGoogle Scholar
  12. [12]
    D. Stiliadis and A. Vanna. Efficient Fair Queueing Algorithms for Packet Switched Networks. IEEE/ACM Trans. Networking, 6: 175–185, Apr. 1998.CrossRefGoogle Scholar
  13. [13]
    D. Stiliadis and A. Vanna. Rate Proportional Servers: A Design Methodology for Fair Queueing Algorithms. IEEE/ACM Trans. Networking, 6: 164–174, Apr. 1998.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Krishnan Kumaran
    • 1
  • Phil Whiting
    • 1
  1. 1.Bell LabsLucent Tech.Murray HillUSA

Personalised recommendations