University of Cambridge > Talks.cam > Computer Laboratory Opera Group Seminars > Wired Geometric Routing

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Wired Geometric Routing

Download to your calendar using vCal

If you have a question about this talk, please contact Minor Gordon .

Routing substrates for overlay networks are an important building block for large distributed applications. Many existing substrates are based on a random identifier space and therefore do not respect node locality when routing data. This can lead to lower performance for locality-sensitive applications, such as web caching, distributed gaming, and resource discovery.

This talk examines the problem of building a locality-aware routing overlay on top of a network in which nodes know their location. 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 examine query performance on non-Euclidean data sets.

This talk is part of the Computer Laboratory Opera Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Thomas and Dorothy Seminar Room, PHPC, Worts Causeway, Strangeways Research Laboratory Large Seminar Room, Cambridge Institute of Public Health Forvie Site, Robinson Way, Cambridge Seminar Room 2, Isaac Newton Institute

Other talks

Morning Break Coming soon LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Title to be confirmed Cooperation as a Laboratory of Being Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity