All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/61989100:27740/13:86092930

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

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

Others

  • Publication year

    2013

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Peer-to-Peer Networking and Applications

  • ISSN

    1936-6442

  • e-ISSN

  • Volume of the periodical

    8

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    17

  • Pages from-to

    120-136

  • UT code for WoS article

    000348346100009

  • EID of the result in the Scopus database