DWCS : a dynamic web cache selection algorithm
The main aim of cache selection algorithms in current proxy servers is to get higher hit-ratio, they usually don't concern the validation and update of outdate pages. In this paper a new cache benefit model is defined, the relevant factors including validation cost and update cost are considere...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2013
|
| 在線閱讀: | https://hdl.handle.net/10356/96741 http://hdl.handle.net/10220/13058 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The main aim of cache selection algorithms in current proxy servers is to get higher hit-ratio, they usually don't concern the validation and update of outdate pages. In this paper a new cache benefit model is defined, the relevant factors including validation cost and update cost are considered to obtain the optimal cache set. According to the cache model, an algorithm - DWCS (Dynamic Web Cache Selection) is presented, and it is proved to be optimal under the reasonable hypothesis. The experimental results show the efficiency of DWCS algorithm. |
|---|