An efficient and distributed file search in unstructured peer-to-peer networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86092930" target="_blank" >RIV/61989100:27240/13:86092930 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/13:86092930

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s12083-013-0236-0" target="_blank" >http://dx.doi.org/10.1007/s12083-013-0236-0</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s12083-013-0236-0" target="_blank" >10.1007/s12083-013-0236-0</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An efficient and distributed file search in unstructured peer-to-peer networks

Popis výsledku v původním jazyce

Peer-to-peer (P2P) networks are gaining increased attention from both the scientific community and the larger Internet user community. Data retrieval algorithms lie at the center of P2P networks, and this paper addresses the problem of efficiently searching for files in unstructured P2P systems. We propose an Improved Adaptive Probabilistic Search (IAPS) algorithm that is fully distributed and bandwidth efficient. IAPS uses ant-colony optimization and takes file types into consideration in order to search for file container nodes with a high probability of success. We have performed extensive simulations to study the performance of IAPS, and we compare it with the Random Walk and Adaptive Probabilistic Search algorithms. Our experimental results show that IAPS achieves high success rates, high response rates, and significant message reduction. 2013, Springer Science+Business Media New York.

Název v anglickém jazyce

An efficient and distributed file search in unstructured peer-to-peer networks

Popis výsledku anglicky

Peer-to-peer (P2P) networks are gaining increased attention from both the scientific community and the larger Internet user community. Data retrieval algorithms lie at the center of P2P networks, and this paper addresses the problem of efficiently searching for files in unstructured P2P systems. We propose an Improved Adaptive Probabilistic Search (IAPS) algorithm that is fully distributed and bandwidth efficient. IAPS uses ant-colony optimization and takes file types into consideration in order to search for file container nodes with a high probability of success. We have performed extensive simulations to study the performance of IAPS, and we compare it with the Random Walk and Adaptive Probabilistic Search algorithms. Our experimental results show that IAPS achieves high success rates, high response rates, and significant message reduction. 2013, Springer Science+Business Media New York.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

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 periodika

Peer-to-Peer Networking and Applications

ISSN

1936-6442

e-ISSN

—

Svazek periodika

8

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

120-136

Kód UT WoS článku

000348346100009

EID výsledku v databázi Scopus

—