Abstract
Internet users are most likely opening multiple windows and surfing several sites concurrently with frequent site changes within a relatively short period of time. This work proposes a web cache organization algorithm, which can satisfy the frequent site changes effectively with low cost. The algorithm is based on the collected statistics of the visited sites and the pattern analysis of the site change. Our study suggests that the proposed path based cache scheme outperforms the existing algorithms in the hit ratio and response time dramatically.
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
Claffy, K., Wessels, D.: Icp and the squid web cache. IEEE Journal (April 1998)
Almeida, J., Fan, L., Cao, P.: Summary cache: A scalable wide-area web cache sharing protocol. ACM, New York (1998)
Ross, K.W.: Hash routing for collection of shared web cache. IEEE Network (November 1997)
Zegura, E.W., Bhattacharjee, S., Calvert, K.L.: Self-organizing wide-area network caches. In: IEEE INFOCOM (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jang, H.S., Min, K.H., Jou, W.S., Ryu, Y., Lee, C.K., Hong, S.W. (2004). A Path Based Internet Cache Design for GRID Application. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_78
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive