Sciweavers

323 search results - page 60 / 65
» Range-capable Distributed Hash Tables
Sort
View
SPAA
2003
ACM
14 years 1 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ICDCS
2010
IEEE
14 years 10 days ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
SIGCOMM
2010
ACM
13 years 8 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
INFOCOM
2008
IEEE
14 years 2 months ago
Link Lifetimes and Randomized Neighbor Selection in DHTs
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...
Zhongmei Yao, Dmitri Loguinov
NOSSDAV
2005
Springer
14 years 1 months ago
MOPAR: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games
In this paper we propose a fully distributed peer-to-peer (P2P) infrastructure supporting Networked Virtual Environment (NVE) applications, such as massively multiplayer online ga...
Anthony (Peiqun) Yu, Son T. Vuong