STOC '97 Proceedings of the twenty-ninth 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
IEEE Internet Computing
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Can Heterogeneity Make Gnutella Scalable?
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
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Review: From P2P to Web Services and Grids: Peers in a Client-Server World
The Computer Journal
An optimized two-tier P2P architecture for contextualized keyword searches
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
Fault-tolerant peer-to-peer search on small-world networks
Future Generation Computer Systems
Structuring connections between content delivery servers groups
Future Generation Computer Systems
A group-based content delivery network
UPGRADE '08 Proceedings of the third international workshop on Use of P2P, grid and agents for the development of content networks
A scalable authentication model based on public keys
Journal of Network and Computer Applications
A distributed expansible authentication model based on Kerberos
Journal of Network and Computer Applications
Improving networks using group-based topologies
Computer Communications
Study and performance of a group-based Content Delivery Network
Journal of Network and Computer Applications
Group-based self-organization grid architecture
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
FRDT: Footprint Resource Discovery Tree for grids
Future Generation Computer Systems
An adaptive sector-based routing model over structured peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive resource management for P2P live streaming systems
Future Generation Computer Systems
| Hi-index | 0.00 |
One of the main problems in peer-to-peer systems is how to balance the lookup latency, the number of transmitted messages and the network expansibility. In this paper, we present a P2P model based on a rigorous binary tree code algorithm. Our model is robust and efficient with constant lookup latency and constant message transmission. More importantly, the model has good expansibility and is suitable for super-scale networks.