### 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 language | English (US) |
---|---|

Pages (from-to) | 156-158 |

Number of pages | 3 |

Journal | IEEE Communications Letters |

Volume | 2 |

Issue number | 6 |

DOIs | |

State | Published - 1998 |

Externally published | Yes |

### Fingerprint

### 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.

Research output: Contribution to journal › Article

*IEEE Communications Letters*, vol. 2, no. 6, pp. 156-158. https://doi.org/10.1109/4234.681357

}

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 -