Distributed adaptive routing has proven to be useful in packet switching networks. However,
the storage and updating cost of this routing procedure becomes prohibitive as the number
of nodes in the network gets large. This paper deals with the specification, analysis and
evaluation of some hierarchical routing procedures which are effective for large store-and-
forward packet-switched computer networks. The procedures studied are an extension of
present techniques and rely on a hierarchical clustering of the network nodes. In particular …