Shortest route computation in distributed systems

Shortest route computation in distributed systems

0.00 Avg rating0 Votes
Article ID: iaor2005403
Country: United Kingdom
Volume: 31
Issue: 10
Start Page Number: 1621
End Page Number: 1633
Publication Date: Sep 2004
Journal: Computers and Operations Research
Authors: ,
Keywords: networks: path
Abstract:

This paper presents a polynomial time algorithm for computing the shortest route in distributed systems. A distributed system is composed of autonomous subsystems and a central computing server. A subsystem stores and maintains its own data, and is obligated to provide the central computing server with the information about its intersections with other subsystems. The approach presented in this paper is for the central computing server to compute the shortest route that crosses subsystems based on the partial local information provided by the subsystems. It is the first efficient algorithm that guarantees to find the shortest route in such a distributed system.

Reviews

Required fields are marked *. Your email address will not be published.