Analysis of some algorithms of Web-sites searching

MaRDI QIDQ2782144zbMATH OpenFDO

Authors Vladimir Rykov, S. N. Verbitskiy

Publication date 14 April 2002

Published in Vestnik Rossiĭskogo Universiteta Druzhby Narodov. Seriya Prikladnaya Matematika i Informatika (Search for Journal in Brave)

zbMATH Keywords

algorithms of Web-sites searchingPolling systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Communication theory (94A05)

Review text

The paper deals with a mathematical problem of servicing a finite (but large enough) number \(N\) of information sources (Web-sites) by one server (search engine). Such systems are called ``Polling systems (see [\textit{H.~Takagi}, ``Analysis of polling systems, MIT Press, Cambridge (1986)]). The authors propose three algorithms of Web-sites searching and make their numerical comparison by means of the work immutation model of the corresponding search engine.

Recommendations

• Performance evaluation of polling systems by means of the power-series algorithm
• Algorithmic Challenges in Web Search Engines
• Combinatorial algorithms for web search engines -- three success stories
• Some recent results on ranking webpages and websites
• Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines

Cited in

(4)

• On analysis of periodic polling systems
• Modeling and optimization of functioning of the information Web portal
• Algorithmic Challenges in Web Search Engines
• Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines

This page was built for publication: Analysis of some algorithms of Web-sites searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2782144)