TY - GEN

T1 - Optimal Representations of a Traffic Distribution in Switch Memories

AU - Sadeh, Yaniv

AU - Rottenstreich, Ori

AU - Barkan, Arye

AU - Kanizo, Yossi

AU - Kaplan, Haim

N1 - Publisher Copyright:
© 2019 IEEE.

PY - 2019/4

Y1 - 2019/4

N2 - Traffic splitting is a required functionality in networks, for example for load balancing over multiple paths or among different servers. The capacity of each server or path implies the distribution 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 hungry and are often also required for other tasks such as classification and routing. For splitting a universe of 2W addresses into k pieces of particular sizes, we give a simple algorithm that computes an optimal representation in Owk time. Furthermore, we prove that a recently published load balancer, called Niagara, which also runs in O(wk) time is in fact optimal. That is, both our algorithm and Niagara produce the smallest possible TCAM that splits the traffic exactly to the required pieces, where the only previously known algorithm for computing optimal exact representation has running time exponential in k. Finally, we rely on our optimal O(wk) runtime algorithm to investigate through extensive experiments the amount of TCAM memory required to represent traffic splitting in typical scenarios.

AB - Traffic splitting is a required functionality in networks, for example for load balancing over multiple paths or among different servers. The capacity of each server or path implies the distribution 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 hungry and are often also required for other tasks such as classification and routing. For splitting a universe of 2W addresses into k pieces of particular sizes, we give a simple algorithm that computes an optimal representation in Owk time. Furthermore, we prove that a recently published load balancer, called Niagara, which also runs in O(wk) time is in fact optimal. That is, both our algorithm and Niagara produce the smallest possible TCAM that splits the traffic exactly to the required pieces, where the only previously known algorithm for computing optimal exact representation has running time exponential in k. Finally, we rely on our optimal O(wk) runtime algorithm to investigate through extensive experiments the amount of TCAM memory required to represent traffic splitting in typical scenarios.

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

U2 - 10.1109/INFOCOM.2019.8737645

DO - 10.1109/INFOCOM.2019.8737645

M3 - פרסום בספר כנס

AN - SCOPUS:85068216268

T3 - Proceedings - IEEE INFOCOM

SP - 2035

EP - 2043

BT - INFOCOM 2019 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 29 April 2019 through 2 May 2019

ER -