Abstract
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.
This work is supported in part by the National Science Foundation through grants NCR-9624106 (CAREER), ANI-9730103, and ANI-0085955.
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
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.
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. IETF RFC 2475, December 1998.
R. Braden, D. Clark, and S. Shenker. Integrated services in the internet architecture: an overview. IETF RFC 1633, July 1994.
D. Clark and W. Fang. Explicit allocation of best-effort packet delivery service. IEEE/ACM Transactions on Networking, 6(4):362–373, August 1998.
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.
C. Dovrolis. Proportional Differentiated Services for the Internet. PhD thesis, University of Wisconsin-Madison, December 2000.
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.
S. Floyd and V. Jacobson. Random early detection for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397–413, July 1993.
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.
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.
V. Jacobson, K. Nichols, and K. Poduri. An expedited forwarding PHB. IETF RFC 2598, June 1999.
L. Kleinrock. Queueing Systems. Volume II: Computer Applications. John Wiley & Sons, New York, NY, 1976.
M. A. Labrador and S. Banerjee. Packet dropping policies for ATM and IP networks. IEEE Communications Surveys, 2(3), 3rd Quarter 1999.
J. Liebeherr and N. Christin. Buffer management and scheduling for enhanced differentiated services. Technical Report CS-2000-24, University of Virginia, August 2000.
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.
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.
K. Nichols, V. Jacobson, and L. Zhang. Two-bit differentiated services architecture for the Internet. IETF RFC 2638, July 1999.
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.
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.
K. Schittkowski. NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems. Annals of Operations Research, 5:485–500, 1986.
L. Zhang. Virtual clock: A new traffic control algorithm for packet switched networks. IEEE/ACM Trans. Comput. Syst., 9(2):101–125, May 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liebeherr, J., Christin, N. (2001). JoBS: Joint Buffer Management and Scheduling for Differentiated Services. In: Wolf, L., Hutchison, D., Steinmetz, R. (eds) Quality of Service — IWQoS 2001. IWQoS 2001. Lecture Notes in Computer Science, vol 2092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45512-4_31
Download citation
DOI: https://doi.org/10.1007/3-540-45512-4_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42217-4
Online ISBN: 978-3-540-45512-7
eBook Packages: Springer Book Archive