Title :
Hypernets for metroarea networks: A deadlock free routing technique
Author :
Maziarz, Bogdan M. ; Jain, Vijay K.
Author_Institution :
Dept. of Electr. Eng., Univ. of South Florida, Tampa, FL, USA
Abstract :
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
Keywords :
concurrency control; graphs; hypercube networks; metropolitan area networks; parallel algorithms; parallel architectures; telecommunication channels; telecommunication network routing; channel dependency graph; cycles; deadlock free routing algorithm; hypernets; metropolitan area network; Buildings; Computational modeling; Computer networks; Concurrent computing; Floors; Joining processes; Metropolitan area networks; Network topology; Routing; System recovery;
Conference_Titel :
Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on
Conference_Location :
Geneva
Print_ISBN :
0-7803-0950-2
DOI :
10.1109/ICC.1993.397599
