论文标题
在最佳TCAM中的范围和分区
On Ranges and Partitions in Optimal TCAMs
论文作者
论文摘要
流量分割是网络中所需的功能，例如用于在路径或服务器上的负载平衡，或者通过源的访问限制。服务器的容量（或具有特定访问限制的用户数量）确定了应分配流量的零件的尺寸。最近的一种方法在三元内容可寻址内存（TCAM）中实现了流量分裂，该内存通常在交换机中可用。重要的是要减少为此任务分配的内存量，因为TCAM是功率消耗，并且通常需要进行分类和路由等其他任务。在最长的前缀模型（LPM）中，Draves等人。 （Infocom 1999）找到一个功能的最小表示，Sadeh等。 （Infocom 2019）找到一个分区的最小表示。在某些情况下，范围功能是特别感兴趣的，也就是说，所有具有相同目标或行动的地址都是连续的。在本文中，我们表明，将代表分区的TCAM条目的数量最小化是以分裂为代价的，因此某些分区的某些操作必须具有多个范围。然后，我们还研究每个目标必须具有单个地址的情况。
Traffic splitting is a required functionality in networks, for example for load balancing over paths or servers, or by the source's access restrictions. The capacities of the servers (or the number of users with particular access restrictions) determine the sizes of the parts into which traffic should be split. A recent approach implements traffic splitting within the ternary content addressable memory (TCAM), which is often available in switches. It is important to reduce the amount of memory allocated for this task since TCAMs are power consuming and are often also required for other tasks such as classification and routing. In the longest-prefix model (LPM), Draves et al. (INFOCOM 1999) find a minimal representation of a function, and Sadeh et al. (INFOCOM 2019) find a minimal representation of a partition. In certain situations, range-functions are of special interest, that is, all the addresses with the same target, or action, are consecutive. In this paper we show that minimizing the amount of TCAM entries to represent a partition comes at the cost of fragmentation, such that for some partitions some actions must have multiple ranges. Then, we also study the case where each target must have a single segment of addresses.
