Title :
An efficient route generation algorithm for distributed multi-layered network
Author :
Sato, Masakazu ; Nakamura, Mitsuhiro
Author_Institution :
JUSTSYSTEM Corp., Tokyo, Japan
fDate :
30 Jun-2 Jul 1998
Abstract :
Minimizing the cost of routing calculations is crucial for scaling up networks. This paper outlines a method for computing the shortest path in a hierarchical network by applying Dijkstra´s (1959) algorithm to various subsets in an entire graph. In the proposed method, the routing calculations increase linearly with the number of layers, while they increase as a square of the number of layers in the existing method
Keywords :
graph theory; minimisation; network topology; telecommunication network routing; cost; distributed multi-layered network; efficient route generation algorithm; graph; hierarchical network; scaling; shortest path; Character generation; Clustering algorithms; Computational efficiency; Computer networks; Costs; Impedance; Network topology; Peer to peer computing; Routing; Switches;
Conference_Titel :
Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on
Conference_Location :
Athens
Print_ISBN :
0-8186-8538-7
DOI :
10.1109/ISCC.1998.702558
