BibTeX
@MISC{Suh_stablerouting,
author = {Changjin Suh and Lixin Gao},
title = {Stable Routing in Internet with Fully Meshed Sibling Relationship},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. The Border Gateway Protocol (BGP, [1]) is the only path vector routing protocol used in Internet inter-domain. However, BGP still suffers from its inherent stability problems ([2]). If some BGP policy table is poorly configured, update of a routing path may trigger the change in another BGP router. This routing path changes occur sequentially and incessantly. As ISPs are reluctant to open local policies to public, rather than analyzing interworking of policy incidences, we tried to find out the recommendations that guarantee stability. Previously there were recommendations about the network consisting of provider-to-customer, customer-to-provider, peer-to-peer relationships without sibling relationships ([5]). Sibling links connect a set of close BGP routers to behave like a single virtual hyper-node having larger capacity. This paper solves how the stability is guaranteed in the networks containing full-mesh sibling relationship and suggests the guidelines proved to be safe while leaving significant flexibility to local policies. It is very easy to implement our results to BGP routers, because our approach (i) is consistent with previous results, (ii) is purely local without worrying about revealing private local policies and (iii) does not require change or additional functions of current BGP protocols. 1
Keyphrases
fully meshed sibling relationship bgp router local policy internet inter-domain path change private local policy significant flexibility current bgp protocol border gateway protocol path vector peer-to-peer relationship single virtual hyper-node bgp policy table close bgp router policy incidence inherent stability problem previous result additional function full-mesh sibling relationship
