Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11422778_84 | Networking |
Keywords | Field | DocType |
path failure,transit hub,default ip path,heuristic solution,alternate backup end-to-end path,better utilization,ip layer routing,multipath routing,diverse point,routing data,disjoint path,empirical study | Internet Protocol,Multipath routing,Heuristic,PlanetLab,Disjoint sets,Computer science,Computer network,Backup,Distributed computing,Computation,The Internet | Conference |
Volume | ISSN | ISBN |
3462 | 0302-9743 | 3-540-25809-4 |
Citations | PageRank | References |
2 | 0.39 | 13 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A Sen | 1 | 58 | 5.56 |
| B. Hao | 2 | 2 | 0.39 |
| B. H. Shen | 3 | 2 | 0.39 |
| S. Murthy | 4 | 2 | 0.39 |
| S. Ganguly | 5 | 2 | 0.39 |