Abstract
Making drop decisions to enforce the max-min fair resource allocation in a network of standard TCP flows without any explicit state information is a challenging problem. Here we propose a solution to this problem by developing a suite of stateless queue management schemes that we refer to as Multi-Level Comparison with index l (MLC(l)). We show analytically, using a Markov chain model, that for an arbitrary network topology of standard TCP flows and queues employing MLC(l), the resource allocation converges to max-min fair as l increases. The analytical findings are verified experimentally using packet level ns2 simulations.
This is a preview of subscription content, log in via an institution to check access.
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
Altman, E., Avrachenkov, K., Barakat, C.: A stochastic model of TCP/IP with stationary random losses. IEEE/ACM Transactions on Networking (TON) 13(2) (2005)
Abouzeid, A., Roy, S.: Analytic understanding of RED gateways with. multiple competing TCP flows. In: Proc. of IEEE GLOBECOM (2000)
Athuraliya, S., Lapsley, D., Low, S.: Enhanced Random Early Marking algorithm for Internet flow control. In: Proc. of IEEE INFOCOM, Tel Aviv, Israel (2000)
Das, A., Dutta, D., Goel, A., Helmy, A., Heidemann, J.: Low State Fairness: Lower Bounds and Practical Enforcement. In: Proc. of the IEEE INFOCOM, Miami, FL, USA (March 2005)
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: Proc. of ACM SIGCOMM, Austin, TX (1989)
Dumas, V., Guillemin, F., Robert, P.: A Markovian analysis of additive-increase multiplicative-decrease algorithms. Adv. in Appl. Probab. 34(1), 85–111 (2002)
Feng, W., Shin, K.G., Kandlur, D.D., Saha, D.: The BLUE active queue management algorithms. IEEE ACM Transactions on Networking 10(4), 513–528 (2002)
Floyd, S.: HighSpeed TCP for Large Congestion Windows. RFC 3649, Experimental (December 2003)
Floyd, S.: Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: Oneway Traffic. ACM Computer Communication Review 21(5), 30–47 (1991)
Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1, 397–413 (1993)
Katabi, D., Handley, M., Rohr, C.: Internet Congestion Control for Future High Bandwidth-Delay Product Environments. In: Proc. of ACM SIGCOMM, Pittsburgh, PA, USA (2002)
Kelly, T.: Scalable TCP: Improving Performance in Highspeed Wide Area Networks. ACM SIGCOMM Computer Communication Review 33(2) (April 2003)
Kodialam, M., Lakshman, T.V., Mohanty, S.: Runs based Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. In: Proc. of IEEE INFOCOM, Hong Kong (March 2004)
Lakshman, T.V., Madhow, U.: The performance of TCP/IP for networks with high bandwidth-delay products and random loss. IEEE ACM Transactions on Networking 5(3), 336–350 (1997)
Lin, D., Morris, R.: Dynamics of random early detection. In: Proc. of ACM SIGCOMM, Cannes, France (1997)
Low, S., Andrew, L., Wydrowski, B.: Understanding XCP: Equilibrium and Fairness. In: Proc. of IEEE Infocom, Miami, FL (March 2005)
Mahajan, R., Floyd, S., Wetherall, D.: Controlling high-bandwidth flows at the congested router. In: Proc. of IEEE ICNP, Riverside, CA, USA (2001)
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8(5) (October 2000)
Ott, T.J., Lakshman, T.V., Wong, L.H.: SRED: Stabilized RED. In: Proc. IEEE INFOCOM, New York (March 1999)
Pan, R., Breslau, L., Prabhakar, B., Shenker, S.: Approximate Fairness through Differential Dropping. ACM SIGCOMM Computer Communication Review 33(2) (April 2003)
Pan, R., Prabhakar, B., Psounis, K.: CHOKe: A stateless AQM scheme for approximating fair bandwidth allocation. In: Proc. of IEEE INFOCOM, Tel Aviv, Israel (2000)
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round-robin. IEEE/ACM Transactions on Networking 4(3) (June 1996)
Srikant, R.: The Mathematics of Internet Congestion Control. Birkhauser (2004)
Stanojevic, R., Shorten, R.: AQM’s for achieving fairness between competing TCP flows. Technical report, available online: www.hamilton.ie/person/rade/trm.pdf
Stoica, I., Shenker, S., Zhang, H.: Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks. IEEE ACM Transactions on Networking 11(1), 33–46 (2003)
Tang, A., Wang, J., Low, S.H.: Understanding CHOKe: throughput and spatial characteristics. IEEE/ACM Transactions on Networking 12(4) (2004)
Wydrowski, B., Zukerman, M.: MaxNet: A congestion control architecture for maxmin fairness. IEEE Communications Letters 6(11), 512–514 (2002)
Yang, Y., Lam, S.: General AIMD Congestion Control. In: Proc. ICNP 2000, Osaka, Japan (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stanojević, R., Shorten, R. (2007). Beyond CHOKe: Stateless Fair Queueing. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-72709-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72708-8
Online ISBN: 978-3-540-72709-5
eBook Packages: Computer ScienceComputer Science (R0)