Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/637201.637248acmconferencesArticle/Chapter ViewAbstractPublication PagesimcConference Proceedingsconference-collections
Article

Predicting and bypassing end-to-end internet service degradations

Published: 06 November 2002 Publication History

Abstract

We study the patterns and predictability of Internet End-to-End service degradations, where a degradation is a significant deviation of the round trip time between a client and a server. We use simultaneous RTT measurements collected from several locations to a large representative set of Web sites and study the duration and extent of degradations. We combine these measurements with BGP cluster information to learn on the location of the cause.We evaluate a number of predictors based upon Hidden Markov Models and Markov Models. Predictors typically exhibit a tradeoff between two types of errors, false positives (incorrect degradation prediction) and false negatives (a degradation is not predicted). The costs of these error-types is application dependent, but we capture the entire spectrum using a precision versus recall tradeoff. Using this methodology, we learn what information is most valuable for prediction (recency versus quantity of past measurements). Surprisingly, we also conclude that predictors that utilize history in a very simple way perform as well as more sophisticated ones.One important application of prediction is gateway selection, which is applicable when a LAN is connected through multiple gateways to one or several ISP's. Gateway selection can boost reliability and survivability by selecting for each connection the (hopefully) best gateway. We show that gateway selection using our predictors can reduce the degradations to half of that obtained by routing all the connections through the best gateway.

References

[1]
Y. Rekhter and T. Li, "A border gateway protocol 4 (BGP4)," Tech. Rep., IETF, 1999, draft-ietf-idr-bgp4-09.txt.
[2]
C. Labovitz, A. Ahuja, A. Bose, and E Johanian, "Delayed Internet routing convergence," in Proc. S1GCOMM 2000.
[3]
S. Savage, A. Collins, and E. Hoffman, "The end-to-end effects of Internet path selection," in Proc. SIGCOMM 1999.
[4]
"Route science company," http://www.routescience.com/.
[5]
"Sockeye networks," http://www.sockeye.com/.
[6]
"Opnix inc.," http://www.opnix.com/.
[7]
"Netvmg," http://www.netvmg.com/.
[8]
"Radware company," http://www.radware.com/.
[9]
"Internap company," http://www.internap.com/.
[10]
Z. Fei, S. Bhattacharjee, E. W. Zegura, and M. H. Ammar, "A novel server selection technique for improving the response time of a replicated service," in Proceedings of the IEEE INFOCOM Conference, 1998.
[11]
P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang, "IDMaps: a global Internet host distance estimation service," IEEE/ACM Transactions on Networking, vol. 9, pp. 525--540, 2001.
[12]
Y. Zhang, N. Duffield, V. Paxson, and S. Shenker, "On the constancy of Internet path properties," in Proc. IMW 2002.
[13]
D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proc. SOSP 2001.
[14]
"IRcache home," http://www.ircache.net.
[15]
"Nanog digest 900," http://www.nanog.org/.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
IMW '02: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
November 2002
334 pages
ISBN:158113603X
DOI:10.1145/637201
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: 06 November 2002

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

IMW02
Sponsor:
IMW02: Internet Measurement Workshop
November 6 - 8, 2002
Marseille, France

Acceptance Rates

Overall Acceptance Rate 29 of 80 submissions, 36%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 27 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Decay ModelsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_126(1008-1012)Online publication date: 7-Dec-2018
  • (2017)SWIFTProceedings of the Conference of the ACM Special Interest Group on Data Communication10.1145/3098822.3098856(460-473)Online publication date: 7-Aug-2017
  • (2017)Decay ModelsEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_126-2(1-5)Online publication date: 2-Jan-2017
  • (2010)Challenge identification for network resilience6th EURO-NGI Conference on Next Generation Internet10.1109/NGI.2010.5534459(1-8)Online publication date: Jun-2010
  • (2009)Defining defects, errors, and service degradationsACM SIGSOFT Software Engineering Notes10.1145/1507195.150720534:2(1-14)Online publication date: 28-Feb-2009
  • (2009)Decay ModelsEncyclopedia of Database Systems10.1007/978-0-387-39940-9_126(757-761)Online publication date: 2009
  • (2008)Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive ErrorTheory of Computing Systems10.1007/s00224-007-9031-842:3(349-365)Online publication date: 5-Feb-2008
  • (2007)A Framework for Measuring and Predicting the Impact of Routing ChangesProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.47(339-347)Online publication date: 1-May-2007
  • (2005)Improved algorithms for polynomial-time decay and time-decay with additive errorProceedings of the 9th Italian conference on Theoretical Computer Science10.1007/11560586_25(309-322)Online publication date: 12-Oct-2005
  • (2003)Measuring the effects of internet path faults on reactive routingACM SIGMETRICS Performance Evaluation Review10.1145/885651.78104331:1(126-137)Online publication date: 10-Jun-2003
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media