On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Routing in the Internet (2nd ed.)
Routing in the Internet (2nd ed.)
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
FRTR: A Scalable Mechanism for Global Routing Table Consistency
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Delivering Packets During The Routing Convergence Latency Interval Through Highly Connected Detours
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Stability-Oriented Approach to Improving BGP Convergence
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Internet Routing Anomaly Detection and Visualization
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Improving BGP Convergence Delay for Large-Scale Failures
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
An analysis of convergence delay in path vector routing protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
This work proposes a fault-tolerant dynamic routing algorithm that employs maximum flow evaluation for route selection, increasing the number of disjoint paths to the destination, enhancing the path redundancy, and so extending the possibility of using detours, or alternative paths if needed. Route distance is employed as a secondary criterion. Routes may be dynamically changed by intermediate routers, which usually have more recent information about topology changes. Formal proofs for correctness of the algorithm are also presented. The proposed algorithm was implemented in a simulation environment and experimental results are presented.