DocumentCode
491147
Title
A New Approach to Hierarchical Routing in Large Networks
Author
Garcia-Luna-Aceves, J.Joaquin
Author_Institution
Information Sciences and Technology Center, SRI International, Menlo Park, California 94025
Volume
1
fYear
1987
fDate
19-22 Oct. 1987
Abstract
The overhead of an adaptive routing algorithm becomes prohibitive in a network with numerous nodes (in the order of hundreds or more) and a flat organization. In this paper, we present and analyze a new hierarchical routing algorithm for large networks. The algorithm is based on (1) the definition and maintenance of a hierarchical addressing scheme that is in turn based on the names of nodes that are well known in the network or within regions of the network, and (2) an extension of a new distributed routing algorithm first proposed by the author for flat networks.
Keywords
Algorithm design and analysis; Clustering algorithms; Delay effects; Face; Intelligent networks; Network topology; Partitioning algorithms; Proposals; Routing; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference - Crisis Communications: The Promise and Reality, 1987. MILCOM 1987. IEEE
Conference_Location
Washington, DC, USA
Type
conf
DOI
10.1109/MILCOM.1987.4795188
Filename
4795188
Link To Document