Sciweavers

81 search results - page 11 / 17
» Sybil-Resistant DHT Routing
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast
Abstract— This paper investigates the reliability of applicationlevel multicast based on a distributed hash table (DHT) in a highly dynamic network. Using a node residual lifetim...
Guang Tan, Stephen A. Jarvis
IPPS
2006
IEEE
14 years 1 months ago
D1HT: a distributed one hop hash table
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
Luiz Rodolpho Monnerat, Cláudio L. Amorim
AAAIDEA
2005
IEEE
14 years 1 months ago
SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System
Voice over IP (VoIP) and Instant Messaging (IM) systems to date have either followed a client-server model or have required the use of clients that do not follow any VoIP or IM st...
David A. Bryan, Bruce Lowekamp, Cullen Jennings
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 2 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
IEEEARES
2006
IEEE
14 years 1 months ago
Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Matthew Leslie, Jim Davies, Todd Huffman