A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Brocade: Landmark Routing on Overlay Networks
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
A super-peer model for resource discovery services in large-scale grids
Future Generation Computer Systems
A structured hierarchical P2P model based on a rigorous binary tree code algorithm
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Fault-tolerant peer-to-peer search on small-world networks
Future Generation Computer Systems
Evolution of social models in peer-to-peer networking: towards self-organising networks
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
A scalable multi-attribute range query approach on cluster-based hybrid overlays
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
On the design of semi-structured multi-star hybrid-overlays for multi-attribute range queries
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
We describe a two-tiered P2P network for efficient lookup of contextualized data, utilizing an alternative strategy for building the network overlay designed to reduce the hops required to route lookups and improve fault tolerance by allowing the selection of nodes to build subrings. We show how the method is used to support context-keyword queries. Our calculations indicate that the technique yields improvements in the average query hop count while reducing the amount of state stored on each node. The use of Preference Lists can further reduce the average hop count through bypassing previously traversed segments of the structures