Resource pricing and the evolution of congestion control

Automatica

Volumn 35, Issue 12, 1999, Pages 1969-1985

  Gibbens, R J ^a   Kelly, F P ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); GAME THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PACKET NETWORKS; TELECOMMUNICATION TRAFFIC;

TRANSMISSION CONTROL PROTOCOL (TCP);

INTERNET;

EID: 0033283294     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(99)00135-1     Document Type: Article

References (31)

1. Axelrod, R. 1984. The evolution of co-operation. London: Penguin.
2. Chiu D.-M., Jain R. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems. 17:1989;1-14.
3. Clark, D. D. (1996). Adding service discrimination to the Internet. Telecommunications Policy, 20. http: // ana-www.lcs.mit.edu / anaweb / abstracts / TPRC2-0.html.
4. Courcoubetis, C., Stamoulis, G. D., Manolakis, C., & Kelly, F. P. (1998). An intelligent agent for optimizing QoS-for-money in priced ABR connections. Preprint.
5. Crowcroft J., Oechslin P. Differentiated end-to-end Internet services using a weighted proportionally fair sharing TCP. ACM Computer Communications Review. 28:1998;53-67.
6. Floyd, S. (1994). TCP and explicit congestion notification. ACM Computer Communications Review, 24, 10-23. http: // www-nrg.ee.lbl.gov / floyd / ecn.html.
7. Floyd, S., & Fall, K. (1998). Promoting the use of end-to-end congestion control in the Internet. http: // www-nrg.ee.lbl.gov / floyd / end2end-paper.html.
8. Floyd, S., & Jacobson, V. (1993). Random early detection gateways for congestion avoidance. IEEE / ACM Transactions on Networking, 1, 397-413. ftp: // ftp.ee.lbl.gov / papers / early.pdf.
9. Gallager R.G. A mininum delay routing algorithm using distributed computation. IEEE Transactions on Communications. 25:1977;73-85.
10. Gibbens, R. J., Mason, R., & Steinberg, R. (1998). Multiproduct competition between congestible networks. University of Southampton Discussion Paper in Economics and Econometrics, No. 9816. http: // www.soton.ac.uk / ~ ram2.
11. Gupta, A., Stahl, A. O., & Whinston, A. B. (1997). Priority pricing of integrated services networks. In L. W. McKnight, & J. P. Bailey, Internet economics. Cambridge, Massachussetts: MIT Press.
12. International Telecommunications Union (1996). Recommendation I371: Traffic control and congestion control in B-ISDN. Geneva.
13. Jacobson, V. (1988). Congestion avoidance and control. In Proceedings of the ACM SIGCOMM '88, pp. 314-329. A revised version, joint with M.J. Karels, is available via ftp: // ftp.ee.lbl.gov / papers / congavoid.ps.Z.
14. Jaiswal, N. K. (1968). Priority queues. New York: Academic Press.
15. Kelly, F. P. (1979). Reversibility and stochastic networks. Chichester: Wiley.
16. Kelly F.P. Routing in circuit-switched networks: Optimization, shadow prices, and decentralization. Advances in Applied Probability. 20:1988;112-144.
17. Kelly, F. P. (1997). Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8, 33-37. http: // www.statslab.cam.ac.uk / ~ frank / elastic.html.
18. Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998). Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 237-252. http: // www.statslab.cam.ac.uk /~ frank / rate.html.
19. Key, P., & McAuley, D. (1999). Differential QoS and pricing in networks: Where flow control meets game theory. IEE Proc Software, 146.
20. MacKie-Mason, J. K., & Varian, H. R. (1994). Pricing the Internet. In B. Kahin, & J. Keller, Public Access to the Internet. Englewood Cliffs, New Jersey: Prentice-Hall.
21. Massoulié, L., & Roberts, J. (1998). Fairness and quality of service for elastic traffic. Preprint.
22. Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997). The macroscopic behaviour of the TCP congestion avoidance algorithm. Computer Communication Review, 27.
23. Odlyzko, A. (1997). A modest proposal for preventing Internet congestion. http: // www.research.att.com /~ amo / doc / modest.proposal.ps.
24. Ott, T. J., & Krishnan, K. R. (1985). State dependent routing of telephone traffic and the use of separable routing schemes. In M. Akiyama, Proceedings of the 11th International Teletraffic Congress. Amsterdam: North-Holland.
25. Ramakrishnan K.K., Jain R. A binary feedback scheme for congestion avoidance in computer networks. ACM Transactions on Computer Systems. 8:1990;158-181.
26. Ridley, M. (1997). The origins of virtue. London: Penguin.
27. Shenker S. Fundamental design issues for the future Internet. IEEE Journal Selected Areas Communication. 13:1995;1176-1188.
28. Shenker S., Clark D., Estrin D., Herzog S. Pricing in computer networks: Reshaping the research agenda. Telecommunications Policy. 20:1996;183-201.
29. Tan, D. K. H. (1998). Rate control and user behaviour in communication networks. Presented at the fourth INFORMS telecommunications conference, Boca Raton, Florida. http: // www.statslab.cam.ac.uk /~ dkht2 / conf.ps.
30. Varian, H. R. (1992). Microeconomic analysis (3rd ed.). New York: Norton.
31. Vickrey W. Counterspeculation, auctions and competitive sealed tenders. The Journal of Finance. 16:1961;8-37.