Placement and read algorithms for high throughput in coded network switches
Rami Cohen, Yuval Cassuto · 2016
Coded switches write incoming packets with redundancy to increase the flexibility to read them later without contention. An important question pertaining to coded switches is what policy to follow when placing the coded packets in the switch memory. We study this question by proposing two such placement policies: cyclic placement and (block-) design placement. We show that these policies offer many advantages in switching throughput, algorithmic efficiency, and analysis amenability.