Computing a most probable delay constrained path: NP-hardness and approximation schemes

Ying Xiao, Krishnaiya Thulasiraman, Xi Fang, Dejun Yang, Guoliang Xue

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

Delay constrained path selection is concerned with finding a source-to-destination path so that the delay of the path is within a given delay bound. When the network is modeled by a directed graph where the delay of a link is a random variable with a known mean and a known variance, the problem becomes that of computing a most probable delay constrained path. In this paper, we present a comprehensive theoretical study of this problem. First, we prove that the problem is NP-hard. Next, for the case where there exists a source-to-destination path with a delay mean no more than the given delay bound, we present a fully polynomial time approximation scheme. In other words, for any given constant ε such that 0 < ε < 1, our algorithm computes a path whose probability of satisfying the delay constraint is at least (1-\epsilon ) times the probability that the optimal path satisfies the delay constraint, with a time complexity bounded by a polynomial in the number of network nodes and 1/ε. Finally, for the case where any source-to- destination path has a delay mean larger than the given delay bound, we present a simple approximation algorithm with an approximation ratio bounded by the square root of the hop count of the optimal path.

Original languageEnglish (US)
Article number5740849
Pages (from-to)738-744
Number of pages7
JournalIEEE Transactions on Computers
Volume61
Issue number5
DOIs
StatePublished - 2012

Fingerprint

NP-hardness
Approximation Scheme
Probable
Hardness
Polynomials
Path
Computing
Directed graphs
Approximation algorithms
Random variables
Computational complexity
Optimal Path
Fully Polynomial Time Approximation Scheme
Square root
Directed Graph
Time Complexity
Approximation Algorithms
Count
NP-complete problem
Random variable

Keywords

  • approximation schemes
  • computational complexity
  • Delay constrained path selection

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Computing a most probable delay constrained path : NP-hardness and approximation schemes. / Xiao, Ying; Thulasiraman, Krishnaiya; Fang, Xi; Yang, Dejun; Xue, Guoliang.

In: IEEE Transactions on Computers, Vol. 61, No. 5, 5740849, 2012, p. 738-744.

Research output: Contribution to journalArticle

Xiao, Ying ; Thulasiraman, Krishnaiya ; Fang, Xi ; Yang, Dejun ; Xue, Guoliang. / Computing a most probable delay constrained path : NP-hardness and approximation schemes. In: IEEE Transactions on Computers. 2012 ; Vol. 61, No. 5. pp. 738-744.
@article{02f996b18f2f4eccab453169644b48d4,
title = "Computing a most probable delay constrained path: NP-hardness and approximation schemes",
abstract = "Delay constrained path selection is concerned with finding a source-to-destination path so that the delay of the path is within a given delay bound. When the network is modeled by a directed graph where the delay of a link is a random variable with a known mean and a known variance, the problem becomes that of computing a most probable delay constrained path. In this paper, we present a comprehensive theoretical study of this problem. First, we prove that the problem is NP-hard. Next, for the case where there exists a source-to-destination path with a delay mean no more than the given delay bound, we present a fully polynomial time approximation scheme. In other words, for any given constant ε such that 0 < ε < 1, our algorithm computes a path whose probability of satisfying the delay constraint is at least (1-\epsilon ) times the probability that the optimal path satisfies the delay constraint, with a time complexity bounded by a polynomial in the number of network nodes and 1/ε. Finally, for the case where any source-to- destination path has a delay mean larger than the given delay bound, we present a simple approximation algorithm with an approximation ratio bounded by the square root of the hop count of the optimal path.",
keywords = "approximation schemes, computational complexity, Delay constrained path selection",
author = "Ying Xiao and Krishnaiya Thulasiraman and Xi Fang and Dejun Yang and Guoliang Xue",
year = "2012",
doi = "10.1109/TC.2011.61",
language = "English (US)",
volume = "61",
pages = "738--744",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Computing a most probable delay constrained path

T2 - NP-hardness and approximation schemes

AU - Xiao, Ying

AU - Thulasiraman, Krishnaiya

AU - Fang, Xi

AU - Yang, Dejun

AU - Xue, Guoliang

PY - 2012

Y1 - 2012

N2 - Delay constrained path selection is concerned with finding a source-to-destination path so that the delay of the path is within a given delay bound. When the network is modeled by a directed graph where the delay of a link is a random variable with a known mean and a known variance, the problem becomes that of computing a most probable delay constrained path. In this paper, we present a comprehensive theoretical study of this problem. First, we prove that the problem is NP-hard. Next, for the case where there exists a source-to-destination path with a delay mean no more than the given delay bound, we present a fully polynomial time approximation scheme. In other words, for any given constant ε such that 0 < ε < 1, our algorithm computes a path whose probability of satisfying the delay constraint is at least (1-\epsilon ) times the probability that the optimal path satisfies the delay constraint, with a time complexity bounded by a polynomial in the number of network nodes and 1/ε. Finally, for the case where any source-to- destination path has a delay mean larger than the given delay bound, we present a simple approximation algorithm with an approximation ratio bounded by the square root of the hop count of the optimal path.

AB - Delay constrained path selection is concerned with finding a source-to-destination path so that the delay of the path is within a given delay bound. When the network is modeled by a directed graph where the delay of a link is a random variable with a known mean and a known variance, the problem becomes that of computing a most probable delay constrained path. In this paper, we present a comprehensive theoretical study of this problem. First, we prove that the problem is NP-hard. Next, for the case where there exists a source-to-destination path with a delay mean no more than the given delay bound, we present a fully polynomial time approximation scheme. In other words, for any given constant ε such that 0 < ε < 1, our algorithm computes a path whose probability of satisfying the delay constraint is at least (1-\epsilon ) times the probability that the optimal path satisfies the delay constraint, with a time complexity bounded by a polynomial in the number of network nodes and 1/ε. Finally, for the case where any source-to- destination path has a delay mean larger than the given delay bound, we present a simple approximation algorithm with an approximation ratio bounded by the square root of the hop count of the optimal path.

KW - approximation schemes

KW - computational complexity

KW - Delay constrained path selection

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

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

U2 - 10.1109/TC.2011.61

DO - 10.1109/TC.2011.61

M3 - Article

AN - SCOPUS:84859713332

VL - 61

SP - 738

EP - 744

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 5

M1 - 5740849

ER -