DocumentCode :
3110420
Title :
Overlay routing to avoid BGP path inflation
Author :
Chen, Xiao ; Liu, Nianzu
Author_Institution :
Dept. of Comput. Sci., Shanghai Lixin Univ. of Commerce, Shanghai, China
fYear :
2011
fDate :
26-28 March 2011
Firstpage :
932
Lastpage :
938
Abstract :
Several studies have shown that the BGP protocol adopts a special routing policy such that the default BGP route is usually not the best choice in terms of path length or quality of service. In order to send the traffic through the shortest AS paths by overlay routing, we have to place overlay nodes at several critical points along such paths. Otherwise, these AS paths will never be available to end users. In this paper, we explore the method for deploying a BGP-aware overlay routing network. First, we formulate the task of overlay deployment as a novel optimization problem. Then we divide this optimization problem into two sub-problems and conquer them with different algorithms respectively. Finally we investigate the layout of the overlay derived from simulations and identify the major force that causes the AS-level path inflation. By simulation experiments, we conclude that we can derive a cost-efficient overlay with our methodology to provider a better routing service for a given set of pair-wise inter-domain connections.
Keywords :
optimisation; routing protocols; BGP aware overlay routing; BGP path inflation; BGP protocol; optimization problem; pairwise interdomain connections; shortest AS paths; Heuristic algorithms; Internet; Lasers; Peer to peer computing; Routing; Routing protocols;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Technology (ICIST), 2011 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-9440-8
Type :
conf
DOI :
10.1109/ICIST.2011.5765128
Filename :
5765128
Link To Document :
بازگشت