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

Research output: Contribution to journalArticle

40 Scopus citations

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 - Dec 1 1998
Externally publishedYes

Keywords

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

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'End-to-end data paths: Quickest or most reliable?'. Together they form a unique fingerprint.

Cite this