Michael Elkin
ABSTRACT
Currently, there are no known explicit algorithms for the great majority of graph problems in the dynamic distributed message-passing model. Instead, most state-of-the-art dynamic distributed algorithms are constructed by composing a static algorithm for the problem at hand with a simulation technique that converts static algorithms to dynamic ones. We argue that this powerful methodology does not provide satisfactory solutions for many important dynamic distributed problems, and this necessitates developing algorithms for these problems from scratch.
In this paper we develop a fully dynamic distributed algorithm for maintaining sparse spanners. Our algorithm improves drastically the quiescence time of the state-of-the-art algorithm for the problem. Moreover, we show that the quiescence time of our algorithm is optimal up to a small constant factor. In addition, our algorithm improves significantly upon the state-of-the-art algorithm in all efficiency parameters, specifically, it has smaller quiescence message and space complexities, and smaller local processing time. Finally, our algorithm is self-contained and fairly simple, and is, consequently, amenable to implementation on unsophisticated network devices.
- Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. 28th Symp. on Foundations of Computer Science, pages 358--370, 1987.Google Scholar
Digital Library
- Y. Afek, B. Awerbuch, S. Plotkin, and M. Saks. Local management of a global resource in a communication network. In Proc. of the 28th IEEE Annual Symp. on Foundations of Computer Science, pages 347--357, 1987.Google ScholarDigital Library
- Y. Afek, E. Gafni, and M. Ricklin. Upper and lower bounds for routing schemes in dynamic networks. In Proc. of 30th IEEE Annual Symposium on Foundations of Computer Science (FOCS-89), pages 370--375, 1989.Google ScholarDigital Library
- Y. Afek, E. Gafni, and A. Rosen. The slide mechanism with applications in dynamic networks. In Proc. of the 11th ACM Symp. Principles of Distributed Computing, pages 35--46, 1992. Google ScholarDigital Library
- B. Awerbuch. Complexity of network synchronization. J. ACM, 4:804--823, 1985. Google ScholarDigital Library
- B. Awerbuch, I. Cidon, and S. Kutten. Communication-optimal maintenance of replicated information. In Proc. IEEE Symp. on Foundations of Computer Science, pages 492--502, 1990.Google ScholarDigital Library
- B. Awerbuch and S. Even. Reliable broadcast protocols in unreliable networks. Networks, 16:381--396, 1986.Google ScholarCross Ref
- B. Awerbuch, O. Goldreich, and A. Herzberg. A quintitive approach to dynamic networks. In Proc. of the 9th ACM Symp. on Principles of Distributed Computing, pages 189--203, 1990. Google ScholarDigital Library
- B. Awerbuch, S. Kutten, and D. Peleg. Online load balancing in a distributed network. In Proc. 24th ACM Symp. on Theory of Comput., pages 571--580, 1992.Google Scholar
- B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. E. Saks. Adapting to asynchronous dynamic networks. In Proc. of the 24th Annual ACM Symp. on Theory of Computing, pages 557--570, 1992. Google ScholarDigital Library
- B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local cheking and correction. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 268--277, 1991. Google ScholarDigital Library
- B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 514--522, 1990.Google ScholarDigital Library
- B. Awerbuch and D. Peleg. Routing with polynomial communication-space tradeoff. SIAM J. Discrete Mathematics, 5:151--162, 1992. Google ScholarDigital Library
- B. Awerbuch and M. Sipser. Dynamic networks are as fast as static networks. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 206--220, 1988.Google ScholarDigital Library
- S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie. New constructions of (a,b)-spanners and additive spanners. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 672--681, 2005. Google ScholarDigital Library
- S. Baswana and S. Sen. A simple linear time algorithm for computing a (2k - 1)-spanner of O(n
1+1/k) size in weighted graphs. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of LNCS, pages 384--396. Springer, 2003. Google ScholarDigital Library
- S. Cicerone, G. D. Stefano, and M. Flammini. Static and dynamic low-congested interval routing schemes. Theoretical Computer Science, 276:315--354, 2002. Google ScholarDigital Library
- S. Cicerone, G. D. Stefano, D. Frigione, and U. Nanni. A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science, 297:83--102, 2003. Google ScholarDigital Library
- E. Cohen. Fast algorithms for t-spanners and stretch-t paths. SIAM J. Comput., 28:210--236, 1999. Google ScholarDigital Library
- S. Dolev. Self-Stabilization. MIT Press, 2000. Google ScholarDigital Library
- M. Elkin. Computing almost shortest paths. In Proc. 20th ACM Symp. on Principles of Distributed Computing, pages 53--62, 2001. Google ScholarDigital Library
- M. Elkin. A streaming and fully dynamic centralized algorithm for maintaining sparse spanners. In Proc. of the Internat. Colloq. Autonata, Languages, and Progr. (to appear), 2007. Google ScholarDigital Library
- M. Elkin and J. Zhang. Efficient algorithms for constructing (1 + ε, ß)-spanners in the distributed and streaming models. Distributed Computing, 18:375--385, 2006.Google ScholarDigital Library
- P. Erdõs. Extremal problems in graph theory. In Theory of Graphs and Applications (Proc. Sympos. Smolenice), pages 29--36, 1964.Google ScholarCross Ref
- J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph distances in the streaming model: The value of space. In Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pages 745--754, 2005. Google ScholarDigital Library
- P. Humblet. Another adaptive distributed shortest path algorithm. IEEE Transactions on Communications, 39(6):995--1003, 1991.Google ScholarCross Ref
- G. F. Italiano. Distributed algorithms for updating shortest paths. In Proc. Intern. Workshop on Distributed Algorithms, pages 200--211, 1991. Google ScholarDigital Library
- A. Korman and D. Peleg. Labeling schemes for weighted dynamic trees. In Proc. 30th Int. Colloq. on Automata, Languages and Programming, pages 369--383, 2003. Google ScholarDigital Library
- A. Korman, D. Peleg, and Y. Rodeh. Labeling schemes for dynamic tree networks. Theory of Computing Systems, 37:49--75, 2004.Google ScholarCross Ref
- F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. Proc. of Symp. on Discrete Algorithms, pages 980--989, 2006. Google ScholarDigital Library
- N. Linial and M. Saks. Decomposing graphs into regions of small diameter. Combinatorica, 13:441--454, 1993.Google ScholarCross Ref
- D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000. Google ScholarDigital Library
- D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM J. on Comput., 18:740--747, 1989. Google ScholarDigital Library
- D. Peleg and E. Upfal. A tradeoff between size and efficiency for routing tables. J. of the ACM, 36:510--530, 1989. Google ScholarDigital Library
- W. B. Powell, P. Jaillet, and A. Odoni. Stochastic and dynamic networks and routing. In M. O. Ball and T. L. Magnanti and C. L. Monma and and G. L. Nemhauser (editors) Network Routing: volume 8 of Handbooks in Operations Research and Management Science, pages 141--295, 1995.Google Scholar
- K. V. S. Ramarao and S. Venkatesan. On finding and updating shortest paths distributively. Journal of Algorithms, 13:235--257, 1992. Google ScholarDigital Library
- M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33rd ACM Symp. on Theory of Computing, pages 183--192, 2001. Google ScholarDigital Library
- M. Thorup and U. Zwick. Compact routing schemes. In Proc. of the 13th Symp. on Parallelism in Algorithms and Architectures, pages 1--10, 2001. Google ScholarDigital Library
Index Terms
- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Recommendations
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
We present a streaming algorithm for constructing sparse spanners and show that our algorithm significantly outperforms the state-of-the-art algorithm for this task (due to Feigenbaum et al.). Specifically, the processing time per edge of our algorithm ...
Fully dynamic randomized algorithms for graph spanners
Spanner of an undirected graph G = (V,E) is a subgraph that is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ ℕ is a subgraph (V,ES), ES ⊆ E such that the distance between any two vertices in the ...
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and ProgrammingWe present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Specifically, the processing time-per-edge of our algorithm is drastically ...
Comments