Skip graphs

ACM Transactions on Algorithms

Volumn 3, Issue 4, 2007, Pages

  Aspnes, James ^a,c   Shah, Gauri ^b  

^a Google ^*

^b GOOGLE INC   (United States)

^c Yale University   (United States)

Author keywords

Overlay networks; Peer to peer; Skip lists

Indexed keywords

OVERLAY NETWORKS; PEER-TO-PEER; SKIP LISTS;

ALGORITHMS; DATA STRUCTURES; DISTRIBUTED DATABASE SYSTEMS; ERROR ANALYSIS;

GRAPH THEORY;

EID: 36448982165     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1290672.1290674     Document Type: Conference Paper

References (43)

1. ABRAHAM, I., ASPNES, J., AND YUAN, J. 2005. Skip B-trees. In Proceedings of the 9th International Conference on Principles of Distributed Systems, 284-295.
2. ANGLUIN, D., ASPNES, J., CHEN, J., WU, Y., AND YIN, Y. 2005. Fast construction of overlay networks. In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 145-154.
3. ASPNES, J., DIAMADI, Z., AND SHAH, G. 2002. Fault-Tolerant routing in peer-to-peer systems. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA, 223-232. http://arXiv.org/abs/cs/0302022.
4. ASPNES, J., AND SHAH, G. 2003. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 384-393.
5. ASPNES, J., AND WIEDER, U. 2005. The expansion and mixing time of skip graphs with applications. In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 126-134.
6. AUMANN, Y., AND BENDER, M. A. 1996. Fault tolerant data structures. In Proceedings of the 37th Annual Symposium on Foundatiotis of Computer Science (FOCS), Burlington, VT, 580-589.
7. AWERBUCH, B., AND SCHEIDELER, C. 2003. Peer-to-Peer systems for prefix search. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), Boston. to appear.
8. CASTRO, M., DRUSCHEL, P., HU, Y. C., AND ROWSTRON, A. 2002. Topology-Aware routing in structured peer-to-peer overlay networks. In Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy, A. Schiper, et al., eds. Lecture Notes in Computer Science, vol. 2584. Springer, 103-107.
9. CLARKE, I., SANDBERG, O., WILEY, B., AND HONG, T. W. 2000. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, H. Federrath, ed. Lecture Notes in Computer Science, vol. 2009. Springer, 46-66. http://www.freenet. sourceforge.net.
10. DATAR, M. 2002. Butterflies and peer-to-peer networks. In Proceedings of the 10th European Symposium on Algorithms (ESA), Rome, R. Möhring and R. Raman, eds. Lecture Notes in Computer Science, vol. 2461. Springer, 310-322.
11. DE LA BRIANDAIS, R. 1959. File searching using variable length keys. In Proceedings of the Western Joint Computer Conference, vol. 15, Montvale, NJ, 295-298.
12. DEVROYE, L. 1992. A limit theory for random skip lists. Ann. Appl. Probab. 2, 3, 597-609.
13. FIAT, A., AND SAIA, J. 2002. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 94-103. Submitted to a special issue of J. Alg. dedicated to select papers of SODA 2002.
14. FREDKIN, E. 1960. Trie memory. Commun. ACM 3, 9 (Sept.), 490-499.
15. GABARRÓ, J., MARTÍNEZ, C., AND MESSEGUER, X. 1996. A top-down design of a parallel dictionary using skip lists. Theor. Comput. Sci. 158, 1-2 (May), 1-33.
16. GABARRO, J., AND MESSEGUER, X. 1997. A unified approach to concurrent and parallel algorithms on balanced data structures. In Proceedings of the 17th International Conference of the Chilean Computer Society (SCCC), Valparáiso, Chile, 78-92.
17. GNUTELLA. 2007. Gnutella website. http://gnutella.wego.com.
18. HARREN, M., HELLERSTEIN, J. M., HUEBSCH, R., LOO, B. T., SHENKER, S., AND STOICA, I. 2002. Complex queries in DHT-based peer-to-peer networks. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, P. Druschel, et al., eds. Lecture Notes in Computer Science, vol. 2429, Springer, 242-250.
19. HARVEY, N. J. A., JONES, M. B., SAROIU, S., THEIMER, M., AND WOLMAN, A. 2003. SkipNet: A scalable overlay network with practical locality properties. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS), Seattle, WA, 113-126.
20. HARVEY, N. J. A., AND ZATLOUKAL, K. C. 2004. Family trees. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, 308-317.
21. HILDRUM., K., KUBIATOWICZ, J. D., RAO, S., AND ZHAO, B. Y. 2002. Distributed object location in a dynamic network. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, Manitoba, Canada, 41-52.
22. JOHNSON, T., AND COLBROOK, A. 1994. A distributed, replicated, data-balanced search structure. Int. J. High Speed Comput. 6, 4 (Dec.), 475-500.
23. KARGER, D., AND RUHL, M. 2002. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montreal, Canada, 741-750.
24. KIRSCHENHOFER, P., MARTÍNEZ, C., AND PRODINGER, H. 1995. Analysis of an optimized search algorithm for skip lists. Theor. Comput. Sci. 144, 1-2 (Jun.), 199-220.
25. KIRSCHENHOFER, P., AND PRODINGER, H. 1994. The path length of random skip lists. Acta Informatica 31, 8, 775-792.
26. KNUTH, D. E. 1973. The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading, MA.
27. LI, X., MISRA, J., AND PLAXTON, C. G. 2004. Active and concurrent topology maintenance. In Proceedings of the 18th International Conference on Distributed Computing (DISC), Amsterdam, The Netherlands, R. Guerraoui, ed. Lecture Notes in Computer Science, vol. 3274. Springer, 320-334.
28. MALKHI, D., NAOR, M., AND RATAJCZAK, D. 2002. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA, 183-192.
29. MUNRO, J. I., AND POBLETE, P. V. 1984. Fault tolerance and storage reduction in binary search trees. Inf. Control 62, 2/3 (Aug.), 210-218.
30. NAPSTER. 2003. Napster website. http://www.napster.com.
31. PAPADAKIS, T., MUNRO, J. I., AND POBLETE, P. V. 1990. Analysis of the expected search cost in skip lists. In Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory (SWAT), Bergen, Norway, J. R. Gilbert and R. G. Karlsson, eds. Lecture Notes in Computer Science, vol. 447, Springer, 160-172.
32. PLAXTON, C. G., RAJARAMAN, R., AND RICHA., A. W. 1999. Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst. 32, 3, 241-280.
33. PUGH, W. 1990. Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33, 6 (Jun.), 668-676.
34. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. 2001. A scalable content-addressable network. In Proceedings of the ACM Symposium on Communications Architectures and Protocols (SIGCOMM), San Diego, CA, 161-172.
35. ROWSTRON, A., AND DRUSCHEL, P. 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, 329-350.
36. SAIA, J., FIAT, A., GRIBBLE, S., KARLIN, A., AND SAROIU, S. 2002. Dynamically fault-tolerant content addressable networks. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA. P. Druschel, et al., eds. Lecture Notes in Computer Science, vol. 2429, Springer, 270-279.
37. SEDGEWICK, R., AND FLAJOLET, P. 1996. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, MA.
38. SHAKER, A., AND REEVES, D. S. 2005. Self-Stabilizing structured ring topology P2P systems. In Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing (P2P), Konstanz, Germany. IEEE Computer Society, 39-46.
39. SILAGHI, B., BHATTACHARJEE, B., AND KELEHER, P. 2002. Query Routing in the TerraDir distributed directory. In Proceedings of the SPIE ITCOM, vol. 4868, V. Firoiu and Z.-L. Zhang, eds. SPIE, Boston, 299-309.
40. STOICA, I., MORRIS, R., LIBEN-NOWELL, D., KARGER, D. R., KAASHOEK, M. F., DABEK, F., AND BALAKR-ISHNAN, H. 2003. Chord: A scalable peer-to-peer lookup service for internet applications. IEEE/ACM Trans. Netw. 11, 17-32.
41. ZHANG, Z., SHI, S., AND ZHU, J, 2003, SOMO: Self-Organized metadata overlay for resource management in P2P DHT. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA.
42. ZHAO, B. Y., JOSEPH, A. D., AND KUBIATOWICZ, J. D. 2002. Locality-Aware mechanisms for large-scale networks. In Proceedings of the Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy, 80-83.
43. ZHAO, B. Y., KUBIATOWICZ, J., AND JOSEPH, A. D. 2001. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California, Berkeley, Berkeley, CA.