p2p simulation with redundant data

We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multiqueries. In the proposed method, by copying data items to the redundant storage spaces in other storages, a good data placement reflecting co-occurrence structures in the structured overlay network is achieved. Through several simulations, it is confirmed that the proposed method can reduce the average number of hops required to answer multi-queries. The simulator code and the results are contained this dataset.

Identifier
DOI https://doi.org/10.17026/dans-2cq-x9gw
PID https://nbn-resolving.org/urn:nbn:nl:ui:13-9j-yxoa
Metadata Access https://easy.dans.knaw.nl/oai?verb=GetRecord&metadataPrefix=oai_datacite&identifier=oai:easy.dans.knaw.nl:easy-dataset:110623
Provenance
Creator Koizumi, Y.; Watabe, K.
Publisher Data Archiving and Networked Services (DANS)
Publication Year 2018
Rights info:eu-repo/semantics/openAccess; License: http://creativecommons.org/publicdomain/zero/1.0; http://creativecommons.org/publicdomain/zero/1.0
OpenAccess true
Representation
Language English
Resource Type Dataset
Format application/pdf; text/plain; .py
Discipline Other