BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Wired Geometric Routing - Peter Pietzuch\, Imperial College London
DTSTART:20070306T143000Z
DTEND:20070306T153000Z
UID:TALK5942@talks.cam.ac.uk
CONTACT:Minor Gordon
DESCRIPTION:Routing substrates for overlay networks are an important build
 ing\nblock for large distributed applications. Many existing\nsubstrates a
 re based on a random identifier space and therefore do not respect node lo
 cality when routing data. This can lead to lower performance for locality-
 sensitive applications\, such as web caching\, distributed gaming\, and re
 source discovery.\n\nThis talk examines the problem of building a locality
 -aware routing overlay on top of a network in which nodes know their locat
 ion. As a starting point we look at the scaled Theta-routing proposal for 
 geometric routing in a Euclidean space. We address the practical problems 
 of forming routing tables with imperfect node knowledge and churn and exam
 ine query performance on non-Euclidean data sets. 
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR