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.
This research was supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2003CB314802 and the National High-Tech Research and Development Plan of China under Grant No. 2005AA121570.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rekhter, Y., Li, T.: Border Gateway Protocol 4, RFC 1771, SRI Network Information Center (July 1995)
Rekhter, Y., Li, T., Hares, S.: A Border Gateway Protocol 4 (BGP- 4). Internet Draft draft-ietf-idr-bgp4-26.txt (October 2004)
Bates, T., Chandra, R., Chen, E., Route Reflection, B.G.P.: – An Alternative to Full Mesh IBGP, RFC 2796, Network Working Group (April 2000)
Bates, T., Chandra, R., Chen, E.: BGP Route Reflection – An Alternative to Full Mesh IBGP, draft-ietf-idr-rfc2796bis-01.txt, Network Working Group (November 2004)
Basu, A., Luke Ong, C., Rasala, A., Bruce Shepherd, F., Wilfong, G.: Route Oscillations in IBGP with Route Reflection. In: Proc. ACM SIGCOMM, Pittsburgh, PA, pp. 235–247 (August 2002)
Griffin, T.G., Wilfong, G.: Analysis of the MED Oscillation Problem in BGP. In: Proc. 10th IEEE International Conference on Network Protocols, Paris, France, pp. 90–99 (November 2002)
Griffin, T.G., Wilfong, G.: On the correctness of IBGP configuration. In: Proc. ACM SIGCOMM, Pittsburgh, PA, pp. 17–29 (August 2002)
McPherson, D., Gill, V., Walton, D., Retana, A.: Border Gateway Protocol Persistent Route Oscillation Condition, RFC 3345 (August 2002)
Feamster, N.: Proactive Techniques for Correct and Predictable Internet Routing. PhD thesis, Massachusetts Institute of Technology (September 2005)
Feamster, N., Balakrishnan, H.: Detecting BGP Configuration Faults with Static Analysis. In: Proc. 2nd Symp. On Networked Systems Design and Implementation (NSDI), Boston, MA (May 2005)
Musunuri, R., Cobb, J.A.: Stable IBGP through Selective Path Dissemination. In: IASTED Parallel and Distributed Computing and Systems Conference (PDCS), Marina Del Ray, CA, November 3-5 (2003)
Musunuri, R., Cobb, J.A.: A complete solution for IBGP stability. In: ICC 2004 (2004)
Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.: How to Construct a Correct and Scalable IBGP Configuration. In: Proceedings of IEEE INFOCOM (2006)
Feldman, A., et al.: Measuring BGP Pass-Through times. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol. 3015, pp. 267–277. Springer, Heidelberg (2004)
Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: Inferring Link Weights Esing 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_D: An Improved Algorithm for Constructing Correct and Scalable IBGP Configurations Based on Vertexes Degree. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_42
Download citation
DOI: https://doi.org/10.1007/11847366_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)