Adaptable Peer-to-Peer Discovery of Objects that Match Multiple Keywords

Authors:
Michael Moore;Tatsuya Suda
Affiliations:
-;-
Venue:
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Year:
2004

Citing 2
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A commonly needed function in peer-to-peer networks is the ability to locate information that matches particular query criteria. In this paper, information is associated with descriptive keywords, and discovery is performed to locate information that matches the query criteria ofmultiple keywords. Discovery forwards queries multiple hops through nodes, reaching nodes that may satisfy the query criteria. Concepts of keyword similarity and relationship history are introduced so that discovery performs in a more adaptable and scalable manner. Simulations are conducted to evaluate the impact of environment dynamics and environment scale onperforming discovery.