Finding most sustainable paths in networks with time-dependent edge reliabilities

Goran Konjevod, Soohyun Oh, Andrea Richa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we formalize the problem of finding a routing path for the streaming of continuous media (e.g., video or audio files) that maximizes the probability that the streaming is successful, over a network with nonuniform edge delays and capacities, and arbitrary timedependent edge reliabilities. We call such a problem the most sustainable path (MSP) problem. We address the MSP problem in two network routing models: the wormhole and the circuit-switching routing models. We present fully-distributed polynomial-time algorithms for the streaming of constant-size data in the wormhole model, and for arbitrary-size data in the circuit-switching model. Our algorithms are simple and assume only local knowledge of the network topology at each node. The algorithms evolved from a variation of the classical Bellman-Ford shortest-path algorithm. One of the main contributions of this paper was to show how to extend the ideas in the Bellman-Ford algorithm to account for arbitrary time-dependent edge reliabilities.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages435-450
Number of pages16
Volume2286
ISBN (Print)3540434003, 9783540434009
StatePublished - 2002
Event5th Latin American Symposium on Theoretical Informatics, LATIN 2002 - Cancun, Mexico
Duration: Apr 3 2002Apr 6 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2286
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Latin American Symposium on Theoretical Informatics, LATIN 2002
CountryMexico
CityCancun
Period4/3/024/6/02

Fingerprint

Streaming
Circuit Switching
Path
Wormhole
Routing
Switching circuits
Arbitrary
Shortest Path Algorithm
Distributed Algorithms
Network routing
Network Topology
Model
Polynomial-time Algorithm
Maximise
Topology
Polynomials
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Konjevod, G., Oh, S., & Richa, A. (2002). Finding most sustainable paths in networks with time-dependent edge reliabilities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2286, pp. 435-450). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2286). Springer Verlag.

Finding most sustainable paths in networks with time-dependent edge reliabilities. / Konjevod, Goran; Oh, Soohyun; Richa, Andrea.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2286 Springer Verlag, 2002. p. 435-450 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2286).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Konjevod, G, Oh, S & Richa, A 2002, Finding most sustainable paths in networks with time-dependent edge reliabilities. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2286, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2286, Springer Verlag, pp. 435-450, 5th Latin American Symposium on Theoretical Informatics, LATIN 2002, Cancun, Mexico, 4/3/02.
Konjevod G, Oh S, Richa A. Finding most sustainable paths in networks with time-dependent edge reliabilities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2286. Springer Verlag. 2002. p. 435-450. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Konjevod, Goran ; Oh, Soohyun ; Richa, Andrea. / Finding most sustainable paths in networks with time-dependent edge reliabilities. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2286 Springer Verlag, 2002. pp. 435-450 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{73bf16fee1d048b3a49646d438e6b30c,
title = "Finding most sustainable paths in networks with time-dependent edge reliabilities",
abstract = "In this paper, we formalize the problem of finding a routing path for the streaming of continuous media (e.g., video or audio files) that maximizes the probability that the streaming is successful, over a network with nonuniform edge delays and capacities, and arbitrary timedependent edge reliabilities. We call such a problem the most sustainable path (MSP) problem. We address the MSP problem in two network routing models: the wormhole and the circuit-switching routing models. We present fully-distributed polynomial-time algorithms for the streaming of constant-size data in the wormhole model, and for arbitrary-size data in the circuit-switching model. Our algorithms are simple and assume only local knowledge of the network topology at each node. The algorithms evolved from a variation of the classical Bellman-Ford shortest-path algorithm. One of the main contributions of this paper was to show how to extend the ideas in the Bellman-Ford algorithm to account for arbitrary time-dependent edge reliabilities.",
author = "Goran Konjevod and Soohyun Oh and Andrea Richa",
year = "2002",
language = "English (US)",
isbn = "3540434003",
volume = "2286",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "435--450",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Finding most sustainable paths in networks with time-dependent edge reliabilities

AU - Konjevod, Goran

AU - Oh, Soohyun

AU - Richa, Andrea

PY - 2002

Y1 - 2002

N2 - In this paper, we formalize the problem of finding a routing path for the streaming of continuous media (e.g., video or audio files) that maximizes the probability that the streaming is successful, over a network with nonuniform edge delays and capacities, and arbitrary timedependent edge reliabilities. We call such a problem the most sustainable path (MSP) problem. We address the MSP problem in two network routing models: the wormhole and the circuit-switching routing models. We present fully-distributed polynomial-time algorithms for the streaming of constant-size data in the wormhole model, and for arbitrary-size data in the circuit-switching model. Our algorithms are simple and assume only local knowledge of the network topology at each node. The algorithms evolved from a variation of the classical Bellman-Ford shortest-path algorithm. One of the main contributions of this paper was to show how to extend the ideas in the Bellman-Ford algorithm to account for arbitrary time-dependent edge reliabilities.

AB - In this paper, we formalize the problem of finding a routing path for the streaming of continuous media (e.g., video or audio files) that maximizes the probability that the streaming is successful, over a network with nonuniform edge delays and capacities, and arbitrary timedependent edge reliabilities. We call such a problem the most sustainable path (MSP) problem. We address the MSP problem in two network routing models: the wormhole and the circuit-switching routing models. We present fully-distributed polynomial-time algorithms for the streaming of constant-size data in the wormhole model, and for arbitrary-size data in the circuit-switching model. Our algorithms are simple and assume only local knowledge of the network topology at each node. The algorithms evolved from a variation of the classical Bellman-Ford shortest-path algorithm. One of the main contributions of this paper was to show how to extend the ideas in the Bellman-Ford algorithm to account for arbitrary time-dependent edge reliabilities.

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

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

M3 - Conference contribution

AN - SCOPUS:84937500980

SN - 3540434003

SN - 9783540434009

VL - 2286

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 435

EP - 450

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -