### Abstract

Given a communication network modeled as a directed graph with a delay parameter associated with each link, we consider the problem of determining the most probable delay constrained path from a source node to a destination node. Assuming that the link delays are random variables with continuous and differentiable probability density function and using the central limit theorem this problem can be formulated as a path problem which involves simultaneously optimizing two additive path parameters. Two cases arise. When there is one path with mean delay less than the delay bound, we present an exact pseudo polynomial algorithm, a fully polynomial time ε-approximation algorithm and a strongly polynomial heuristic algorithm. In the unlikely case when this assumption is violated, the problem is shown to be NP-hard and no constant factor approximation algorithm exists if P ≠ NP. We also study the path protection problem under inaccurate state information.

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

Title of host publication | Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004 |

Editors | A. Boukerche, J. Cobb, S. Chen, M.Y. Fang |

Pages | 130-137 |

Number of pages | 8 |

State | Published - 2004 |

Event | Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004 - Dallas, TX, United States Duration: Oct 18 2004 → Oct 20 2004 |

### Other

Other | Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004 |
---|---|

Country | United States |

City | Dallas, TX |

Period | 10/18/04 → 10/20/04 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004*(pp. 130-137)

**Approximation and heuristic algorithms for delay constrained path selection under inaccurate state information.** / Xiao, Ying; Thulasiraman, Krishnaiyan; Xue, Guoliang.

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

*Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004.*pp. 130-137, Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004, Dallas, TX, United States, 10/18/04.

}

TY - GEN

T1 - Approximation and heuristic algorithms for delay constrained path selection under inaccurate state information

AU - Xiao, Ying

AU - Thulasiraman, Krishnaiyan

AU - Xue, Guoliang

PY - 2004

Y1 - 2004

N2 - Given a communication network modeled as a directed graph with a delay parameter associated with each link, we consider the problem of determining the most probable delay constrained path from a source node to a destination node. Assuming that the link delays are random variables with continuous and differentiable probability density function and using the central limit theorem this problem can be formulated as a path problem which involves simultaneously optimizing two additive path parameters. Two cases arise. When there is one path with mean delay less than the delay bound, we present an exact pseudo polynomial algorithm, a fully polynomial time ε-approximation algorithm and a strongly polynomial heuristic algorithm. In the unlikely case when this assumption is violated, the problem is shown to be NP-hard and no constant factor approximation algorithm exists if P ≠ NP. We also study the path protection problem under inaccurate state information.

AB - Given a communication network modeled as a directed graph with a delay parameter associated with each link, we consider the problem of determining the most probable delay constrained path from a source node to a destination node. Assuming that the link delays are random variables with continuous and differentiable probability density function and using the central limit theorem this problem can be formulated as a path problem which involves simultaneously optimizing two additive path parameters. Two cases arise. When there is one path with mean delay less than the delay bound, we present an exact pseudo polynomial algorithm, a fully polynomial time ε-approximation algorithm and a strongly polynomial heuristic algorithm. In the unlikely case when this assumption is violated, the problem is shown to be NP-hard and no constant factor approximation algorithm exists if P ≠ NP. We also study the path protection problem under inaccurate state information.

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

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

M3 - Conference contribution

AN - SCOPUS:19644363874

SN - 0769522335

SN - 9780769522333

SP - 130

EP - 137

BT - Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004

A2 - Boukerche, A.

A2 - Cobb, J.

A2 - Chen, S.

A2 - Fang, M.Y.

ER -