最优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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。