Web search results caching service for structured P2P networks

被引:6
|
作者
Rosas, Erika [2 ]
Hidalgo, Nicolas [2 ]
Marin, Mauricio [1 ,2 ]
Gil-Costa, Veronica [1 ,3 ]
机构
[1] Yahoo Labs Santiago, Santiago, Chile
[2] Univ Santiago, DIINF, Santiago, Chile
[3] Natl Univ San Luis, CONICET, San Luis, Argentina
关键词
Web search engines; Caching services; Load balancing; P2P networks; LOAD; AWARE; REPLICATION; EFFICIENT;
D O I
10.1016/j.future.2013.06.018
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:254 / 264
页数:11
相关论文
共 50 条
  • [1] Two-Level Result Caching for Web Search Queries on Structured P2P Networks
    Rosas, Erika
    Hidalgo, Nicolas
    Marin, Mauricio
    [J]. PROCEEDINGS OF THE 2012 IEEE 18TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2012), 2012, : 221 - 228
  • [2] Distributed caching and adaptive search in multilayer P2P networks
    Wang, C
    Xiao, L
    Liu, YH
    Zheng, P
    [J]. 24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2004, : 219 - 226
  • [3] Trustworthy service caching: Cooperative search in P2P information systems
    Udupi, YB
    Yolum, P
    Singh, MP
    [J]. AGENT-ORIENTED INFORMATION SYSTEMS, 2003, 3030 : 32 - 44
  • [4] An Active Index Caching Search Algorithm for Unstructured P2P Networks
    Zhang, Pingjian
    Li, Sanqing
    [J]. 2009 INTERNATIONAL CONFERENCE ON NETWORKING AND DIGITAL SOCIETY, VOL 2, PROCEEDINGS, 2009, : 238 - 241
  • [5] Search mechanism using distributed metadata caching in P2P networks
    Kibe, A
    Nakamura, H
    Sunaga, H
    [J]. 2005 SYMPOSIUM ON APPLICATIONS AND THE INTERNET WORKSHOPS, PROCEEDINGS, 2005, : 212 - 215
  • [6] Cooperative Caching for Efficient Data Search in Mobile P2P Networks
    Kyoungsoo Bok
    Jaegu Kim
    Jaesoo Yoo
    [J]. Wireless Personal Communications, 2017, 97 : 4087 - 4109
  • [7] Cooperative Caching for Efficient Data Search in Mobile P2P Networks
    Bok, Kyoungsoo
    Kim, Jaegu
    Yoo, Jaesoo
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2017, 97 (03) : 4087 - 4109
  • [8] Context-based caching and routing for P2P web service discovery
    Christos Doulkeridis
    Vassilis Zafeiris
    Kjetil N⊘rvåg
    Michalis Vazirgiannis
    Emmanouel A. Giakoumakis
    [J]. Distributed and Parallel Databases, 2007, 21 : 59 - 84
  • [9] Context-based caching and routing for P2P web service discovery
    Doulkeridis, Christos
    Zafeiris, Vassilis
    Norvag, Kjetil
    Vazirgiannis, Michalis
    Giakoumakis, Emmanouel A.
    [J]. DISTRIBUTED AND PARALLEL DATABASES, 2007, 21 (01) : 59 - 84
  • [10] Caching routing indices in structured P2P overlays
    Cai, HL
    Wang, J
    [J]. 2005 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSSING, PROCEEDINGS, 2005, : 521 - 528