Repository logo
Log In(current)
  • Inicio
  • Personal de Investigación
  • Unidad Académica
  • Publicaciones
  • Colecciones
    Datos de Investigacion Divulgacion cientifica Personal de Investigacion Protecciones Proyectos Externos Proyectos Internos Publicaciones Tesis
  1. Home
  2. Universidad de Santiago de Chile
  3. Publicaciones
  4. Web Search Results Caching Service for Structured p2p Networks
Details

Web Search Results Caching Service for Structured p2p Networks

Journal
Future Generation Computer Systems
ISSN
0167-739X
Date Issued
2014
Author(s)
Marin-Caihuan, J  
Rosas-Olivos, E  
Hidalgo-Castillo, N  
DOI
https://doi.org/10.1016/j.future.2013.06.018
Abstract
This paper proposes a two-level P2P caching strategy for Web search queries. The design is suitable for a fully distributed service platform based on managed peer boxes (set-top-box or DSL/cable modem) located at the edge of the network, where both boxes and access bandwidth to those boxes are controlled and managed by an ISP provider. Our solution significantly reduces user query traffic going outside of the ISP provider to get query results from the respective Web search engine. Web users are usually very reactive to worldwide events which cause highly dynamic query traffic patterns leading to load imbalance across peers. Our solution contains a strategy to quickly ease imbalance on peers and spread communication flow among participating peers. Each peer maintains a local result cache used to keep the answers for queries originated in the peer itself and queries for which the peer is responsible for by contacting the Web search engine on-demand. When query traffic is predominantly routed to a few responsible peers our strategy replicates the role of "being responsible for" to neighboring peers so that they can absorb query traffic. This is a fairly slow and adaptive process that we call mid-term load balancing. To achieve a short-term fair distribution of queries we introduce a location cache in each peer which keeps pointers to peers that have already requested the same queries in the recent past. This lets these peers share their query answers with newly requesting peers. This process is fast as these popular queries are usually cached in the first DHT hop of a requesting peer which quickly tends to redistribute load among more and more peers. © 2013 Elsevier B.V. All rights reserved.
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Logo USACH

Universidad de Santiago de Chile
Avenida Libertador Bernardo O'Higgins nº 3363. Estación Central. Santiago Chile.
ciencia.abierta@usach.cl © 2023
The DSpace CRIS Project - Modificado por VRIIC USACH.

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
Logo DSpace-CRIS
Repository logo COAR Notify