5 search results - page 1 / 1 » Degree-Optimal Deterministic Routing for P2P Systems |
ISCC
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
STOC
2004
ACM
13 years 10 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
IPTPS
2004
Springer
13 years 10 months ago
2004
Springer
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...