@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",

month = jan,

day = "1",

doi = "10.1007/3-540-45995-2_39",

language = "English (US)",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "435--450",

editor = "Sergio Rajsbaum",

booktitle = "LATIN 2002",

note = "5th Latin American Symposium on Theoretical Informatics, LATIN 2002 ; Conference date: 03-04-2002 Through 06-04-2002",

}