Title :
Routing and performance of the double tree (DOT) network
Author :
Mittal, R. ; Cherian, D. ; Mohan, P.J.
Author_Institution :
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
fDate :
3/1/1995 12:00:00 AM
Abstract :
The paper deals with the analysis of an irregular multistage interconnection network called the double tree (DOT) network. A dynamic shortest path routing algorithm for the packet switching DOT network is proposed. The DOT network, being an irregular network, can provide biased pairwise service to favoured connections. Its performance under varying degrees of localised communication is analysed. A comparison with the Omega network is also made
Keywords :
multistage interconnection networks; packet switching; trees (mathematics); Omega network; biased pairwise service; double tree network; dynamic shortest path routing algorithm; irregular multistage interconnection network; irregular network; localised communication; packet switching DOT network;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19951603
