TY - JOUR

T1 - Optimal Weighted Load Balancing in TCAMs

AU - Sadeh, Yaniv

AU - Rottenstreich, Ori

AU - Kaplan, Haim

N1 - Publisher Copyright:
© 1993-2012 IEEE.

PY - 2022/6/1

Y1 - 2022/6/1

N2 - 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∞ to the desired one. We do the same for a one-sided version of L∞ 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.

AB - 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∞ to the desired one. We do the same for a one-sided version of L∞ 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.

KW - Computer network management

KW - algorithms

KW - data structures

KW - packet switching

UR - http://www.scopus.com/inward/record.url?scp=85123306009&partnerID=8YFLogxK

U2 - 10.1109/TNET.2021.3140124

DO - 10.1109/TNET.2021.3140124

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85123306009

SN - 1063-6692

VL - 30

SP - 985

EP - 998

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 3

ER -