A distributed algorithm for constructing a minimum diameter spanning tree

We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G=(V, E, ω). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute centre of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(|V|) time complexity and O(|V||E|) message complexity.

[1]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[2]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[3]  Leslie Lamport,et al.  An Assertional Correctness Proof of a Distributed Algorithm , 1982, Sci. Comput. Program..

[4]  Subbarayan Venkatesan,et al.  A Message-Optimal Algorithm for Distributed Termination Detection , 1990, J. Parallel Distributed Comput..

[5]  S. Hakimi,et al.  On p -Centers in Networks , 1978 .

[6]  Chak-Kuen Wong,et al.  Minimum Diameter Spanning Trees and Related Problems , 1991, SIAM J. Comput..

[7]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[8]  Edmund Ihler,et al.  On Shortest Networks for Classes of Points in the Plane , 1991, Workshop on Computational Geometry.

[9]  Giuseppe F. Italiano,et al.  Maintaining Spanning Trees of Small Diameter , 1994, ICALP.

[10]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[11]  Pierre Fraigniaud,et al.  Memory requirement for universal routing schemes , 1995, PODC '95.

[12]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[13]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[14]  P. Camerini,et al.  Complexity of spanning tree problems: Part I , 1980 .

[15]  Nicos Christofides,et al.  Graph theory: An algorithmic approach (Computer science and applied mathematics) , 1975 .

[16]  Christian Lavault.  Complexité de l'élection: méthodes d'analyse d'algorithmes distribués , 1995 .

[17]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[18]  David Eppstein,et al.  Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. , 1993 .

[19]  Baruch Awerbuch,et al.  Communication-optimal maintenance of replicated information , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.