Supported by the National Natural Science Foundation of China under Grant No.60473082 (国家自然科学基金); the National Basic Research Program of China under Grant No.2003CB314801 (国家重点基础研究发展计划(973))
Time Window Mechanism to Improve BGP Routing Convergence
In this paper, a time window mechanism based on the penalty value of route flap damping is designed to improve routing convergence. This mechanism judges the route stability in the network from BGP (border gateway protocol) routes correlation by observing multiple routes received from different peers jointly. Then BGP speaker can find instable routes earlier and makes stable routes get the chance to be selected earlier in route selection, thus curtail path exploration. Simulation results prove that with proper parameters this method can reduce convergence delay and communication overhead obviously. Furthermore, without addition information in BGP Update message, time window mechanism is a practical method to be deployed in the Internet.
[1] Rekhter Y, Li T, Hares S. A border gateway protocol 4 (BGP-4). RFC 4271, 2006.
[2] Labovitz C, Malan GR, Jahanian F. Internet routing instability. IEEE/ACM Trans. on Networking, 1998,6(5):15-527.
[3] Labovitz C, Ahuja A, Bose A, Jahanian F. Delayed Internet routing convergence. IEEE/ACM Trans. on Networking, 2001,9(3): 293-306.
[4] Zhang BC, Massey D, Zhang LX. Destination reachability and BGP convergence time. In: Proc. of the IEEE Global Telecommunications Conf., Vol.3. Los Angeles: IEEE, 2004. 1383-1389.
[6] Bartell M, Zhang R. BGP Design and Implementation. Cisco Press, 2003.
[7] Mao ZM, Govindan R, Varghese G, Katz RH. Route flap damping exacerbates Internet routing convergence. In: Proc. of the ACM SIGCOMM, Vol.32. New York: ACM, 2002. 221-233.
[8] Afek Y, Bremler-Barr A, Schwarz S. Improved BGP convergence via ghost flushing. IEEE Journal on Selected Areas in Communications, 2004,22(10):1933-1948.
[9] Pei D, Azuma M, Massey D, Zhang LX. BGP-RCN: Improving BGP convergence through root cause notification. Computer Networks, 2005,48(2):175-194.
[10] The SSFnet project. http://www.ssfnet.org/homepage.html