Tapestry project == munchnets? @Stanford: Thu 10/18

Rohit Khare Rohit@KnowNow.com
Sun, 14 Oct 2001 23:20:40 -0700

Note: I haven't done the least bit of due diligence on Tapestry. But 
it sounds like a very intriguing problem abstract, quite a bit closer 
to munchnets than any of the ad-hoc IP stuff so far...


PS. I won't be able to attend.

--- begin forwarded text
To: <colloq@CS.Stanford.EDU>; <netseminar@lists.Stanford.EDU>
Subject: Stanford Networking Seminar, Thu 10/18: Ben Zhao

>                    Stanford Networking Seminar
>  When:      12:45PM, Thursday, October 18, 2001
>  Where:     Room 104, Gates Computer Science Building
>  URL:       http://netseminar.stanford.edu/sessions/2001-10-18.html
>  --------------------------------------------------------------------
>  Title:     Tapestry: Scalable and Fault-Tolerant Routing and Location
>  Speaker:   Ben Zhao
>             U.C. Berkeley
>  Abstract:
>  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.
>  Bio:
>  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.
>  Notes:
>  Lunch will be available at 12:15. A vegetarian selection will be
>  available.  No drinks will be provided.  The talk itself will begin at
>  12:45