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
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
EBu: A Novel P2P Overlay Network
ICINIS '08 Proceedings of the 2008 First International Conference on Intelligent Networks and Intelligent Systems
CayleyChord: A Novel P2P Overlay Network
EUC '08 Proceedings of the 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing - Volume 02
Cayley graphs as models of deterministic small-world networks
Information Processing Letters
ComNET: a P2P community network
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
| Hi-index | 0.00 |
Many structured peer-to-peer (P2P) systems supported by distributed hash table (DHT) schemas have been proposed recently to improve the scalability of distributed virtual application systems. By organizing the peers based on interconnection topologies, existing proposed schemas are purely based on the logical relationship without knowledge of the physical networks. In this paper, we propose a new structured DHT schema, which receives routing information not just from virtual neighbors in P2P overlay network, but also from nearby physical neighbors. The average degree of our model is 5, the diameter is logarithmic. The simulation shows that our model achieves shorter query path length, higher clustering, and better robustness than other overlay networks which have the same level of degree and diameter.