End-to-end data paths: Quickest or most reliable?

Research output: Contribution to journalArticle

40 Citations (Scopus)

Abstract

Let N = (V, E, c, l, p) be a network where V is the set of n vertices, E is the set of m edges, c(u, v) ≥ 0 is the capacity of edge {u, v}, l (u, v) ≥ 0 is the delay of edge {u, u}, p(u, v) ε [0, 1] is the operational probability of edge {u, v}. In this letter, we present O(rm + rn logn) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.

Original languageEnglish (US)
Pages (from-to)156-158
Number of pages3
JournalIEEE Communications Letters
Volume2
Issue number6
DOIs
StatePublished - 1998
Externally publishedYes

Fingerprint

Path

Keywords

  • Communication networks
  • Most reliable path
  • Quickest path
  • Shortest path network

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

End-to-end data paths : Quickest or most reliable? / Xue, Guoliang.

In: IEEE Communications Letters, Vol. 2, No. 6, 1998, p. 156-158.

Research output: Contribution to journalArticle

@article{0952e09bce2345d5a551dc12c492de7e,
title = "End-to-end data paths: Quickest or most reliable?",
abstract = "Let N = (V, E, c, l, p) be a network where V is the set of n vertices, E is the set of m edges, c(u, v) ≥ 0 is the capacity of edge {u, v}, l (u, v) ≥ 0 is the delay of edge {u, u}, p(u, v) ε [0, 1] is the operational probability of edge {u, v}. In this letter, we present O(rm + rn logn) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.",
keywords = "Communication networks, Most reliable path, Quickest path, Shortest path network",
author = "Guoliang Xue",
year = "1998",
doi = "10.1109/4234.681357",
language = "English (US)",
volume = "2",
pages = "156--158",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - End-to-end data paths

T2 - Quickest or most reliable?

AU - Xue, Guoliang

PY - 1998

Y1 - 1998

N2 - Let N = (V, E, c, l, p) be a network where V is the set of n vertices, E is the set of m edges, c(u, v) ≥ 0 is the capacity of edge {u, v}, l (u, v) ≥ 0 is the delay of edge {u, u}, p(u, v) ε [0, 1] is the operational probability of edge {u, v}. In this letter, we present O(rm + rn logn) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.

AB - Let N = (V, E, c, l, p) be a network where V is the set of n vertices, E is the set of m edges, c(u, v) ≥ 0 is the capacity of edge {u, v}, l (u, v) ≥ 0 is the delay of edge {u, u}, p(u, v) ε [0, 1] is the operational probability of edge {u, v}. In this letter, we present O(rm + rn logn) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.

KW - Communication networks

KW - Most reliable path

KW - Quickest path

KW - Shortest path network

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

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

U2 - 10.1109/4234.681357

DO - 10.1109/4234.681357

M3 - Article

AN - SCOPUS:0032097366

VL - 2

SP - 156

EP - 158

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

ER -