A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Web Polling

  • Ole-Christoffer Granmo
  • B. John Oommen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5027)


We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time. Thus, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of changes detected. We solve the problem by first modelling it as a Stochastic Non-linear Fractional Knapsack Problem. We then present a completely new on-line Learning Automata (LA) system, namely, the Hierarchy of Twofold Resource Allocation Automata (H-TRAA), whose primitive component is a Twofold Resource Allocation Automaton (TRAA). Both the TRAA and the H-TRAA have been proven to be asymptotically optimal. Finally, we demonstrate empirically that H-TRAA provides orders of magnitude faster convergence compared to the LAKG which represents the state-of-the-art. Further, in contrast to the LAKG, H-TRAA scales sub-linearly. Based on these results, we believe that the H-TRAA has a tremendous potential to handle demanding real-world applications, particularly those which deal with the world wide web.


Web Polling Learning Automata Stochastic Optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Granmo, O.C., Oommen, B.J., Myrer, S.A., Olsen, M.G.: Learning Automata-based Solutions to the Nonlinear Fractional Knapsack Problem with Applications to Optimal Resource Allocation. IEEE Transactions on Systems, Man, and Cybernetics, Part B (2006)Google Scholar
  2. 2.
    Black, P.E.: Fractional knapsack problem. Dictionary of Algorithms and Data Structures (2004)Google Scholar
  3. 3.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  4. 4.
    Pandey, S., Ramamritham, K., Chakrabarti, S.: Monitoring the Dynamic Web to Respond to Continuous Queries. In: 12th International World Wide Web Conference, pp. 659–668. ACM Press, New York (2003)Google Scholar
  5. 5.
    Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs (1989)Google Scholar
  6. 6.
    Tsetlin, M.L.: Automaton Theory and Modeling of Biological Systems. Academic Press, London (1973)Google Scholar
  7. 7.
    Bretthauer, K.M., Shetty, B.: The Nonlinear Knapsack Problem — Algorithms and Applications. European Journal of Operational Research 138, 459–472 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Granmo, O.C., Oommen, B.J.: Solving stochastic nonlinear resource allocation problem s using a hierarchy of twofold resource allocation automata (submitted for publication, 2007)Google Scholar
  9. 9.
    Wolf, J.L., Squillante, M.S., Sethuraman, J., Ozsen, K.: Optimal Crawling Strategies for Web Search Engines. In: 11th International World Wide Web Conference, pp. 136–147. ACM Press, New York (2002)Google Scholar
  10. 10.
    Zipf, G.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading (1949)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ole-Christoffer Granmo
    • 1
  • B. John Oommen
    • 2
  1. 1.Dept. of ICTUniversity of AgderGrimstadNorway
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations