Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
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, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, 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 nonlinear fractional knapsack problem. We then present an online 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 the H-TRAA provides orders of magnitude faster convergence compared to the learning automata knapsack game (LAKG) which represents the state-of-the-art for this problem. Further, in contrast to the LAKG, the H-TRAA scales sub-linearly. Based on these results, we believe that the H-TRAA has also tremendous potential to handle demanding real-world applications, particularly those which deal with the world wide web.
|Keywords||Hierarchical learning, Learning automata, Nonlinear knapsack problems, Stochastic optimization, Web polling, WWW-related resource allocation|
|Journal||Engineering Applications of Artificial Intelligence|
Granmo, O.-C. (Ole-Christoffer), & Oommen, J. (2011). Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem. Engineering Applications of Artificial Intelligence, 24(7), 1238–1251. doi:10.1016/j.engappai.2011.05.018