The Linking Probability of Deep Spider-Web Networks

Details The Linking Probability of Deep Spider-Web Networks The Linking Probability of Deep Spider-Web Networks

2005-02-14

arxiv.org/abs/math/0502294v1

Mathematics

Probability

i+21 pp

Scientific paper

We consider crossbar switching networks with base $b$ (that is, constructed from $b\times b$ crossbar switches), scale $k$ (that is, with $b^k$ inputs, $b^k$ outputs and $b^k$ links between each consecutive pair of stages) and depth $l$ (that is, with $l$ stages). We assume that the crossbars are interconnected according to the spider-web pattern, whereby two diverging paths reconverge only after at least $k$ stages. We assume that each vertex is independently idle with probability $q$, the vacancy probability. We assume that $b\ge 2$ and the vacancy probability $q$ are fixed, and that $k$ and $l = ck$ tend to infinity with ratio a fixed constant $c>1$. We consider the linking probability $Q$ (the probability that there exists at least one idle path between a given idle input and a given idle output). In a previous paper it was shown that if $c\le 2$, then the linking probability $Q$ tends to 0 if $01$. This is done by using generating functions and complex-variable techniques to estimate the second moments of various random variables involved in the analysis of the networks.

Affiliated with

Also associated with

No associations

Rating

The Linking Probability of Deep Spider-Web Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Linking Probability of Deep Spider-Web Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Linking Probability of Deep Spider-Web Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413487