On multipath routing with transit hubs

Authors:
A. Sen;B. Hao;B. H. Shen;S. Murthy;S. Ganguly
Affiliations:
Dept. of Computer Science and Engineering, Arizona State University, Tempe, AZ;Dept. of Computer Science and Engineering, Arizona State University, Tempe, AZ;Dept. of Computer Science and Engineering, Arizona State University, Tempe, AZ;Dept. of Computer Science and Engineering, Arizona State University, Tempe, AZ;Dept. of Broadband and Mobile Networks, NEC Laboratories
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 6
Cited 0

On generating all maximal independent sets

Information Processing Letters
Analysis of multi-path routing

IEEE/ACM Transactions on Networking (TON)
Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Internet indirection infrastructure

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring the effects of internet path faults on reactive routing

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A framework for self-optimizing, fault-tolerant, high performance bulk data transfers in a heterogeneous grid environment

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Empirical studies report frequent occurrences of path failure in the Internet. In providing resilience to such failures, we propose the computation of alternate backup end-to-end path that is disjoint to the default IP path. This disjoint path is created using transit hubs that can be located at diverse points in the Internet. Transit hubs provide better utilization of network resources. Assuming an IP layer routing between any two nodes, we show that the problem of computing such a disjoint path is NP-complete. We present an exact and a heuristic solution for the problem. Using routing data obtained from PlanetLab, we evaluate the efficacy of our heuristic solution.