Optimal approximations for traffic distribution in bounded switch memories

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 TCAM necessary to implement a given partition exactly. In this paper we solve the more practical case, where at most n TCAM rules are available, restricting the ability to implement 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.

Original languageEnglish
Title of host publicationCoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies
PublisherAssociation for Computing Machinery, Inc
Pages309-322
Number of pages14
ISBN (Electronic)9781450379489
DOIs
StatePublished - 23 Nov 2020
Event16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020 - Barcelona, Spain
Duration: 1 Dec 20204 Dec 2020

Publication series

NameCoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies

Conference

Conference16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020
Country/TerritorySpain
CityBarcelona
Period1/12/204/12/20

Fingerprint

Dive into the research topics of 'Optimal approximations for traffic distribution in bounded switch memories'. Together they form a unique fingerprint.

Cite this