Abstract
The service speed of tiled-web data such as a map can be improved by prefetching future tiles while the current one is being displayed. Traditional prefetching techniques examine the transition probabilities among the tiles to predict the next tile to be requested. However, when the tile space is very huge, and a large portion of it is accessed with even distribution, it is very costly to monitor all those tiles. A technique that captures the regularity in the tile request pattern by using an NSMC (Neighbor Selection Markov Chain) has been suggested. The required regularity to use the technique is that the next tile to be requested is dependent on previous k movements (or requests) in the tile space. Maps show such regularity in a sense. Electronic books show a strong such regularity. The NSMC captures that regularity and predicts the client’s next movement. However, Since the real-life movements are rarely strictly regular, we need to show that NSMC is robust enough such that with random movements occurred frequently, it still captures the regularity and predicts the future movement with a very high accuracy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bestavros, A., Cunha, C.: Server-initiated document dissemination for the www. IEEE Data Engineering Bulletin (1996)
Cao, P., Felten, E.W., Karlin, A.R., Li, K.: A study of integrated prefetching and caching strategies. In: Proceedings of 1995 ACM SIGMETRICS. (1995) 188–197
Padmanabhan, V.N., Mogul, J.C.: Using predictive prefetching to improve world wide web latency. In: Proceedings of ACM SIGCOMM Computer Communication Review. (1996)
Gwertzman, J., Seltzer, M.: The case for geographical push-caching. In: Proceedings of the Fifth Workshop on Hot Topics in Operating Systems. (1995)
Markatos, E.P., Chronaki, C.E.: A top-10 approach to prefetching on the web:technical report no. 173. Technical report, ICS-FORTH, Crete, Greece (1996)
Wcol Group: WWW collector — the prefetching proxy server for www. Technical report, ICS-FORTH, http://shika.aist-nara.ac.jp/products/wcol/wcol.html (1997)
Loon, T.S., Bharghavan, V.: Alleviating the latency and bandwidth problems in WWW browing. In: Proceedings of the 1997 USENIX Symposium on Internet Technology and Systems. (1997)
Kraiss, A., Weikum, G.: Integrated document caching and prefetching in storage hierarchies based on markov-chain predictions. The VLDB Journal 7 (1998) 141–162
Sarukkai, R.R.: Link prediction and path analysis using markov chains. In: Proceedings of 9th International world wide web conference. (2000)
Chan, E.P., Ueda, K.: Efficient query result retrieval over the web. In: Proceedings of the 7th International Conference on Parallel and Distributed Systems. (2000)
Duska, B., Marwood, D., Feeley, M.: The measured access characteristics of world wide web client proxy caches. In: Proceedings of USENIX Symposium of Internet Technologies and Systems(USITS). (1997) 23–35
Jagadish, H.V.: Linear clustering of objects with multiple attributes. In: Proceedings of ACM SIGMODD 90 International Conference on Management of Data. (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, D., Kim, J., Kim, S., Kim, K., Park, J. (2002). Robustness of a Neighbor Selection Markov Chain in Prefetching Tiled Web Data. In: Chang, W. (eds) Advanced Internet Services and Applications. AISA 2002. Lecture Notes in Computer Science, vol 2402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45639-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-45639-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43968-4
Online ISBN: 978-3-540-45639-1
eBook Packages: Springer Book Archive