On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of multi-path routing
IEEE/ACM Transactions on Networking (TON)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Experience in black-box OSPF measurement
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Introduction to Algorithms
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
BANANAS: an evolutionary framework for explicit and multipath routing in the internet
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An evaluation of IP-based fast reroute techniques
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
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
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Towards low-complexity Internet traffic engineering: The Adaptive Multi-Path algorithm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Low complexity link state multipath routing
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
The Journal of Supercomputing
The Journal of Supercomputing
Revisiting flow-based load balancing: Stateless path selection in data center networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Multipath routing allows for load balancing and fast re-routing in order to improve the reliability and the efficiency of the network. Current IP routers only support Equal Cost MultiPath (ECMP) which guarantees that the forwarding paths do not contain loops. However, ECMP provides limited path diversity. In this paper, we present an efficient algorithm that allows routers to enable more path diversity: our algorithm let all routers compute at least the two best first hop distinct paths towards each destination and achieves a good tradeoff between path diversity and overhead. In addition, we propose a multipath routing scheme whose goal is to combine fast re-routing and load balancing loop-free routes. The low overhead of our scheme (no additional signaling messages and low complexity) and the nature of its loop-free rules allow to incrementally deploy it on current IP routers. Using actual, inferred, and generated topologies, we compare our algorithm to existing solutions.