This website requires JavaScript.

Codes for Load Balancing in TCAMs: Size Analysis

Yaniv SadehOri RottenstreichHaim Kaplan
Dec 2022
摘要
Traffic splitting is a required functionality in networks, for example forload balancing over paths or servers, or by the source's access restrictions.The capacities of the servers (or the number of users with particular accessrestrictions) determine the sizes of the parts into which traffic should besplit. A recent approach implements traffic splitting within the ternarycontent addressable memory (TCAM), which is often available in switches. It isimportant to reduce the amount of memory allocated for this task since TCAMsare power consuming and are often also required for other tasks such asclassification and routing. Recent works suggested algorithms to compute asmallest implementation of a given partition in the longest prefix match (LPM)model. In this paper we analyze properties of such minimal representations andprove lower and upper bounds on their size. The upper bounds hold for generalTCAMs, and we also prove an additional lower-bound for general TCAMs. We alsoanalyze the expected size of a representation, for uniformly random orderedpartitions. We show that the expected representation size of a random partitionis at least half the size for the worst-case partition, and is linear in thenumber of parts and in the logarithm of the size of the address space.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答