Efficient resource discovery in grids and P2P networks

Nick Antonopoulos (University Lecturer in the Department of Computing, University of Surrey, Guildford, UK)
James Salter (PhD Student, in the Department of Computing, University of Surrey, Guildford, UK)

Internet Research

ISSN: 1066-2243

Publication date: 1 December 2004

Abstract

Presents a new model for resource discovery in grids and peer‐to‐peer networks designed to utilise efficiently small numbers of messages for query processing and building of the network. Outlines and evaluates the model through a theoretical comparison with other resource discovery systems and a mathematical analysis of the number of messages utilised in contrast with Chord, a distributed hash table. Shows that through careful setting of parameter values the model is able to provide responses to queries and node addition in fewer messages than Chord. The model is shown to have significant benefits over other peer‐to‐peer networks reviewed. Uses a case study to show the applicability of the model as a methodology for building resource discovery systems in peer‐to‐peer networks using different underlying structures. Shows a promising new method of creating a resource discovery system by building a timeline structure on demand, which will be of interest to both researchers and system implementers in the fields of grid computing, peer‐to‐peer networks and distributed resource discovery in general.

Keywords

Citation

Antonopoulos, N. and Salter, J. (2004), "Efficient resource discovery in grids and P2P networks", Internet Research, Vol. 14 No. 5, pp. 339-346. https://doi.org/10.1108/10662240410566926

Download as .RIS

Publisher

:

Emerald Group Publishing Limited

Copyright © 2004, Emerald Group Publishing Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.