Cache replacement policies are developed to help insure optimal use of limited resources. Varieties of such algorithms exist with relatively few that dynamically adapt to traffic patterns. Algorithms that are tunable typically utilize offline training mechanisms or trial-and-error to determine optimal characteristics. Utilizing multiple algorithms to establish an efficient replacement policy th...

The variety of didactic methods and approaches to teaching, which can stimulate and unlock learning potential, is recognised as influence of pluralist teaching. Pluralism in teaching is determined by various methods which can improve the quality of learning and make teaching more active, interesting, of high-quality and complete. The authors of this paper wanted to examine which teaching strate...

Information-Centric Networking is (ICN) [1] gained increasingly concerns, as an important direction of the Future Internet Architecture research. Although In-network caching is considered as one of the most significant properties of ICN, the cache policy for ICN is still little explored. In this paper, to explor the properties of the optimal cache policy, we formulate the in-network caching pro...

Servlet cache can effectively improve the throughput of Servlet container and reduce the response time experienced by the users. But the cache effect is dependent on the hit rate determined by the cache replacement algorithms. Servlets represent some business functions, so mining the business association among Servlets can improve the hit rate of cache replacement algorithms which in turn exhan...

Content caching at the edge nodes is a promising technique to reduce the data traffic in next-generation wireless networks. Inspired by the success of Deep Reinforcement Learning (DRL) in solving complicated control problems, this work presents a DRL-based framework with Wolpertinger architecture for content caching at the base station. The proposed framework is aimed at maximizing the long-ter...