Advertisement

The quickest path problem in distributed computing systems

  • Yung-Chen Hung
  • Gen-Huey Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 579)

Abstract

Let N=(V, A, C, L) be an input network with node set V, arc set A, positive arc capacity function C, and nonnegative arc lead time function L. The quickest path problem is to find a path in N to transmit a given amount of data such that the transmission time is minimized. In this paper, distributed algorithms are developed for the quickest path problem in an asynchronous communication network. For the one-source quickest path problem, we present two algorithms that require O(rn2) messages, O(rn2) time, and O(rmn) messages, O(rn) time, respectively, where m=¦A¦, n=¦V ¦, and r is the number of distinct capacity values of N. For the all-pairs quickest path problem, we present an algorithm that requires O(mn) messages and O(m) time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Awerbuch, “Optimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems,” Proceedings of 19th Annual ACM Symposium on Theory of Computing, May 1987, pp. 230–240.Google Scholar
  2. [2]
    B. Awerbuch and R. Gallager, “A new distributed algorithm to find breadth first search trees,” IEEE Transactions on Information Theory, vol. 33, no. 3, pp. 315–322, May 1987.Google Scholar
  3. [3]
    L. D. Bodin, B. L. Golden, A. A. Assad, and M. O. Ball, “Routing and scheduling of vehicles and crews: the state of the art,” Computers and Operations Research, vol. 10, pp. 63–211, 1982.Google Scholar
  4. [4]
    Y. L. Chen and Y. H. Chin, “The quickest path problem,” Computers and Operations Research, vol. 17, pp. 153–161, 1989.Google Scholar
  5. [5]
    G. N. Frederickson, “A distributed shortest path algorithm for a planar network,” Information and Computation, vol. 86, pp. 140–159, 1990.Google Scholar
  6. [6]
    M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” Journal of the ACM, vol. 34, pp. 596–615, 1987.Google Scholar
  7. [7]
    E. Horowitz and S. Sahni, Fundamentals of Data Structures, Potomac MD: Computer Science Press, 1976.Google Scholar
  8. [8]
    Y. C. Hung and G. H. Chen, “On the quickest path problem,” Proceedings of the International Conference on Computing and Information, Ottawa, Canada, May 1991, to appear.Google Scholar
  9. [9]
    K. B. Lakshmanan, K. Thulasiraman, and M. A. Comeau, “An efficient distributed protocol for finding shortest paths in networks with negative weights” IEEE Transactions on Software engineering, vol. 15, no. 5, May 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Yung-Chen Hung
    • 1
  • Gen-Huey Chen
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipeiTaiwan

Personalised recommendations