Reliable flow with failures in a network

Author

Kishimoto, Wataru

Author_Institution

Tamagawa Univ., Tokyo, Japan

Volume

46

Issue

3

fYear

1997

fDate

9/1/1997 12:00:00 AM

Firstpage

308

Lastpage

315

Abstract

In communication networks, there is a growing need for ensuring that networks maintain service despite failures. To meet this need, the concept of a δ-reliable channel is introduced; it is a set of communication channels along a set of paths. The δ-reliable channel meets the requirement that if a link or node fails, failure is limited to a maximum of δ·c (c≡total capacity of the channels, and 0<δ⩽1). A δ-reliable flow is such that the maximum number of flow failures is δ·f (f≡value of the flow) if an edge or vertex of a network fails. The max-flow min-cut theorem of δ-reliable flow is demonstrated for the single-commodity case

Keywords

failure analysis; telecommunication channels; telecommunication network reliability; δ-reliable channel; communication channels; communication network reliability; flow failures; link failure; max-flow min-cut theorem; node failure; single-commodity case; Channel capacity; Communication channels; Communication networks; Computer network reliability; Computer networks; Distributed computing; Intelligent networks; Maintenance; Reliability theory; Telecommunication network reliability;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.664001

Filename

664001