Advertisement

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.

Keywords

transit hub disjoint path multipath routing network resilience 

References

  1. 1.
    Anderson, D., Balakrishnan, H., Kaashoek, M., Morris, R.: Resilient Overlay Networks. In: Proc. 18th ACM SOSP, Canada (October 2001)Google Scholar
  2. 2.
    Beck, M., Dongarra, J., Plank, J., Wolski, R.: Logistical Network Project, http://loci.cs.utk.edu/scidac
  3. 3.
    Cidon, I., Rom, R., Shavitt, Y.: Analysis of Multi-path Routing. IEEE/ACM Trans. on Networking 7(6), 885–896 (1999)CrossRefGoogle Scholar
  4. 4.
    Cohen, R., Nakibli, G.: On the computational complexity and effectiveness of N-hub shortest path routing. In: Proc. of IEEE Infocom (2004)Google Scholar
  5. 5.
    Feamster, N., Anderson, D., Balakrishnan, H., Kaashoek, M.: Measuring the Effects of Internet Path Faults on Reactive Routing. In: Proc. of ACM SIGMETRICS, San Diego, CA (June 2003)Google Scholar
  6. 6.
    Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On Generating All Maximal Independent Sets. Information Processing Letters 27, 119–123 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kosar, T., Kola, G., Livny, M.: A Framework for Self-optimizing, Fault-tolerant, High Performance Bulk Data Transfers in a Heterogenous Grid Environments. In: Proc. ISPDC 2003 (2003)Google Scholar
  8. 8.
    Lee, S., Gerla, M.: Split Multipath Routing with Maximally Disjoint Paths in Ad-hoc Networks. In: Proc. of IEEE ICC 2001 (2001)Google Scholar
  9. 9.
    Perkins, C.: IP encapsulation within IP. IETF RFC 2003 (October 1996)Google Scholar
  10. 10.
    Suurballe, S., Tarjan, R.: A Quick Method for Finding Shortest Pair of Disjoint Paths. Networks 14, 325–336 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A New Algorithm for Generating All Maximal Independent Sets. SIAM Journal of Computing 6, 505–517 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Stoica, S.Z.S.S.I., Adkins, D., Surana, S.: Internet indirection infrastructure. In: Proceedings of ACM SIGCOMM 2002 (August 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • A. Sen
    • 1
  • B. Hao
    • 1
  • B. H. Shen
    • 1
  • S. Murthy
    • 1
  • S. Ganguly
    • 2
  1. 1.Dept. of Computer Science and EngineeringArizona State UniversityTempeUSA
  2. 2.Dept. of Broadband and Mobile NetworksNEC LaboratoriesUSA

Personalised recommendations