Skip to main content
SpringerLink
Log in

The Fairness Challenge in Computer Networks

  • Conference paper
  • First Online:
Quality of Future Internet Services (QofIS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1922))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Maslow, Motivation and Personality, Harper & Row, New York, 1954. 209

    Google Scholar 

  2. D. K. Foley, “Resource allocation in the public sector,” Yale Econ. Essays, vol. 7, pp. 73–76, 1967. 210

    Google Scholar 

  3. Elisha A. Pazner, “Pitfalls in the Theory of Fairness,” Journal of Economic Theory, vol. 14, pp. 458–466, 1977. 210

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Steinhaus, “Sur la division pragmatique,” Econometrica (supplement), vol. 17, pp. 315–319, 1949. 211

    Article  MathSciNet  Google Scholar 

  5. L. E. Dubins and E. H. Spanier, “How to cut a cake fairly,” American Mathematical Monthly, pp. 1–17, 1961. 211

    Google Scholar 

  6. Harold W. Kuhn, “On Games of Fair Division,” in Essays in Mathematical Economics, Martin Shubik, Ed. 1967, pp. 29–37, Princeton University Press. 211

    Google Scholar 

  7. Hal R. Varian, Intermediate Microeconomics-A Modern Approach, W.W. North & Company, New York/London, fifth edition, 1999. 211, 212

    Google Scholar 

  8. Scott Shenker, “Fundamental Design Issues for the Future Internet,” IEEE Journal Selected Areas Communication, vol. 13, pp. 1176–1188, 1995. 211, 214

    Article  Google Scholar 

  9. K. J. Arrow and F. H. Hahn, General Competitive Analysis, Oliver and Boyd, Edinburgh, 1971. 211

    MATH  Google Scholar 

  10. Hal R. Varian, “Distributive Justice, Welfare Economics, and the Theory of Fairness,” Philosophy & Public Affairs, vol. 4, no. 3, pp. 223–247, 1975. 212

    Google Scholar 

  11. Hal R. Varian, Microeconomic Analysis, Norton, New York, third edition, 1992. 212

    Google Scholar 

  12. Donald Wittman, “A Diagrammatic Exposition of Justice,” Theory and Decision, vol. 11, pp. 207–237, 1979. 212

    Article  MathSciNet  Google Scholar 

  13. J. F. Nash, “The Bargaining Problem,” Econometrica, vol. 18, pp. 155–162, 1950. 213

    Article  MathSciNet  Google Scholar 

  14. J. Jaffe, “Bottleneck flow control,” IEEE Transactions on Communications, vol. 7, no. 29, pp. 954–962, July 1980. 213

    MathSciNet  Google Scholar 

  15. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1987. 213

    Google Scholar 

  16. Frank P. Kelly, “Charging and rate control for elastic traffic,” European Transactions on Telecommunications, vol. 8, pp. 33–37, 1997. 213

    Article  Google Scholar 

  17. Frank P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control for communication networks: shadow prices, proportional fairness and stability,” Journal of the Operational Research Society, vol. 49, 1998. 214

    Article  Google Scholar 

  18. L. Massoulié and J. Roberts, “Fairness and quality of service for elastic traffic,” CNET-France Tél’ecom, Feb. 1998. 214

    Google Scholar 

  19. Paul Hurley, Jean-Yves Le Boudec, and Patrick Thiran, “A Note on the Fairness of Additive Increase and Multiplicative Decrease,” in Proceedings of ITC-16, Edinburgh, June 1999. 214

    Google Scholar 

  20. Milan Vojnović, Jean-Yves Le Boudec, and Catherine Boutremans, “Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times,” in Proceedings of IEEE INFOCOM2000, March 2000. 214

    Google Scholar 

  21. J. R. Moorman and J. W. Lockwood, “Multiclass Priority Fair Queueing for Hybrid Wired/Wireless Quality of Service Support,” in Proceedings of WoWMoM99, Seattle, WA, Aug. 1999. 214

    Google Scholar 

  22. M. A. Marsan, A. Bianco, E. Leonardi, A. Morabito, and F. Neri, “All-Optical WDM Multi-Rings with Differentiated QoS,rd IEEE Communications Magazine, pp. 58–66, Feb. 1999. 214

    Google Scholar 

  23. ATM Forum Traffic Management Working Group, ”ATM Forum Traffic Management Specification Version 4.1,“ ftp://ftp.atmforum.com/pub/approved-specs/aftm-0121.000.pdf , March 1999. 214

  24. A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” in Proceedings of ACM SIGCOMM’89, 1989, pp. 3–12. 214

    Google Scholar 

  25. A. K. Parekh and R. G. Gallager, “A Generalized Processor Sharing Approach to Flow Control-the Single Node Case,” in Proceedings of IEEE INFOCOM’92, May 1992. 214, 215

    Google Scholar 

  26. Z. Wang, “User-Share Differentiation-Scalable Service Allocation for the Internet,” Internet Draft, Nov. 1997. 215

    Google Scholar 

  27. Y. Bernet et. al., “A framework for differentiated services,” Internet Draft, draftietf-diffserv-framework-01.txt, November 1998. 215

    Google Scholar 

  28. J. C. R. Bennett and H. Zhang, “WF2Q: Worst-case Fair Weighted Fair Queueing,” in Proceedings of IEEE INFOCOM’96, March 1996, pp. 120–128. 215

    Google Scholar 

  29. S. Golestani, “A Self-clocked Fair Queueing Scheme for Broadband Applications,” in Proceedings of IEEE INFOCOM’94, April 1994, pp. 636–646. 215

    Google Scholar 

  30. M. Shreedhar and G. Varghese, “Efficient Fair Queueing using Deficit Round Robin,” in Proceedings of ACM SIGCOMM’95, September 1995, pp. 231–243. 215

    Google Scholar 

  31. S. Floyd and V. Jacobson, “Random early detection for congestion avoidance,” IEEE/ACM Transactions on Networking, vol. 1, no. 4, pp. 397–413, July 1993. 215

    Article  Google Scholar 

  32. Ion Stoica, Scott Shenker, and Hui Zhang, “Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks,” ACM SIGCOMM’98, pp. 118–130, Oct. 1998. 215

    Google Scholar 

  33. Albert Banchs and Robert Denda, “SBSD: A Relative Differentiated Services Architecture based on Bandwidth Sares,” Tech. Rep., University of Mannheim, Germany, February 2000. 215

    Google Scholar 

  34. Albert Banchs and Robert Denda, “A Scalable Share Differentiation Architecture for Elastic and Real-Time Traffic,” in Proc. of the Eighth International Workshop on Quality of Service IWQoS 2000, Pittsburgh, PA USA, June 2000, pp. 42–51. 215

    Google Scholar 

  35. J. Mahdavi, “The TCP-friendly web site,” http://www.psc.edu/networking/tcp_friendly.html. 215

  36. I. Rhee, N. Balaguru, and G. Rouskas, “MTCP: Scalable TCP-like Congestion Control for Reliable Multicast,” in Proceedings of IEEE INFOCOM’99, New York, NY, Mar. 1999. 215

    Google Scholar 

  37. H. A. Wang and M. Schwartz, “Achieving Bounded Fairness for Multicast and TCP Traffic in the Internet,” in Proceedings of ACM SIGCOMM’98, Vancouver, Canada, Sept. 1998. 216

    Google Scholar 

  38. S. Bhattacharyya, D. Towsley, and J. Kurose, “The Loss Path Multiplicity Problem for Multicast Congestion Control,” in Proceedings of IEEE INFOCOM’99, New York, NY, Mar. 1999. 216

    Google Scholar 

  39. S. McCanne and V. Jacobson, “Receiver-Driven Layered Multicast,” in Proceedings of ACM SIGCOMM’96, Oct. 1996. 216

    Google Scholar 

  40. L. Vicisano, L. Rizzo, and J. Crowcroft, “TCP-like congestion control for layered multicast data transfer,” in Proceedings of INFOCOM’98, Mar. 1998, pp. 996–1003. 216

    Google Scholar 

  41. A. Banchs, W. Effelsberg, Ch. Tschudin, and V. Turau, “Active Multicasting of Multimedia Streams,” in Proceedings of the IEEE Local Computer Networks Conference LCN’98, October 1998, pp. 150–159. 216

    Google Scholar 

  42. D. Rubenstein, Jim Kurose, and Don Towsley, “The Impact of Multicast Layering on Network Fairness,” in Proceedings of ACM SIGCOMM’99, Sept. 1999. 216

    Google Scholar 

  43. Christian Huitema, IPv6: The New Internet Protocol, Prentice Hall, Englewood Cliffs, New Jersey, 1996. 218

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de I+D, ENDITEL Endesa Ingeniería de Telecomunicaciones S.A., Sevilla, Spain

    Robert Denda

  2. Lehrstuhl für Praktische Informatik IV, Universität Mannheim, Germany

    Robert Denda & Wolfgang Effelsberg

  3. NEC Europe Ltd., C&C Research Laboratories, Heidelberg, Germany

    Albert Banchs

Authors
  1. Robert Denda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Albert Banchs
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wolfgang Effelsberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London, Gower Street London, WC1E 6BT, UK

    Jon Crowcroft

  2. France Telecom R&D, 38 rue de Général Leclerc, 92794, Issy-Moulineaux, Cedex 9, France

    James Roberts

  3. GMD FOKUS, Kaiserin-Augusta Allee 31, 10589, Berlin, Germany

    Mikhail I. Smirnov

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Denda, R., Banchs, A., Effelsberg, W. (2000). The Fairness Challenge in Computer Networks. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds) Quality of Future Internet Services. QofIS 2000. Lecture Notes in Computer Science, vol 1922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39939-9_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-39939-9_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41076-8

  • Online ISBN: 978-3-540-39939-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation