An OL(n3) potential reduction algorithm for linear programming
Mathematical Programming: Series A and B
Fast bandwidth reservation scheme with multi-line & multi-path routing in ATM networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Reliable Packet Transmissions in Multipath Routed Wireless Networks
IEEE Transactions on Mobile Computing
The Confluent Capacity of the Internet: Congestion vs. Dilation
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Optimal path selection for minimizing the differential delay in ethernet-over-SONET
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Resource allocation for multimedia streaming over the Internet
IEEE Transactions on Multimedia
Media Flow Rate Allocation in Multipath Networks
IEEE Transactions on Multimedia
An improved algorithm for decomposing arc flows into multipath flows
Operations Research Letters
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
Streaming video over the Internet: approaches and directions
IEEE Transactions on Circuits and Systems for Video Technology
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
DoS-resilient virtual networks through multipath embedding and opportunistic recovery
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous routing along multiple disjoint paths. Most previous protection and restoration schemes were designed for all-or-nothing protection and thus, an overkill for data traffic. In this work, we study the Reliable Adaptive Multipath Provisioning (RAMP) problem with reliability and differential delay constraints. We aim to route the connections in a manner such that link failure does not shut down the entire stream but allows a continuing flow for a significant portion of the traffic along multiple (not necessary disjoint) paths, allowing the whole network to carry sufficient traffic even when link/node failure occurs. The flexibility enabled by a multipath scheme has the tradeoff of differential delay among the diversely routed paths. This requires increased memory in the destination node in order to buffer the traffic until the data arrives on all the paths. Increased buffer size will raise the network element cost and could cause buffer overflow and data corruption. Therefore, differential delay between the multiple paths should be bounded by containing the delay of a path in a range. We first prove that RAMP is an NP-hard problem. Then we present a pseudo-polynomial time solution to solve a special case of RAMP, representing edge delays as integers. Next, an (1 + ε)-approximation algorithm is proposed to solve the optimization version of the RAMP problem. An efficient heuristic is also provided for the RAMP problem. We also present numerical results confirming the advantage of our schemes as the first solution for the RAMP problem.