Tapestry: A resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 1, 2004, Pages 41-53

  Zhao, Ben Y ^a   Huang, Ling ^a   Stribling, Jeremy ^b   Rhea, Sean C ^a   Joseph, Anthony D ^a   Kubiatowicz, John D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Overlay networks; Peer to peer (P2P); Service deployment; Tapestry

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; INTERFACES (COMPUTER); TELECOMMUNICATION SERVICES;

APPLICATIONS PROGRAMMING INTERFACE; OVERLAY NETWORKS; PEER-TO-PEER NETWORKS; SERVICE DEPLOYMENT; TAPESTRY ARCHITECTURE;

TELECOMMUNICATION NETWORKS;

EID: 0742267177     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.818784     Document Type: Article

References (36)

1. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Univ. California, Berkeley, CA, Tech. Rep. CSD-01-1141, Apr. 2001.
2. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, "Distributed object location in a dynamic network," in Proc. SPAA, Winnipeg, Canada, Aug. 2002, pp. 41-52.
3. F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, "Toward a common API for structured P2P overlays," in IPTPS, Berkeley, CA, Feb. 2003, pp. 33-44.
4. S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz, "Pond: The OceanStore prototype," in Proc. FAST, San Francisco, CA, Apr. 2003, pp. 1-14.
5. S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz, "Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination," in Proc. NOSSDAV, Port Jefferson, NY, June 2001, pp. 11-20.
6. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A scalable content-addressable network," in Proc. SIGCOMM, San Diego, CA, Aug. 2001, pp. 161-172.
7. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. Middleware, Heidelberg, Germany, Nov. 2001, pp. 329-350.
8. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. SIGCOMM, San Diego, CA, Aug. 2001, pp. 149-160.
9. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer information system based on the XOR metric," in Proc. IPTPS, Cambridge, MA, Mar. 2002, pp. 53-65.
10. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. PODC, Monterey, CA, 2002, pp. 183-192.
11. 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. USITS, Seattle, WA, Mar. 2003, pp. 113-126.
12. B. Wilcox-O'Hearn, "Experiences deploying a large-scale emergent network," in Proc. IPTPS, Cambridge, MA, Mar. 2002, pp. 104-110.
13. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, "Freenet: A distributed anonymous information storage and retrieval system," in Proc. Int. Workshop Design Issues in Anonymity and Unobservability, Berkeley, CA, 2001, pp. 46-66.
14. B. Y. Zhao, A. D. Joseph, and J. Kubiatowicz, "Locality-aware mechanisms for large-scale networks," presented at the Int. Workshop on Future Directions in Distributed Computing, Bertinoro, Italy, June 2002.
15. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in Proc. SPAA, Newport, RI, June 1997, pp. 311-320.
16. B. Awerbuch and D. Peleg, "Concurrent online tracking of mobile users," in Proc. SIGCOMM, Zurich, Switzerland, Sept. 1991, pp. 221-233.
17. R. Rajaraman, A. W. Richa, B. Vöcking, and G. Vuppuluri, "A data tracking scheme for general networks," in Proc. SPAA, Crete Island, Greece, July 2001, pp. 247-254.
18. F. Kaashoek and D. R. Karger, "Koorde: A simple degree-optimal hash table," in Proc. IPTPS, Berkeley, CA, Feb. 2003, pp. 98-107.
19. U. Wieder and M. Naor, "A simple fault tolerant distributed hash table," in Proc. IPTPS, Berkeley, CA, Feb. 2003, pp. 88-97.
20. B. Y. Zhao, Y. Duan, L. Huang, A. Joseph, and J. Kubiatowicz, "Brocade: Landmark routing on overlay networks," in Proc. IPTPS, Cambridge, MA, Mar. 2002, pp. 34-44.
21. S. Ratnasamy, M. Handley, R. Karp, and S. Schenker, "Application-level multicast using content-addressable networks," in Proc. NGC, London, U.K., Nov. 2001, pp. 14-29.
22. A. Rowstron, A.-M. Kermarrec, P. Druschel, and M. Castro, "SCRIBE: The design of a large-scale event notification infrastructure," in Proc. NGC, London, U.K., Nov. 2001, pp. 30-43.
23. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with CFS," in Proc. SOSP, Banff, Canada, Oct. 2001, pp. 202-215.
24. S. Hand and T. Roscoe, "Mnemosyne: Peer-to-peer steganographic storage," in Proc. IPTPS, Cambridge, CA, Mar. 2002, pp. 130-140.
25. A. Rowstron and P. Druschel, "Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility," in Proc. SOSP, Banff, Canada, Oct. 2001, pp. 188-201.
26. A. Keromytis, V. Misra, and D. Rubestein, "SOS: Secure overlay services," in Proc. SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 61-72.
27. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, "Internet indirection infrastructure," in Proc. SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 73-86.
28. F. Zhou, L. Zhuang, B. Y. Zhao, L. Huang, A. D. Joseph, and J. D. Kubiatowicz, "Approximate object location and spam filtering on peer-to-peer systems," in Proc. Middleware, Rio de Janeiro, Brazil, June 2003, pp. 1-20.
29. M. J. B. Robshaw, "MD2, MD4, MD5, SHA and other hash functions," RSA Labs., vol. 4.0, Tech. Rep. TR-101, 1995.
30. Y. Rekhter and T. Li. (1993) An architecture for IP address allocation with CIDR. [Online]. Available: http://www.isi.edu/in-notes/rfc1518.txt
31. M. Welsh, D. Culler, and E. Brewer, "SEDA: An architecture for well-conditioned, scalable internet services," in Proc. SOSP, Banff, Canada, Oct. 2001, pp. 230-243.
32. B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
33. S. C. Rhea and J. Kubiatowicz, "Probabilistic location and routing," in Proc. INFOCOM, vol. 3, New York, NY, June 2002, pp. 1248-1257.
34. J. R. Douceur, "The Sybil attack," in Proc. IPTPS, Cambridge, MA, Mar. 2002, pp. 251-260.
35. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach, "Security for structured peer-to-peer overlay networks," in Proc. OSDI, Boston, MA, Dec. 2002, pp. 299-314.
36. B. Y. Zhao, L. Huang, J. Stribling, A. Joseph, and J. Kubiatowicz, "Exploiting routing redundancy via structured peer-to-peer overlays," in Proc. IEEE ICNP, Atlanta, GA, Nov. 2003, pp. 246-257.