ABSTRACT
Using a simple analytical model, this paper addresses the following question: Should the Internet retain its best-effort-only architecture, or should it adopt one that is reservation-capable? We characterize the differences between reservation-capable and best-effort-only networks in terms of application performance and total welfare. Our analysis does not yield a definitive answer to the question we pose, since it would necessarily depend on unknowable factors such as the future cost of network bandwidth and the nature of the future traffic load. However, our model does reveal some interesting phenomena. First, in some circumstances, the amount of incremental bandwidth needed to make a best-effort-only network perform as well as a reservation capable one diverges as capacity increases. Second, in some circumstances reservation-capable networks retain significant advantages over best-effort-only networks, no matter how cheap bandwidth becomes. Lastly, we find bounds on the maximum performance advantage a reservation-capable network can achieve over best-effort architectures.
- 1.Jan Beran, Robert Sherman, Murad S. Taqqu, and Walter Willinger. Long-range dependence in variable-bit-rate video traffic. IEEE Transactions on Communications, 43(2):1566--1579, February 1995.]]Google ScholarCross Ref
- 2.R. Braden, Ed., L. Zhang, S. Berson, S. Herzog, (RSVP)- version 1 functional specification. Technical Report RFC 2205, Internet Engineering Task Force, September 1997.]] Google ScholarDigital Library
- 3.Lee Breslau and Scott Shenker. Best-effort versus reservations: A simple comparative analysis. Submitted to ACM Transactions on Networking, June 1998.]]Google Scholar
- 4.David D. Clark, Scott Shenker, and Lixia Zhang. Supporting real-time applications ill an integrated services packet network: Architecture and mechanism. In Proceedings of .4 (.7tll Sigcomm, pages 14--26, August 1992.]] Google ScholarDigital Library
- 5.Mark Crovella and Azer Bestavros. Self-similarity in world wide web traffic: Evidence and possible causes. In Proceedings of SIGMETRICS '96, 1996.]] Google ScholarDigital Library
- 6.Domenico Ferrari, Anindo Banerjea, and Hui Zhang. Network support for multimedia: A discussion of the Tenet. approach. Computer Networks and ISDN Systems, 10:1267-1280, July 1994.]] Google ScholarDigital Library
- 7.Sally Floyd. Comments on measurement-based admissions control for controlled-load services. submitted to CCR, July 1996.]]Google Scholar
- 8.Sugih Jamin, Peter B. Danzig, Scott J. Shenker, and Lixia Zhang. A measurement-based admission control algorithm for integrated services packet networks. I EEE/ACM Transactions on Networking, 5(1):56-70, February 1997.]] Google ScholarDigital Library
- 9.Will E. Leland, Murad S. Taqqu, Walter Willinger, and Daniel V. Wilson. On the self-similar nature of Ethernet traffic (extended version). IEEE/A CM Transactions on Networking, 2(1):1- 15, February 1994.]] Google ScholarDigital Library
- 10.Abhay K. Parekh and Robert. G. Gallager..4 generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/A CM Transactions on Networking, 1(3):344-357, June 1993.]] Google ScholarDigital Library
- 11.Vern Paxson and Sally Floyd. Wide-area traffic: the failure of Poisson modeling, in Proceedings of A CM Sigcomm, pages 257-268, London, United Kingdom, August 1994. ACM.]] Google ScholarDigital Library
- 12.S. Shenker, C. Partridge, and R. Guerin. Specification of guaranteed quMity of service. RFC 2212, Internet Engineering Task Force, September 1997.]] Google ScholarDigital Library
- 13.S. Shenker and J. Wroclawski. Network element service specification template. Technical Report RFC 2216, Internet Engineering Task Force, September 1997.]] Google ScholarDigital Library
- 14.Scott Shenker. Fundamental design issues for the future internet. IEEE Journal on Selected Areas in Communications, 13(7), September 1995.]]Google ScholarDigital Library
- 15.C. Topolcic. Experimental internet stream protocol, version 2 (ST-II). RFC 1190, SRI Network Information Center, October 1990.]] Google ScholarDigital Library
- 16.J. Wroclawski. Specification of the controlled-load network element service. RFC 2211, Internet Engineering Task Force, September 1997.]] Google ScholarDigital Library
- 17.J. Wroclawski. The use of RSVP with IETF integrated services. Technical Report RFC 2210, Internet Engineering Task Force, September 1997.]] Google ScholarDigital Library
- 18.Lixia Zhang, Steve Deering, Deborah Estrin, Scott Shenker, and Daniel Zappala. RSVP: A new resource reservation protocol. IEEE Network Magazine, 7( 5):8-18, September 1993.]]Google Scholar
Index Terms
- Best-effort versus reservations: a simple comparative analysis
Recommendations
Best-effort versus reservations revisited
IWQoS'05: Proceedings of the 13th international conference on Quality of ServiceIn this paper, we walk in the footsteps of the stimulating paper by Lee Breslau and Scott Shenker entitled “Best-effort vs. Reservations: A Simple Comparative Analysis”[1]. In fact, we finally follow their invitation to use their models as a starting ...
Best-effort versus reservations: a simple comparative analysis
Using a simple analytical model, this paper addresses the following question: Should the Internet retain its best-effort-only architecture, or should it adopt one that is reservation-capable? We characterize the differences between reservation-capable ...
Comments