Skip to main content

Improving BGP Convergence Time via MRAI Timer

  • Conference paper
  • First Online:
Novel Algorithms and Techniques in Telecommunications and Networking

Abstract

The Border Gateway Protocol (BGP) is the path vector protocol that routes inter-domain traffic, connecting Autonomous Systems (AS’s) together to form the decentralized backbone of the Internet. In the event of a network failure, BGP can take minutes to converge under default settings. With the route withdrawal rate limit (WRATE) change in the new BGP specification, the effect of the Minimum Route Advertisement Interval (MRAI) timer on convergence time needs to be re-evaluated. This paper shows that the reduction of the MRAI timer remains critical to the improvement of BGP convergence time. This paper also shows that while WRATE is not effective in improving convergence time, it reduces the number of transient loops and messages on the network at the optimal MRAI value.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Rekhter and T. Li, “Border Gateway Protocol 4,” RFC 4271, Jan. 2006

    Google Scholar 

  2. T.G. Griffin and B.J. Premore, “An Experimental Analysis of BGP Convergence Time,” in Proc. ICNP 2001.

    Google Scholar 

  3. “SSFNet: Scalable Simulation Framework”. [Online] Available: http://www.ssfnet.org

  4. D. Pei, X. Zhao, D. Massey, and L. Zhang, “A Study of BGP Path Vector Route Looping Behavior,” in Proceedings of ICDCS 2004.

    Google Scholar 

  5. A. Sahoo, K. Kant, and P. Mohapatra, “Improving BGP Convergence Delay for Large-Scale Failures,” in Proceedings of ICDSN 2006.

    Google Scholar 

  6. R. Viswanathan, K. Sabnani, R. Holt and A. Netravali, “Expected Convergence Properties of BGP,” in Proc. ICNP 2005.

    Google Scholar 

  7. L. Li, and C. Chen, “Anti-Loop Probing: Achieving Fast BGP Convergence,” in Proceedings of AINA 2006.

    Google Scholar 

  8. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, “Delayed Internet Routing Convergence,” SIGCOMM 2000.

    Google Scholar 

  9. A. Sridharan, S. Moon and C. Diot, “On the Correlation between Route Dynamics and Routing Loops,” in Proceedings of IMC 2003.

    Google Scholar 

  10. A. Bremler-Barr, Y. Afek and S. Schwarz, “Improved BGP Convergence via Ghost Flushing,” in Proceedings of IEEE INFOCOM 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Abdelshakour Abuzneid or Brandon J. Stark .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this paper

Cite this paper

Abuzneid, A., Stark, B.J. (2010). Improving BGP Convergence Time via MRAI Timer. In: Sobh, T., Elleithy, K., Mahmood, A. (eds) Novel Algorithms and Techniques in Telecommunications and Networking. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3662-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-3662-9_17

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-3661-2

  • Online ISBN: 978-90-481-3662-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics