Sciweavers

81 search results - page 6 / 17
» Sybil-Resistant DHT Routing
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Improving Lookup Performance Over a Widely-Deployed DHT
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
Daniel Stutzbach, Reza Rejaie
SAINT
2008
IEEE
14 years 1 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...
IPTPS
2004
Springer
14 years 25 days ago
Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol
—This paper describes a new peer-to-peer protocol that integrates DHT routing, aggregation, allto-all multicast, as well as both topic- and content-based publish/subscribe. In sp...
Robbert van Renesse, Adrian Bozdog
IPPS
2007
IEEE
14 years 1 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 7 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen