Multipath routing algorithms for congestion minimization

Authors:
Ron Banner;Ariel Orda
Affiliations:
Department of Electrical Engineering, Technion – Israel Institute of Technology, Haifa, Israel;Department of Electrical Engineering, Technion – Israel Institute of Technology, Haifa, Israel
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 10
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
End-to-end routing behavior in the Internet

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Online computation and competitive analysis

Online computation and competitive analysis
Analysis of multi-path routing

IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms

Introduction to Algorithms
On Selection of Paths for Multipath Routing

IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. Yet, in contrast to the single-path routing approach, most studies in the context of multipath routing focused on heuristic methods. We demonstrate the significant advantage of optimal solutions. Hence, we investigate multipath routing adopting a rigorous (theoretical) approach. We formalize problems that incorporate two major requirements of multipath routing. Then, we establish the intractability of these problems in terms of computational complexity. Accordingly, we establish efficient solutions with proven performance guarantees.