Quantifying path exploration in the internet

Ricardo Oliveira, Beichuan Zhang, Dan Pei, Rafit Izhak-Ratzin, Lixia Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

43 Citations (Scopus)

Abstract

A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem [21, 15, 4, 20, 5]. However all the previous measurements were conducted over a small number of testing pre-fixes. There has been no systematic study to quantify the pervasiveness of BGP slow convergence in the operational Internet, nor there is any known effort to deploy any of the proposed solutions. In this paper we present our measurement results from identifying BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 ISPs observe less path exploration, hence shorter convergence delays than routers in edge ASes, and prefixes originatd from tier-1 ISPs also experience less path exploration than those originated from edge ASes. Our data also shows that the convergence time of route fail-over events is similar to that of new route announcements, and significantly shorter than that of route failures, which confirms our earlier analytical results [19]. In addition, we also developed a usage-time based path preference inference method which can be used by future studies of BGP dynamics.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGCOMM Internet Measurement Conference, IMC
Pages269-282
Number of pages14
DOIs
StatePublished - 2006
Event6th ACM SIGCOMM on Internet Measurement Conference, IMC 2006 - Rio de Janeriro, Brazil
Duration: Oct 25 2006Oct 27 2006

Other

Other6th ACM SIGCOMM on Internet Measurement Conference, IMC 2006
CountryBrazil
CityRio de Janeriro
Period10/25/0610/27/06

Fingerprint

Internet
Routers
Computer systems
Network protocols
Testing

Keywords

  • BGP
  • Path exploration
  • Routing convergence
  • Slow convergence

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Oliveira, R., Zhang, B., Pei, D., Izhak-Ratzin, R., & Zhang, L. (2006). Quantifying path exploration in the internet. In Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC (pp. 269-282) https://doi.org/10.1145/1177080.1177116

Quantifying path exploration in the internet. / Oliveira, Ricardo; Zhang, Beichuan; Pei, Dan; Izhak-Ratzin, Rafit; Zhang, Lixia.

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2006. p. 269-282.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Oliveira, R, Zhang, B, Pei, D, Izhak-Ratzin, R & Zhang, L 2006, Quantifying path exploration in the internet. in Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. pp. 269-282, 6th ACM SIGCOMM on Internet Measurement Conference, IMC 2006, Rio de Janeriro, Brazil, 10/25/06. https://doi.org/10.1145/1177080.1177116
Oliveira R, Zhang B, Pei D, Izhak-Ratzin R, Zhang L. Quantifying path exploration in the internet. In Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2006. p. 269-282 https://doi.org/10.1145/1177080.1177116
Oliveira, Ricardo ; Zhang, Beichuan ; Pei, Dan ; Izhak-Ratzin, Rafit ; Zhang, Lixia. / Quantifying path exploration in the internet. Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. 2006. pp. 269-282
@inproceedings{92169b58c34346f9beb62c59a13fbe57,
title = "Quantifying path exploration in the internet",
abstract = "A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem [21, 15, 4, 20, 5]. However all the previous measurements were conducted over a small number of testing pre-fixes. There has been no systematic study to quantify the pervasiveness of BGP slow convergence in the operational Internet, nor there is any known effort to deploy any of the proposed solutions. In this paper we present our measurement results from identifying BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 ISPs observe less path exploration, hence shorter convergence delays than routers in edge ASes, and prefixes originatd from tier-1 ISPs also experience less path exploration than those originated from edge ASes. Our data also shows that the convergence time of route fail-over events is similar to that of new route announcements, and significantly shorter than that of route failures, which confirms our earlier analytical results [19]. In addition, we also developed a usage-time based path preference inference method which can be used by future studies of BGP dynamics.",
keywords = "BGP, Path exploration, Routing convergence, Slow convergence",
author = "Ricardo Oliveira and Beichuan Zhang and Dan Pei and Rafit Izhak-Ratzin and Lixia Zhang",
year = "2006",
doi = "10.1145/1177080.1177116",
language = "English (US)",
isbn = "1595935614",
pages = "269--282",
booktitle = "Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC",

}

TY - GEN

T1 - Quantifying path exploration in the internet

AU - Oliveira, Ricardo

AU - Zhang, Beichuan

AU - Pei, Dan

AU - Izhak-Ratzin, Rafit

AU - Zhang, Lixia

PY - 2006

Y1 - 2006

N2 - A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem [21, 15, 4, 20, 5]. However all the previous measurements were conducted over a small number of testing pre-fixes. There has been no systematic study to quantify the pervasiveness of BGP slow convergence in the operational Internet, nor there is any known effort to deploy any of the proposed solutions. In this paper we present our measurement results from identifying BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 ISPs observe less path exploration, hence shorter convergence delays than routers in edge ASes, and prefixes originatd from tier-1 ISPs also experience less path exploration than those originated from edge ASes. Our data also shows that the convergence time of route fail-over events is similar to that of new route announcements, and significantly shorter than that of route failures, which confirms our earlier analytical results [19]. In addition, we also developed a usage-time based path preference inference method which can be used by future studies of BGP dynamics.

AB - A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem [21, 15, 4, 20, 5]. However all the previous measurements were conducted over a small number of testing pre-fixes. There has been no systematic study to quantify the pervasiveness of BGP slow convergence in the operational Internet, nor there is any known effort to deploy any of the proposed solutions. In this paper we present our measurement results from identifying BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 ISPs observe less path exploration, hence shorter convergence delays than routers in edge ASes, and prefixes originatd from tier-1 ISPs also experience less path exploration than those originated from edge ASes. Our data also shows that the convergence time of route fail-over events is similar to that of new route announcements, and significantly shorter than that of route failures, which confirms our earlier analytical results [19]. In addition, we also developed a usage-time based path preference inference method which can be used by future studies of BGP dynamics.

KW - BGP

KW - Path exploration

KW - Routing convergence

KW - Slow convergence

UR - http://www.scopus.com/inward/record.url?scp=34547406892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547406892&partnerID=8YFLogxK

U2 - 10.1145/1177080.1177116

DO - 10.1145/1177080.1177116

M3 - Conference contribution

AN - SCOPUS:34547406892

SN - 1595935614

SN - 9781595935618

SP - 269

EP - 282

BT - Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

ER -