Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/285237.285248acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

Best-effort versus reservations: a simple comparative analysis

Published: 01 October 1998 Publication History

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.

References

[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.]]
[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.]]
[3]
Lee Breslau and Scott Shenker. Best-effort versus reservations: A simple comparative analysis. Submitted to ACM Transactions on Networking, June 1998.]]
[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.]]
[5]
Mark Crovella and Azer Bestavros. Self-similarity in world wide web traffic: Evidence and possible causes. In Proceedings of SIGMETRICS '96, 1996.]]
[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.]]
[7]
Sally Floyd. Comments on measurement-based admissions control for controlled-load services. submitted to CCR, July 1996.]]
[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.]]
[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.]]
[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.]]
[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.]]
[12]
S. Shenker, C. Partridge, and R. Guerin. Specification of guaranteed quMity of service. RFC 2212, Internet Engineering Task Force, September 1997.]]
[13]
S. Shenker and J. Wroclawski. Network element service specification template. Technical Report RFC 2216, Internet Engineering Task Force, September 1997.]]
[14]
Scott Shenker. Fundamental design issues for the future internet. IEEE Journal on Selected Areas in Communications, 13(7), September 1995.]]
[15]
C. Topolcic. Experimental internet stream protocol, version 2 (ST-II). RFC 1190, SRI Network Information Center, October 1990.]]
[16]
J. Wroclawski. Specification of the controlled-load network element service. RFC 2211, Internet Engineering Task Force, September 1997.]]
[17]
J. Wroclawski. The use of RSVP with IETF integrated services. Technical Report RFC 2210, Internet Engineering Task Force, September 1997.]]
[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.]]

Cited By

View all
  • (2013)Simplification of Service Functions Resulting from Growth in Scale of NetworksIEICE Transactions on Communications10.1587/transcom.E96.B.2224E96.B:9(2224-2234)Online publication date: 2013
  • (2010)Best-effort computingProceedings of the 47th Design Automation Conference10.1145/1837274.1837492(865-870)Online publication date: 13-Jun-2010
  • (2009)A Survey of Congestion and QoS Control Mechanisms for the InternetThe Industrial Information Technology Handbook10.1201/9781420036336.ch22(326-338)Online publication date: 13-Dec-2009
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '98: Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
October 1998
328 pages
ISBN:1581130031
DOI:10.1145/285237
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1998

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGCOMM98
Sponsor:
SIGCOMM98: ACM SIGCOMM'98
August 31 - September 4, 1998
British Columbia, Vancouver, Canada

Acceptance Rates

SIGCOMM '98 Paper Acceptance Rate 26 of 247 submissions, 11%;
Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)79
  • Downloads (Last 6 weeks)17
Reflects downloads up to 16 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2013)Simplification of Service Functions Resulting from Growth in Scale of NetworksIEICE Transactions on Communications10.1587/transcom.E96.B.2224E96.B:9(2224-2234)Online publication date: 2013
  • (2010)Best-effort computingProceedings of the 47th Design Automation Conference10.1145/1837274.1837492(865-870)Online publication date: 13-Jun-2010
  • (2009)A Survey of Congestion and QoS Control Mechanisms for the InternetThe Industrial Information Technology Handbook10.1201/9781420036336.ch22(326-338)Online publication date: 13-Dec-2009
  • (2009)Best-effort parallel execution framework for Recognition and mining applicationsProceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing10.1109/IPDPS.2009.5160991(1-12)Online publication date: 23-May-2009
  • (2008)On the feasibility of dynamic congestion-based pricing in differentiated services networksIEEE/ACM Transactions on Networking10.1109/TNET.2007.90816316:5(1001-1014)Online publication date: 1-Oct-2008
  • (2006)A decision-theoretic approach to reliable message deliveryDistributed Computing10.1007/BFb0056476(89-103)Online publication date: 2-Jun-2006
  • (2006)An efficient dynamic bandwidth allocation algorithm for quality of service networksProceedings of the First IFIP TC6 international conference on Autonomic Networking10.1007/11880905_12(132-145)Online publication date: 27-Sep-2006
  • (2006)Dynamic resource allocation in communication networksProceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems10.1007/11753810_74(892-903)Online publication date: 15-May-2006
  • (2005)Capacity requirements of traffic handling schemes in multi-service networksComputer Communications10.1016/j.comcom.2004.07.03528:18(2070-2081)Online publication date: 1-Nov-2005
  • (2005)Dynamic resource allocation in quality of service networksProceedings of the Second international conference on Wireless Systems and Network Architectures in Next Generation Internet10.1007/11750673_15(184-197)Online publication date: 13-Jul-2005
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media