Skip to main content
Log in

Analyzing and Improving Network Availability in Interdomain Routing

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The Internet now-a-days has become indispensable to each and everyone. It is vulnerable to node failures, link failures, and fluctuations due to many known or unknown reasons in the network connectivity. The bitter truth is even today networks’ failure, link faults are happening. A single change in a link or a node has a potential to trigger the unstable-routing-tables of many nodes. These failures may lead the network in an unstable state by increasing its convergence time significantly longer. In this paper we propose an algorithm to keep the value of the minimum route advertisement interval timer variable unlike the conventional approach of keeping it constant. The proposed approach makes the timer value varying depending on the receiver’s position with respect to the origin of the prefix advertised on the network. Simulations’ results show that the convergence time becomes significantly low and make the network converge relatively quicker.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

References

  1. Halabi, B. (1997). Internet routing architectures. Cisco Press. ISBN-13: 9788131725948.

  2. Rekhter, Y., & Li, T. (1995). Border Gateway Protocol 4. RFC 1771, SRI Network Information Center.

  3. The Border Gateway Protocol, Cisco Systems. http://www.cisco.com/en/US/tech/tk365/technologies_tech_note09186a00800c95bb.shtml. Accessed March 2003.

  4. Labovitz, C., Malan, G. R., & Jahanian, F. (1998). Internet Routing Instability. IEEE/ACM Transactions on Networking, 6(5), 515–528.

    Article  Google Scholar 

  5. Griffin, T. G., & Premore, B. J. (2001). An experimental analysis of BGP convergence time. In 2001 International conference on network protocols ICNP, pp. 53–61.

  6. Pei, D., Zhang, B., et al., (2005). An analysis of path-vector routing protocol convergence algorithms. Computer Networks. http://www.cs.arizona.edu/bzhang/paper/convergence.pdf.

  7. Labovitz, C., Ahuja A., & Bose, A. (2000, August). Delayed internet routing convergence. In Proceedings of SIGCOMM, (pp. 175–187) ACM.

  8. Bremler-Barr, A., Afek, Y., & Schwarz, S., (2003, April). Improved BGP convergence via ghost flushing. In Proceedings of INFOCOM, San Francisco, (pp. 927–937), CA.

  9. Pei, D., Azuma, M., Nguyen, N., Chen, J., Massey, D., & Zhang, L. (2005). BGP-RCN: Improving BGP convergence through root cause notification. Computer Networks Journal, 48(2), 175–194.

    Article  MATH  Google Scholar 

  10. Sahoo, A., Kant, K., & Mohapatra, P. (2006). Improving BGP convergence delay for large-scale failures. In Proceedings of the international conference on dependable systems and networks, (pp. 323–332). http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=1633521&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D1633521

  11. Deshpande, S., & Sikdar, B. (2004, November). On the impact of route processing and MRAI timers on BGP convergence times. In Proceedings of IEEE GLOBECOM. (pp. 1147–1151). Dallas, TX.

  12. Abuzneid, A., & Stark, B. J. (2010). “Improving BGP convergence time via MRAI timer” novel algorithms and techniques in telecommunications and networking, (pp. 105–110). ISBN: 978-90-481-3661-2.

  13. Yu, K.-M., Yu, C. W., & Yan, S.-F. (2011, April). An ad hoc routing protocol with multiple backup routes. Wireless Personal Communications, 57(4), 533–551.

    Google Scholar 

  14. Heer, T., Garcia-Morchon, O., Hummen, R., Keoh, L. S., Kumar, S. S., & Wehrle, K. (2011). Security challenges in the IP-based internet of things. Wireless Personal Communications, 61(3), 527–542.

    Article  Google Scholar 

  15. Scalable Networks Technologies. http://www.scalable-networks.com/content/products/qualnet.

  16. NS-BGP 2.0, www.ensc.sfu.ca/~ljilja/cnl/projects/BGP-ns-2.34/ns-2.34-BGP.html.

  17. Laskovic, N., & Trajkovic, L. (2006, April). BGP with an adaptive minimal route advertisement interval. In Performance, computing, and communications conference, 25th IEEE international IPCCC.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shishir Kumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kumar, M., Kumar, S. Analyzing and Improving Network Availability in Interdomain Routing. Wireless Pers Commun 72, 2069–2080 (2013). https://doi.org/10.1007/s11277-013-1136-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1136-6

Keywords

Navigation