### Abstract

In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks. Assume that each link in the network has a bandwidth and a delay. For a given source-destination pair and a bandwidth requirement, we want to find a set of source to destination paths such that the delay of the longest path is minimized while the aggregated bandwidth of the set of paths meets the bandwidth requirement. This problem is NP-hard, and the state of the art is a maximum flow based heuristic. We first construct a class of examples showing that the maximum flow based heuristic could have very bad performance. We then present a fully polynomial time approximation scheme that can compute a (1 +)-approximation with running time bounded by a polynomial in 1/and the input size of the instance. Given the NP-hardness of the problem, our approximation scheme is the best possible. We also present numerical results confirming the advantage of our scheme over the current state of the art.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM |

Pages | 558-566 |

Number of pages | 9 |

DOIs | |

State | Published - 2009 |

Event | 28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil Duration: Apr 19 2009 → Apr 25 2009 |

### Other

Other | 28th Conference on Computer Communications, IEEE INFOCOM 2009 |
---|---|

Country | Brazil |

City | Rio de Janeiro |

Period | 4/19/09 → 4/25/09 |

### Fingerprint

### Keywords

- Band-width and delay constraints
- Multi-path routing
- Polynomial time approximation
- Quality of service routing

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM*(pp. 558-566). [5061962] https://doi.org/10.1109/INFCOM.2009.5061962

**Polynomial time approximations for multi-path routing with bandwidth and delay constraints.** / Misra, Satyajayant; Xue, Guoliang; Yang, Dejun.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - IEEE INFOCOM.*, 5061962, pp. 558-566, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 4/19/09. https://doi.org/10.1109/INFCOM.2009.5061962

}

TY - GEN

T1 - Polynomial time approximations for multi-path routing with bandwidth and delay constraints

AU - Misra, Satyajayant

AU - Xue, Guoliang

AU - Yang, Dejun

PY - 2009

Y1 - 2009

N2 - In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks. Assume that each link in the network has a bandwidth and a delay. For a given source-destination pair and a bandwidth requirement, we want to find a set of source to destination paths such that the delay of the longest path is minimized while the aggregated bandwidth of the set of paths meets the bandwidth requirement. This problem is NP-hard, and the state of the art is a maximum flow based heuristic. We first construct a class of examples showing that the maximum flow based heuristic could have very bad performance. We then present a fully polynomial time approximation scheme that can compute a (1 +)-approximation with running time bounded by a polynomial in 1/and the input size of the instance. Given the NP-hardness of the problem, our approximation scheme is the best possible. We also present numerical results confirming the advantage of our scheme over the current state of the art.

AB - In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks. Assume that each link in the network has a bandwidth and a delay. For a given source-destination pair and a bandwidth requirement, we want to find a set of source to destination paths such that the delay of the longest path is minimized while the aggregated bandwidth of the set of paths meets the bandwidth requirement. This problem is NP-hard, and the state of the art is a maximum flow based heuristic. We first construct a class of examples showing that the maximum flow based heuristic could have very bad performance. We then present a fully polynomial time approximation scheme that can compute a (1 +)-approximation with running time bounded by a polynomial in 1/and the input size of the instance. Given the NP-hardness of the problem, our approximation scheme is the best possible. We also present numerical results confirming the advantage of our scheme over the current state of the art.

KW - Band-width and delay constraints

KW - Multi-path routing

KW - Polynomial time approximation

KW - Quality of service routing

UR - http://www.scopus.com/inward/record.url?scp=70349673237&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349673237&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2009.5061962

DO - 10.1109/INFCOM.2009.5061962

M3 - Conference contribution

AN - SCOPUS:70349673237

SN - 9781424435135

SP - 558

EP - 566

BT - Proceedings - IEEE INFOCOM

ER -