Sciweavers

98 search results - page 13 / 20
» Limiting Sybil Attacks in Structured P2P Networks
Sort
View
P2P
2006
IEEE
101views Communications» more  P2P 2006»
14 years 1 months ago
Towards Scalable Mobility in Distributed Hash Tables
For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, ...
Olaf Landsiedel, Stefan Götz, Klaus Wehrle
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...
SSS
2007
Springer
14 years 1 months ago
Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance
In this paper we present a rigorous treatment to structured overlay maintenance in decentralized peerto-peer (P2P) systems subject to various system and network failures. we prese...
Yu Chen, Wei Chen
TC
2008
13 years 7 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
PODC
2011
ACM
12 years 10 months ago
Sustaining collaboration in multicast despite rational collusion
This paper focuses on designing incentive mechanisms for overlay multicast systems. Existing proposals on the problem are no longer able to provide proper incentives when rational...
Haifeng Yu, Phillip B. Gibbons, Chenwei Shi