On emulating hardware/software co-designed control algorithms for packet switches

Hardware accelerators in networking systems for control algorithms offer a promising approach to scale performance. To that end, several research efforts have been devoted to verify a hardware version of complex control algorithms but only for small-scale hardware unit tests. In this paper we propose and evaluate an emulation framework, in which such control algorithm accelerators can be integrated to design a packet switch, able both to forward real traffic and to enable extensive experimental evaluation and demonstration scenarios. As a case study, we have integrated in the proposed framework a Belief-Propagation-driven algorithm accelerator for multicast packet scheduling.

[1]  Paolo Giaccone,et al.  A belief-propagation approach for multicast scheduling in input-queued switches , 2013, 2013 IEEE International Conference on Communications Workshops (ICC).

[2]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[3]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[4]  Paolo Giaccone,et al.  Belief-Propagation-Assisted Scheduling in Input-Queued Switches , 2010, IEEE Transactions on Computers.

[5]  Marco Ajmone Marsan,et al.  Multicast traffic in input-queued switches: optimal scheduling and maximum throughput , 2003, TNET.

[6]  Ada Gavrilovska,et al.  ShareStreams-V: A Virtualized QoS Packet Scheduling Accelerator , 2008, 2008 16th International Symposium on Field-Programmable Custom Computing Machines.

[7]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[8]  Nick McKeown,et al.  NetFPGA: A Tool for Network Research and Education , 2006 .

[9]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.