BGPSep_S: an algorithm for constructing IBGP configurations with complete visibility

Authors:
Feng Zhao;Xicheng Lu;Peidong Zhu;Jinjing Zhao
Affiliations:
School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China
Venue:
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Year:
2006

Citing 2
Cited 0

Inferring link weights using end-to-end measurements

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
BGPSep_D: an improved algorithm for constructing correct and scalable IBGP configurations based on vertexes degree

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

IBGP configurations based on the route reflection may violate the properties of complete visibility, thus leading to forwarding loops and sub-optimal paths. On the other hand, a router should not maintain too much BGP sessions because of performance reason. This paper presents an IBGP topology construction algorithm, called BGPSep_S, by taking into consideration the vertexes degrees, the vertexes separators and the shortest paths between vertexes in the underlying IGP graph. We prove that BGPSep_S guarantees complete visibility in normal situations. And the performance of BGPSep_S is evaluated on several real-world backbone topologies. Experimental results show that the maximum degrees of the IBGP topologies generated by BGPSep_S for these IGP topologies can be reduced by about 27%-68%, compared with full mesh and BGPSep.