| 本文已被：浏览 4627次 下载 7169次 |
码上扫一扫！ |
|
|
| En-Route Transcoding缓存的优化放置和替换 |
|
李春洪1,2, 冯国富1,2, 顾铁成1,2, 陆桑璐1,2, 陈道蓄1,2
|
|
1.南京大学 计算机软件新技术国家重点实验室,江苏 南京 210093;2.南京大学 计算机科学与技术系,江苏 南京 210093
|
|
| 摘要: |
| 对en-route transcoding缓存中的缓存路由和协同放置及替换问题进行了研究.提出了CCRA(cost-aware cache routing algorithm)缓存路由算法,能以可控的探测开销来发现潜在的、具有最小访问开销的缓存对象.在此基础上,建立了en-route transcoding缓存的分析模型,将缓存放置和替换问题形式化为一个最优化问题,并利用一种基于动态规划的方法来求解最佳缓存放置策略.仿真结果表明,与已有的元算法放置策略相比,该协同放置和替换策略可以获得更好的CSR性能. |
| 关键词: en-route transcoding缓存 缓存路由 协同放置 缓存替换 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60573106, 60402027, 60573131 (国家自然科学基金); the National Basic Research Program of China under Grant No.2002CB312002 (国家重点基础研究发展计划(973)); the Natural Science Foundation of Jiangsu Province of China under Grant Nos.BK2005411, BK2005208 (江苏省自然科学基金) |
|
| Optimal Placement and Replacement Scheme in En-Route Transcoding Caching Systems |
|
LI Chun-Hong,FENG Guo-Fu,GU Tie-Cheng,LU Sang-Lu,CHEN Dao-Xu
|
| Abstract: |
| This paper investigates cache routing and cache management problems for en-route transcoding caching systems. An active cache routing algorithm called CCRA (cost-aware cache routing algorithm) is designed, which, using a controllable probing load, can find the potential cache objects with minimal access cost. Then an analyzable model for en-route transcoding caching is established, with which the cooperative cache placement and replacement problem is formulated as an optimization problem and the optimal locations to cache the object are obtained by using a dynamic programming algorithm. Results of the simulation show that the proposed scheme outperforms existing meta placement algorithms on metric of CSR (cost save ratio). |
| Key words: en-route transcoding caching cache routing cooperative placement cache replacement |
