Feedback-based Performance Tuning for Self-organizing Multimedia Retrieval Systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F10%3A00043542" target="_blank" >RIV/00216224:14330/10:00043542 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Feedback-based Performance Tuning for Self-organizing Multimedia Retrieval Systems

Popis výsledku v původním jazyce

We concentrate on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should dealwith sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we propose a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data bytheir content. The peers are interconnected by relationships established according to answers returned to queries. In order to select appropriate relationships for query forwarding, we define and evaluate a new adaptive routing algorithm. The routing algorithm is influenced by automatically evaluated feedback, so the system does not need any user intervention. The experiments are evaluated on a real-life image data set.

Název v anglickém jazyce

Feedback-based Performance Tuning for Self-organizing Multimedia Retrieval Systems

Popis výsledku anglicky

We concentrate on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should dealwith sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we propose a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data bytheir content. The peers are interconnected by relationships established according to answers returned to queries. In order to select appropriate relationships for query forwarding, we define and evaluate a new adaptive routing algorithm. The routing algorithm is influenced by automatically evaluated feedback, so the system does not need any user intervention. The experiments are evaluated on a real-life image data set.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

International Conference on Advances in Multimedia (MMEDIA 2010)

ISBN

978-0-7695-4068-9

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

—

Název nakladatele

IEEE Computer Society

Místo vydání

Los Alamitos, CA 90720-1314

Místo konání akce

Athens/Glyfada, Greece

Datum konání akce

13. 6. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—