Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Essence of P2P: A Reference Architecture for Overlay Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Cayley graphs as models of deterministic small-world networks
Information Processing Letters
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Echo: A peer-to-peer clustering framework for improving communication in DHTs
Journal of Parallel and Distributed Computing
Psu: a novel low-latency constant-degree overlay network
Frontiers of Computer Science in China
| Hi-index | 0.00 |
In addition to searching, browsing is yet another requirement of P2P file sharing systems. Nevertheless, none of the recent P2P DHTs can closely connect peers with the same interests together so that it is not practical to provide browsing service in such systems. In this paper, we define a new cayley graph to support logical grouping, and based on this cayley graph, a set of P2P DHT protocols which is suitable for providing file browsing service is also designed. Performance evaluation indicates that the new protocols can reach the theoretical lower bound of routing table size and query path length. Furthermore, the robustness of ComNET is also better than most of the P2P DHTs recently proposed.