Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

  • Ravi Janardan
  • Siu Wing Cheng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)


An efficient distributed algorithm is given for computing a single-source shortest path tree in an asynchronous planar network. The algorithm has message and time complexity O(pn) on an n-node network, where p is the smallest number of faces needed to cover all the nodes, taken over all possible plane embeddings of the network. The complexity of the algorithm ranges from O(n) to O(n2) as p ranges from 1 to Θ(n). The algorithm incorporates optimal distributed solutions to a number of interesting subproblems including: (i) decomposing the plane embedding into Θ(p) outerplane graphs with favorable properties; (ii) a single-source algorithm for outerplane graphs; and (iii) identifying any edge in an outerplane graph whose cost exceeds the distance between its endpoints. As an application, an efficient message routing scheme is presented which adapts to changing link conditions and routes along near-shortest paths.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804–823, 1985.Google Scholar
  2. [2]
    B. Awerbuch. A new distributed depth-first search algorithm. Information Processing Letters, 20:147–150, 1985.Google Scholar
  3. [3]
    B. Awerbuch. Distributed shortest paths algorithms. In Proc. 21st ACM Symposium on Theory of Computing, pages 490–500, Seattle, May 1989.Google Scholar
  4. [4]
    B. Awerbuch and R. Gallager. Distributed BFS algorithms. In Proc. 26th IEEE Symposium on Foundations of Computer Science, pages 250–256, Portland, OR, October 1985.Google Scholar
  5. [5]
    B. Awerbuch and R.G. Gallager. A new distributed algorithm to find breadth-first search trees. IEEE Transactions on Information Theory, 33(3):315–322, 1987.Google Scholar
  6. [6]
    D. Bienstock and C.L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM Journal on Computing, 17:53–76, 1988.Google Scholar
  7. [7]
    G.N. Frederickson. A single source shortest path algorithm for a planar distributed network. In Proc. 2nd Symposium on Theoretical Aspects of Computer Science, pages 143–150, 1985.Google Scholar
  8. [8]
    G.N. Frederickson. A new approach to all pairs shortest paths in planar graphs. In Proc. 19th ACM Symposium on Theory of Computing, pages 19–28, New York, May 1987. Revised version available as: “Planar graph decomposition and all pairs shortest paths”, TR-89-015, ICSI, Berkeley, March 1989.Google Scholar
  9. [9]
    G.N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171–190, 1988.Google Scholar
  10. [10]
    R. Janardan and S.W. Cheng. Efficient distributed algorithms for single-source shortest paths and related problems on plane networks. Technical Report TR-89-47 (1st revision), University of Minnesota, July 1989. Submitted.Google Scholar
  11. [11]
    M. Schwartz and T.E. Stern. Routing techniques used in computer communication networks. IEEE Transactions on Communications, 28(4):539–552, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ravi Janardan
    • 1
  • Siu Wing Cheng
    • 1
  1. 1.Department of Computer ScienceUniversity of MinnesotaMinneapolisU.S.A.

Personalised recommendations