title: Termination of the Bellman-Ford algorithm in asynchronous distributed model
body: <p>I'm looking for an algorithm to compute the BFS tree of a graph rooted in the leader processor <code>r</code> in the asynchronous distributed model.</p>
  
  <p>The only requirement is <code>O(D)</code> time complexity, where <code>D</code> denotes the diameter of the graph (message complexity isn't relevant). </p>
  
  <p>Currently, I'm using Bellman-Ford algorithm, but I don't know how to guarantee the global termination of this method in <code>O(D)</code> time. I was trying to use the convergecast technique, but with no success. </p>
  
  <p>Is it possible to guarantee a termination of Bellman-Ford in <code>O(D)</code> time or is there any other algorithm for computing the BFS tree in <code>O(D)</code> time?</p>