HYPERNETS FOR METROAREA NETWORKS:A DEADLOCK FREE ROUTING TECHNIQUE1

摘要

Hypemets are emerging as a possible solution to communication difficulties in networks with very large number of nodes,such as in a metropolitan area network,or in a massively parallel computer system.This paper presents an overview of hypemets and,more importantly,a deadlock free routing algorithm which can make these hypernets practical for metropolitan communication.This new muting 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.