Threshold Channel Graphs

Miro Kraetzl, Charles Colbourn

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

A transformation that increases the blocking probability of the channel graphs arising in interconnection networks is developed. This provides the basis for eminently computing a bound on the blocking probability by applying the transformation to reduce an arbitrary four-stage channel graph to a threshold channel graph. The four-stage channel graph that is most likely to block, given links that are equally likely to block, is characterized. Partial results are proved concerning the threshold channel graphs that are least likely to block.

Original languageEnglish (US)
Pages (from-to)337-349
Number of pages13
JournalCombinatorics Probability and Computing
Volume2
Issue number3
DOIs
StatePublished - 1993
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Applied Mathematics
  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics

Cite this