IEEE/ACM Transactions on Networking (TON)
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Internet Routing Architectures
Internet Routing Architectures
An Experimental Analysis of BGP Convergence Time
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Improving BGP Convergence Delay for Large-Scale Failures
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Ad Hoc Routing Protocol with Multiple Backup Routes
Wireless Personal Communications: An International Journal
Security Challenges in the IP-based Internet of Things
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
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.