JoBS: Joint Buffer Management and Scheduling for Differentiated Services

  • Jörg Liebeherr
  • Nicolas Christin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2092)


A novel algorithm for buffer management and packet scheduling is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, called JoBS (Joint Buffer Management and Scheduling), provides delay and loss differentiation independently at each node, without assuming admission control or policing. The novel capabilities of the proposed algorithm are that (1) scheduling and buffer management decisions are performed in a single step, and (2) both relative and (whenever possible) absolute QoS requirements of classes are supported. Numerical simulation examples, including results for a heuristic approximation, are presented to illustrate the effectiveness of the approach and to compare the new algorithm to existing methods for loss and delay differentiation.


Loss Rate Busy Period System Constraint Rate Allocation Delay Constraint 
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.
    S. Athuraliya, D. Lapsley, and S. Low. An enhanced random early marking algorithm for internet flow control. In Proceedings of IEEE INFOCOM 2000, pages 1425–1434, Tel-Aviv, Israel, April 2000.Google Scholar
  2. 2.
    S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. IETF RFC 2475, December 1998.Google Scholar
  3. 3.
    R. Braden, D. Clark, and S. Shenker. Integrated services in the internet architecture: an overview. IETF RFC 1633, July 1994.Google Scholar
  4. 4.
    D. Clark and W. Fang. Explicit allocation of best-effort packet delivery service. IEEE/ACM Transactions on Networking, 6(4):362–373, August 1998.CrossRefGoogle Scholar
  5. 5.
    R. Cruz, H. Sariowan, and G. Polyzos. Scheduling for quality of service guarantees via service curves. In Proceedings of the International Conference on Computer Communications and Networks (ICCCN), pages 512–520, Las Vegas, NV., September 1995.Google Scholar
  6. 6.
    C. Dovrolis. Proportional Differentiated Services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.Google Scholar
  7. 7.
    C. Dovrolis and P. Ramanathan. Proportional differentiated services, part II: Loss rate differentiation and packet dropping. In Proceedings of IWQoS 2000, pages 52–61, Pittsburgh, PA., June 2000.Google Scholar
  8. 8.
    S. Floyd and V. Jacobson. Random early detection for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397–413, July 1993.CrossRefGoogle Scholar
  9. 9.
    S. Floyd and V. Jacobson. Link-sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking, 3(4):365–386, August 1995.CrossRefGoogle Scholar
  10. 10.
    P. Hurley, M. Kara, J.-Y. Le Boudec, and P. Thiran. ABE: Providing a low delay service within best-effort. Technical Report DSC/2000/34, EPFL-DI-ICA, September 2000.Google Scholar
  11. 11.
    V. Jacobson, K. Nichols, and K. Poduri. An expedited forwarding PHB. IETF RFC 2598, June 1999.Google Scholar
  12. 12.
    L. Kleinrock. Queueing Systems. Volume II: Computer Applications. John Wiley & Sons, New York, NY, 1976.Google Scholar
  13. 13.
    M. A. Labrador and S. Banerjee. Packet dropping policies for ATM and IP networks. IEEE Communications Surveys, 2(3), 3rd Quarter 1999.Google Scholar
  14. 14.
    J. Liebeherr and N. Christin. Buffer management and scheduling for enhanced differentiated services. Technical Report CS-2000-24, University of Virginia, August 2000.Google Scholar
  15. 15.
    Y. Moret and S. Fdida. A proportional queue control mechanism to provide differentiated services. In Proceedings of the International Symposium on Computer and Information Systems (ISCIS), pages 17–24, Belek, Turkey, October 1998.Google Scholar
  16. 16.
    T. Nandagopal, N. Venkitaraman, R. Sivakumar, and V. Bharghavan. Delay differentiation and adaptation in core stateless networks. In Proceedings of IEEE INFOCOM 2000, pages421–430, Tel-Aviv, Israel, April 2000.Google Scholar
  17. 17.
    K. Nichols, V. Jacobson, and L. Zhang. Two-bit differentiated services architecture for the Internet. IETF RFC 2638, July 1999.Google Scholar
  18. 18.
    A. K. Parekh and R. G. Gallagher. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking,1(3):344–357, June 1993.CrossRefGoogle Scholar
  19. 19.
    S. Sahu, P. Nain, D. Towsley, C. Diot, and V. Fioroiu. On achievable service differentiation with token bucket marking for TCP. In Proceedings of ACM SIGMETRICS 2000, pages23–33, Santa Clara, CA, June 2000.Google Scholar
  20. 20.
    K. Schittkowski. NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems. Annals of Operations Research, 5:485–500, 1986.MathSciNetGoogle Scholar
  21. 21.
    L. Zhang. Virtual clock: A new traffic control algorithm for packet switched networks. IEEE/ACM Trans. Comput. Syst., 9(2):101–125, May 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jörg Liebeherr
    • 1
  • Nicolas Christin
    • 1
  1. 1.Computer Science DepartmentUniversity of VirginiaCharlottesvilleUSA

Personalised recommendations