Sciweavers

33 search results - page 5 / 7
» Estimating Churn in Structured P2P Networks
Sort
View
CCS
2009
ACM
14 years 2 months ago
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
Prateek Mittal, Nikita Borisov
ICPP
2005
IEEE
14 years 1 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
PPNA
2011
12 years 10 months ago
Ad-hoc limited scale-free models for unstructured peer-to-peer networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Durgesh Rani Kumari, Hasan Guclu, Murat Yuksel
P2P
2007
IEEE
113views Communications» more  P2P 2007»
14 years 1 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
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...