دانلود رایگان مقاله حداقل هزینه مدیریت حافظه پنهان برای شبکه اطلاعات محور با برنامه نویسی شبکه

Abstract

In recent years, the increasing demand for media-rich content has driven many efforts to redesign the Internet architecture. As one of the main candidates, information-centric network (ICN) has attracted significant attention, where in-network cache is a key component in different ICN architectures. In this paper, we propose a novel framework for optimal cache management in ICNs that jointly considers caching strategy and content routing. Specifically, our framework is based on software-defined networking (SDN) where a controller is responsible for determining the optimal caching strategy and content routing via linear network coding (LNC). For the proposed cache management framework, we first formulate an optimization problem to minimize the network bandwidth cost and cache cost by jointly considering caching strategy and content routing with LNC. We then develop an efficient network coding based cache management (NCCM) algorithm to obtain a near-optimal caching and routing solution for ICNs. We further derive the upper and lower bounds of the problem and conduct extensive experiments to compare the performance of the NCCM algorithm with these bounds. Simulation results validate the effectiveness of the NCCM algorithm and the framework.

8. Conclusion

In this paper, we have systematically explored the power of LNC to reduce the network bandwidth cost and cache cost in ICNs. Specifically, we first proposed a novel SDN based framework for cache management in ICNs with LNC. We then formulated an optimal cache management problem for ICNs with LNC to minimize the network bandwidth cost and cache cost by jointly considering caching strategy and content routing. We also developed an efficient Lagrangian relaxation based algorithm namely, NCCM, to obtain near-optimal cache management solution. To evaluate the performance of the framework and the NCCM algorithm, we further derived the upper and lower bounds of the problem and conducted extensive experiments to compare the performance of the proposed NCCM algorithm with these bounds. Simulation results validate the effectiveness of the proposed NCCM algorithm and framework. Specifically, extensive numerical results show that the proposed NCCM algorithm gets within 10% of a lower bound of the optimal solution under most simulation scenarios. In addition to minimizing the network bandwidth cost, network security is another key challenge for communication networks. Search schemes over encrypted data have been studied in cloud environment [44–47]. In the future, we will explore the search schemes over encrypted data cached on CRs.