Distributed computation in dynamic networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 513-522

  Kuhn, Fabian ^a   Lynch, Nancy ^b   Oshman, Rotem ^b  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

distributed algorithms; dynamic networks

Indexed keywords

A-STABILITY; COMMUNICATION LINKS; CONNECTED GRAPH; DISTRIBUTED ALGORITHM; DISTRIBUTED COMPUTATIONS; DISTRIBUTED COMPUTING; DYNAMIC GRAPH; DYNAMIC NETWORK; IN-NETWORK; LOWER BOUNDS; MOBILE NETWORKS; NETWORK TOPOLOGY; ON DYNAMICS; SUBGRAPHS; WORST-CASE MODELS;

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; STABILITY;

WIRELESS NETWORKS;

EID: 77954733147     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806760     Document Type: Conference Paper

References (41)

1. Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. of 28th Symp. on Foundations of Computer Science (FOCS), pages 358-370, 1987.
2. Y. Afek and D. Hendler. On the complexity of gloabl computation in the presence of link failures: The general case. Distributed Computing, 8(3):115-120, 1995.
3. D. Angluin, J. Aspnes, Z. Diamadi, M. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235-253, 2006.
4. J. Aspnes and E. Ruppert. An introduction to population protocols. In B. Garbinato, H. Miranda, and L. Rodrigues, editors, Middleware for Network Eccentric and Mobile Applications, pages 97-120. Springer-Verlag, 2009.
5. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. John Wiley and Sons, Inc., 2nd edition, 2004.
6. B. Awerbuch, Y. Mansour, and N. Shavit. Polynomial end-to-end communication. In Proc. of 30th Symp. on Foundations of Computer Science (FOCS), pages 358-363, 1989.
7. B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. E. Saks. Adapting to asynchronous dynamic networks. In Proc. of the 24th Annual ACM Symposium on Theory of Computing (STOC), pages 557-570, 1992.
8. B. Awerbuch and M. Sipser. Dynamic networks are as fast as static networks. In Proc. of 29th Symp. on Foundations of Computer Science (FOCS), pages 206-220, 1988.
9. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences (JCSS), 45(1):104-126, 1992.
10. H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proc. of 28th Symp. on Principles of Distributed Computing (PODC), pages 260-269, 2009.
11. A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-markovian dynamic graphs. In Proc. of 27th Symp. on Principles of Distributed Computing (PODC), pages 213-222, 2008.
12. A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213-230, 2009.
13. A. E. G. Clementi, A. Monti, and R. Silvestri. Distributed multi-broadcast in unknown radio networks. In Proc. of 20th Symp. on Principles of Distributed Computing (PODC), pages 255-263, 2001.
14. A. Cornejo, F. Kuhn, R. Ley-Wild, and N. A. Lynch. Keeping mobile robot swarms connected. In Proc. of 23rd Conference on Distributed Computing (DISC), pages 496-511, 2009.
15. S. Dolev. Self-Stabilization. MIT Press, 2000.
16. M. Fischer and H. Jiang. Self-stabilizing leader election in networks of finite-state anonymous agents. In Proc. of 10th Int. Conf. on Principles of Distributed Systems (OPODIS), pages 395-409, 2006.
17. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
18. E. Gafni and D. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communication, 29(1):11-18, 1981.
19. T. P. Hayes, J. Saia, and A. Trehan. The forgiving graph: A distributed data structure for low stretch under adversarial attack. In Proc. of 28th Symp. on Principles of Distributed Computing (PODC), pages 121-130, 2009.
20. S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319-349, 1988.
21. J. Hromkovič, R. Klasing, B. Monien, and R. Peine. Dissemination of information in interconnection networks (broadcasting & gossiping). Combinatorial Network Theory, pages 125-212, 1996.
22. R. Ingram, P. Shields, J. E. Walter, and J. L.Welch. An asynchronous leader election algorithm for dynamic networks. In Proc. of 23rd IEEE Int. Symp. on Parallel and Distributed Processing (IPDPS), pages 1-12, 2009.
23. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. of 41st Symp. on Foundations of Computer Science (FOCS), pages 565-574, 2000.
24. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of 44th Symp. on Foundations of Computer Science (FOCS), pages 482-491, 2003.
25. D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proc. of 43rd Symp. on Foundations of Computer Science (FOCS), pages 471-480, 2002.
26. A. Korman. Improved compact routing schemes for dynamic trees. In Proc. of 27th Symp. on Principles of Distributed Computing (PODC), pages 185-194, 2008.
27. D. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. In Proc. of 22nd Symp. on Principles of Distributed Computing (PODC), pages 73-82, 2003.
28. D. Krizanc, F. Luccio, and R. Raman. Compact routing schemes for dynamic ring networks. Theory of Computing Systems, 37:585-607, 2004. (Pubitemid 39323150)
29. F. Kuhn, T. Locher, and R. Oshman. Gradient clock synchronization in dynamic networks. In Proc. of 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 270-279, 2009.
30. F. Kuhn, N. A. Lynch, and C. C. Newport. The abstract MAC layer. In Proc. of 23rd Conference on Distributed Computing (DISC), pages 48-62, 2009.
31. F. Kuhn, S. Schmid, and R. Wattenhofer. A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In Proc. of 4th Int. Workshop on Peer-To-Peer Systems (IPTPS), 2005.
32. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, 1978.
33. X. Li, M. J, and C. Plaxton. Active and Concurrent Topology Maintenance. In Proc. of 18th Conference on Distributed Computing (DISC), 2004.
34. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
35. N. Malpani, J. L. Welch, and N. Vaidya. Leader election algorithms for mobile ad hoc networks. In DIALM '00: Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, pages 96-103, New York, NY, USA, 2000. ACM.
36. D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. In Proc. of 25th Symp. on Principles of Distributed Computing (PODC), pages 113-122, 2006.
37. R. O'Dell and R. Wattenhofer. Information dissemination in highly dynamic graphs. In Proc. of 9th Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 104-110, 2005.
38. R. Olfati-Saber and R. M. Murray. Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 49(9):1520-1533, 2004.
39. W. Ren and R. W. Beard. Consensus of information under dynamically changing interaction topologies. In Proc. of American Control Conference, pages 4939-4944, 2004.
40. D. M. Topkis. Concurrent broadcast for information dissemination. IEEE Transactions on Software Engineering, SE-11(10), 1985.
41. J. E. Walter, J. L. Welch, and N. H. Vaidya. A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks, 7(6):585-600, 2001. (Pubitemid 33091056)