Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

An efficient route generation algorithm for distributed multi-layered network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sato, M. ; JUSTSYSTEM Corp., Tokyo, Japan ; Nakamura, M.

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

Published in:

Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on

Date of Conference:

30 Jun-2 Jul 1998