Abstract
In this paper, we present a comparative study of three proposals for differentiated services — the RIO scheme, the two-bit scheme and the User-Share Differentiation (USD) scheme. We simulate the three schemes under a number of different scenarios including mismatching of bottleneck bandwidth and profiles, short duration traffic, and non-responsive sources. Our findings show that although the simpler schemes for Differentiated Services reduce the complexity in the core, they tend to perform less well when there is a mismatch between the allocated profiles and bottleneck bandwidth, and also when the traffic sources are bursty, and non-responsive.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35580-1_16
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
D. Black, S. Blake, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An Architecture for Differentiated Services, RFC 2475, May 1998.
D. Clark and W. Fang. Explicit Allocation of Best Effort Packet Delivery Service, Work in progress, 1998.
D. Clark, S. Shenker, and L. Zhang. Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanisms, In Proceedings of ACM SIGCOMM’92,August 1992.
D. Clark, J. Wroclawski. An Approach to Service Allocation in the Internet, Work in progress, July 1997.
M. Degermark, A. Brodnok, S. Carlsson, and S. Pink. Small Forwarding Tables for Fast Routing Lookups, In Proceedings of ACM SIGCOMM ‘97, Cannes, France, September 1997.
K. Fall and S. Floyd. Promoting the Use of End-to-End Congestion Control in the Internet, Work in progress, February 1998.
S. Golestani. A self-clocked fair queuing scheme for broadband applications, In Proceedings of IEEE INFOCOM’94, pages 636–646, April 1994.
V. Jacobson. Differentiated Services Architecture, Presented at the IETF meeting at the Munich IETF, August 1997.
S. Keshay. REAL 5.0 Manuals, http://www.cs.comell.edu/skeshav/real/man.html, August 1997.
V. P. Kumar, T. V. Lakshman, and D. Stiliadis. Beyond Best Effort: Router Architectures for the Differentiated Services of Tomorrow’s Internet, IEEE Communications Magazine, May 1998.
K. Nichols, V. Jacobson, and L. Zhang. A Two-bit Differentiated Services Architecture for the Internet, Work in progress, November 1997.
A. K. Parekh and R. G. Gallager, “A Generalized Processor Sharing Approach to Flow Control - the Single Node Case, In Proceedings of IEEE INFOCOM’92,May 1992.
M. Shreedhar and G. Varghese. Efficient Fair Queuing Using Deficit Round Robin, In Proceedings of ACM SIGCOMM’95,Cambridge, Massachusetts, August 1995.
K. Thompson, G. Miller, and R. Wilder. Wide-Area Internet Traffic Patterns and Characteristics, IEEE Network, November 1997.
Z. Wang. USD: Scalable Bandwidth Allocation for the Internet, In Proceedings of HPN’98,September 1998.
L. Zheng, S. Deering, S. Estrin, S. Shenker, and D. Zappala. A New Resource Reservation Protocol, IEEE Network, September 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Basu, A., Wang, Z. (2000). Fair Bandwidth Allocation for Differentiated Services. In: Touch, J.D., Sterbenz, J.P.G. (eds) Protocols for High-Speed Networks VI. PfHSN 1999. IFIP — The International Federation for Information Processing, vol 31. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35580-1_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-35580-1_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6318-8
Online ISBN: 978-0-387-35580-1
eBook Packages: Springer Book Archive