Quantifying path exploration in the Internet

Ricardo Oliveira, Beichuan Zhang, Dan Pei, Lixia Zhang

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

Previous measurement studies 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. However, existing measurements were conducted only over a small number of testing prefixes. There has been no systematic study to quantify the pervasiveness of Border Gateway Protocol (BGP) slow convergence in the operational Internet, nor any known effort to deploy any of the proposed solutions. In this paper, we present our measurement results that identify 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 Internet service providers (ISPs) observe less path exploration, hence they experience shorter convergence delays than routers in edge ASs; prefixes originated from tier-1 ISPs also experience less path exploration than those originated from edge ASs. Furthermore, our data show that the convergence time of route fail-over events is similar to that of new route announcements and is significantly shorter than that of route failures. This observation is contrary to the widely held view from previous experiments but confirms our earlier analytical results. Our effort also led to the development of a path-preference inference method based on the path usage time, which can be used by future studies of BGP dynamics.

Original languageEnglish (US)
Pages (from-to)445-458
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume17
Issue number2
DOIs
StatePublished - 2009
Externally publishedYes

Fingerprint

Gateways (computer networks)
Internet
Internet service providers
Network protocols
Routers
Computer systems
Testing
Experiments

Keywords

  • AS topology completeness
  • Border Gateway Protocol (BGP)
  • Inter-domain routing
  • Internet topology

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Quantifying path exploration in the Internet. / Oliveira, Ricardo; Zhang, Beichuan; Pei, Dan; Zhang, Lixia.

In: IEEE/ACM Transactions on Networking, Vol. 17, No. 2, 2009, p. 445-458.

Research output: Contribution to journalArticle

Oliveira, Ricardo ; Zhang, Beichuan ; Pei, Dan ; Zhang, Lixia. / Quantifying path exploration in the Internet. In: IEEE/ACM Transactions on Networking. 2009 ; Vol. 17, No. 2. pp. 445-458.
@article{525a7e5a093346789b0475597f3a1bb7,
title = "Quantifying path exploration in the Internet",
abstract = "Previous measurement studies 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. However, existing measurements were conducted only over a small number of testing prefixes. There has been no systematic study to quantify the pervasiveness of Border Gateway Protocol (BGP) slow convergence in the operational Internet, nor any known effort to deploy any of the proposed solutions. In this paper, we present our measurement results that identify 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 Internet service providers (ISPs) observe less path exploration, hence they experience shorter convergence delays than routers in edge ASs; prefixes originated from tier-1 ISPs also experience less path exploration than those originated from edge ASs. Furthermore, our data show that the convergence time of route fail-over events is similar to that of new route announcements and is significantly shorter than that of route failures. This observation is contrary to the widely held view from previous experiments but confirms our earlier analytical results. Our effort also led to the development of a path-preference inference method based on the path usage time, which can be used by future studies of BGP dynamics.",
keywords = "AS topology completeness, Border Gateway Protocol (BGP), Inter-domain routing, Internet topology",
author = "Ricardo Oliveira and Beichuan Zhang and Dan Pei and Lixia Zhang",
year = "2009",
doi = "10.1109/TNET.2009.2016390",
language = "English (US)",
volume = "17",
pages = "445--458",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Quantifying path exploration in the Internet

AU - Oliveira, Ricardo

AU - Zhang, Beichuan

AU - Pei, Dan

AU - Zhang, Lixia

PY - 2009

Y1 - 2009

N2 - Previous measurement studies 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. However, existing measurements were conducted only over a small number of testing prefixes. There has been no systematic study to quantify the pervasiveness of Border Gateway Protocol (BGP) slow convergence in the operational Internet, nor any known effort to deploy any of the proposed solutions. In this paper, we present our measurement results that identify 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 Internet service providers (ISPs) observe less path exploration, hence they experience shorter convergence delays than routers in edge ASs; prefixes originated from tier-1 ISPs also experience less path exploration than those originated from edge ASs. Furthermore, our data show that the convergence time of route fail-over events is similar to that of new route announcements and is significantly shorter than that of route failures. This observation is contrary to the widely held view from previous experiments but confirms our earlier analytical results. Our effort also led to the development of a path-preference inference method based on the path usage time, which can be used by future studies of BGP dynamics.

AB - Previous measurement studies 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. However, existing measurements were conducted only over a small number of testing prefixes. There has been no systematic study to quantify the pervasiveness of Border Gateway Protocol (BGP) slow convergence in the operational Internet, nor any known effort to deploy any of the proposed solutions. In this paper, we present our measurement results that identify 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 Internet service providers (ISPs) observe less path exploration, hence they experience shorter convergence delays than routers in edge ASs; prefixes originated from tier-1 ISPs also experience less path exploration than those originated from edge ASs. Furthermore, our data show that the convergence time of route fail-over events is similar to that of new route announcements and is significantly shorter than that of route failures. This observation is contrary to the widely held view from previous experiments but confirms our earlier analytical results. Our effort also led to the development of a path-preference inference method based on the path usage time, which can be used by future studies of BGP dynamics.

KW - AS topology completeness

KW - Border Gateway Protocol (BGP)

KW - Inter-domain routing

KW - Internet topology

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

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

U2 - 10.1109/TNET.2009.2016390

DO - 10.1109/TNET.2009.2016390

M3 - Article

VL - 17

SP - 445

EP - 458

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

ER -