Towards robust and efficient computation in dynamic Peer-to-Peer networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 551-569

  Augustine, John ^a   Pandurangan, Gopal ^b,c   Robinson, Peter ^b   Upfal, Eli ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c Brown Univerity   (United States)

Author keywords

Distributed algorithm; Dynamic network; Expander graph; Peer to Peer network; Randomized algorithm; Stable agreement

Indexed keywords

COMPUTATIONAL EFFICIENCY; PARALLEL ALGORITHMS; PEER TO PEER NETWORKS; PROBABILITY;

DISTRIBUTED AGREEMENT; DISTRIBUTED COMPUTATIONS; DYNAMIC NETWORK; EXPANDER GRAPHS; PEER TO PEER (P2P) NETWORK; POLYLOGARITHMIC NUMBERS; RANDOMIZED ALGORITHMS; RANDOMIZED DISTRIBUTED ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84860120033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.47     Document Type: Conference Paper

References (54)

1. Yehuda Afek, Baruch Awerbuch, and Eli Gafni. Applying static network protocols to dynamic networks. In FOCS'87, pages 358-370, 1987.
2. Yehuda Afek, Eli Gafni, and Adi Rosen. The slide mechanism with applications in dynamic networks. In ACM PODC, pages 35-46, 1992.
3. R. Ahlswede, N. Cai, S. Li, and R. Yeung. Network information flow. Transactions on Information Theory, 46(4):1204-1216, 2000.
4. James Aspnes, Navin Rustagi, and Jared Saia. Worm versus alert: Who wins in a battle for control of a large-scale network? In OPODIS, pages 443-456, 2007.
5. Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). John Wiley Interscience, March 2004.
6. B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In IEEE FOCS, pages 158-167, 2001.
7. B. Awerbuch and F. T. Leighton. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In ACM STOC, pages 487-496, May 1994.
8. Baruch Awerbuch, Andr Brinkmann, and Christian Scheideler. Anycasting in adversarial systems: Routing and admission control. In ICALP'03, pages 1153-1168, 2003.
9. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, and Michael E. Saks. Adapting to asynchronous dynamic networks. In STOC'92, pages 557-570, 1992.
10. Baruch Awerbuch and Christian Scheideler. Towards a scalable and robust DHT. Theory of Computing Systems, 45:234-260, 2009.
11. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. The effect of faults on network expansion. Theory Comput. Syst., 39(6):903-928, 2006.
12. Hervé Baumann, Pierluigi Crescenzi, and Pierre Fraigniaud. Parsimonious flooding in dynamic graphs. In PODC, pages 260-269, 2009.
13. Piotr Berman and Juan A. Garay. Fast consensus in networks of bounded degree. Distributed Computing, 7(2):67-73, 1993.
14. John F. Canny. Collaborative filtering with privacy. In IEEE Symposium on Security and Privacy, pages 45-57, 2002.
15. Keren Censor Hillel and Hadas Shachnai. Partial information spreading with application to distributed maximum coverage. In Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pages 161-170. ACM, 2010.
16. Hyun Chul Chung, Peter Robinson, and Jennifer L. Welch. Optimal regional consecutive leader election in mobile ad-hoc networks. In Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing, FOMC '11, pages 52-61. ACM, 2011.
17. Website of Cloudmark Inc. http://cloudmark.com/.
18. Edith Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci., 55(3):441-453, 1997.
19. Souptik Datta, Kanishka Bhaduri, Chris Giannella, Ran Wolff, and Hillol Kargupta. Distributed data mining in peer-to-peer networks. IEEE Internet Computing, 10(4):18-26, 2006.
20. A. Dembo and O. Zeitouni. Large deviations techniques and applications. Elearn, 1998.
21. Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. Stabilizing consensus with the power of two choices. In SPAA, pages 149-158, 2011.
22. Shlomi Dolev. Self-stabilization. MIT Press, Cambridge, MA, USA, 2000.
23. Cynthia Dwork, David Peleg, Nicholas Pippenger, and Eli Upfal. Fault tolerance in networks of bounded degree. SIAM J. Comput., 17(5):975-988, 1988.
24. Jarret Falkner, Michael Piatek, John P. John, Arvind Krishnamurthy, and Thomas E. Anderson. Profiling a million user dht. In Internet Measurement Comference, pages 129-134, 2007.
25. Amos Fiat and Jared Saia. Censorship resistant peer-to-peer content addressable networks. In SODA, pages 94-103, 2002.
26. E. Gafni and B. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. Comm., 29(1):1118, 1981.
27. Roxana Geambasu, Tadayoshi Kohno, Amit A. Levy, and Henry M. Levy. Vanish: Increasing data privacy with self-destructing data. In USENIX Security Symposium, pages 299-316, 2009.
28. C.M. Grinstead and J.L. Snell. Introduction to probability. American Mathematical Society, 1997.
29. P. Krishna Gummadi, Stefan Saroiu, and Steven D. Gribble. A measurement study of napster and gnutella as examples of peer-to-peer file sharing systems. Computer Communication Review, 32(1):82, 2002.
30. Bernhard Haeupler. Analyzing network coding gossip made easy. In ACM STOC, pages 293-302, 2011.
31. Bernhard Haeupler and David Karger. Faster information dissemination in dynamic networks via network coding. In ACM PODC, pages 381-390, 2011.
32. Kirsten Hildrum and John Kubiatowicz. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In DISC, volume 2848 of Lecture Notes in Computer Science, pages 321-336. Springer, 2003.
33. Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, and Vishal Sanwalani. Fast asynchronous byzantine agreement and leader election with full information. ACM Transactions on Algorithms, 6(4), 2010.
34. 2) bit barrier: Scalable byzantine agreement with an adaptive adversary. J. ACM, 58:18:1-18:24, July 2011.
35. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In SODA, pages 990-999, 2006.
36. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Towards secure and scalable computation in peer-to-peer networks. In FOCS, pages 87-98, 2006.
37. F. Kuhn and R. Oshman. Dynamic networks: Models and algorithms. SIGACT News, 42(1):82-96, 2011.
38. Fabian Kuhn, Nancy Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In ACM STOC, pages 513-522, 2010.
39. Fabian Kuhn, Rotem Oshman, and Yoram Moses. Coordinated consensus in dynamic networks. In Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pages 1-10. ACM, 2011.
40. Fabian Kuhn, Stefan Schmid, and Roger Wattenhofer. Towards worst-case churn resistant peer-to-peer systems. Distributed Computing, 22(4):249-267, 2010.
41. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, volume 3, pages 2133-2143 vol.3, march-3 april 2003.
42. Nancy Lynch. Distributed Algorithms. Morgan Kaufman Publishers, Inc., San Francisco, USA, 1996.
43. David J. Malan and Michael D. Smith. Host-based detection of worms through peer-to-peer cooperation. In Vijay Atluri and Angelos D. Keromytis, editors, WORM, pages 72-80. ACM Press, 2005.
44. Damon Mosk-Aoyama and Devavrat Shah. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory, 54(7):2997-3007, 2008.
45. Moni Naor and Udi Wieder. A simple fault tolerant distributed hash table. In IPTPS, pages 88-97, 2003.
46. Regina O'Dell and Roger Wattenhofer. Information dissemination in highly dynamic graphs. In DIALM-POMC, pages 104-110, 2005.
47. Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal. Building low-diameter P2P networks. In FOCS, pages 492-499, 2001.
48. Gopal Pandurangan and Amitabh Trehan. Xheal: localized self-healing using expanders. In PODC, pages 301-310, 2011.
49. Christian Scheideler. How to spread adversarial nodes?: rotate! In STOC, pages 704-713, 2005.
50. Christian Scheideler and Stefan Schmid. A distributed and oblivious heap. In Automata, Languages and Programming, volume 5556 of Lecture Notes in Computer Science, pages 571-582. Springer Berlin / Heidelberg, 2009.
51. Subhabrata Sen and Jia Wang. Analyzing peer-to-peer traffic across large networks. In Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, IMW '02, pages 137-150, New York, NY, USA, 2002. ACM.
52. Daniel Stutzbach and Reza Rejaie. Understanding churn in peer-to-peer networks. In Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, IMC '06, pages 189-202, New York, NY, USA, 2006. ACM.
53. Eli Upfal. Tolerating a linear number of faults in networks of bounded degree. Inf. Comput., 115(2):312-320, 1994.
54. Vasileios Vlachos, Stephanos Androutsellis-Theotokis, and Diomidis Spinellis. Security applications of peer-to-peer networks. Comput Netw., 45:195-205, June 2004.