Email this article 
Open Access
Subscription or Fee Access
Core-Stateless Fair Queuing For Fair Bandwidth Allocations in Internet
Abstract
To achieve fair bandwidth allocations, router mechanisms are attained in the network. Router mechanisms designed to achieve fair bandwidth allocations, like RED, have many desirable proper ties for congestion control in the Internet. In this paper, we propose an architecture that contains edge router and core router, significantly reduces this implementation complexity yet still achieves fair bandwidth allocations. We apply this approach to core routers that is, a nearby region of the network and we difference between edge routers and core routers. Edge routers maintain per flow state; they estimate the incoming rate of each flow and insert a label into each packet header based on this estimate. Core routers maintain no per flow state; they use FIFO packet scheduling. We call the scheme Core-Stateless Fair Queuing. We present simulations and analysis on the performance of this approach, and discuss an alternate approach.
Keywords
References
Ion Stoica, Scott Shenker, Hui Zhang, "Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks", SIGCOMM’98.
S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Transactions on Networking,August 1993.
S. Kunniyur and R. Srikant, “End-to-end congestion control: utility functions, random losses and ECN marks,” in Proceedings of INFOCOM, Tel Aviv, Israel, March 2000.Also to appear in IEEE/ACM Transactions on Networking, 2003.
S. Kunniyur and R. Srikant, “A time-scale decomposition approach to adaptive ECN marking,” IEEE Transactions on Automatic Control, June 2002.
T. J. Ott, T. V. Lakshman, and L. H. Wong, “SRED: Stabilized RED,” in Proceedings of INFOCOM, New York, NY, March 1999
W. Feng, D. Kandlur, D. Saha, and K. Shin, “Blue: A new class of active queue management schemes,” April 1999, Technical Report,CSE-TR-387-99, U. Michigan.
S. Athuraliya, D. E. Lapsley, and S. H. Low, “Random early marking for Internet congestion control,” in Proceedings of Globecom, 1999.
R.J. Gibbens and F.P. Kelly, “Distributed connection acceptance control for a connectionless network,” in Proc. of the 16th Intl. Teletraffic Congress, Edinburgh,Scotland, June 1999.
J.C.R. Bennett, D.C. Stephens, and H. Zhang. High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks. In Proceedings of IEEE ICNP '97, pages 7{14, Atlanta, GA,October 1997.
J.C.R. Bennett and H. Zhang. WF2Q: Worst-case fair weighted fair queueing. In Proceedings of IEEE INFO COM'96, pages 120{128, SanFrancisco, CA, March 1996.
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks by Ion Stoica, Scott Shenker, Hui Zhang.
I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks, June 1998. Technical Report CMU-CS 98-136, Carnegie Mellon University.
S. Keshav. A control-theoretic approach to flow control. In Proceedings of ACM SIGCOMM'91, pages 3{15, Zurich, Switzerland, September 1991.
S. Floyd and K. Fall. Router mechanisms to support end to-end congestion control, February 1997. LBL Technical Report.
S. Floyd and V. Jacobson. Random early detection for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397{413, July 1993.
S. Golestani. A self-clocked fair queuing scheme for broadband applications. In Proceedings of IEEE INFOCOM'94,pages 636{646,Toronto, CA, June 1994.
V. Jacobson. Congestion avoidance and control. In Proceedings of ACM SIGCOMM'88, pages 314329, August 1988.
J.Jae. Bottleneck flow control. IEEE Transactions on Communications,7(29):954{962, July 1980.
S.Keshav.A control-theoretic approach to flow control. In Proceedings of ACM SIGCOMM'91, pages 3{15, Zurich, Switzerland, September 1991.
M. Shreedhar and G. Varghese. Efficient fair queuing using decit round robin. In Proceedings of SIGCOMM'95, pages.231{243, Boston, MA, September 1995.
D. Stilliadis and A. Varma. Efficient fair queuing algorithms for packetswitched networks. IEEE/ACM Transactions on Networking,6(2):175{185, April 1998.
I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queuing:Achieving approximately fair bandwidth allocations in high speed networks, June 1998. Technical Report CMU-CS-98-136, Carnegie Mellon University.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.