BGPSep_D: an improved algorithm for constructing correct and scalable IBGP configurations based on vertexes degree

Authors:
Feng Zhao;Xicheng Lu;Peidong Zhu;Jinjing Zhao
Affiliations:
School of Computer, National University of Defense Technology, Hunan, China;School of Computer, National University of Defense Technology, Hunan, China;School of Computer, National University of Defense Technology, Hunan, China;School of Computer, National University of Defense Technology, Hunan, China
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 6
Cited 1

On the correctness of IBGP configuration

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Route oscillations in I-BGP with route reflection

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring link weights using end-to-end measurements

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analysis of the MED Oscillation Problem in BGP

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Proactive techniques for correct and predictable internet routing

Proactive techniques for correct and predictable internet routing
Detecting BGP configuration faults with static analysis

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2

BGPSep_S: an algorithm for constructing IBGP configurations with complete visibility

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

IBGP configurations based on the route reflection may lead to forwarding loops and sub-optimal paths. Although the IBGP configuration generated by BGPSep guarantees three correctness properties of complete visibility, loop-free forwarding, robustness to IGP failures, and the number of IBGP sessions is smaller than in a full-mesh configuration, BGPSep does not reduce the number of IBGP sessions of its top level route reflectors. We improve BGPSep by removing some vertexes, whose degrees satisfy some conditions, from the IGP graph gradually. The improved algorithm is called BGPSep_D. We prove that BGPSep_D satisfies the three correctness properties. The performance of BGPSep_D is evaluated on several real-world backbone topologies. Experimental results indicate that BGPSep_D can generate an IBGP topology with much smaller maximum degree and a much smaller number of IBGP sessions than that produced by BGPSep.