TY - JOUR

T1 - A Probability Inequality and Its Application to Switching Networks

AU - Hwang, F. K.

AU - Odlyzko, A. M.

PY - 1977

Y1 - 1977

N2 - The use of channel graphs to study the blocking probabilities of multistage switching networks was first proposed by Lee and has gained popularity ever since. A channel graph between an input terminal and an output terminal is the union of all paths connecting them in the network. Usually, the assumption is made that links connecting the same two stages, say the ith stage and the (i + 1)st stage, have constant and identical probability pi of being busy. Let G(s,λ) denote the class of channel graphs with s stages and λ paths. We show that for every channel graph in G(s,λ) with multiple links, there exists a channel graph in the same class without multiple links that has smaller or equal blocking probabilities for all {pi}. We obtain this result by first proving a probability inequality of a more general nature.

AB - The use of channel graphs to study the blocking probabilities of multistage switching networks was first proposed by Lee and has gained popularity ever since. A channel graph between an input terminal and an output terminal is the union of all paths connecting them in the network. Usually, the assumption is made that links connecting the same two stages, say the ith stage and the (i + 1)st stage, have constant and identical probability pi of being busy. Let G(s,λ) denote the class of channel graphs with s stages and λ paths. We show that for every channel graph in G(s,λ) with multiple links, there exists a channel graph in the same class without multiple links that has smaller or equal blocking probabilities for all {pi}. We obtain this result by first proving a probability inequality of a more general nature.

UR - http://www.scopus.com/inward/record.url?scp=0016953887&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0016953887&partnerID=8YFLogxK

U2 - 10.1002/j.1538-7305.1977.tb00541.x

DO - 10.1002/j.1538-7305.1977.tb00541.x

M3 - Article

AN - SCOPUS:0016953887

VL - 56

SP - 821

EP - 826

JO - Bell Labs Technical Journal

JF - Bell Labs Technical Journal

SN - 1089-7089

IS - 5

ER -