Abstract
This chapter first introduces basic definitions related to distributed algorithms. Then, considering a distributed system as a graph whose vertices are the processes and whose edges are the communication channels, it presents distributed algorithms for graph traversals, namely, parallel traversal, breadth-first traversal, and depth-first traversal. It also shows how spanning trees or rings can be constructed from these distributed graph traversal algorithms. These trees and rings can, in turn, be used to easily implement broadcast and convergecast algorithms.
As the reader will see, the distributed graph traversal techniques are different from their sequential counterparts in their underlying principles, behaviors, and complexities. This come from the fact that, in a distributed context, the same type of traversal can usually be realized in distinct ways, each with its own tradeoff between its time complexity and message complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
H. Attiya, J.L. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. (Wiley-Interscience, New York, 2004). 414 pages. ISBN 0-471-45324-2
B. Awerbuch, A new distributed depth-first search algorithm. Inf. Process. Lett. 20(3), 147–150 (1985)
T.-Y. Cheung, Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Trans. Softw. Eng. SE-9(4), 504–512 (1983)
I. Cidon, Yet another distributed depth-first search algorithm. Inf. Process. Lett. 26(6), 301–305 (1988)
S. Even, Graph Algorithms, 2nd edn. (Cambridge University Press, Cambridge, 2011), 202 pages (edited by G. Even)
R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66–77 (1983)
V.K. Garg, Elements of Distributed Computing (Wiley-Interscience, New York, 2002), 423 pages
A. Gibbons, Algorithmic Graph Theory (Cambridge University Press, Cambridge, 1985), 260 pages
J.L. Gross, J. Yellen (eds.), Graph Theory (CRC Press, Boca Raton, 2004), 1167 pages
J.-M. Hélary, A. Maddi, M. Raynal, Controlling information transfers in distributed applications, application to deadlock detection, in Proc. Int’l IFIP WG 10.3 Conference on Parallel Processing (North-Holland, Amsterdam, 1987), pp. 85–92
J.-M. Hélary, M. Raynal, Depth-first traversal and virtual ring construction in distributed systems, in Proc. IFIP WG 10.3 Conference on Parallel Processing (North-Holland, Amsterdam, 1988), pp. 333–346
E. Korach, S. Moran, S. Zaks, The optimality of distributive constructions of minimum weight and degree restricted spanning tree in complete networks of processes. SIAM J. Comput. 16(2), 231–236 (1987)
A.D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms and Systems (Cambridge University Press, Cambridge, 2008), 736 pages
K.B. Lakshmanan, N. Meenakshi, K. Thulisaraman, A time-optimal message-efficient distributed algorithm for depth-first search. Inf. Process. Lett. 25, 103–109 (1987)
Y. Lavallée, G. Roucairol, A fully distributed minimal spanning tree algorithm. Inf. Process. Lett. 23(2), 55–62 (1986)
N.A. Lynch, Distributed Algorithms (Morgan Kaufmann, San Francisco, 1996), 872 pages
M. Raynal, Networks and Distributed Computation: Concepts, Tools and Algorithms (The MIT Press, Cambridge, 1987), 168 pages. ISBN 0-262-18130-4
M. Raynal, J.-M. Hélary, Synchronization and Control of Distributed Systems and Programs. Wiley Series in Parallel Computing (1991), 126 pages. ISBN 0-471-92453-9
N. Santoro, Design and Analysis of Distributed Algorithms (Wiley, New York, 2007), 589 pages
A. Segall, Distributed network protocols. IEEE Trans. Inf. Theory 29(1), 23–35 (1983)
M. van Steen, Graph Theory and Complex Networks: An Introduction (2011), 285 pages. ISBN 978-90-815406-1-2
G. Tel, Introduction to Distributed Algorithms, 2nd edn. (Cambridge University Press, Cambridge, 2000), 596 pages. ISBN 0-521-79483-8
Y. Zhu, C.-T. Cheung, A new distributed breadth-first search algorithm. Inf. Process. Lett. 25(5), 329–333 (1987)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Raynal, M. (2013). Basic Definitions and Network Traversal Algorithms. In: Distributed Algorithms for Message-Passing Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38123-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-38123-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38122-5
Online ISBN: 978-3-642-38123-2
eBook Packages: Computer ScienceComputer Science (R0)