Abstract
A large data file in the internet such as a map is served in small pieces, called tiles. To improve the service speed for such data, we can prefetch 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. In this paper, we propose a technique that captures the regularity in the tile request pattern by using an NSMC (Neighbor Selection Markov Chain) and predicts future tile requests based on it. The required regularity to use our technique is that the next tile to be requested is dependent on previous k movements (or requests) in the tile space. Map shows such regularity in a sense. Electronic books show a strong such regularity. We show how to build an NSMC and measure its prediction capability through experimentations.
This work is supported by Inha University in 2000.
This is a preview of subscription content, log in via an institution to check access.
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
G. Banga, F. Douglis, and M. Rabinovish, “Optimistic deltas for WWW latency reduction,” Proc. of USENIX’97,pp 289–303, Jan. 1997
Azer Bestavros and Carlos Cunha, “Server-initiated document dissemination for the www,” IEEE Data Engineering Bulletin, September 1996.
Pei Cao, Edwad W. Felten, Anna R. Karlin, and Kai Li, “A study of integrated prefetching and caching strategies,” Proc. 1995 ACM SIGMETRICS, pp 188–197, May 1995.
B. Duska, D. Marwood, and M. Feeley, “The measured access characteristics of world wide web client proxy caches,” Proc. of USENIX Symposium of Internet Technologies and Systems(USITS), pp. 23–35, Dec. 1997.
Wcol Group, “WWW collector-the prefetching proxy server for www,” http://shika.aistnara. ac.jp/products/wcol/wcol.html, 1997.
James Gwertzman and Margo Seltzer, “The case for geographical push-caching,” Proceedings of the Fifth Workshop on Hot Topics in Operating Systems, 1995.
V. Holmedahl, B. Smith, and T. Yang, “Cooperative caching of dynamic content on a distributed web server,” Proc. of Seventh IEEE International Symposium on High Performance Distributed Computing(HPDC-7), pp243–250, 1998
H. V. Jagadish, “Linear Clustering of Objects with Multiple Attributes,” Proc. of ACM SIGMODD’ 90 Intl. Conf. on Management of Data, May 1990.
A. Kraiss and G. Weikum, “Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions,” The VLDB Journal 7(7)(1998) 141–162.
Tong sau Loon and Vaduvur Bharghavan, “Alleviating the latency and bandwidth problems in www browing”, Proc. of the 1997 USENIX Symposium on Internet Technology and Systems, Dec. 1997.
Evangelos P. Markatos and Catherine E. Chronaki, “A top-10 approach to prefetching on the web,” Technical report, Technical Report No. 173, ICS-FORTH, Heraklion, Crete, Greece, August 1996. URL http://www.ics.forth.gr/proj/arch-vlsi/www.html
J. Mogul, F. Douglish, A. Feldmann, and b. Krishnamurthy, “Potential benefits of delta-encoding and data compression for HTTP,” Proc. of SIGCOMM’97, pp.181-94, Sept. 1997.
Venkata N. Padmanabhan and Jeffrey C. Mogul, “Using predictive prefetching to improve world wide web latency,” ACM SIGCOMM Computer Communication Review, July 1996.
Ramesh R. Sarukkai, “Link prediction and path analysis using Markov chains,” Proc. of 9th International world wide web conference, May 15-19, 2000.
Edward P.F. Chan and Koji Ueda, “Efficient query result retrieval over the web,” Proc. of the 7th International Conference on Parallel and Distributed Systems, July 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, YS., Kim, KC., Kim, S.D. (2001). Prefetching Tiled Internet Data Using a Neighbor Selection Markov Chain. In: Böhme, T., Unger, H. (eds) Innovative Internet Computing Systems. IICS 2001. Lecture Notes in Computer Science, vol 2060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48206-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-48206-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42275-4
Online ISBN: 978-3-540-48206-2
eBook Packages: Springer Book Archive