An analysis of convergence delay in path vector routing protocols

Dan Pei, Beichuan Zhang, Daniel Massey, Lixia Zhang

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

Path vector routing protocols such as the Border Gateway Protocol (BGP) are known to suffer from slow convergence following a change in the network topology or policy. Although a number of convergence enhancements have been proposed recently, there has been no general analytical framework to assess and compare the various proposed algorithms. In this paper we present such a general framework to analyze the upper bounds of path vector protocols' convergence delay under shortest path routing policy and single link failure. Our framework takes into account important factors such as network connectivity, failure location, and routing message processing delay. It can be used to analyze both standard BGP and all the proposed convergence improvement algorithms in the case of shortest path routing policy and single link failure. It enables us to obtain previously unavailable analytical results, including the delay bounds of path fail-over for standard BGP and its convergence enhancements. Our analysis shows that BGP fail-over delay bounds are mainly determined by two factors: (1) the distance between the failure location and the destination, and (2) the length of the longest alternate path to reach the destination after the failure. These two factors are captured formally by our analysis and can explain why existing convergence enhancements often provide only limited improvements in fail-over events. Moreover, explicitly modeling message processing delay reveals insights into the impacts of connectivity richness (i.e., node degree and total number of links in the network), and also the effectiveness of different enhancements. These new results enable one to better understand and compare the behavior of various path vector protocols under different topology structures, network sizes, and message delays.

Original languageEnglish (US)
Pages (from-to)398-421
Number of pages24
JournalComputer Networks
Volume50
Issue number3
DOIs
StatePublished - Feb 22 2006
Externally publishedYes

Fingerprint

Routing protocols
Gateways (computer networks)
Network protocols
Topology
Processing

Keywords

  • BGP
  • Path vector protocol
  • Routing
  • Routing protocol convergence

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

An analysis of convergence delay in path vector routing protocols. / Pei, Dan; Zhang, Beichuan; Massey, Daniel; Zhang, Lixia.

In: Computer Networks, Vol. 50, No. 3, 22.02.2006, p. 398-421.

Research output: Contribution to journalArticle

Pei, Dan ; Zhang, Beichuan ; Massey, Daniel ; Zhang, Lixia. / An analysis of convergence delay in path vector routing protocols. In: Computer Networks. 2006 ; Vol. 50, No. 3. pp. 398-421.
@article{bc2c75c3ef1142d3888fbc275d9d2897,
title = "An analysis of convergence delay in path vector routing protocols",
abstract = "Path vector routing protocols such as the Border Gateway Protocol (BGP) are known to suffer from slow convergence following a change in the network topology or policy. Although a number of convergence enhancements have been proposed recently, there has been no general analytical framework to assess and compare the various proposed algorithms. In this paper we present such a general framework to analyze the upper bounds of path vector protocols' convergence delay under shortest path routing policy and single link failure. Our framework takes into account important factors such as network connectivity, failure location, and routing message processing delay. It can be used to analyze both standard BGP and all the proposed convergence improvement algorithms in the case of shortest path routing policy and single link failure. It enables us to obtain previously unavailable analytical results, including the delay bounds of path fail-over for standard BGP and its convergence enhancements. Our analysis shows that BGP fail-over delay bounds are mainly determined by two factors: (1) the distance between the failure location and the destination, and (2) the length of the longest alternate path to reach the destination after the failure. These two factors are captured formally by our analysis and can explain why existing convergence enhancements often provide only limited improvements in fail-over events. Moreover, explicitly modeling message processing delay reveals insights into the impacts of connectivity richness (i.e., node degree and total number of links in the network), and also the effectiveness of different enhancements. These new results enable one to better understand and compare the behavior of various path vector protocols under different topology structures, network sizes, and message delays.",
keywords = "BGP, Path vector protocol, Routing, Routing protocol convergence",
author = "Dan Pei and Beichuan Zhang and Daniel Massey and Lixia Zhang",
year = "2006",
month = "2",
day = "22",
doi = "10.1016/j.comnet.2005.04.013",
language = "English (US)",
volume = "50",
pages = "398--421",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - An analysis of convergence delay in path vector routing protocols

AU - Pei, Dan

AU - Zhang, Beichuan

AU - Massey, Daniel

AU - Zhang, Lixia

PY - 2006/2/22

Y1 - 2006/2/22

N2 - Path vector routing protocols such as the Border Gateway Protocol (BGP) are known to suffer from slow convergence following a change in the network topology or policy. Although a number of convergence enhancements have been proposed recently, there has been no general analytical framework to assess and compare the various proposed algorithms. In this paper we present such a general framework to analyze the upper bounds of path vector protocols' convergence delay under shortest path routing policy and single link failure. Our framework takes into account important factors such as network connectivity, failure location, and routing message processing delay. It can be used to analyze both standard BGP and all the proposed convergence improvement algorithms in the case of shortest path routing policy and single link failure. It enables us to obtain previously unavailable analytical results, including the delay bounds of path fail-over for standard BGP and its convergence enhancements. Our analysis shows that BGP fail-over delay bounds are mainly determined by two factors: (1) the distance between the failure location and the destination, and (2) the length of the longest alternate path to reach the destination after the failure. These two factors are captured formally by our analysis and can explain why existing convergence enhancements often provide only limited improvements in fail-over events. Moreover, explicitly modeling message processing delay reveals insights into the impacts of connectivity richness (i.e., node degree and total number of links in the network), and also the effectiveness of different enhancements. These new results enable one to better understand and compare the behavior of various path vector protocols under different topology structures, network sizes, and message delays.

AB - Path vector routing protocols such as the Border Gateway Protocol (BGP) are known to suffer from slow convergence following a change in the network topology or policy. Although a number of convergence enhancements have been proposed recently, there has been no general analytical framework to assess and compare the various proposed algorithms. In this paper we present such a general framework to analyze the upper bounds of path vector protocols' convergence delay under shortest path routing policy and single link failure. Our framework takes into account important factors such as network connectivity, failure location, and routing message processing delay. It can be used to analyze both standard BGP and all the proposed convergence improvement algorithms in the case of shortest path routing policy and single link failure. It enables us to obtain previously unavailable analytical results, including the delay bounds of path fail-over for standard BGP and its convergence enhancements. Our analysis shows that BGP fail-over delay bounds are mainly determined by two factors: (1) the distance between the failure location and the destination, and (2) the length of the longest alternate path to reach the destination after the failure. These two factors are captured formally by our analysis and can explain why existing convergence enhancements often provide only limited improvements in fail-over events. Moreover, explicitly modeling message processing delay reveals insights into the impacts of connectivity richness (i.e., node degree and total number of links in the network), and also the effectiveness of different enhancements. These new results enable one to better understand and compare the behavior of various path vector protocols under different topology structures, network sizes, and message delays.

KW - BGP

KW - Path vector protocol

KW - Routing

KW - Routing protocol convergence

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

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

U2 - 10.1016/j.comnet.2005.04.013

DO - 10.1016/j.comnet.2005.04.013

M3 - Article

VL - 50

SP - 398

EP - 421

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 3

ER -