CRRP: Cost-Based Replacement with Random Placement for En-Route Caching
スポンサーリンク
概要
- 論文の詳細を見る
Caching is considered widely as an efficient way to reduce access latency and network bandwidth consumption. En-route caching, where caches are associated with routing nodes in the network, is proposed in the context of Web cache to exploit fully the potential of caching. To make sensible replacement and placement decision for en-route caching, traditional caching schemes either engage computation-intensive algorithm like dynamic programming or suffer from inferior performance in terms of average access latency. In this article, we propose a new caching scheme with cost-based replacement and random placement, which is named CRRP. The cost-based replacement of CRRP introduces probing request to timely perceive cost change and the random placement is independent of current caching state, of O(1) computational complexity of placement decision. Through extensive simulations, we show that CRRP outperforms a wide range of caching schemes and is very close to the traditional dynamic-programming-based algorithm, in terms of average access delay.
- The Institute of Electronics, Information and Communication Engineersの論文
The Institute of Electronics, Information and Communication Engineers | 論文
- Compensation Effect of Quasi-Inverse Filter (QIF) on Frequency Characteristic Distortion in Wideband Systems
- Subblock Processing for Frequency-Domain Turbo Equalization under Fast Fading Environments
- Measurement-Based Performance Evaluation of Coded MIMO-OFDM Spatial Multiplexing with MMSE Spatial Filtering in an Indoor Line-of-Sight Environment
- Design of a Multiple-Input SC DC-DC Converter Realizing Long Battery Runtime
- The Influence of a Low-Level Color or Figure Adaptation on a High-Level Face Perception