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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rekhter, Y., Li, T., Hares, S. (eds.): A Border Gateway Protocol 4 (BGP-4), RFC 4271 (January 2006)
Bates, T., Chandra, R., Chen, E.: BGP Route Reflection – An Alternative to Full Mesh IBGP, RFC 2796, Network Working Group (April 2000)
Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.: How to Construct a Correct and Scalable IBGP Configuration. In: Proceedings of IEEE INFOCOM (2006)
Zhao, F., Lu, X.C., Zhu, P.D., Zhao, J.J.: BGPSep_D: An Improved Algorithm for Constructing Correct and Scalable IBGP configurations Based on Vertexes Degree. In: Gerndt, M., Kranzlmüller, D. (eds.) HPCC 2006. LNCS, vol. 4208, pp. 406–415. Springer, Heidelberg (2006)
Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: Inferring Link Weights using End-to-end Measurements. In: Proc. 2nd ACM SIGCOMM Internet Measurement Workshop, Marseille, France, pp. 231–236 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, F., Lu, X., Zhu, P., Zhao, J. (2006). BGPSep_S: An Algorithm for Constructing IBGP Configurations with Complete Visibility. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_42
Download citation
DOI: https://doi.org/10.1007/11947950_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68139-7
Online ISBN: 978-3-540-68140-3
eBook Packages: Computer ScienceComputer Science (R0)