Title :
Resilient Routing under Hierarchical Automatic Addressing
Author :
Song, Yang ; Gao, Lixin ; Fujikawa, Kenji
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Massachusetts, Amherst, MA, USA
Abstract :
BGP table size and update rate have increased dramatically in the last decade. The rate of the growth poses great demand on memory size and CPU speed of the router control processor. Hierarchical Automatic Addressing (HAA) reduces BGP table size and update rate by enabling prefix aggregation for multihomed ASes. However, the aggregation blocks routing information of individual ASes, and causes the routing system fails to react to failures. In this paper, we propose a resilient routing protocol referred to as Routing with Detour (RD) to address the problem. RD provides resilient routing under HAA, and it reacts to failures in a timely manner without modifying BGP. Our experiments with realistic AS topology show that RD has slight impact on HAA´s performance. More precisely, HAA with RD can reduce BGP table size and update rate by more than 90%.
Keywords :
internetworking; routing protocols; BGP table size; CPU speed; border gateway protocol; hierarchical automatic addressing; resilient routing; routing protocol; IEEE Communications Society; IP networks; Internet; Robustness; Routing; Routing protocols; Scalability;
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location :
Houston, TX, USA
Print_ISBN :
978-1-4244-9266-4
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2011.6134508