John Augustine
- P2p networks hijacked for ddos attacks. 2007. http://news.netcraft.com/archives/2007/05/23/p2p_networks_hijacked_for_ddos_attacks.html.Google Scholar
- Sebastian Abshoff, Markus Benter, Manuel Malatyali, and Friedhelm Meyer auf der Heide. On two-party communication through dynamic networks. OPODIS, pages 11--22, 2013. Google ScholarDigital Library
- Yehuda Afek, Baruch Awerbuch, and Eli Gafni. Applying static network protocols to dynamic networks. FOCS'87, pages 358--370, 1987. Google ScholarDigital Library
- Yehuda Afek, Eli Gafni, and Adi Rosen. The slide mechanism with applications in dynamic networks. ACM PODC, pages 35--46, 1992. Google ScholarDigital Library
- Rudolf Ahlswede, Ning Cai, Shuo-Yen Li, and Raymond Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204--1216, 2000. Google ScholarDigital Library
- James Aspnes. Lower bounds for distributed coin-ipping and randomized consensus. In Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing (STOC), pages 559--568, 1997. Google ScholarDigital Library
- James Aspnes and Gauri Shah. Skip graphs. SODA, pages 384--393, 2003. Google ScholarDigital Library
- James Aspnes and Udi Wieder. The expansion and mixing time of skip graphs with applications. SPAA, pages 126--134, 2005. Google ScholarDigital Library
- Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). John Wiley Interscience, March 2004. Google ScholarDigital Library
- John Augustine, Tejas Kulkarni, and Sumathi Sivasubramaniam. Leader election in sparse dynamic networks with churn. IPDPS, 347-356, 2015. Google ScholarDigital Library
- John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, and Eli Upfal. Storage and search in dynamic peer-to-peer networks. In SPAA, pages 53--62, 2013. Google ScholarDigital Library
- John Augustine, Gopal Pandurangan, and Peter Robinson. Fast Byzantine agreement in dynamic networks. PODC, pages 74--83, 2013. Google ScholarDigital Library
- John Augustine, Gopal Pandurangan, and Peter Robinson. Fast Byzantine leader election in bdynamic networks. DISC, pages 276--291, 2015.Google Scholar
- John Augustine, Gopal Pandurangan, Peter Robinson, Scott Roche, and Eli Upfal. Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. IEEE Symposium on the Foundations of Computer Science (FOCS), pages 350--369, 2015. Google ScholarDigital Library
- John Augustine, Gopal Pandurangan, Peter Robinson, and Eli Upfal. Towards robust and efficient computation in dynamic peer-to-peer networks. SODA, pages 551--569, 2012. Google ScholarDigital Library
- Chen Avin, Michal Koucký, and Zvi Lotker. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). ICALP (1), pages 121--132, 2008. Google ScholarDigital Library
- B. Awerbuch and F. T. Leighton. Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks. ACM STOC, pages 487--496, May 1994. Google ScholarDigital Library
- Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, and Michael E. Saks. Adapting to asynchronous dynamic networks. STOC'92, pages 557--570, 1992. Google ScholarDigital Library
- Baruch Awerbuch and Christian Scheideler. Group Spreading: A Protocol for Provably Secure Distributed Name Service. ICALP, pages 183--195, 2004.Google Scholar
- Baruch Awerbuch and Christian Scheideler. The hyperring: a low-congestion deterministic data structure for distributed environments. SODA, pages 318--327, 2004. Google ScholarDigital Library
- Baruch Awerbuch and Christian Scheideler. Robust random number generation for peer-topeer systems. OPODIS, pages 275--289, 2006. Google ScholarDigital Library
- Baruch Awerbuch and Christian Scheideler. Towards a scalable and robust DHT. Theory of Computing Systems, 45:234--260, 2009. Google ScholarDigital Library
- Baruch Awerbuch and Michael Sipser. Dynamic networks are as fast as static networks (preliminary version). In 29th Annual Symposium on Foundations of Computer Science (FOCS), pages 206--220, 1988. Google ScholarDigital Library
- Ozalp Babaoglu, Moreno Merzolla, and Michele Tamburini. Design and implementation of a P2P cloud system. SAC, 412-417, 2012. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Ziv Bar-Joseph and Michael Ben-Or. A tight lower bound for randomized synchronous consensus. Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 193--199, 1998. Google ScholarDigital Library
- M. Ben-Or and N. Linial. Collective coin flipping. In Silvio Micali, editor, Advances in Computing Research 5: Randomness and Computation, volume 5, pages 91--115, JAI Press, 1989.Google Scholar
- Website of Bitcoin. http://www.bitcoin.org/.Google Scholar
- Marc Bui, Thibault Bernard, Devan Sohier, and Alain Bui. Random walks in distributed computing: A survey. In 4th International Workshop on Innovative Internet Community Systems (IICS), pages 1--14, 2004. Google ScholarDigital Library
- John F. Canny. Collaborative filtering with privacy. In IEEE Symposium on Security and Privacy, pages 45--57, 2002. Google ScholarDigital Library
- Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. CoRR, abs/1012.0009, 2010. Short version in ADHOC-NOW 2011. Google ScholarDigital Library
- M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Secure Routing for Structured Peer-to-Peer Overlay Networks. In OSDI, pages 299--314, 2002. Google ScholarDigital Library
- Yu-Wei Chan, Tsung-Hsuan Ho, Po-Chi Shih, and Yeh-Ching Chung. Malugo: A peer-to-peer storage system. Int. J. Ad Hoc and Ubiquitous Computing, 5(4), 209-218, 2010. Google ScholarDigital Library
- Nicolas Christin, Andreas S. Weigend, and John Chuang. Content availability, pollution and poisoning in file sharing peer-to-peer networks. In Proceedings 6th ACM Conference on Electronic Commerce (EC), pages 68--77, 2005. Google ScholarDigital Library
- Hyun Chul Chung, Peter Robinson, and Jennifer L. Welch. Regional consecutive leader election in mobile ad-hoc networks. In DIALM-PODC, pages 81--90, 2010. Google ScholarDigital Library
- Hyun Chul Chung, Peter Robinson, and Jennifer L. Welch. Optimal regional consecutive leader election in mobile ad-hoc networks. FOMC, pages 52--61, 2011. Google ScholarDigital Library
- Andrea Clementi, Riccardo Silvestri, and Luca Trevisan. Information spreading in dynamic graphs. PODC, 37-46, 2012. Google ScholarDigital Library
- Website of Cloudmark Inc. http://cloudmark.com/.Google Scholar
- Edith Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci., 55(3):441--453, 1997. Google ScholarDigital Library
- Alejandro Cornejo, Seth Gilbert, and Calvin C. Newport. Aggregation in dynamic networks. In PODC, pages 195--204, 2012. Google ScholarDigital Library
- Miguel Correia, Giuliana Santos Veronese, Nuno Ferreira Neves, and Paulo Verissimo. Byzantine consensus in asynchronous message passing systems: a survey. Int. J. Crit. Comput.- Based Syst., 2(2):141--161, July 2011. Google ScholarDigital Library
- Website of Crashplan Inc. http://www.crashplan.com/.Google Scholar
- A. Das Sarma, A. Molla, and G. Pandurangan. Fast distributed computation in dynamic networks via random walks. DISC, 136-150, 2012. Journal version: Theoretical Computer Science, 381, 45-66, 2015.Google Scholar
- 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. Google ScholarDigital Library
- Amir Dembo and Ofer Zeitouni. Large deviations techniques and applications. Springer, 2010.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Danny Dolev and H. Raymond Strong. Authenticated algorithms for Byzantine agreement. SIAM J. Comput., 12(4):656--666, 1983.Google ScholarDigital Library
- Shlomi Dolev. Self-stabilization. MIT Press, Cambridge, MA, USA, 2000. Google ScholarDigital Library
- P. Druschel and A. Rowstron. Past: A large-scale, persistent peer-to-peer storage utility. In HotOS VIII, pages 75--80, 2001. Google ScholarDigital Library
- P. Druschel and A. Rowstron. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proc. of ACM SOSP, 188-201, 2001. Google ScholarDigital Library
- Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, and Emanuele Viola. On the complexity of information spreading in dynamic networks. SODA, pages 717--736, 2013. Google ScholarDigital Library
- Cynthia Dwork, David Peleg, Nicholas Pippenger, and Eli Upfal. Fault tolerance in networks of bounded degree. SIAM J. Comput., 17(5):975--988, 1988. Google ScholarDigital Library
- Jarret Falkner, Michael Piatek, John P. John, Arvind Krishnamurthy, and Thomas E. Anderson. Profiling a million user DHT. In Internet Measurement Conference, pages 129--134, 2007. Google ScholarDigital Library
- Amos Fiat, Steve Gribble, Anna Karlin, Jared Saia, and Stefan Saroiu. Dynamically Fault- Tolerant Content Addressable Networks. Proceedings of the First International Workshop on Peer-to-Peer Systems, 270--279, 2002. Google ScholarDigital Library
- Amos Fiat and Jared Saia. Censorship resistant peer-to-peer content addressable networks. In SODA, pages 94--103, 2002. Google ScholarDigital Library
- Amos Fiat, Jared Saia, and Maxwell Young. Making Chord robust to Byzantine attacks. In ESA, pages 803--814, 2005. Google ScholarDigital Library
- Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Process. Lett., 14(4):183--186, 1982.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Sukumar Ghosh. Distributed Systems: An Algorithmic Approach. CRC Press, 2006.Google Scholar
- C.M. Grinstead and J.L. Snell. Introduction to Probability. American Mathematical Society, 1997.Google Scholar
- Rachid Guerraoui, Florian Huc, and Anne-Marie Kermarrec. Highly dynamic distributed computing with Byzantine failures. In PODC, pages 176--183, 2013. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Bernhard Haeupler and David Karger. Faster information dissemination in dynamic networks via network coding. In ACM PODC, pages 381--390, 2011. Google ScholarDigital Library
- Ragib Hasan, Zahid Anwar, William Yurcik, Larry Brumbaugh, and Roy Campbell. A survey of peer-to-peer storage techniques for distributed file systems. In Proc. of ITCC, pages 205--213, 2005. Google ScholarDigital Library
- Kirsten Hildrum and John Kubiatowicz. Asymptotically efficient approaches to faulttolerance in peer-to-peer networks. In DISC, pages 321--336, 2003.Google ScholarCross Ref
- Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. PODC, pages 131--140, 2009. Google ScholarDigital Library
- Tim Jacobs and Gopal Pandurangan. Stochastic analysis of a churn-tolerant structured peerto-peer scheme. Peer-to-Peer Networking and Applications, 6(1), 1-14, 2013.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- M. Kashoek and D. Karger. Koorde: A simple degree optimal distributed hash table. IPTPS, 98-107, 2003.Google Scholar
- Valerie King and Jared Saia. Breaking the O(n2) bit barrier: Scalable Byzantine agreement with an adaptive adversary. J. ACM, 58:18:1--18:24, July 2011. Google ScholarDigital Library
- Valerie King and Jared Saia. Faster agreement via a spectral method for detecting malicious behavior. In SODA, pages 785--800, 2014. Google ScholarDigital Library
- Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In SODA, pages 990--999, 2006. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- F. Kuhn and R. Oshman. Dynamic networks: Models and algorithms. SIGACT News, 42(1):82--96, 2011. Google ScholarDigital Library
- Fabian Kuhn, Nancy Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In ACM STOC, pages 513--522, 2010. Google ScholarDigital Library
- Fabian Kuhn, Rotem Oshman, and Yoram Moses. Coordinated consensus in dynamic networks. PODC, pages 1--10, 2011. Google ScholarDigital Library
- Fabian Kuhn, Stefan Schmid, and Roger Wattenhofer. Towards worst-case churn resistant peer-to-peer systems. Distributed Computing, 22(4):249--267, 2010.Google ScholarDigital Library
- Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. On the complexity of universal leader election. PODC, pages 100--109, 2013. Journal version: Journal of the ACM, 62(1), 7:1-7:27, 2015. Google ScholarDigital Library
- C. Law and K.-Y. Siu. Distributed construction of random expander networks. INFOCOM 2003, pages 2133--2143, 2003.Google ScholarCross Ref
- James Li. A survey of peer-to-peer network security issues. 2007. http://www.cse.wustl.edu/~jain/cse571-07/ftp/p2p/.Google Scholar
- Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma, and Steven Lim. A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials, 7(1-4), 72-93, 2005. Google ScholarDigital Library
- Nancy Lynch. Distributed Algorithms. Morgan Kaufman Publishers, San Francisco, USA, 1996. Google ScholarDigital Library
- Peter Mahlmann and Christian Schindelhauer. Peer-to-peer networks based on random transformations of connected regular undirected graphs. SPAA, pages 155--164, 2005. Google ScholarDigital Library
- David J. Malan and Michael D. Smith. Host-based detection of worms through peer-to-peer cooperation. WORM, pages 72--80, 2005. Google ScholarDigital Library
- Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005. Google ScholarDigital Library
- Damon Mosk-Aoyama and Devavrat Shah. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory, 54(7):2997--3007, 2008. Google ScholarDigital Library
- Moni Naor and Udi Wieder. Scalable and dynamic quorum systems. In PODC, 114--122, 2003. Google ScholarDigital Library
- Moni Naor and Uri Nadav. The dynamic and-or quorum system. In DISC, 472--486, 2005. Google ScholarDigital Library
- Moni Naor and Udi Wieder. A simple fault tolerant distributed hash table. In IPTPS, pages 88--97, 2003.Google ScholarCross Ref
- Regina O'Dell and Roger Wattenhofer. Information dissemination in highly dynamic graphs. In DIALM-POMC, pages 104--110, 2005. Google ScholarDigital Library
- Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal. Building low-diameter P2P networks. In FOCS, pages 492--499, 2001. Google ScholarDigital Library
- Gopal Pandurangan, Peter Robinson, and Amitabh Trehan. Dex: Self-healing expanders. IEEE IPDPS, 702--711, 2014. Google ScholarDigital Library
- Gopal Pandurangan and Amitabh Trehan. Xheal: localized self-healing using expanders. In Cyril Gavoille and Pierre Fraigniaud, editors, PODC, pages 301--310, 2011. Google ScholarDigital Library
- Marshall C. Pease, Robert E. Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228--234, 1980. Google ScholarDigital Library
- Arjan Peddemors. Cloud storage and peer-to-peer storage - end-user considerations and product overview. http://www.novay.nl/okb/publications/152, 2010.Google Scholar
- David Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, 2000. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. ACM SIGCOMM, 161--172, 2001. Google ScholarDigital Library
- A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proc. of the IFIP/ACM Intenrational Conference on Distributed Systems Platforms, 329--350, 2001. Google ScholarDigital Library
- J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu. Dynamically fault-tolerant content addressable networks. Proceedings of the 1st International Workshop on Peer-to-Peer Systems, 270--279, 2002. Google ScholarDigital Library
- Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, and Prasad Tetali. Distributed random walks. J. ACM, 60(1):2, 2013. Google ScholarDigital Library
- Christian Scheideler. How to spread adversarial nodes?: rotate! STOC, pages 704--713, 2005. Google ScholarDigital Library
- Christian Scheideler and Stefan Schmid. A distributed and oblivious heap. ICALP, pages 571--582. 2009. Google ScholarDigital Library
- Subhabrata Sen and Jia Wang. Analyzing peer-to-peer traffic across large networks, IMC, pages 137--150, 2002. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM, pages 149--160, 2001. Google ScholarDigital Library
- Daniel Stutzbach and Reza Rejaie. Understanding churn in peer-to-peer networks. IMC, 189--202, 2006. Google ScholarDigital Library
- Website of Symform:. http://www.symform.com/.Google Scholar
- Eli Upfal. Tolerating a linear number of faults in networks of bounded degree. Inf. Comput., 115(2):312--320, 1994. Google ScholarDigital Library
- Vasileios Vlachos, Stephanos Androutsellis-Theotokis, and Diomidis Spinellis. Security applications of peer-to-peer networks. Comput. Netw., 45:195--205, June 2004. Google ScholarDigital Library
- Maxwell Young, Aniket Kate, Ian Goldberg, and Martin Karsten. Practical Robust Communication in DHTs Tolerating a Byzantine Adversary. In ICDCS, pages 263--272, 2010. Google ScholarDigital Library
- B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant widearea location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April, 2001. Google ScholarDigital Library
- Ming Zhong and Kai Shen. Random walk based node sampling in self-organizing networks. Operating Systems Review, 40(3):49--55, 2006. Google ScholarDigital Library
Index Terms
- Distributed Algorithmic Foundations of Dynamic Networks
Index terms have been assigned to the content through auto-classification.
Recommendations
Algorithmic foundations of the internet
In this paper we survey the field of Algorithmic Foundations of the Internet, which is a new area within theoretical computer science. We consider six sample topics that illustrate the techniques and challenges in this field.
Comments