Idioma:

Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks

Koizumi, Yusuke ; Watabe, Kohei ; Nakagawa, Kenji Kanovsky, Igor

PloS one, 2018-10, Vol.13 (10), p.e0205757-e0205757 [Revista revisada por pares]

United States: Public Library of Science

Texto completo disponible

Citas Citado por

Acciones

Título:
Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks
Autor: Koizumi, Yusuke ; Watabe, Kohei ; Nakagawa, Kenji
Kanovsky, Igor
Materias: Analysis ; Big Data ; Computer and Information Sciences ; Computer networks ; Computer science ; Computer simulation ; Copying ; Engineering schools ; Ethernet ; Information networks ; Integer programming ; Internet ; Network switching ; Networks ; Optimization ; Peer to peer computing ; Physical Sciences ; Placement ; Queries ; Reduction ; Research and Analysis Methods ; Response time ; Semantic web ; Semantics ; Sensors ; Social Sciences ; Structure
Es parte de: PloS one, 2018-10, Vol.13 (10), p.e0205757-e0205757
Notas: ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Competing Interests: The authors have declared that no competing interests exist.
Descripción: We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multi-queries. 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. We formulate the optimization problem of the data placement in the limited redundant space of the storages as an integer programming. A greedy approach to solve the optimization problem is also proposed. Through several simulations, it is confirmed that the proposed method can reduce the average number of hops required to answer multi-queries by about 30% at the maximum in our simulation settings. The reduction rate of the average number of hops depends on the level of co-occurrence. Further, the reduction of the computation time to solve the optimization problem with the greedy approach is evaluated. We also confirm that the proposed method does not affect load balancing of structured overlay networks.
Editor: United States: Public Library of Science
Idioma: Inglés

Enlaces

View this record in MEDLINE/PubMed

Volver a la lista de resultados

Anterior Resultado 15 Siguiente Ir a la siguiente página

Realización: Logos de Redes Sociales:

Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks

Koizumi, Yusuke ; Watabe, Kohei ; Nakagawa, Kenji Kanovsky, Igor

United States: Public Library of Science

Buscando en bases de datos remotas, por favor espere