面向ICN的非合作博弈优化缓存策略

Non-cooperative Game Optimization Caching Strategy for ICN

针对信息中心网络(Information-Centric Network,ICN)的缓存分布问题,提出了一种基于非合作博弈算法(Non-cooperative Game)的优化缓存策略。算法将ICN网络建模成复杂网络,采用非合作博弈框架,兼顾用户服务质量(Quality of Service,QoS)的情况下,综合缓存节点距离、能效和流行度对网络中每个节点构建相应的效用函数,采用分布式迭代算法解出非合作博弈的纳什均衡解,得到全局最优的效用函数值,获取最佳的缓存分配结果。仿真结果表明,在用户请求次数和请求内容流行度不断增加的情况下,使用非合作博弈算法可以减少网络整体能耗,提高平均缓存命中率,减少平均响应跳数。

To solve the problem of cache distribution of information-centric network(ICN),an optimized cache strategy based on non-cooperative game algorithm is proposed.The algorithm models the ICN network into a complex network,adopts a non-cooperative game framework,and takes into account the user's quality of service(QoS).By integrating the cache node distance,energy efficiency and popularity and building a corresponding utility function for each node in the network,a distributed iterative algorithm is used to solve the Nash equilibrium solution of the non-cooperative game,and the global optimal utility function value is obtained to achieve the best cache allocation result.The simulation results show that the non-cooperative game algorithm can reduce the overall energy consumption of the network,improve the average cache hit rate,and reduce the average response hop count when the number of user requests and the popularity of the requested content increase continuously.