On multipath routing with transit hubs

Arunabha Sen, B. Hao, B. H. Shen, S. Murthy, S. Ganguly

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsR. Boutaba, K. Almeroth, R. Puigjaner, S. Shen, J.P. Black
Pages1043-1055
Number of pages13
Volume3462
StatePublished - 2005
Event4th International IFIP-TC6 Networking Conference: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, NETWORKING 2005 - Waterloo, Ont., Canada
Duration: May 2 2005May 6 2005

Other

Other4th International IFIP-TC6 Networking Conference: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, NETWORKING 2005
Country/TerritoryCanada
CityWaterloo, Ont.
Period5/2/055/6/05

Keywords

  • Disjoint path
  • Multipath routing
  • Network resilience
  • Transit hub

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • General Computer Science
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'On multipath routing with transit hubs'. Together they form a unique fingerprint.

Cite this