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.