The Fairness Challenge in Computer Networks

In this paper, the concept of fairness as a future field of research in computer networks is investigated. We motivate the need of examining fairness issues by providing example future application scenarios where fairness support is needed in order to experience sufficient service quality. We further demonstrate how fairness definitions from political science and in computer networks are related and, finally, contribute with this work to the ongoing research activities by defining the fairness challenge with the purpose of helping direct future investigations to the white spots on the map of research in fairness.

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

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

[3]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[4]  Donald F. Towsley,et al.  The loss path multiplicity problem in multicast congestion control , 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).

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

[6]  K. Arrow,et al.  General Competitive Analysis , 1971 .

[7]  Injong Rhee,et al.  MTCP: scalable TCP-like congestion control for reliable multicast , 2002, Comput. Networks.

[8]  B. Ohlman,et al.  A Framework for Differentiated Services , 1998 .

[9]  J. Nash THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[10]  Steven McCanne,et al.  Receiver-driven layered multicast , 1996, SIGCOMM '96.

[11]  H. Varian Intermediate Microeconomics: A Modern Approach , 1987 .

[12]  Elisha A. Pazner Pitfalls in the Theory of Fairness , 1977 .

[13]  S. Shenker Fundamental Design Issues for the Future Internet , 1995 .

[14]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Christian Huitema,et al.  IPv6--the new Internet protocol , 1996 .

[16]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[17]  Jon Crowcroft,et al.  TCP-like congestion control for layered multicast data transfer , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[18]  Albert Banchs,et al.  A scalable share differentiation architecture for elastic and real-time traffic , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[19]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[20]  C. Fisher,et al.  Resource Allocation in the Public Sector: Values, Priorities and Markets in the Management of Public Services , 1998 .

[21]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[22]  H. Steinhaus,et al.  Sur la division pragmatique , 1949 .

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

[24]  W. Thomson,et al.  Games of Fair Division , 1995 .

[25]  Donald F. Towsley,et al.  The impact of multicast layering on network fairness , 1999, SIGCOMM '99.

[26]  W. Stromquist How to Cut a Cake Fairly , 1980 .

[27]  Harold W. Kuhn,et al.  Chapter 2. On Games of Fair Division , 1967 .

[28]  Wolfgang Effelsberg,et al.  Multicasting multimedia streams with active networks , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[29]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[30]  Srinivasan Keshav,et al.  A Framework for Differentiated Services , 1999 .

[31]  J. Boudec,et al.  The Fairness of Additive Increase and Multiplicative Decrease , 1998 .

[32]  R. Denda,et al.  SBSD: A Relative Differentiated Services Architecture based on Bandwidth Shares , 2000 .

[33]  Mischa Schwartz,et al.  Achieving bounded fairness for multicast and TCP traffic in the Internet , 1998, SIGCOMM '98.

[34]  Donald Wittman,et al.  A diagrammatic exposition of justice , 1979 .

[35]  Marco Ajmone Marsan,et al.  All-optical WDM multi-rings with differentiated QoS , 1999, IEEE Commun. Mag..

[36]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[37]  A. Maslow Motivation and Personality , 1954 .

[38]  John W. Lockwood,et al.  Multiclass priority fair queuing for hybrid wired/wireless quality of service support , 1999, WOWMOM '99.

[39]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..