DocumentCode :
1940405
Title :
Web Cache Prefetching by Multi-dimensional Matrix
Author :
Feng, Wenying ; Vij, Karan
Author_Institution :
Dept. of Comput. & Inf. Syst., Trent Univ., Peterborough, ON
fYear :
2008
fDate :
13-15 Dec. 2008
Firstpage :
265
Lastpage :
270
Abstract :
In this paper, we study Web cache prefetching with multiple Web pages. Four multi-prefetching models including the Top-m, Future-r, (Top-m)+(Future-r) and multi-dimensional matrix are introduced. The idea is based on examination of the probabilities on sequence request patterns. Simulation results on hit rate comparison are also presented. The algorithms generalize the previous work of two-dimensional probability matrix in the application of Web cache prefetching.
Keywords :
Web sites; cache storage; probability; tree data structures; Future-r prefetching model; Top-m prefetching model; Top-m-Future-r prefetching model; Web cache prefetching; Web site access time; multidimensional probability matrix; multiple Web page; multiprefetching model; tree data structure; Application software; Information systems; Mathematics; Network servers; Prefetching; Software engineering; Telecommunication traffic; Web and internet services; Web pages; Web server; LRU; Web cache; multi-dimensional matrix; prefetching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Software Engineering and Its Applications, 2008. ASEA 2008
Conference_Location :
Hainan Island
Print_ISBN :
978-0-7695-3432-9
Type :
conf
DOI :
10.1109/ASEA.2008.61
Filename :
4721358
Link To Document :
بازگشت