Consideration of resource access history for optimizing overlay networks in P2P-based resource discovery

Tsutomu Inaba, Yoshitomo Murata, Hiroyuki Takizawa, Hiroaki Kobayash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper proposes an algorithm for self-organization of an overlay network to efficiently search appropriate computing resources in a large-scale grid computing environment. To reduce redundant links and the point of failure, this logical link reconnection algorithm considers the resource usage order of individual peers. Experimental results show that the retrieval efficiency can be increased by 20% in comparison with the previous algorithm. Therefore, in the ubiquitous computing environment, flooding search packets can be reduced while keeping the same performance of resource discovery.

Original languageEnglish
Title of host publicationProceedings - 2008 International Symposium on Applications and the Internet, SAINT 2008
Pages269-272
Number of pages4
DOIs
Publication statusPublished - 2008 Oct 20
Event2008 International Symposium on Applications and the Internet, SAINT 2008 - Turku, Finland
Duration: 2008 Jul 282008 Aug 1

Publication series

NameProceedings - 2008 International Symposium on Applications and the Internet, SAINT 2008

Other

Other2008 International Symposium on Applications and the Internet, SAINT 2008
CountryFinland
CityTurku
Period08/7/2808/8/1

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Consideration of resource access history for optimizing overlay networks in P2P-based resource discovery'. Together they form a unique fingerprint.

Cite this