Advertisement

Fast BGP Convergence Following Link/Router Failure

  • Swapan Kumar Ray
  • Susmit Shannigrahi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5935)

Abstract

A Modified Border Gateway Protocol (MBGP) has been proposed towards achieving faster BGP convergence in the Internet following link/router/ network failures. MBGP adopts the overall strategy of distributed fault detection-cum-identification, fault notification and rediscovery-cum-readvertisement of valid routes. In the assumed simplified model of the Internet, the sole MBGP router in each autonomous system (AS) identifies any failed component using the novel concept of special neighbors and notifies the identity of the failed component to all the MBGP routers in the Internet. Six new messages, including a query-response message pair and four permanent withdrawal messages, have been proposed in MBGP, without changing the BGP message format. The path exploration problem is significantly reduced because some failures cause no path exploration, the others do but only in a small number of nearby routers and, finally, no invalid messages are ever exchanged. Simulation studies have demonstrated significantly faster convergence of MBGP over BGP.

Keywords

BGP Convergence Slow Convergence in BGP Fast BGP Convergence Link or Router Failure in Internet Path Exploration in BGP Modified BGP Special Neighbors 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Labovitz, C., Ahuja, A., Bose, A., Jahanian, F.: Delayed Internet Routing Convergence. In: SIGCOMM 2000 (2000)Google Scholar
  3. 3.
    Labovitz, C., Wattenhofer, R., Venkatachary, S., Ahuja, A.: The Impact of Internet Policy and Topology On Delayed Routing Convergence. In: INFOCOM (April 2001)Google Scholar
  4. 4.
    Labovitz, C., Ahuja, A., Bose, A., Jahanian, F.: Delayed Internet Routing Convergence. IEEE/ACM Trans. Network, 293–306 (2001)Google Scholar
  5. 5.
    Griffin, T., Presmore, B.: An Experimental Analysis of BGP Convergence Time. IEEE ICNP (November 2001)Google Scholar
  6. 6.
    Mao, Z.M., Govindan, R., Varghese, G., Katz, R.: Route Flap Damping Exacerbates Internet Routing Convergence. ACM SIGCOMM (2002)Google Scholar
  7. 7.
    Griffin, T., Shepherd, F.: The Stable Path Problem and the Interdomain Routing. IEEE ICNP (November 2001)Google Scholar
  8. 8.
    Pei, D., Zhao, X., Wang, L., Massey, D.M., Su, A., Lixia Zhang, S.F.: Improving Bgp Convergence Through Consistency Assertions. In: INFOCOM 2002 (2002)Google Scholar
  9. 9.
    Bremler-Barr, A., Afek, Y., Schwarz, S.: Improved BGP Convergence via Ghost Flushing. In: IEEE INFOCOM (2003)Google Scholar
  10. 10.
    Pei, D., Azuma, M., Massey, D., Zhang, L.: BGP-RCN: Improving BGP Convergence Through Root Cause Notification. Computer Networks 48(2), 175–194 (2005)zbMATHCrossRefGoogle Scholar
  11. 11.
    Zhang, H., Arora, A., Liu, Z.: A Stability-Oriented Approach to Improving BGP Convergence. In: IEEE International Symposium on Reliable Distributed Systems (2004)Google Scholar
  12. 12.
    Chandrashekar, Z., Duan, Z.-L.: Zhang, and J. Krasky: Limiting Path Exploration in Bgp. In: INFCOM, Miami, USA (2005)Google Scholar
  13. 13.
    Feldmann, A., Maennel, O., Mao, Z.M., Berger, A., Maggs, B.: Locating Internet Routing Instabilities. ACM SIGCOMM Computer Communication Review archive 34(4) (October 2004)Google Scholar
  14. 14.
    Lad, M., Nanavati, A., Massey, D., Zhang, L.: An Algorithmic Approach to Identifying Link Failures. In: IEEE PISPDC, pp. 25–34 (2004)Google Scholar
  15. 15.
    Teixeira, R., Rexford, J.: A Measurement Framework for Pin-pointing Routing Changes. In: IEEE SIGCOMM 2004 workshop (2004)Google Scholar
  16. 16.
    Ray, S.K., Paira, S.K., Sen, S.K.: Modified Distance Vector Routing Avoids the Count-to-Infinity Problem. In: Proc. Intl. Conf. on Commun. devices and Intell. Systems (CODIS 2004), Calcutta, January 8-10, pp. 31–34 (2004)Google Scholar
  17. 17.
    Sen, S.K.: An Improved Network Routing Scheme Based on Distance Vector Routing. Ph.D (Engg.) Thesis of Jadavpur University (January 2008)Google Scholar
  18. 18.
    Ray, S.K., Ghosh, P., Sen, S.: Modified BGP has Faster Convergence. In: Proc. NCC 2006, I.I.T Delhi, January 27-29, pp. 404–408 (2006)Google Scholar
  19. 19.
    Shannigrahi, S.: Reducing path Exploration in BGP. M.C.S.E Thesis of Jadavpur University (June 2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Swapan Kumar Ray
    • 1
  • Susmit Shannigrahi
    • 1
  1. 1.Computer Science and Engineering DepartmentJadavpur UniversityKolkataIndia

Personalised recommendations