×

zbMATH — the first resource for mathematics

Resource pricing and the evolution of congestion control. (English) Zbl 0946.93028
Summary: We describe ways in which the transmission protocol of the Internet may evolve to support heterogeneous applications. We show that by appropriately marking packets at overloaded resources and by charging a fixed small amount for each mark received, end-nodes are provided with the necessary information and the correct incentive to use the network efficiently.

MSC:
93C30 Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)
PDF BibTeX XML Cite
Full Text: DOI
References:
[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, 1-14, (1989) · Zbl 0684.68016
[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, 53-67, (1998)
[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, 73-85, (1977) · Zbl 0361.68086
[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. · Zbl 0179.47904
[15] Kelly, F. P. (1979). Reversibility and stochastic networks. Chichester: Wiley. · Zbl 0422.60001
[16] Kelly, F.P., Routing in circuit-switched networks: optimization, shadow prices, and decentralization, Advances in applied probability, 20, 112-144, (1988) · Zbl 0644.60096
[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. · Zbl 1111.90313
[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, 158-181, (1990)
[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, 1176-1188, (1995)
[28] Shenker, S.; Clark, D.; Estrin, D.; Herzog, S., Pricing in computer networks: reshaping the research agenda, Telecommunications policy, 20, 183-201, (1996)
[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, 8-37, (1961)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.