计算机网络中目的地址局部性的特性：高速缓存方案的比较
Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes
摘要：
计算机网络的规模及其带宽正呈指数级增长。为了支持这些大型高速网络，必须能够在几微秒内转发数据包。转发操作的一部分包括在大型地址数据库中进行搜索。在网桥、路由器、网关和名称服务器的设计中会遇到这个问题。如果地址引用模式中存在局部性，则缓存可以减少查找时间。使用在扩展的本地网络上测量的目的地引用跟踪，我们试图查看目的地引用是否具有显著的局部性。我们比较了MIN、LRU、FIFO和随机缓存替换算法的性能。我们发现，在我们的样本中的交互式（终端）流量有很大不同的本地行为比非交互式流量。交互业务不遵循LRU协议栈模型，而非交互业务遵循LRU协议栈模型。示例显示的环境中，缓存可以帮助以及那些缓存可以伤害，除非缓存大小是大的。
英文摘要：
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in a few microseconds. One part of the forwarding operation consists of searching through a large address databse. This problem is encountered in the design of bridges, routers, gateways and name servers. Caching can reduce the lookup time if there is a locality in the address reference pattern. Using a destination reference trace measured on an extended local are a network, we attempt to see if the destination refernces do have a significant locality. We compared the performance of MIN, LRU, FIFO, and random cache replacement algorithms. We found that the interactive (terminal) traffic in our sample had quite different locality behavior than that of the noninteractive traffic. The interactive traffic did not follow the LRU stack model while the noninteractivetraffic did. Examples are shown of the environments in which caching can help as well as those in which caching can hurt, unless the cache size is large.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
