We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...
Abstract— We consider the problem of supporting bandwidth heterogeneity and congestion control in the context of P2P multicast streaming. We identify several challenges peculiar ...
Venkata N. Padmanabhan, Helen J. Wang, Philip A. C...
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distr...
In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge how suitable a P2P solution might be for a particular problem. It is bas...
Mema Roussopoulos, Mary Baker, David S. H. Rosenth...