Optimizing the number of robots for web search engines

Telecommunication Systems

Volumn 17, Issue 1-2, 2001, Pages 243-264

  Talim, J ^a   Liu, Z ^b   Nain, P ^c   Coffman Jr , E G ^d  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c INRIA   (France)

^d Columbia University ^*  (United States)

Author keywords

Queues; Web robots; Web search engines

Indexed keywords

EID: 23044525811     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1016672623865     Document Type: Article

References (7)

1. E.G. Coffman, Jr., Z. Liu and R.R. Weber, Optimal robot scheduling for Web search engines, Journal of Scheduling 1 (1998) 14-22.
2. J.W. Cohen, The Single Server Queue (North-Holland, Amsterdam, 1982).
3. L. Kleinrock, Queueing Systems, Vol. I (Wiley, New York, 1975).
4. R. Sedgewick and P. Flajolet, Analysis of Algorithms (Addison-Wesley, Reading, MA, 1996).
5. J. Talim, Z. Liu, P. Nain and E.G. Coffman, Jr., Optimal number of robots for search engines: The dynamic case, in: Proc. of the ACM SIGMETRICS 2001 / Performance 2001 Conference, Cambridge, MA, June 17-20, 2001.
6. E.C. Titchmarsh, The Theory of Functions, 2nd ed. (Oxford Univ. Press, Oxford, 1939).
7. R.L. Wolff, Poisson arrivals see time averages, Operations Research 30 (1982) 223-231.