本文選題：Web緩存 + 協(xié)同過濾��； 參考：《湖南科技大學(xué)》2014年碩士論文

【摘要】：隨著Internet網(wǎng)絡(luò)技術(shù)的迅猛發(fā)展，網(wǎng)絡(luò)接入用戶量和信息數(shù)據(jù)量急劇增加，互聯(lián)網(wǎng)已經(jīng)深入滲透至社會生活的各個方面，深刻地影響著人類的生產(chǎn)方式與生活習(xí)慣。由于不同網(wǎng)絡(luò)拓撲結(jié)構(gòu)具有明顯的差異、多媒體內(nèi)容在網(wǎng)絡(luò)資源中的比重不斷增加以及網(wǎng)絡(luò)帶寬的限制，，這些因素導(dǎo)致網(wǎng)絡(luò)傳輸具有較高延時，影響了用戶網(wǎng)絡(luò)訪問體驗。針對上述問題，研究人員提出了Web緩存技術(shù)與Web預(yù)取技術(shù)，這兩種技術(shù)都能極大地提高網(wǎng)絡(luò)帶寬利用率、減輕網(wǎng)絡(luò)出入口吞吐容量并減少用戶訪問延時，從而改善用戶網(wǎng)絡(luò)服務(wù)體驗。 本文研究了Web緩存技術(shù)與Web預(yù)取技術(shù)，并將兩者進行有機結(jié)合，提出了一種新的Web緩存模型，該模型的緩存模塊為本文提出的改進型緩存替換算法，預(yù)取模塊采用了基于用戶訪問模式的預(yù)取算法。論文主要完成了如下幾個方面的具體研究： 首先，通過研究和分析已有的Web緩存替換算法，設(shè)計了一種基于協(xié)同過濾的Web緩存替換算法GDSF-CF（Greedy Dual Size Frequency Collaborative Filtering）。該算法利用協(xié)同過濾技術(shù)生成Web對象的預(yù)測訪問頻率，并考慮了用戶的訪問特征與Web對象的屬性特征，通過目標(biāo)函數(shù)的計算確定Web對象的緩存價值；當(dāng)存儲空間需要進行替換操作以容納新的Web對象時，則對每個Web對象的緩存價值進行比較，替換出價值最小的對象，從而完成替換過程，維護代理服務(wù)器的可用性。 然后，提出了一種基于對象替換與預(yù)取的Web緩存模型MGP（Model of GDSF-CFwith Prefetching）。該模型包含緩存與預(yù)取兩大模塊，緩存模塊為本文提出的GDSF-CF替換算法，預(yù)取模塊采用了基于用戶訪問路徑分析的預(yù)取算法，該預(yù)取算法通過分析用戶的訪問序列形成目標(biāo)網(wǎng)頁的預(yù)取集合；當(dāng)用戶請求到達代理服務(wù)器時，緩存模塊與預(yù)取模塊將共同處理用戶請求，有效兼顧了用戶訪問的時間局部性與空間局部性。 最后，通過仿真實驗對本文提出的GDSF-CF算法與MGP模型進行了評價與分析，驗證了GDSF-CF算法與MGP模型的有效性。
[Abstract]:With the rapid development of Internet network technology, the number of network access users and the amount of information have increased dramatically. The Internet has deeply penetrated into all aspects of social life, and has deeply affected the mode of production and living habits of human beings. Due to the obvious differences in different network topologies, the increasing proportion of multimedia content in network resources and the limitation of network bandwidth, these factors lead to high delay of network transmission and affect the user's network access experience. In view of the above problems, researchers put forward Web cache technology and Web prefetching technology, both of which can greatly improve the utilization of network bandwidth, reduce the throughput capacity of network entry and exit, and reduce user access delay. In order to improve the user network service experience. In this paper, Web cache technology and Web prefetching technology are studied, and a new Web cache model is proposed. The cache module of this model is an improved cache replacement algorithm proposed in this paper. Prefetching module adopts prefetching algorithm based on user access mode. The thesis mainly completed the following aspects of the specific research: Firstly, by studying and analyzing the existing Web cache replacement algorithms, a Web cache replacement algorithm based on collaborative filtering, GDSF-CF(Greedy Dual Size Frequency Collaborative filtering algorithm, is designed. The algorithm uses collaborative filtering technology to generate the predicted access frequency of Web objects, and considers the access characteristics of users and the attribute features of Web objects, and determines the cache value of Web objects through the calculation of objective functions. When the storage space needs to be replaced to accommodate the new Web object, the cache value of each Web object is compared to replace the least valuable object, thus the replacement process is completed and the availability of the proxy server is maintained. Then, a MGP(Model of GDSF-CFwith prefetching model based on object replacement and prefetching is proposed. The model includes two modules: cache and prefetching. The cache module is the GDSF-CF replacement algorithm proposed in this paper. The prefetching module adopts the prefetching algorithm based on user access path analysis. The prefetching algorithm forms a prefetching set of the target web pages by analyzing the user's access sequence. When the user requests to reach the proxy server, the cache module and the prefetching module will jointly process the user requests. The time locality and spatial locality of user access are taken into account effectively. Finally, the GDSF-CF algorithm and MGP model proposed in this paper are evaluated and analyzed by simulation experiments, and the validity of GDSF-CF algorithm and MGP model is verified.
【學(xué)位授予單位】：湖南科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.09;TP333

【參考文獻】

相關(guān)期刊論文 前10條

1 王惠文;孟潔;;多元線性回歸的預(yù)測建模方法[J];北京航空航天大學(xué)學(xué)報;2007年04期

2 黃濤;王晶;管雪濤;鐘祺;王克義;;一種降低末級高速緩存污染的軟件控制插入策略[J];電子學(xué)報;2012年12期

3 李喬;何慧;張宏莉;;內(nèi)容分發(fā)網(wǎng)絡(luò)研究[J];電子學(xué)報;2013年08期

4 班志杰;古志民;金瑜;;Web預(yù)取技術(shù)綜述[J];計算機研究與發(fā)展;2009年02期

5 冀俊忠,劉椿年,沙志強;貝葉斯網(wǎng)模型的學(xué)習(xí)、推理和應(yīng)用[J];計算機工程與應(yīng)用;2003年05期

6 范波;程久軍;;用戶間多相似度協(xié)同過濾推薦算法[J];計算機科學(xué);2012年01期

7 張震波;楊鶴標(biāo);馬振華;;基于LRU算法的Web系統(tǒng)緩存機制[J];計算機工程;2006年19期

8 張艷;石磊;衛(wèi)琳;;Web緩存優(yōu)化模型研究[J];計算機工程;2009年08期

9 韓英杰;石磊;劉楊;;Web預(yù)取性能指標(biāo)準(zhǔn)確率與查全率的關(guān)系[J];計算機工程;2010年03期

10 徐翔;王煦法;;協(xié)同過濾算法中的相似度優(yōu)化方法[J];計算機工程;2010年06期

相關(guān)博士學(xué)位論文 前1條

1 劉耀;延遲容忍網(wǎng)絡(luò)中路由與緩存管理算法[D];中南大學(xué);2012年

本文編號：1959426