Jon Crowcroft
Philippe Oechslin
Abstract
In this document we study the application of weighted proportional fairness to data flows in the Internet. We let the users set the weights of their connections in order to maximise the utility they get from the network. When combined with a pricing scheme where connections are billed by weight and time, such a system is known to maximise the total utility of the network. Our study case is a national Web cache server connected to long distance links. We propose two ways of weighting TCP connections by manipulating some parameters of the protocol and present results from simulations and prototypes. We finally discuss how proportional fairness could be used to implement an Internet with differentiated services.
- {1} D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1987. Google Scholar
Digital Library
- {2} H. Blakrishnan, V. Padmamabhan, S. Seshan, M. Stemm, and R. Katz. TCP behavior of a busy internet server: analysis and improvements. Technical report, Computer Science Division, University of California at Berkeley, 1997. http://http.cs.berkeley.edu/padmanab/papers/csd-97-966.ps.gz. Google ScholarDigital Library
- {3} D. Clark and J. Wroclawski. An approach to service allocation in the internet, work in progress, Internet Draft draft-clark-diff-svc-alloc-00.txt, 1997.Google Scholar
- {4} Sally Floyd. Connections with multiple congested gateways in packet-switched networks, part 1: One-way traffic. Computer Communications Review, 21(5), October 1991. Google ScholarDigital Library
- {5} Sally Floyd and Kevin Fall. Router mechanisms to support end-to-end congestion control. Technical report, Laurence Berkley National Laboratory, Berkley, 1997. ftp://ftp.ee.lbl.gov/papers/collapse.ps.Google Scholar
- {6} R. Gardner. Games for Business and Economics. Wiley, New York, 1995.Google Scholar
- {7} Van Jacobson. Congestion avoidance and control. In Proceeings of ACM SIGCOMM, 1988. Google ScholarDigital Library
- {8} Lampros Kalampoukas and Anujan Varma, UCSC, K.K. Ramakrishnan, AT&T Labs Explicit Window Adaptation: A Method to Enhance TCP Performance In Proceedings of IEEE INFOCOM, 1998.Google Scholar
- {9} Frank Kelly. Charging and rate control of elastic traffic. European Transactions on Telecommunications, 8, 1997.Google Scholar
- {10} Frank Kelly, Aman Manlloo, and David Tan. Rate control for communication networks: shadow prices, proporional fairness and stability, draft, 1997. http://www.statslab.cam.ac.uk/frank/rate.html.Google Scholar
- {11} Matthew Mathis, Jeffrey Semke, and Jamhid Mahdavi. The macroscopic behavior of the tcp congestion avoidance algorithm. Computer Communication Review, 27(3):67-82, July 1997. Google ScholarDigital Library
- {12} K. Nichols, V. Jacobson, and L. Zhang. A two-bit differentiated services architecture for the internet. Internet Draft draft-nichols-diff-svc-arch-00.txt. work in progress, http://diffserv.lcs.mit.edu/Drafts/draft-nichols-diff-svc-arch-00.pdf.Google Scholar
- {13} Vern Paxson. Automated packet trace analsysis of TCP implementations. In Proceedings of ACM SIGCOMM '97, August 1997. Google ScholarDigital Library
- {14} J. Rawls. A Theory of Justice. Harvard University Press, Cambridge Mass, 1971.Google Scholar
- {15} S. Shenker. Fundamental design issues for the future internet. IEEE Journal on Selected Areas of Communication, 13:1176-1188, 1995. Google ScholarDigital Library
- {16} Zheng Wang. User-share differentiation (USD) scalable bandwidth allocation for differentiated services. - A Case for Proportional Sharing Internet Draft, draft-wang-diff-serv-usd-00.txt, Nov 1997. and In IEEE/IFIP IWQoS, 1998.Google Scholar
Index Terms
- Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
Recommendations
A middlebox-cooperative TCP for a non end-to-end internet
SIGCOMM'14Understanding, measuring, and debugging IP networks, particularly across administrative domains, is challenging. One particularly daunting aspect of the challenge is the presence of transparent middleboxes---which are now common in today's Internet. In-...
A middlebox-cooperative TCP for a non end-to-end internet
SIGCOMM '14: Proceedings of the 2014 ACM conference on SIGCOMMUnderstanding, measuring, and debugging IP networks, particularly across administrative domains, is challenging. One particularly daunting aspect of the challenge is the presence of transparent middleboxes---which are now common in today's Internet. In-...
Comments