ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Best-effort versus reservations: a simple comparative analysis
Full text PdfPdf (1.62 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Vancouver, British Columbia, Canada
Pages: 3 - 16  
Year of Publication: 1998
ISBN:1-58113-003-1
Also published in ...
Authors
Lee Breslau  Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
Scott Shenker  Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 40,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/285237.285248
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
5
 
6
 
7
Sally Floyd. Comments on measurement-based admissions control for controlled-load services. submitted to CCR, July 1996.
 
8
 
9
 
10
11
 
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  13

Collaborative Colleagues:
Lee Breslau: colleagues
Scott Shenker: colleagues