A Network - path based Web Cache Algorithm


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 7, pp. 2161-2168, Jul. 2000
10.3745/KIPSTE.2000.7.7.2161,   PDF Download:

Abstract

Since most of the existing web cache structures are static, they cannot support the dynamic request change of the current WWW users well. Users are generally using multiple programs in several different windows with rapid preference change within a relatively short period of time. We develop a network-path based algorithm. It organizes a cache according to the network path of the requested URLs and builds a network cache farm where caches are logically connected with each other and each cache has its own preference over certain network paths. The algorithm has been implemented and tested in a real site. The performance results show that the new algorithm outperforms the existing static algorithms in the hit ratio and response time dramatically.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. H. Min and H. S. Jang, "A Network - path based Web Cache Algorithm," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 7, pp. 2161-2168, 2000. DOI: 10.3745/KIPSTE.2000.7.7.2161.

[ACM Style]
Kyong Hoon Min and Hyuk Soo Jang. 2000. A Network - path based Web Cache Algorithm. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 7, (2000), 2161-2168. DOI: 10.3745/KIPSTE.2000.7.7.2161.