Performance analysis of random routing algorithm for n-D connected networks
Zheng Chen, T. Berger · 2002
An n-D connected network is a kind of networks which have n input links to each node and n output links from each node. It is designed for packet communications in a local or metropolitan area. Two examples of n-D connected networks are Manhattan Street Network (MSN) and Chordal Ring Network. In this paper, the random routing algorithm is used for n-D connected networks. For the random routing algorithm we give the theoretical steady state delay and throughput analysis for n-D connected networks by a single node approximate Markov Chain model. A simple iterative formula used for calculating the related distributions is derived, and its accuracy is verified by simulations.>