Friday, June 3, 2005 - Note special day
In VRR the nodes have fixed location independent identifiers and are organized into a virtual ring. VRR requires each node to maintain only a small number of paths to its immediate neighbors in the virtual ring and it does not require flooding to setup or maintain these paths. VRR uses these paths to route messages between any pair of nodes in the network without any route discovery overhead or delay but with a small delay stretch. VRR also provides a distributed hash table interface that can be used to implement services. The design of VRR is heavily influenced by lessons learnt designing, implementing and using structured overlays (DHTs).
The talk will describe the design and implementation of VRR, and include initial results showing the performance of VRR using both simulations and measurements on two sensor network testbeds.
This is joint work with Miguel Castro and Matt Caesar (UCB).
His current research interests are firmly centered in distributed systems and networking. Most recently he has been working on self-organizing structured overlays (DHTs) (co-designing Pastry). Prior to this work he spent several years working on coordination languages and he lead the Cambridge University 1998 RoboCup autonomous robot football team.
Host: M. Satyanarayanan
Visitor Coordinator: Contact Tracy Farbacher for appointments.
Seminar Info Contact: