Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

An efficient distributed algorithm is given for computing single-source shortest paths in an asynchronous planar network. The algorithm has message and time complexityO(pn) on ann-node network, wherep is the smallest number of faces needed to cover all the nodes, taken over all possible plane embeddings of the network. Each node has only local information about the network, consisting of an ordered list of its incident edges in the embedding that realizesp and the name of the covering face that it belongs to. The complexity of the algorithm ranges fromO(n) toO(n 2) asp ranges from 1 to Θ(n). The algorithm is more efficient than previous algorithms [A3], [F1] for a broad range of values forp; however, the algorithms in [A3] and [F1] do not require knowledge about the embedding. The single-source 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, a communication-, time-, and space-efficient message-routing scheme is presented which adapts to changing link conditions and routes along near-shortest paths.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [A1] B. Awerbuch, Complexity of network synchronization,Journal of the Association for Computing Machinery,32 (1985), 804–823.

    MATH  MathSciNet  Google Scholar 

  • [A2] B. Awerbuch, A new distributed depth-first search algorithm,Information Processing Letters,20 (1985), 147–150.

    Article  MATH  Google Scholar 

  • [A3] B. Awerbuch, Distributed shortest paths algorithms,Proc. 21st ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 490–500.

  • [ABLP] B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Compact distributed data structures for adaptive routing,Proc. 21st ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 479–489.

  • [AG1] B. Awerguch and R. Gallager, Distributed BFS algorithms,Proc. 26th IEEE Symposium on Foundations of Computer Science, Portland, OR, October 1985, pp. 250–256.

  • [AG2] B. Awerbuch and R. Gallager, A new distributed algorithm to find breadth-first search trees,IEEE Transactions on Information Theory,33 (1987), 315–322.

    Article  MATH  Google Scholar 

  • [BM] D. Bienstock and C. Monma, On the complexity of covering vertices by faces in a planar graph,SIAM Journal on Computing,17 (1988), 53–76.

    Article  MATH  MathSciNet  Google Scholar 

  • [F1] G. Frederickson, A single source shortest path algorithm for a planar distributed network,Proc. 2nd Symposium on Theoretical Aspects of Computer Science, 1985, pp. 143–150.

  • [F2] G. Frederickson, A new approach to all pairs shortest paths in planar graphs,Proc. 19th ACM Symposium on Theory of Computing, New York, May 1987, pp. 19–28. Revised version available as: Planar Graph Decomposition and All Pairs Shortest Paths, TR-89-015, ICSI, Berkeley, March 1989.

  • [FJ1] G. Frederickson and R. Janardan, Designing networks with compact routing tables,Algorithmica,3 (1988), 171–190.

    Article  MATH  MathSciNet  Google Scholar 

  • [FJ2] G. Frederickson and R. Janardan, Space-efficient and fault-tolerant message routing in outerplanar networks,IEEE Transactions on Computers,37 (1988), 1529–1540.

    Article  MATH  MathSciNet  Google Scholar 

  • [SS] M. Schwartz and T. Stern, Routing techniques used in computer communication networks,IEEE Transactions on Communications,28 (1980), 539–552.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 55455, Minneapolis, MN, USA

    Ravi Janardan & Siu Wing Cheng

Authors
  1. Ravi Janardan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siu Wing Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ravi Janardan.

Additional information

This research was supported in part by a grant-in-aid of research from the Graduate School of the University of Minnesota. R. Janardan was also supported in part by NSF Grant CCR-8808574. Portions of this work were presented at the 4th International Workshop on Distributed Algorithms, Bari, Italy, September 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janardan, R., Cheng, S.W. Efficient distributed algorithms for single-source shortest paths and related problems on plane networks. Math. Systems Theory 25, 93–122 (1992). https://doi.org/10.1007/BF02835831

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02835831

Keywords

Search

Navigation