By Topic

Distributed search revisited: Resolving the conflict of flexibility and efficiency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Boutaba, R. ; Comput. Sci., Univ. of Waterloo, Waterloo, ON

Peer-to-peer technology has impacted a wide range of distributed systems beyond simple file-sharing. Distributed XML databases, distributed computing, server-less Web publishing and networked resource/service sharing are only a few to name. Despite the diversity in applications, these systems share a common problem regarding searching and discovery of information. This commonality stems from transitory peer population and volatile peer content. As an effect users do not have the exact information about what they are looking for. Rather queries are based on partial information, which requires the search mechanism to be flexible. On the other hand to scale with network size the search mechanism is also required to be bandwidth efficient. This talk introduces a generic framework called distributed pattern matching to address the search problem in distributed environments while achieving both search flexibility and efficiency.

Published in:

Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on

Date of Conference:

14-17 Oct. 2008