On multipath routing using widest pair of disjoint paths

Bao Hong Shen, Bin Hao, Arunabha Sen

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

17 Scopus citations

Abstract

Multipatb and disjoint path routing schemes have received considerable amount of attention in the networking research community in recent years due to many of advantages offered by such schemes. Delay, delay-jitter, bandwidth, are often used as parameters to specify quality-of-service. One of the most important parameter is the bandwidth of the route used for data transmission. A path from a source node s to a destination node t is known as the widest path if the bandwidth of this path is the largest among all paths between s to t. Algorithms for computing a widest path between a source-destination node pair is well-known. In this paper, we consider two problems where the notions of multipath, disjoint path and widest path are combined. In one version, we address the problem of finding a pair of disjoint paths between a source-destination node pair, such that the combined bandwidth of this path-pair is the maximum over all such pairs. In the other version, we want to find a pair of disjoint paths, such that the bandwidth of the first path is at least X 1 and the bandwidth of the second path is at least X 2, for some pre-specified values X 1 and X 2. We prove that both versions of the problem are NP-complete. We provide exact and approximate solutions for both versions of the problem. We show that our approximate solutions provide near-optimal solutions for almost all the instances of the problem.

Original languageEnglish (US)
Title of host publication2004 Workshop on High Performance Switching and Routing, HPSR 2004
Pages134-140
Number of pages7
StatePublished - Jun 22 2004
Event2004 Workshop on High Perfomance Switching and Routing, HPSR 2004 - Phoenix, AZ, United States
Duration: Apr 19 2004Apr 20 2004

Publication series

NameIEEE Workshop on High Performance Switching and Routing, HPSR

Other

Other2004 Workshop on High Perfomance Switching and Routing, HPSR 2004
CountryUnited States
CityPhoenix, AZ
Period4/19/044/20/04

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Shen, B. H., Hao, B., & Sen, A. (2004). On multipath routing using widest pair of disjoint paths. In 2004 Workshop on High Performance Switching and Routing, HPSR 2004 (pp. 134-140). (IEEE Workshop on High Performance Switching and Routing, HPSR).