Abstract
End-to-end fairness guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling algorithm. Unfortunately, these scheduling algorithms require every router to maintain per-flow state and perform per-packet flow classification; these requirements limit the scalability of the routers. In this paper, we propose the Core-stateless Guaranteed Fair (CSGF) network architecture—the first work-conserving architecture that, without maintaining per-flow state or performing per-packet flow classification in core routers, provides to flows fairness guarantees similar to those provided by a network of core-stateful fair routers.
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
V. Agarwal, M.S. Hrishikesh, S.W. Keckler, and D.C. Burger. Clock Rate Versus IPC: The End of the Road for Conventional Microarchitectures. In 27th International Symposium on Computer Architecture (ISCA), June 2000.
J.C.R. Bennett, K. Benson, A. Charny, W.F. Courtney, and J.Y. LeBoudec. Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding. to appear in IEEE/ACM Transactions on Networking.
J.C.R. Bennett and H. Zhang. WF2Q: Worst-case Fair Weighted Fair Queuing. In Proceedings of INFOCOM’96, pages 120–127, March 1996.
J.C.R. Bennett and H. Zhang. Hierarchical Packet Fair Queueing Algorithms. In IEEE/ACM Transactions on Networking, volume 5, pages 675–689, October 1997.
S. Bhatnagar and B.R. Badrinath. Distributed Admission Control to Support Guaranteed Services in Core-stateless Networks. In Proceedings of IEEE INFOCOM, April 2003.
Z. Cao, Z. Wang, and E. Zegura. Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State. In Proceedings of IEEE INFOCOM, March 2000.
A. Clerget and W. Dabbous. TUF: Tag-based Unified Fairness. In Proceedings of IEEE INFOCOM, April 2001.
K. Coffman and A. Odlyzko. The Size and Growth Rate of the Internet. March 2001. http://www.firstmoday.dk/issues/issue3_10/coffman/.
A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a Fair Queueing Algorithm. In Proceedings of ACM SIGCOMM, pages 1–12, September 1989.
S.J. Golestani. A Self-Clocked Fair Queueing Scheme for High Speed Applications. In Proceedings of INFOCOM’94, 1994.
P. Goyal, H. Vin, and H. Cheng. Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. In Proceedings of ACM SIGCOMM’96, pages 157–168, August 1996.
P. Kaiser. A (R)evolutionary Technology Roadmap Beyond Today’s OE Industry. NSF Workshop on The Future Revolution in Optical Communications & Networking, December 2000.
J. Kaur and H. Vin. Core-stateless Guaranteed Rate Scheduling Algorithms. In Proceedings of IEEE INFOCOM, volume 3, pages 1484–1492, April 2001.
J. Kaur and H. Vin. Core-stateless Guaranteed Throughput Networks. Technical Report TR-01-47, Department of Computer Sciences, University of Texas at Austin, November 2001.
J. Kaur and H. Vin. End-to-end Fairness Analysis of Fair Queuing Networks. In Proceedings of the 23rd IEEE International Real-time Systems Symposium (RTSS), December 2002.
J. Kaur and H. Vin. Core-stateless Guaranteed Throughput Networks. In Proceedings of IEEE INFOCOM, volume 3, April 2003.
C. Li and E. Knightly. Coordinated Network Scheduling: A Framework for End-to-end Services. In IEEE ICNP, November 2000.
R. Pan, B. Prabhakar, and K. Psounis. CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. In Proceedings of IEEE INFOCOM, March 2000.
A.K. Parekh. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, 1992.
I. Stoica, S. Shenker, and H. Zhang. Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. In Proceedings of ACM SIGCOMM, September 1998.
I. Stoica and H. Zhang. Providing Guaranteed Services Without Per Flow Management. In Proceedings of ACM SIGCOMM, September 1999.
H. Zhang. Service Disciplines For Guaranteed Performance Service in Packet-Switching Networks. Proceedings of the IEEE, 83(10), October 1995.
H. Zhang and S. Keshav. Comparison of Rate-Based Service Disciplines. In Proceedings of ACM SIGCOMM, pages 113–121, August 1991.
L. Zhang. Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks. In Proceedings of ACM SIGCOMM’90, pages 19–29, August 1990.
Z.L. Zhang, Z. Duan, and Y.T. Hou. Virtual Time Reference System: A Unifying Scheduling Framework for Scalable Support of Guarantees Services. IEEE Journal on Selected Areas in Communication, Special Issue on Internet QoS, December 2000.
Z.L. Zhang, Z. Duan, Y.T. Hou, and L. Gao. Decoupling QoS Control from Core Routers: A Novel Bandwidth Broker Arcitecture for Scalable Support of Guaranteed Services. In Proceedings of ACM SIGCOMM, Sweden, August 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaur, J., Vin, H. (2003). Providing Deterministic End-to-End Fairness Guarantees in Core-Stateless Networks. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive