Hypernets for metroarea networks: A deadlock free routing technique
B.M. Maziarz, V.K. Jain · 2002
Hypernets are emerging as a possible solution to communication difficulties in networks with a very large number of nodes, such as in a metropolitan area network, or in a massively parallel computer system. An overview of hypernets is presented, together with a deadlock free routing algorithm which can make these hypernets practical for metropolitan communication. This new routing method is developed using the concept of a channel dependency graph and the presence or absence of cycles in this graph. Simulation results demonstrate the success of this deadlock-free routing strategy.>