Advertisement

Resource Pricing for Differentiated Services

  • Peter B. Key
Part of the Informatik aktuell book series (INFORMAT)

Abstract

In paper we present an overview of recent work on resource pricing for differentiated Services in the Internet. This approach is based upon encouraging Cooperation between the end-systems and the network by use of the correct feedback signals. These Signals reflect the congestion shadow prices at a resource, and their use means then even ‘selfish’ end-systems, acting in their own best interests, will push the System to a global or social Optimum. In contrast to most current Diffserv proposals, little is required from resources in the network; they just have to mark packets correctly, while the end-system can use complex or simple strategies. All that is needed is for the end-systems to have an incentive to react to the feedback signals, and then we have a distributed resource sharing mechanism. We give examples of typical end-system behaviour, and show how this approach can also implement Distributed Admission Control, where the decision is in the hand of the end-system. We comment on how ECN (Explicit Congestion Notification) could be used as an enabling technology. Lastly we outline how guarantees can be constructed with this framework.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Robert Axelrod.The Evolution of Cooperation. Basic Books, NY, 1984.Google Scholar
  2. [2]
    T. Bonald and L. Massoulié. Impact of fairness on Internet performance. Submitted for publication, 2000.Google Scholar
  3. [3]
    S. Floyd and V. Jacobson. Random Early Detection gateways for congestion avoidance.IEEE/ACM Transactions on Networking, 1(4):397-413, 1993. http://www-nrg.ee.lbl.gov/floyd/red.html.CrossRefGoogle Scholar
  4. [4]
    R. J. Gibbens and F. P. Kelly. Resource pricing and the evolution of congestion control.Automatica, 35:1969-1985, 1999. http://www.statslab.cam.ac.uk/~frank/PAPERS/evol.html.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    R. J. Gibbens and P. B. Key. The use of games to assess user strategies for differential quality of service in the internet. InWorkshop on Internet Service Quality Economics, MIT, December 1999. http://research.microsoft.com/research/network/publications/gibkeyl999.ps.Google Scholar
  6. [6]
    F. P. Kelly. Models for a self-managed internet.Philosophical Transactions Royal Society, pages 2335–2348, 2000. www.statslab.am.ac.uk/~/smi.html.Google Scholar
  7. [7]
    F. P. Kelly, P. B. Key, and S. Zachary. Distributed admission control.IEEE Journal on Selected Areas in Communications, 18(12), December 2000. http://research.microsoft.com/research/network/publications/dac.htm.Google Scholar
  8. [8]
    F. P. Kelly, A. K. Maulloo, and D. K. H Tan. Rate control in communication networks: shadow prices, proportional fairness and stability.Journal of the Operational Research Society, 49:237-252, 1998.zbMATHGoogle Scholar
  9. [9]
    P. B. Key and L. Massoulié. User policies in a network implementing congestion pricing. InWorkshop on Internet Service Quality Economics, MIT, December 1999. http://research.microsoft.com/research/network/publications/ISQElm.ps.Google Scholar
  10. [10]
    P. B. Key and D. R. McAuley. Differential QoS and pricing in networks: where flow control meets game theory.IEE Proceedings Software, 146(2):39-43, March 1999.Google Scholar
  11. [11]
    Peter Key, Derek McAuley, Paul Barham, and Koenraad Laevens. Congestion pricing for congestion avoidance. Microsoft Research Technical Report MSR-TR-99-15, MSR, 1999. http://research.microsoft.com/pubs/.Google Scholar
  12. [12]
    S. Kunniyur and R. Srikant. End-to-end congestion control schemes: Utility functions, random losses and ECN marks. InINFOCOM 2000, 2000.Google Scholar
  13. [13]
    Koenraad Laevens, Peter Key, Derek McAuley, and Paul Barham. An ECN-based end-to-end congestion-control framework: experiments and evaluation. Microsoft Research Technical Report MSR-TR-2000-104, MSR, 2000. http://research.microsoft.com/research/network/publications/MSRTR2000_104.pdf.Google Scholar
  14. [14]
    D. E. Lapsley and S. H. Low. Random Early Marking: an optimisation approach to Internet congestion control. InProceedings of IEEE ICON’99. IEEE, 1999. Brisbane, Australia.Google Scholar
  15. [15]
    S. H. Low and D.E. Lapsley. Optimization flow control - I: Basic algorithm and convergence.IEEE/ACM Transactions on Networking, 7(6):861-874, December 1999.CrossRefGoogle Scholar
  16. [16]
    J. K. MacKie-Mason and H. R. Varian. Pricing congestible network resources.IEEE Journal of Selected Areas in Communications, 13(7):1141-1149, 1995.CrossRefGoogle Scholar
  17. [17]
    L. Massoulié. Stability of distributed congestion control with heterogeneous feedback delays. Tech Report MSR-2000-111, Microsoft Research, 2000.Google Scholar
  18. [18]
    Laurent Massoulié, Peter B. Key, and Koenraad Laevens. End-user policies for predicting congestion patterns in data networks. In13th ITC Specialist Seminar on Internet Traffic Measurement, September 2000. http://research.microsoft.com/research/network/publications/monterey.ps.Google Scholar
  19. [19]
    R. Mazumbdar, L.G. Mason, and C. Douglieris. Fairness in network optimal control: optimality of product forms.IEEE Trans. Communications, 39:775-782, 1991.CrossRefGoogle Scholar
  20. [20]
    J. Mo and J. Walrand. Fair end-to-end window based congestion control. InSPIE 98, International Symposium on Voice, Video and Data Communications, 1998.Google Scholar
  21. [21]
    John F Nash. The bargaining problem.Econometrica, 1950.Google Scholar
  22. [22]
    K. Ramakrishnan and S. Floyd. A proposal to add explicit congestion notification (ECN) to IP. RFC 2481, IETF, January 1999. ftp://ftp.isi.edu/in- notes/rfc2481.txt.Google Scholar
  23. [23]
    S. Shenker. Fundamental design issues for the future Internet.IEEE J. Selected Area Communications, 13:1176-1188, 1995.CrossRefGoogle Scholar
  24. [24]
    Neil Stratford. Congestion pricing: A testbed implementation. InMulti-Service Networks 2000, July 2000. http://research.microsoft.com/research/network/talks/Neil_S_Cos2k.pdf.Google Scholar
  25. [25]
    D. K. H. Tan.Mathematical models of rate control for communication networks. PhD thesis, University of Cambridge, 1999. http://www.statslab.cam.ac.uk/ dkht2/phd.html.Google Scholar
  26. [26]
    Damon Wischik. How to mark fairly. InWorkshop on Internet Service Quality Economics. MIT, December 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Peter B. Key
    • 1
  1. 1.Microsoft ResearchCambridgeUK

Personalised recommendations