Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP

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.

REFERENCES

• 1: Dimitri Bertsekas , Robert Gallager, Data networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
• 2: H. Balakrishnan , V. Padmanabhan , S. Seshan , R. H. Katz , M. Stemm, TCP Behavior of a Busy Internet Server: Analysis and Improvements, University of California at Berkeley, Berkeley, CA, 1997
• 3: [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.
• 4: Sally Floyd, Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic, ACM SIGCOMM Computer Communication Review, v.21 n.5, p.30-47, Oct. 1991 [doi>10.1145/122431.122434]
• 5: [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.
• 6: [6] R. Gardner. Games for Business and Economics. Wiley, New York, 1995.
• 7: V. Jacobson, Congestion avoidance and control, Symposium proceedings on Communications architectures and protocols, p.314-329, August 16-18, 1988, Stanford, California, United States
• 8: [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.
• 9: [9] Frank Kelly. Charging and rate control of elastic traffic. European Transactions on Telecommunications, 8, 1997.
• 10: [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.
• 11: Matthew Mathis , Jeffrey Semke , Jamshid Mahdavi, The macroscopic behavior of the TCP congestion avoidance algorithm, ACM SIGCOMM Computer Communication Review, v.27 n.3, p.67-82, July 1997 [doi>10.1145/263932.264023]
• 12: [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.
• 13: Vern Paxson, Automated packet trace analysis of TCP implementations, Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication, p.167-179, September 14-18, 1997, Cannes, France
• 14: [14] J. Rawls. A Theory of Justice. Harvard University Press, Cambridge Mass, 1971.
• 15: [15] S. Shenker. Fundamental design issues for the future internet. IEEE Journal on Selected Areas of Communication, 13:1176-1188, 1995.
• 16: [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.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
          Subjects: Internet (e.g., TCP/IP)

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

          Nouns: TCP/IP

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems

General Terms:
Design, Experimentation, Measurement, Performance, Standardization, Theory