TY - JOUR

T1 - Load Balancing with Minimal Deviation in Switch Memories

AU - Sadeh, Yaniv

AU - Rottenstreich, Ori

AU - Kaplan, Haim

N1 - Publisher Copyright:
© 2004-2012 IEEE.

PY - 2023/12/1

Y1 - 2023/12/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 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 consider the L1 distance between partitions, which is of interest when overloaded requests are simply dropped, and we want to minimize the total loss. We prove that the Niagara algorithm (Kang et al., 2015) can be used to find the closest partition in L1 to the desired partition, that can be realized with n TCAM rules. Moreover, we prove it for arbitrary partitions, with (possibly) non-integer parts. We also include a short discussion on similarities and differences to previous work which studies the same problem but for L∞ distances.

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 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 consider the L1 distance between partitions, which is of interest when overloaded requests are simply dropped, and we want to minimize the total loss. We prove that the Niagara algorithm (Kang et al., 2015) can be used to find the closest partition in L1 to the desired partition, that can be realized with n TCAM rules. Moreover, we prove it for arbitrary partitions, with (possibly) non-integer parts. We also include a short discussion on similarities and differences to previous work which studies the same problem but for L∞ distances.

KW - Load balancing

KW - TCAM

KW - traffic splitting

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

U2 - 10.1109/TNSM.2023.3285749

DO - 10.1109/TNSM.2023.3285749

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

AN - SCOPUS:85162646895

SN - 1932-4537

VL - 20

SP - 4283

EP - 4296

JO - IEEE Transactions on Network and Service Management

JF - IEEE Transactions on Network and Service Management

IS - 4

M1 - 3285749

ER -