Analysis of multi-path routing
IEEE/ACM Transactions on Networking (TON)
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Multipath routing mechanisms for traffic engineering and quality of service in the internet
Multipath routing mechanisms for traffic engineering and quality of service in the internet
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Path Computation for Incoming Interface Multipath Routing
ECUMN '07 Proceedings of the Fourth European Conference on Universal Multiservice Networks
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Link state routing protocols such as OSPF or IS-IS currently use only best paths to forward IP packets throughout a domain. The optimality of subpaths ensures consistency of hop by hop forwarding although paths, calculated using Dijkstra's algorithm, are recursively composed. According to the link metric, the diversity of existing paths can be underestimated using only best paths. Hence, it reduces potential benefits of multipath applications such as load balancing and fast rerouting. In this paper, we propose a low time complexity multipath computation algorithm able to calculate at least two paths with a differentfirst hop between all pairs of nodes in the network if such next hops exist. Using real and generated to pologies, we evaluate and compare the complexity of our proposition with severa techniques. Simulation results suggest that the path diversity achieved with our proposition is approximatively the same that the one obtained using consecutive Dijsktra computations, but with a lower time complexity.