Abstract
Prefetching is a basic mechanism for faster data access and efficient computing. An important issue in prefetching is the tradeoff between the amount of network’s resources wasted by the prefetching and the gain of time. For instance, in the Web, browsers may download documents in advance while a Web surfer is surfing on the Web. Since the Web surfer follows the hyperlinks in an unpredictable way, the choice of the Web pages to be prefetched must be computed online. The question is then to determine the minimum amount of resources used by prefetching that ensures that all documents accessed by the Web surfer have previously been loaded in the cache.
We model this problem as a two-players game similar to Cops and Robber Games in graphs. The first player, a fugitive, starts on a marked vertex of a (di)graph G. The second player, an observer, marks k ≥ 1 vertices, then the fugitive moves along one edge/arc of G to a new vertex, then the observer marks k vertices, etc.
The observer wins if he prevents the fugitive to reach an unmarked vertex. The fugitive wins otherwise, i.e., if she succeed to enter an unmarked vertex. The surveillance number of a (di)graph is the minimum k ≥ 1 allowing the observer to win against any strategy of the fugitive.
We study the computational complexity of the game. We show that deciding whether the surveillance number of a chordal graph equals 2 is NP-hard. Deciding if the surveillance number of a DAG equals 4 is PSPACE-complete. Moreover, computing the surveillance number is NP-hard in split graphs. On the other hand, we provide polynomial time algorithms computing surveillance numbers of trees and interval graphs. Moreover, in the case of trees, we establish a combinatorial characterization, related to isoperimetry, of the surveillance number.
Due to lack of space, some proofs have been omitted or sketched, and can be found in [3]. This work has been done during the visit of Fedor V. Fomin at the INRIA team-project MASCOTTE, INRIA Sophia-Antipolis, France.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alspach, B.: Searching and sweeping graphs: a brief survey. In: Le Matematiche, pp. 5–37 (2004)
Fomin, F.V., Giroire, F., Jean-Marie, A., Mazauric, D., Nisse, N.: To satisfy impatient web surfers is hard. Technical Report INRIA-7740, INRIA (2011), http://hal.inria.fr/inria-00625703/fr/
Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Grigoras, R., Charvillat, V., Douze, M.: Optimizing hypervideo navigation using a Markov decision process approach. ACM Multimedia, 39–48 (2002)
Zona Research Inc. The economic impacts of unacceptable web-site download speeds. White paper, Redwood City, CA (April 1999), http://www.webperf.net/info/wp_downloadspeed.pdf
Joseph, D., Grunwald, D.: Prefetching using Markov predictors. In: ISCA, pp. 252–263 (1997)
Morad, O., Jean-Marie, A.: Optimisation en temps-réel du téléchargement de vidéos. In: Proc. of 11th Congress of the French Operations Research Soc. (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fomin, F.V., Giroire, F., Jean-Marie, A., Mazauric, D., Nisse, N. (2012). To Satisfy Impatient Web Surfers Is Hard. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-30347-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30346-3
Online ISBN: 978-3-642-30347-0
eBook Packages: Computer ScienceComputer Science (R0)