A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

invited paperInternational audienceWe present a new algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of any arbitrary positively real-weighted graph. We use a new fast linear time intermediate all-pairs shortest paths routing protocol. The resulting distributed algorithm is asynchronous, it works for arbitrary named network, and achieves O(n) time complexity and O(nm) message complexity