A new polynomial-time algorithm for linear programming
Combinatorica
Data networks
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
Routing in the Internet
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
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)
Introduction to Algorithms
On Selection of Paths for Multipath Routing
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
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
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
IEEE Network: The Magazine of Global Internetworking
A reliability-based framework for multi-path routing analysis in mobile ad-hoc networks
International Journal of Communication Networks and Distributed Systems
Probing multiple node-disjoint paths using multi-labelled tree traversing
International Journal of Autonomous and Adaptive Communications Systems
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Low complexity link state multipath routing
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
QoS-constrained multi-path routing for high-end network applications
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Delay minimization in multipath routing
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
A dynamic traffic distribution strategy for multipath routing
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Performance evaluation of bandwidth allocation in ATM networks
International Journal of Business Information Systems
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
In-advance path reservation for file transfers in e-science applications
The Journal of Supercomputing
DPillar: Dual-port server interconnection network for large scale data centers
Computer Networks: The International Journal of Computer and Telecommunications Networking
On popularity-based load balancing in content networks
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 0.00 |
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 (or near 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. Finally, we establish efficient solutions with proven performance guarantees.