Algorithms and Throughput Analysis for MDS-Coded Switches

TL;DR

This paper explores the use of MDS coding in network switches to enhance read throughput, analyzing algorithms for maximizing read rates based on packet requests and memory layout, with a focus on the impact of writing policies.

Contribution

It provides a detailed analysis of algorithms for optimizing read throughput in MDS-coded switches and examines how writing policies affect complexity and performance.

Findings

Optimal read rate algorithms depend on writing policies.

Complexity varies significantly with different coding and layout strategies.

MDS coding can improve switch throughput if managed effectively.

Abstract

Network switches and routers need to serve packet writes and reads at rates that challenge the most advanced memory technologies. As a result, scaling the switching rates is commonly done by parallelizing the packet I/Os using multiple memory units. For improved read rates, packets can be coded with an [n,k] MDS code, thus giving more flexibility at read time to achieve higher utilization of the memory units. In the paper, we study the usage of [n,k] MDS codes in a switching environment. In particular, we study the algorithmic problem of maximizing the instantaneous read rate given a set of packet requests and the current layout of the coded packets in memory. The most interesting results from practical standpoint show how the complexity of reaching optimal read rate depends strongly on the writing policy of the coded packets.