Segment-based proxy caching of multimedia streams
Proceedings of the 10th international conference on World Wide Web
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Proxy Cache Algorithms: Design, Implementation, and Performance
IEEE Transactions on Knowledge and Data Engineering
Streaming Media Caching Algorithms for Transcoding Proxies
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
On Exploring Aggregate Effect for Efficient Cache Replacement in Transcoding Proxies
IEEE Transactions on Parallel and Distributed Systems
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
Caching strategies in transcoding-enabled proxy systems for streaming media distribution networks
IEEE Transactions on Multimedia
Video transcoding proxy for 3Gwireless mobile Internet access
IEEE Communications Magazine
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
Adaptation e-learning contents in mobile environment
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Context-Aware and Adaptive Units of Learning in mLearning
International Journal of Handheld Computing Research
Hi-index | 0.02 |
With the emergence of pervasive computing, the Internet client devices have become highly heterogeneous. Transcoding proxies are used to adapt media streams to suit diverse client devices. In a transcoding proxy based streaming system, CPU and network are both potential bottleneck resources. In this paper, a resource-adaptive transcoding proxy caching mechanism is proposed, which deals with network and CPU demand in an integrated fashion and aims to improve the system’s potential service capability. First, we explore the network gain and CPU gain of caching multiple versions at the same time. By introducing a time-varying influence factor α(t), the aggregated resource gain of the caching system is derived. Then, we derive the merit function of caching a single object under a given caching status, and design a cache replacement algorithm called RAC. Simulation shows that, on the primary metric of request blocking ratio, RAC outperforms LRU and LFU markedly.