Shortest route computation in distributed systems

This paper presents a polynomial time algorithm for computing the shortest route in distributed systems. A distributedsystem is composedof autonomous subsystems anda central computing server. A subsystem stores andmaintains its own data, andis obligatedto provide the central computing server with the information about its intersections with other subsystems. The approach presentedin this paper is for the central computing server to compute the shortest route that crosses subsystems basedon the partial local information providedby the subsystems. It is the .rst e/cient algorithm that guarantees to .ndthe shortest route in such a distributed system.