Sciweavers

3 search results - page 1 / 1
» One Hop Lookups for Peer-to-Peer Overlays
Sort
View
CCGRID
2003
IEEE
13 years 10 months ago
DKS (N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications
In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...
Luc Onana Alima, Sameh El-Ansary, Per Brand, Seif ...
HOTOS
2003
IEEE
13 years 10 months ago
One Hop Lookups for Peer-to-Peer Overlays
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
ACSAC
2004
IEEE
13 years 8 months ago
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
1 A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement...
Mudhakar Srivatsa, Ling Liu