12:45 PM, Thursday, October 18th, 2001
Room 104, Gates Computer Science Building

Tapestry: Scalable and Fault-Tolerant Routing and Location

Ben Zhao
U.C. Berkeley

Slides: [PPT]

About the talk:

In today's chaotic network, data and services are mobile, and widely replicated for availability, durability, and locality. Components within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. We propose an alternative to traditional approaches, a network we call Tapestry. Tapestry is an overlay location and routing infrastructure that provides location-independent message routing, directly to the closest copy of an object or service, using only point-to-point links, and without centralized resources. The routing and directory information within this infrastructure are purely soft state, and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. In this talk, we will give an overview of the Tapestry infrastructure, compare it to related projects such as Chord and Content-Addressable Networks, and describe our current and future work.

About the speaker:

Ben Zhao is a 5th year Ph.D. candidate in computer science at University of California at Berkeley. He received his M.S. from Berkeley, and his B.S. from Yale University. His main research focuses on scalable and fault-tolerant overlay networks. Some of his previous work examined wide-area service discovery, lightweight XML databases, and modeling of wireless networks.