Abstract
In this paper, we study the incremental deployability of the Core-Stateless Fair Queuing (CSFQ) approach to provide fair rate allocations in backbone networks. We define incremental deployability as the ability of the approach to gracefully provide increasingly better quality of service with each additional QoS-aware router deployed in the network. We use the ns2 network simulator for the simulations. We conclude that CSFQ does not exhibit good incremental deployability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Zhang, “Service Disciplines For Guaranteed Performance Service in Packet-Switching Networks”, Proceedings of the IEEE, 83(10), Oct 1995..
I. Stoica, S. Shenker, H. Zhang, “Core-Stateless Fair Queuing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks”, Proceedings of ACM SIGCOMM, 1998.
I. Stoica, H. Zhang, “Providing Guaranteed Services Without Per Flow Management” Proceedings of ACM SIGCOMM, 1999.
R. Sivakumar, T. Kim, N. Venkitaraman, and V. Bharghavan, “Achieving Per-flow Rate Fairness in Core-Stateless Networks”, Proceedings of International Conference on Distributed Computing Systems, 2000.
T. Kim, R. Sivakumar, K-W. Lee, and V. Bharghavan, “Multicast Service Differentiation in Core-Stateless Networks”, Proceedings of International Workshop on Network Group Communication, 1999.
Rossi, H. Peter, J. D. Wright, and A. B. Anderson, “Handbook on Survey Research”, 1983.
K. Fall and K. Vardhan, “ns notes and documentation,” available from http://wwwmash. cs.berkeley.edu/ns/, 1999.
Lucent Technologies, “Network Quality of Service: Survey Report,”
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blanpain, Y., Hsieh, HY., Sivakumar, R. (2001). The Incremental Deployability of Core–Stateless Fair Queuing. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_26
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive