Penn Logo
Vertical Line

Implementation of Computation Group


In-network Computing to the Rescue of Faulty Links

Hans Giesen, Anirudh Chelluri, Lei Shi, Nishanth Prabhu, Anthony J. McAuley, John Sonchack, Nik Sultana, Alexander Poylisher, Latha Kant, André DeHon, and Boon Thau Loo.
Proceedings of the ACM SIGCOMM Workshop on In-Network Computing, (NetCompute, August 20, 2018)

Failing network links are usually disabled, and packets are routed around them until the links are repaired. While it is often possible to utilize some of a failing link's capacity, losing what remains of a link's capacity is typically deemed preferable to the erratic effect that unreliable links can have on application-level behavior.

We describe a new network function that relies on in-network computing to limit the erratic effect of failing network links, to enable the continued use of those links until they can be repaired. We explore the design space using ns-3, and evaluate our implemen- tation on a physical test-bed that includes programmable switches and reconfigurable hardware. Our current hardware prototype can almost saturate a 10GbE link while using around 10% of our FPGA's resources.

Copyright Giesen, et al. 2018. Publication rights licensed to ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution.

Room# 315, 200 South 33rd Street, Electrical and Systems Engineering Department, Philadelphia, University of Pennsylvania, PA 19104.