Performance analysis of random routing algorithm for n-D connected networks

Author

Zheng Chen ; Berger, T.

Author_Institution

Bell Commun. Res., Morristown, NJ, USA

Volume

1

fYear

1993

fDate

19-21 Oct. 1993

Firstpage

233

Abstract

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.<>

Keywords

local area networks; metropolitan area networks; multiprocessor interconnection networks; packet switching; performance evaluation; telecommunication network routing; Chordal Ring Network; Manhattan Street Network; Markov Chain model; local area; metropolitan area; n-D connected networks; packet communications; random routing algorithm; steady state delay; throughput analysis; Algorithm design and analysis; Computational modeling; Computer network reliability; Iterative algorithms; Network topology; Performance analysis; Routing; Steady-state; Throughput; Urban areas;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on

Conference_Location

Beijing, China

Print_ISBN

0-7803-1233-3

Type

conf

DOI

10.1109/TENCON.1993.319971

Filename

319971