Optimal robot scheduling for web search engines

Journal of Scheduling

Volumn 1, Issue 1, 1998, Pages 15-29

  Coffman Jr , E G ^a   Liu, Zhen ^b   Weber, Richard R ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b INRIA   (France)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Spiders; Stochastic ordering; Stochastic scheduling; Web robots; Web search engines

Indexed keywords

EID: 0002371171     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1425(199806)1:1<15::AID-JOS3>3.0.CO;2-K     Document Type: Article

References (18)

1. F. Douglis, A. Feldmann, B. Krishnamurthy and J. Mogul, 'Rate of change and other metrics: a live study of the World Wide Web', USENIX, December 8-11, 1997, Monterey, CA.
2. S. Borst, O. J. Boxma, J. H. A. Harink and G. B. Huitema, 'Optimization of fixed time polling schemes', Telecommun. Systems, 3, 31-59 (1994).
3. O. J. Boxma, H. Levy and J. A. Weststrate, 'Efficient visit frequencies for polling tables: minimization of waiting cost', Queueing Systems, 9, 133-162 (1991).
4. O. J. Boxma, H. Levy and J. A. Weststrate, 'Efficient visit orders for polling systems', Perf. Eval., 18, 103-123 (1993).
5. H. Takagi, Analysis of Polling Systems, MIT Press, Cambridge, 1986.
6. H. Takagi, 'Queueing analysis of polling models', in H. Takagi (ed.), Stochastic Analysis of Computer and Communication Systems, North-Holland, Amsterdam, 1990.
7. S. Borst, 'Polling systems', Ph.D. Thesis, CWI, The Netherlands, 1994.
8. M. H. Ammar and J. W. Wong, 'On the optimality of cyclic transmission in teletext systems', IEEE Trans. Commun., COM-35(1), 68-73 (1987).
9. H. D. Dykeman, M. H. Ammar and J. W. Wong, 'Scheduling algorithms for videotex systems under broadcast delivery', Proc. of ICC'86, 1986, pp. 1847-1851.
10. Z. Liu and P. Nain, 'Optimal scheduling in some multi-queue single-server systems', IEEE Trans. Automat. Control, 37(2), pp. 247-252 (1992).
11. A. Itai and Z. Rosberg, 'A golden ratio control policy for a multiple-access channel', IEEE Trans. Automat. Control, AC-29, pp. 712-718 (1984).
12. J. F., C. Kingman, 'The Ergodic theory of subadditive stochastic processes', J. Roy. Statist. Soc. Ser. B, 30, 499-510 (1968).
13. A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
14. D. Stoyan, in D. J. Daley (eds.), Comparison Methods for Queues and Other Stochastic Models, English translation, Wiley, New York, 1983.
15. M. Andrews, A. Fernandez, M. Harchol-Balter, T. Leighton and L. Zhang, 'Template algorithm for one-hop packet routing', Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, 1997, preprint.
16. Y. Arian and Y. Levy, 'Algorithms for generalized round Robin routing', Oper. Res. Lett., 12, 313-319 (1992).
17. B. Hajek, 'Extremal splittings of point porcesses', Math. Oper. Res., 10, 543-556 (1985).
18. M. Hofri and Z. Rosberg, 'Packet delay under the golden ratio weighted TDM policy in a multiple-access channel', IEEE Trans. Inform. Theory, 33, 341-349 (1987).