Low-state fairness: lower bounds and practical enforcement

Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness algorithms. We show that in order to enforce max-min fairness with bounded errors, a router must maintain per-flow state. Then we present a practical edge-marking based architecture to demonstrate the enforcement of approximate global max-min fairness for representative scenarios with multiple bottlenecks and non-responsive traffic. We validate our architecture using packet level simulations.

[1]  Ahmed Helmy,et al.  A low-state packet marking framework for approximate fair bandwidth allocation , 2004, IEEE Communications Letters.

[2]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[3]  Roch Guérin,et al.  A Two Rate Three Color Marker , 1999, RFC.

[4]  A.L. Narasimha Reddy,et al.  Impact of marking strategy on aggregated flows in a differentiated services network , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[5]  Luca Trevisan,et al.  Counting Distinct Elements in a Data Stream , 2002, RANDOM.

[6]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[7]  John Nagle,et al.  Congestion control in IP/TCP internetworks , 1984, CCRV.

[8]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[9]  Ashish Goel,et al.  Using approximate majorization to characterize protocol fairness , 2001, SIGMETRICS '01.

[10]  B. R. Badrinath,et al.  /spl epsiv/-fairness: a trade-off between overhead and max-min fairness , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[11]  Rajeev Rastogi,et al.  Processing set expressions over continuous update streams , 2003, SIGMOD '03.

[12]  A. L. Narasimha Reddy,et al.  Adaptive marking for aggregated flows , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[13]  Roch Guérin,et al.  A Single Rate Three Color Marker , 1999, RFC.

[14]  Ahmed Helmy,et al.  Fair Stateless Aggregate Traffic Marking Using Active Queue Management Techniques , 2002, MMNS.

[15]  Richard J. Lipton,et al.  On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms , 2002, SIGCOMM 2002.

[16]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[17]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[18]  Bogdan M. Wilamowski,et al.  The Transmission Control Protocol , 2005, The Industrial Information Technology Handbook.

[19]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[20]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[21]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[22]  NagleJohn.  Congestion control in IP/TCP internetworks , 1984 .

[23]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[24]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[25]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[26]  A. Feroz,et al.  A TCP-friendly traffic marker for IP differentiated services , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[27]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[28]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[29]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[30]  Richard J. Lipton,et al.  On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms , 2002, IEEE/ACM Transactions on Networking.

[31]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[32]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[33]  Mohammed Atiquzzaman,et al.  ItswTCM: a new aggregate marker to improve fairness in DiffServ , 2003, Comput. Commun..

[34]  George Varghese,et al.  Bitmap algorithms for counting active flows on high speed links , 2003, IMC '03.

[35]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[36]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[37]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .