作者: Woei-Luen Shyu , Cheng-Shong Wu , Ting-Chao Hou
关键词: Parallel computing 、 Computer network 、 Routing table 、 Cache-oblivious algorithm 、 Static routing 、 Page cache 、 Cache invalidation 、 Locality of reference 、 Cache 、 Cache pollution 、 Quality of service 、 Algorithm 、 Policy-based routing 、 Cache algorithms 、 Router 、 Enhanced Interior Gateway Routing Protocol 、 Routing protocol 、 Computer science 、 Adaptive replacement cache
摘要: Recent research on router architectures focuses speeding up the time-consuming routing-lookup procedure by elaborate algorithms and data structures to match ever-increasing wire-speed of fiber links. However, we observed strong temporal locality in traffic traces collected from two TANet backbone routers. Thus, a routing cache, which is used reuse previous results, can significantly offload module. In this paper, first introduce our analysis. Then investigate efficiency several cache replacement algorithms, includes FIFO, LRU, random proposed LFU implementation alternative. The simulation results show that exponentially decayed scheme provides better performance than other especially under small-size caches.