A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 131-140

  Jacob, Riko ^a   Richa, Andrea ^b   Scheideler, Christian ^c   Schmid, Stefan ^a   Täubig, Hanjo ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b Arizona State University   (United States)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Algorithms; C.2.4 computer communication networks : distributed systems; F.2.2 analysis of algorithms and problem complexity : nonnumerical algorithms and problems; Theory

Indexed keywords

C.2.4 [COMPUTER-COMMUNICATION NETWORKS]: DISTRIBUTED SYSTEMS; COMMUNICATION NETWORKS; EFFICIENT ROUTING; F.2.2 [ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY]: NONNUMERICAL ALGORITHMS AND PROBLEMS; INITIAL STATE; PEER-TO-PEER NETWORKS; PEER-TO-PEER SYSTEM; POLYLOGARITHMIC TIME; SELF-STABILIZING ALGORITHM; SKIP-GRAPHS; THEORY;

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SCIENCE; OVERLAY NETWORKS;

ALGORITHMS;

EID: 70350627243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582741     Document Type: Conference Paper

References (36)

1. Y. Afek and S. Dolev. Local stabilizer. Journal of Parallel and Distributed Computing, 62(5):745-765, 2002.
2. D. Angluin, J. Aspnes, J. Chen, Y. Wu, and Y. Yin. Fast construction of overlay networks. In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 145-154, 2005.
3. J. Aspnes and G. Shah. Skip graphs. ACM Transactions on Algorithms, 3(4):37, Nov. 2007.
4. J. Aspnes and U. Wieder. The expansion and mixing time of skip graphs with applications. In Proc. 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 126-134, 2005.
5. J. Aspnes and Y. Wu. O(log n)-time overlay network construction from graphs with out-degree 1. In Proc. International Conference on Principles of Distributed Systems (OPODIS), volume 4878 of LNCS, pages 286-300, 2007.
6. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self stabilization by local checking and correction. In Proc. of the 32nd IEEE Symp. on Foundations of Computer Science (FOCS), 1991.
7. B. Awerbuch and C. Scheideler. Peer-to-peer systems for prefix search. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003.
8. B. Awerbuch and C. Scheideler. The hyperring: A low-congestion deterministic data structure for distributed environments. In Proc. 15th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 318-327, 2004.
9. B. Awerbuch and G. Varghese. Distributed program checking: A paradigm for building self-stabilizing distributed protocols. In Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 258-267, 1991.
10. A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober. Pagoda: A dynamic overlay network for routing, data management, and multicasting. In Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 170-179, 2004.
11. J. Brzezinski and M. Szychowiak. Self-stabilization in distributed systems - a short survey. Foundations of Computing and Decision Sciences, 25(1), 2000.
12. T. Clouser, M. Nesterenko, and C. Scheideler. Tiara: A self-stabilizing deterministic skip list. In Proc. 10th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), 2008.
13. A. Costello and G. Varghese. Self-stabilization by window washing. In Proc. of the 15th ACM Symposium on Principles of Distributed Computing (PODC), pages 35-44, 1996.
14. C. Cramer and T. Fuhrmann. Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe, 2005.
15. E. Dijkstra. Self-stabilization in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
16. S. Dolev. Self-Stabilization. MIT Press, 2000.
17. S. Dolev and T. Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 4:1-40, 1997.
18. P. Druschel and A. Rowstron. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
19. D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, and H. Täubig. Modeling scalability in distributed self-stabilization: The case of graph linearization. Technical Report TUM-I0835, Technische Universität München, Computer Science Dept., Nov. 2008.
20. M. T. Goodrich, M. J. Nelson, and J. Z. Sun. The rainbow skip graph: A fault-tolerant constant-degree distributed data structure. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), pages 384-393, 2006.
21. N. Harvey and J. Munro. Deterministic SkipNet. Inf. Process. Lett., 90(4):205-208, 2004.
22. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS), pages 113-126, 2003.
23. T. Herman. Observations on time adaptive self-stabilization. Technical Report TR 97-07, University of Iowa, 1997.
24. T. Herman. Self-stabilization bibliography: Access guide. University of Iowa, December 2002. See ftp://ftp.cs.uiowa.edu/pub/selfstab/bibliography/.
25. S. Katz and K. Perry. Self-stabilizing extensions for message-passing systems. Distributed Computing, 7(1):17-26, 1993.
26. S. Kutten and B. Patt-Shamir. Time-adaptive self stabilization. In Proc. of the 16th ACM Symposium on Principles of Distributed Computing (PODC), pages 149-158, 1997.
27. S. Kutten and D. Peleg. Fault-local distributed mending. In Proc. of the 14th ACM Symposium on Principles of Distributed Computing (PODC), pages 20-27, 1995.
28. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc. 21st PODC, pages 183-192, 2002.
29. P. Maymounkov and D. Mazières. Kademlia: A peer-to-peer information system based on the xor metric. In Proc. 1st International Workshop on Peer-to-Peer Systems (IPTPS), pages 53-65, 2002.
30. M. Naor and U. Wieder. Novel architectures for P2P applications: the continuous-discrete approach. ACM Transactions on Algorithms (TALG), 3, 2007.
31. M. Onus, A. Richa, and C. Scheideler. Linearization: Locally self-stabilizing sorting in graphs. In Proc. 9th ALENEX, 2007.
32. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proc. ACM SIGCOMM, pages 161-172, 2001.
33. A. Shaker and D. S. Reeves. Self-stabilizing structured ring topology P2P systems. In Proc. 5th IEEE International Conference on Peer-to-Peer Computing, pages 39-46, 2005.
34. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. Technical Report MIT-LCS-TR-819, MIT, 2001.
35. G. Varghese. Self-Stabilization by local checking and correction. PhD thesis, MIT, 1992.
36. G. Varghese. Self stabilization by counter flushing. In Proc. of the 13th ACM Symposium on Principles of Distributed Computing (PODC), 1994.