A Method for Obtaining the Maximum δ-Reliable Flow in a Network

概要

論文の詳細を見る
In communication networks there is a growing need for ensuring that networks maintain service despite failurs. To meet the need, the concept of δ-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 δ・f(f≡total capacity of the channels, and 0<δ≦1). The max-flow min-cut theorem of δ-reliable flow has been proved for the single-commodity case. In this paper we give a method for evaluating the maximum δ-reliable flow between a specified pair of vertices for single commodity case. The method consists of a maximum of 1/δ iterations of calculations of the maximum flow value.
社団法人電子情報通信学会の論文
1998-05-25