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

TCAM中的最优加权负载均衡

Optimal Weighted Load Balancing in TCAMs

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan

摘要:

流量分割是网络中所需的功能,例如用于多个路径上或不同服务器之间的负载均衡。服务器的容量决定了流量应该被分割的分区。最近的一种方法在三进制内容可寻址存储器(TCAM)内实现业务拆分,这通常在交换机中可用。重要的是减少分配给此任务的内存量,因为TCAM是耗电的,并且通常也需要用于其他任务,如分类和路由。以前的工作展示了如何计算精确实现给定分区所需的最小前缀匹配TCAM。在本文中,我们解决了更实际的情况下,在最多$n$前缀匹配TCAM规则是可用的,限制的能力,以实现所需的分区。我们给出了简单而有效的算法来找到$n$规则,生成一个分区最接近$L_\infty$所需的。我们对$L_\infty$的单侧版本(等于服务器上的最大过载)和相对版本做同样的事情,我们使用我们的算法来评估预期错误如何作为规则数量、服务器数量和TCAM宽度的函数而变化。

英文摘要:

Traffic splitting is a required functionality in networks, for example for load balancing over multiple paths or among different servers. The capacities of the servers determine the partition by 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. Previous work showed how to compute the smallest prefix-matching TCAM necessary to implement a given partition exactly. In this paper we solve the more practical case, where at most $n$ prefix-matching TCAM rules are available, restricting the ability to implement exactly the desired partition. We give simple and efficient algorithms to find $n$ rules that generate a partition closest in $L_\infty$ to the desired one. We do the same for a one-sided version of $L_\infty$ which equals to the maximum overload on a server and for a relative version of it. We use our algorithms to evaluate how the expected error changes as a function of the number of rules, the number of servers, and the width of the TCAM.

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

↑