Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
425370 | Future Generation Computer Systems | 2007 | 11 Pages |
Abstract
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 structure.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
James Salter, Nick Antonopoulos,