Title :
Transformations on channel graphs
Author :
Kraetzl, Miro ; Colbourn, Charles J.
Author_Institution :
Sch. of Math. & Stat., Curtin Univ. of Technol., Perth, WA, Australia
fDate :
5/1/1993 12:00:00 AM
Abstract :
A channel graph is a directed acyclic graph with a unique source vertex and a unique sink vertex, in which all edges are partitioned into stages according to their distance from the source. The blocking probability of a channel graph is the probability that every source to sink path is blocked. A general transformation that never decreases the blocking probability is developed. This transformation leads to a short proof of a generalization of a theorem of K. Takagi (1971) and a theorem of F. R. K. Chung and F. K. Hwang (1978) in the case of the binomial model
Keywords :
graph theory; telecommunication channels; binomial model; blocking probability; channel graphs; directed acyclic graph; sink vertex; source vertex; Australia; Capacity planning; Communication switching; Communications Society; Mathematics; Multiprocessor interconnection networks; Network synthesis; Probability distribution; Statistics; Telephony;
Journal_Title :
Communications, IEEE Transactions on
