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
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Application framework based on topic maps
TMRA'05 Proceedings of the First international conference on Charting the Topic Maps Research and Applications Landscape
| Hi-index | 0.00 |
A fundamental challenge in Peer-To-Peer (P2P) systems is how to locate objects of interest, namely, the look-up service problem. In the distributed hash table (DHT), including Chord, CAN, Pastry and Tapestry, among others, both object id and network node are randomly hashed to a same id space, so that "locality-awareness" is not inbullt in the basic DHT design. Therefore, objects are referred to in a location-independent manner. In this paper, we propose an semantic approach to build a P2P system called SemanticChord which aims to integrate and organize the datalinformation resources based on the domain of interest to route requests to the most likely physical location of data. We apply the Topic maps approach as a semantic layer in aggregating and organizing ressources based on the domain of interest on top of the Chord Protocol. Experimental results show that SemanticChord improves the traditional DHT-based Chord in terms of average number of messages per lookup (11 %), the average success rate for content location ( 6%) and response time.