Web search results caching service for structured P2P networks

dc.contributor.affiliationDepartamento de Informática de Sistemas y Computadores
dc.contributor.affiliationGrupo de Redes de Computadores
dc.contributor.authorRosas-Olivos, Erika Susana
dc.contributor.authorHidalgo, Nicolases_ES
dc.contributor.authorMarin, Mauricioes_ES
dc.contributor.authorGil-Costa, Veronicaes_ES
dc.date.accessioned2026-02-25T06:22:52Z
dc.date.available2026-02-25T06:22:52Z
dc.date.issued2014-01es_ES
dc.description.abstract[EN] 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.en_EN
dc.description.accrualMethodSes_ES
dc.description.bibliographicCitationRosas-Olivos, Erika Susana; Hidalgo, N.; Marin, M.; Gil-Costa, V. (2014). Web search results caching service for structured P2P networks. Future Generation Computer Systems. 30:254-264. https://doi.org/10.1016/j.future.2013.06.018es_ES
dc.description.referencesCosta. (2012). Capacity planning for vertical search engines: an approach based on coloured petri nets. vol. 7347.es_ES
dc.description.referencesL. Breslau, P. Cao, L. Fan, G. Phillips, S. Shenker, Web caching and zipf-like distributions: evidence and implications, in: IEEE INFOCOM’99, Vol. 1, 1999, pp. 126–134. http://dx.doi.org/10.1109/INFCOM.1999.749260.es_ES
dc.description.referencesK. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, J. Zahorjan, Measurement, modeling, and analysis of a peer-to-peer file-sharing workload, in: SOSP, 2003, pp. 314–329.es_ES
dc.description.referencesN.R.D. Council, Improving the efficiency of television set-top boxes. http://www.nrdc.org/energy/files/settopboxes.pdf.es_ES
dc.description.referencesValancius. (2009). Greening the Internet with nano data centers.es_ES
dc.description.referencesJ.H. Ahnn, U. Lee, H.J. Moon, Geoserv: a distributed urban sensing platform, in: CCGRID, 2011, pp. 164–173.es_ES
dc.description.referencesErika Rosas. (2012). Two-level result caching for web search queries on structured p2p networks.es_ES
dc.description.referencesI. Stoica, R. Morris, D.R. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for Internet applications, in: SIGCOMM, 2001, pp. 149–160.es_ES
dc.description.referencesRowstron. (2001). Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. vol. 2218.es_ES
dc.description.referencesZhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004). Tapestry: A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications, 22(1), 41-53. https://doi.org/10.1109/jsac.2003.818784es_ES
dc.description.referencesS. Iyer, A.I.T. Rowstron, P. Druschel, Squirrel: a decentralized peer-to-peer web cache, in: PODC, 2002, pp. 213–222.es_ES
dc.description.referencesWang. (2002). Buddyweb: a p2p-based collaborative web caching system. vol. 2376.es_ES
dc.description.referencesStading. (2002). Peer-to-peer caching schemes to address flash crowds.es_ES
dc.description.referencesSilvestre. (2012). AREN: a popularity aware replication scheme for cloud storage.es_ES
dc.description.referencesTigelaar. (2011). Search result caching in peer-to-peer information retrieval networks. vol. 6653.es_ES
dc.description.referencesFujimoto. (2011). Video-popularity-based caching scheme for p2p video-on-demand streaming.es_ES
dc.description.referencesKangasharju. (2006). Adaptive content management in structured p2p communities.es_ES
dc.description.referencesDespotovic. (2010). An operator approach to popularity-based caching in dhts.es_ES
dc.description.referencesWeixiong Rao, Lei Chen, Fu, A. W.-C., & Guoren Wang. (2010). Optimal Resource Placement in Structured Peer-to-Peer Networks. IEEE Transactions on Parallel and Distributed Systems, 21(7), 1011-1026. https://doi.org/10.1109/tpds.2009.136es_ES
dc.description.referencesFerrarotti. (2009). A last-resort semantic cache for web queries. vol. 5721.es_ES
dc.description.referencesMarín. (2009). Location cache for web queries.es_ES
dc.description.referencesMarín. (2010). New caching techniques for web search engines.es_ES
dc.description.referencesT. Pitoura, N. Ntarmos, P. Triantafillou, Replication, load balancing and efficient range query processing in dhts, in: EDBT, 2006, pp. 131–148.es_ES
dc.description.referencesSwart. (2004). Spreading the load using consistent hashing: a preliminary report.es_ES
dc.description.referencesBauer. (2007). Replica placement and location using distributed hash tables.es_ES
dc.description.referencesS. Bianchi, S. Serbu, P. Felber, P. Kropf, Adaptive load balancing for dht lookups, in: ICCCN 2006, 2006, pp. 411–418.es_ES
dc.description.referencesYamamoto. (2005). Replication methods for load balancing on distributed storages in p2p networks.es_ES
dc.description.referencesV. Ramasubramanian, E.G. Sirer, Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays, in: NSDI, 2004, pp. 99–112.es_ES
dc.description.referencesWang, X., Zhang, Y., Li, X., & Loguinov, D. (2004). On zone-balancing of peer-to-peer networks: analysis of random node join. ACM SIGMETRICS Performance Evaluation Review, 32(1), 211-222. https://doi.org/10.1145/1012888.1005713es_ES
dc.description.referencesB. Godfrey, I. Stoica, Heterogeneity and load balance in distributed hash tables, in: INFOCOM, 2005, pp. 596–606.es_ES
dc.description.referencesZhu, Y., & Hu, Y. (2005). Efficient, proximity-aware load balancing for DHT-based P2P systems. IEEE Transactions on Parallel and Distributed Systems, 16(4), 349-361. https://doi.org/10.1109/tpds.2005.46es_ES
dc.description.referencesHsiao, H.-C., Liao, H., Chen, S.-T., & Huang, K.-C. (2011). Load Balance with Imperfect Information in Structured Peer-to-Peer Systems. IEEE Transactions on Parallel and Distributed Systems, 22(4), 634-649. https://doi.org/10.1109/tpds.2010.105es_ES
dc.description.referencesM. Bienkowski, M. Korzeniowski, Friedhelm, dynamic load balancing in distributed hash tables, in: IPTPS, 2005, pp. 217–225. URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.1933.es_ES
dc.description.referencesGiakkoupis. (2005). A scheme for load balancing in heterogeneous distributed hash tables.es_ES
dc.description.referencesChyouhwa Chen, & Kun-Cheng Tsai. (2008). The Server Reassignment Problem for Load Balancing in Structured P2P Systems. IEEE Transactions on Parallel and Distributed Systems, 19(2), 234-246. https://doi.org/10.1109/tpds.2007.70735es_ES
dc.description.referencesShen, H., & Xu, C.-Z. (2007). Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks. IEEE Transactions on Parallel and Distributed Systems, 18(6), 849-862. https://doi.org/10.1109/tpds.2007.1040es_ES
dc.description.referencesLedlie. (2005). Distributed, secure load balancing with skew, heterogeneity and churn.es_ES
dc.description.referencesKarger. (2004). Simple efficient load balancing algorithms for peer-to-peer systems.es_ES
dc.description.referencesLaoutaris, N., Rodriguez, P., & Massoulie, L. (2008). ECHOS: edge capacity hosting overlays of nano data centers. ACM SIGCOMM Computer Communication Review, 38(1), 51-54. https://doi.org/10.1145/1341431.1341442es_ES
dc.description.referencesM. Marzolla, Libcppsim: a Simula-like, portable process-oriented simulation library in C++, in: ESM, 2004, pp. 222–227.es_ES
dc.description.referencesM. Jelasity, A. Montresor, G.P. Jesi, S. Voulgaris, The Peersim simulator. http://peersim.sf.net.es_ES
dc.description.referencesAlici. (2012). Adaptive time-to-live strategies for query result caching in web search engines.es_ES
dc.description.referencesBarroso, L. A., & Hölzle, U. (2007). The Case for Energy-Proportional Computing. Computer, 40(12), 33-37. https://doi.org/10.1109/mc.2007.443es_ES
dc.description.upvformatpfin264es_ES
dc.description.upvformatpinicio254es_ES
dc.description.volume30es_ES
dc.identifier.doi10.1016/j.future.2013.06.018es_ES
dc.identifier.issn0167-739Xes_ES
dc.identifier.urihttps://riunet.upv.es/handle/10251/232894
dc.languageIngléses_ES
dc.publisherElsevieres_ES
dc.relation.ispartofFuture Generation Computer Systemses_ES
dc.relation.pasarelaS\574873es_ES
dc.relation.publisherversionhttps://doi.org/10.1016/j.future.2013.06.018es_ES
dc.rightsReconocimiento - No comercial - Sin obra derivada (by-nc-nd)es_ES
dc.rights.accessRightsAbiertoes_ES
dc.subjectWeb search engineses_ES
dc.subjectCaching serviceses_ES
dc.subjectLoad balancinges_ES
dc.subjectP2P networkses_ES
dc.subject.ods09.- Desarrollar infraestructuras resilientes, promover la industrialización inclusiva y sostenible, y fomentar la innovaciónes_ES
dc.titleWeb search results caching service for structured P2P networkses_ES
dc.typeArtículoes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
dspace.entity.typePublicationes_ES
person.identifier745231
relation.isAuthorOfPublicationb50fdaaf-e32b-4327-afdd-eea20832b728
relation.isAuthorOfPublication.latestForDiscoveryb50fdaaf-e32b-4327-afdd-eea20832b728
relation.isOrgUnitOfPublicationd1ff3d29-c17c-4a84-bfc3-4f72ea62b663
relation.isOrgUnitOfPublication534f8814-5ed1-407d-bd45-50783af46021
relation.isOrgUnitOfPublication.latestForDiscoveryd1ff3d29-c17c-4a84-bfc3-4f72ea62b663
upv.uuidfd5f8da6-8c00-4a57-bbf3-e36098c58be4es_ES

Archivos

Bloque original

Mostrando 1 - 2 de 2
Cargando...
Miniatura
Nombre:
Rosas-OlivosHidalgoMarin - Web search results caching service for structured P2P networks.pdf
Tamaño:
370.13 KB
Formato:
Adobe Portable Document Format
Descripción:
Versión del Autor
Cargando...
Miniatura
Nombre:
1-s2.0-S0167739X13001325-main.pdf
Tamaño:
878.64 KB
Formato:
Adobe Portable Document Format
Descripción:
Versión editorial