arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.13256cs.NI
收藏

TCAM中的负载均衡代码:大小分析

Codes for Load Balancing in TCAMs: Size Analysis

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan

摘要:

流量分割是网络中所需的功能,例如用于路径或服务器上的负载均衡,或者通过源的访问限制。服务器的容量(或具有特定访问限制的用户的数量)决定了流量应该被分割成的部分的大小。最近的一种方法在三进制内容可寻址存储器(TCAM)内实现业务拆分,这通常在交换机中可用。重要的是减少分配给此任务的内存量,因为TCAM是耗电的,并且通常也需要用于其他任务,如分类和路由。最近的工作提出了算法来计算最长前缀匹配(LPM)模型中给定分区的最小实现。在本文中,我们分析这种最小表示的性质,并证明其大小的上下界。上界一般TCAM举行,我们也证明了一个额外的下界一般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. Recent works suggested algorithms to compute a smallest implementation of a given partition in the longest prefix match (LPM) model. In this paper we analyze properties of such minimal representations and prove lower and upper bounds on their size. The upper bounds hold for general TCAMs, and we also prove an additional lower-bound for general TCAMs. We also analyze the expected size of a representation, for uniformly random ordered partitions. We show that the expected representation size of a random partition is at least half the size for the worst-case partition, and is linear in the number of parts and in the logarithm of the size of the address space.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑