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 publicationLATIN 2002
Subtitle of host publicationTheoretical Informatics - 5th Latin American Symposium, Proceedings
EditorsSergio Rajsbaum
PublisherSpringer Verlag
Pages435-450
Number of pages16
ISBN (Electronic)3540434003, 9783540434009
DOIs
StatePublished - Jan 1 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)0302-9743
ISSN (Electronic)1611-3349

Other

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Finding most sustainable paths in networks with time-dependent edge reliabilities'. Together they form a unique fingerprint.

  • Cite this

    Konjevod, G., Oh, S., & Richa, A. (2002). Finding most sustainable paths in networks with time-dependent edge reliabilities. In S. Rajsbaum (Ed.), LATIN 2002: Theoretical Informatics - 5th Latin American Symposium, Proceedings (pp. 435-450). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2286). Springer Verlag. https://doi.org/10.1007/3-540-45995-2_39