Abstract
Mechanisms for achieving fair bandwidth sharing have been a hot research topic for many years. Protection of well-behaved flows and possible simplification of end-to-end congestion control mechanisms are the ultimate challenges driving the need for research in this area. Rate-based schedulers, such as weighted fair queuing, require per-flow state information in the routers and in addition a mechanism to determine which packets to drop under congestion. Therefore they are too complex to be implemented in high-speed networks. To address this issue many other schemes have been proposed among them core stateless fair queuing (CSFQ) [1], constitutes the most revolutionary approach. In this paper we propose an edge-marking scheme that achieves fair bandwidth allocation by marking packets belonging to the same flow with different colors, i.e. layers, according to a token bucket scheme. The interior routers implement a Random Early Detection (RED) [12] based buffer acceptance mechanism that is able to drop packets based on their color. This buffer acceptance mechanism estimates the layer that is causing the congestion and drops packets according to a RED drop function. Using simulations we prove that this mechanism is stable and achieves a fair distribution of the bottleneck bandwidth.
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
Ion Stoica, Scott Shenker, and Hui Zhang, “Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks”, in Proceedings of SIGCOMM.98, Sept. 1998.
R. Braden, D. Clark and S. Shenker, “Integrated Services in the Internet Architecture: An Overview”, RFC 1633, June 1994.
J. Wroclawski, “The use of RSVP with IETF Integrated Services”, RFC 2210, September 1997.
K. Nichols, S. Blake, F. Baker and D. Black, “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers”, RFC 2474, December 1998.
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang and W. Weiss, “An Architecture for Differentiated Services”, RFC 2475, December 1998.
A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm”, SIGCOMM symposium on Communications Architectures and Protocols, Sept 1989.
Abhay Parekh, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks”, Ph. D. thesis, Laboratory for Information and Decision Systems, Massachusetts instirute of Technology, Feb. 1992.
Dong Lin and Robert Morris, “Dynamics of Random Early Detection”, Proceedings of SIGGCOMM.97, Oct. 1997.
Zhiruo Cao, Zheng Wang and Ellen Zegura, “Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State”, in proceedings INFOCOM’ 00, March 2000.
Juha Heinanen and Roch Guerin, “A Two-Rate Three Color Marker”, RFC 2698, September 1999.
S. Floyd and V. Jacobson, “Random Early Detection Gateways for congestion Avoidance”, IEEE/ACM Transactions on Networking, Vol 1, Num 4, August 1993.
S. Floyd; Mail “Optimum functions for computing the drop probability”, available from http://www.aciri.org/floyd/REDfunc.txt.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pauwels, K., De Cnodder, S., Elloumi, O. (2000). A Multi-color Marking Scheme to Achieve Fair Bandwidth Allocation. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds) Quality of Future Internet Services. QofIS 2000. Lecture Notes in Computer Science, vol 1922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39939-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-39939-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41076-8
Online ISBN: 978-3-540-39939-1
eBook Packages: Springer Book Archive