Design, Implementation and Evaluation of a Real-Time Active Content Distribution Service

Abstract

The phenomenal growth of the world-wide web has made it the most popular Internet application today. Web caching and content distribution services have been recognized as valuable techniques to mitigate the explosion of web traffic. An increasing fraction of web traffic today is dynamically generated and therefore intrinsically difficult to replicate or cache using present static approaches. Scalable delivery of such active content poses a myriad of challenges, including content replication, update propagation, and consistency management. This paper makes two contributions: it (1) describes a scalable architecture for transparent demand-driven distribution of active content; and (2) presents a system that can provide real-time delay guarantees on content access. Our approach involves migrating the scripts which generate dynamic web traffic, and their data, from the origin servers to active content distribution proxies nearest to the clients. We also present mechanisms on these proxies to enforce real-time delay guarantees for client requests. Our system is implemented and deployed on PlanetLab (2004), a real-world distributed Internet testbed. Experimental data show that significant improvements are observed in effective throughput and client response time, and that delay bounds on content access can be guaranteed with a very high probability.

Optimizing storage on fog computing edge servers: A recent algorithm design with minimal interference

“…The LFU (Least Frequently Used) algorithm [ 51 ] is a replacement algorithm focusing on block access frequency, eliminating the least frequently accessed block. Compared to other algorithms, LFU can notably enhance the cache hit rate and is ideal for scenarios prioritizing historical access frequency.…”