Communications of the ACM - Special section on computer architecture
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
De bruijn communications networks.
De bruijn communications networks.
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Hi-index | 0.00 |
Autonomy, efficiency, robustness and load balancing are four desirable features for Peer-to-Peer (P2P) systems. These four features however, are often in conflict with each other. We present a novel P2P architecture, called FISH, based on the Hyper-deBruijn topology. FISH provides flexibility in terms of connections per node and the level of fault-tolerance, and possesses a low diameter. We further address the challenge of dynamic operations of peers by introducing a novel set of algorithms. We also design two variants of Hyper-deBruijn topology for achieving an asymptotical optimal diameter. Comprehensive experiments show that FISH has a good trade-off among the four expected features.