Scheduling multicast traffic in input-queued switches to maximize throughput requires solving a hard combinatorial optimization problem in a very short time. This task advocates the design of algorithms that are simple to implement and efficient in terms of performance. We propose a new scheduling algorithm, based on message passing and inspired by the belief propagation paradigm, meant to approximate the provably-optimal scheduling policy for multicast traffic. We design and implement both a software and a hardware version of the algorithm, the latter running on a NetFPGA. We compare the performance and the power consumption of the two versions when integrated in a software router. Our main findings are that our algorithm outperforms other centralized greedy scheduling policies, achieving a better tradeoff between complexity and performance, and it is amenable to practical high-performance implementations.
|Titolo:||Design and implementation of a belief-propagation scheduler for multicast traffic in input-queued switches|
|Data di pubblicazione:||2017|
|Digital Object Identifier (DOI):||10.1016/j.comcom.2017.01.002|
|Appare nelle tipologie:||1.1 Articolo in rivista|