An efficient route generation algorithm for distributed multi-layered network

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.