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. Edges cannot vertices in consecutive stages only. The blocking probability of a channel graph is the probability that every source to sink path is blocked. A general transformation is developed that never decreses the blocking probability. This transformation leads to a short proof of a generalization of a theorem of Takagi,and a theorem of Chung and Hwang, in the case of the binomial model.
ASJC Scopus subject areas
- Electrical and Electronic Engineering