Delay analysis of a circuit-switched interconnection network withnon-uniform traffic

摘要

The authors analyze a circuit-switched, blocking, multi-stageinterconnection network (MIN) with arbitrary independent inputdistributions and arbitrary switch routing probabilities. The networkuses a gated-hold strategy which retains partial path information. Byformulating a dominant system, they derive a recursive expression forthe mean time to process a batch of requests given a particular inputdistribution and a set of switch routing probabilities. This system iscompared to a simulation of a non-blocking switch implementing a similargated strategy. Results indicate that this method yields tight boundsfor small networks with arbitrary input distributions and switch routingprobabilities. For networks with uniform input and output distributionsthis bound is closer than one introduced in a previous work examiningthe same protocol