The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
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
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
A P2P Approach for Global Computing
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
P2P Networking and Applications
P2P Networking and Applications
The efficient and low load range queries in p2p
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
| Hi-index | 0.00 |
A fundament tradeoff issue observed by Ratnasamy is a hotspot in designing distribute hash table(DHT) in P2P network. Three constant-degree systems had proposed recently, but the common weakness of them is handle node leaving without inform its neighbors in advance, and optimize the degree and load balance is another question. In this paper, a constant-degree system has proposed named Cactus which based on the 2-tree and CCC hypercube. Its number of neighbor is 6, and the time complexity of key lookup is O(d) when number of nodes is no more than d*2d, d is the degree of CCC. In this paper, we will introduce the topology, routing algorithm, node join and leave for Cactus. The experimentations show that Cactus is better in optimizing the degree and load balance, faults tolerate and no worse in other performance compare to other constant-degree system.