论文部分内容阅读
互联网的应用方式正从以面向主机的点对点通信为主转向以海量内容获取为主.为适应这一转变,研究界提出了以内容为中心(Content-Centric Networks,CCN)的新型网络架构.网络缓存作为内容中心网络的重要元素,能够有效减少网络带宽和传输时延.为了降低内容中心网络的缓存内容冗余度和提高缓存内容命中率,提出了一种利用K均值算法的缓存机制KCache(K-means algorithm utilized Caching mechanism).KCache利用控制器获取各路由器上内容的请求次数以及网络状态信息,并据此计算得到若干个缓存节点,向其发出主动缓存内容的指令.仿真实验表明:与传统内容中心网络缓存机制相比,KCache可有效提高缓存内容命中率,降低获取内容的跳数以及降低平均请求时延.
The application of the Internet is shifting from a host-oriented peer-to-peer communications system to a mass content-based network.In order to adapt to this change, the research community has proposed a new network architecture based on content-centric networks (CCNs) As an important element in the content center network, caching can effectively reduce the network bandwidth and transmission delay.In order to reduce the content redundancy and improve the cache hit rate, a K-means caching mechanism KCache ( KCache uses the controller to obtain the number of requests and the network status information of each router, and then calculates a number of caching nodes to issue instructions to proactively cache the content.The simulation results show that: In contrast to traditional content center network caching mechanisms, KCache can effectively increase the hit percentage of cached content, reduce the number of hops to get content, and reduce average request latency.