Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
— As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torr...
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, ...
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P...
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its comm...
Brent N. Chun, Joseph M. Hellerstein, Ryan Huebsch...