ROUTING AND PERFORMANCE OF THE DOUBLE TREE (DOT) NETWORK

Authors
MITTAL R CHERIAN D MOHAN PJ
Citation
R. Mittal et al., ROUTING AND PERFORMANCE OF THE DOUBLE TREE (DOT) NETWORK, IEE proceedings. Computers and digital techniques, 142(2), 1995, pp. 93-97
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
IEE proceedings. Computers and digital techniques → ACNP
ISSN journal
13502387
Volume
142
Issue
2
Year of publication
1995
Pages
93 - 97
Database
ISI
SICI code
1350-2387(1995)142:2<93:RAPOTD>2.0.ZU;2-G
Abstract
The paper deals with the analysis of an irregular multistage interconn ection network called the Double Tree (DOT) network. A dynamic shortes t path routing algorithm for the packet switching DOT network is propo sed. The DOT network, being an irregular network, can provide biased p airwise service to favoured connections. Its performance under varying degrees of localised communication is analysed. A comparison with the Omega network is also made.