Hybrid capacity planning methodology for web search engines

Abstract Capacity planning studies are suitable for supporting decision making in management and operation of Web search engines deployed on large clusters of processors. Among many possibilities, they enable ensuring that a sufficient amount of computational resources are timely provisioned to efficiently deal with the ever changing streams of user queries. In this paper, we present a simulation based methodology devised to perform capacity planning in large scale Web search engines. It combines classical operational analysis formulae with discrete event simulation to significantly reduce the number of deployments that are evaluated to find an optimal assignment for a target workload. We experimentally evaluate our proposal for demanding cases such as service nodes with temporary failures. The results show that the proposed methodology is able to produce good quality results in practical running times.

[1]  Hai Wang,et al.  Experiments with improved approximate mean value analysis algorithms , 2000, Perform. Evaluation.

[2]  Abdur Chowdhury,et al.  Operational requirements for scalable search systems , 2003, CIKM '03.

[3]  Toshikazu Kimura,et al.  Diffusion Approximations for Queues with Markovian Bases , 2002, Ann. Oper. Res..

[4]  Alistair Moffat,et al.  Load balancing for term-distributed parallel retrieval , 2006, SIGIR.

[5]  Iadh Ounis,et al.  A case study of distributed information retrieval architectures to index one terabyte of text , 2005, Inf. Process. Manag..

[6]  Iadh Ounis,et al.  Performance analysis of distributed information retrieval architectures using an improved network simulation model , 2007, Inf. Process. Manag..

[7]  Alistair Moffat,et al.  A pipelined architecture for distributed text query evaluation , 2007, Information Retrieval.

[8]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[9]  Jerome A. Rolia,et al.  Characterizing the scalability of a large web-based shopping system , 2001, ACM Trans. Internet Techn..

[10]  Haifeng Chen,et al.  Profiling services for resource optimization and capacity planning in distributed systems , 2008, Cluster Computing.

[11]  Kathryn S. McKinley,et al.  Evaluating the performance of distributed architectures for information retrieval using a variety of workloads , 2000, TOIS.

[12]  Torsten Suel,et al.  Improved techniques for result caching in web search engines , 2009, WWW '09.

[13]  Ricardo A. Baeza-Yates,et al.  Modeling performance-driven workload characterization of web search systems , 2006, CIKM '06.

[14]  Chun Zhang,et al.  An Optimal Capacity Planning Algorithm for Provisioning Cluster-Based Failure-Resilient Composite Services , 2009, 2009 IEEE International Conference on Services Computing.

[15]  Andrei Z. Broder,et al.  Efficient query evaluation using a two-level retrieval process , 2003, CIKM '03.

[16]  Amy Apon,et al.  Capacity Planning of a Commodity Cluster in an Academic Environment: A Case Study , 2008 .

[17]  Torsten Suel,et al.  Optimized Inverted List Assignment in Distributed Search Engine Architectures , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[18]  Dik Lun Lee,et al.  An analysis of performance and cost factors in searching large text databases using parallel search systems , 1994 .

[19]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.

[20]  JUSTIN ZOBEL,et al.  Inverted files for text search engines , 2006, CSUR.

[21]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[22]  Brad Fitzpatrick,et al.  Distributed caching with memcached , 2004 .

[23]  Cathy H. Xia,et al.  Optimal capacity allocation for Web systems with end-to-end delay guarantees , 2005, Perform. Evaluation.

[24]  Mauricio Marín,et al.  Capacity Planning for Vertical Search Engines: An Approach Based on Coloured Petri Nets , 2012, Petri Nets.

[25]  Iadh Ounis,et al.  Network Analysis for Distributed Information Retrieval Architectures , 2005, ECIR.

[26]  Mauricio Marín,et al.  A Fault-Tolerant Cache Service for Web Search Engines , 2012, 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications.

[27]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[28]  Jim Gao,et al.  Machine Learning Applications for Data Center Optimization , 2014 .

[29]  Alonso Inostrosa-Psijas,et al.  Simulating Search Engines , 2017, Computing in Science & Engineering.

[30]  Iadh Ounis,et al.  Performance Analysis of Distributed Architectures to Index One Terabyte of Text , 2004, ECIR.

[31]  Mauricio Marín,et al.  High-performance distributed inverted files , 2007, CIKM '07.

[32]  Alonso Inostrosa-Psijas,et al.  Service Deployment Algorithms for Vertical Search Engines , 2013, 2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[33]  Torsten Suel,et al.  Faster top-k document retrieval using block-max indexes , 2011, SIGIR.

[34]  Virgílio A. F. Almeida,et al.  Capacity Planning for Vertical Search Engines , 2010, ArXiv.

[35]  Moreno Marzolla,et al.  libcppsim: A Simula-like, Portable Process-Oriented Simulation Library in C++ , 2004 .