A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Content-based retrieval in hybrid peer-to-peer networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
An architecture for information retrieval over semi-collaborating Peer-to-Peer networks
Proceedings of the 2004 ACM symposium on Applied computing
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds
Computer Networks: The International Journal of Computer and Telecommunications Networking
p2pDating: Real life inspired semantic overlay networks for Web search
Information Processing and Management: an International Journal
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Information Retrieval and Filtering over Self-organising Digital Libraries
ECDL '08 Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries
A measure for cluster cohesion in semantic overlay networks
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Rewiring strategies for semantic overlay networks
Distributed and Parallel Databases
Anonymity and Censorship Resistance in Unstructured Overlay Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Affinity P2P: A self-organizing content-based locality-aware collaborative peer-to-peer network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Peer rewiring in semantic overlay networks under churn
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
JTangCSPS: A composite and semantic publish/subscribe system over structured P2P networks
Engineering Applications of Artificial Intelligence
On investigating scalability and robustness in a self-organizing retrieval system
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Semi-structured semantic overlay for information retrieval in self-organizing networks
Proceedings of the 21st international conference companion on World Wide Web
DS4: a distributed social and semantic search system
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Hi-index | 0.00 |
We present iCluster, a self-organizing peer-to-peer overlay network for supporting full-fledged information retrieval in a dynamic environment. iCluster works by organizing peers sharing common interests into clusters and by exploiting clustering information at query time for achieving low network traffic and high recall. We define the criteria for peer similarity and peer selection, and we present the protocols for organizing the peers into clusters and for searching within the clustered organization of peers. iCluster is evaluated on a realistic peer-to-peer environment using real-world data and queries. The results demonstrate significant performance improvements (in terms of clustering efficiency, communication load and retrieval accuracy) over a state-of-the-art peer-to-peer clustering method. Compared to exhaustive search by flooding, iCluster exchanged a small loss in retrieval accuracy for much less message flow.