论文标题
弗朗西斯：开关网络协调的快速反应算法
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches
论文作者
论文摘要
优化对网络事件的反应，这在时钟同步，多播和路由等任务中至关重要，随着网络的增长而变得越来越具有挑战性。为了改善与集中解决方案相比的反应时间，该理论社区在通过消息的设计算法的设计中取得了重大进展，该算法利用所有节点用于分布式计算，并且可编程开关的出现使得现在可以实现它们。 我们提出了弗朗西斯（Francis），这是一个框架和相关库，用于在可编程开关上运行消息通讯算法。它具有原始词，可轻松整合此类算法，以快速对网络事件做出反应，同时优化资源消耗。我们使用弗朗西斯（Francis）实施事件反应解决方案，以改善时钟同步，源路由的多播以及路由并证明反应时间减少18倍。
Optimizing the reaction to network events, which is critical in tasks such as clock synchronization, multicast, and routing, becomes increasingly challenging as networks grow larger. To improve the reaction time compared to centralized solutions, the theory community has made significant progress in the design of message-passing algorithms that leverage all nodes for distributed computation, and the advent of programmable switches makes it now possible to materialize them. We propose FRANCIS, a framework and associated libraries for running message-passing algorithms on programmable switches. It features primitives that allow easy integration of such algorithms for quickly reacting to network events while optimizing resource consumption. We use FRANCIS to implement event reaction solutions that improve clock synchronization, source-routed multicast, and routing and demonstrate up to 18x reduction in reaction time.
