FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches

04/29/2022
by   Wenchen Han, et al.
0

Distributed protocols are widely used to support network functions such as clock synchronization and multicast. As the network gets larger and faster, it is increasingly challenging for these protocols to react quickly to network events. The theory community has made significant progress in developing distributed message passing algorithms with improved convergence times. With the emerging programmability at switches, it now becomes feasible to adopt and adapt these theoretical advances for networking functions. In this paper, we propose FRANCIS, a new framework for running message passing algorithms on programmable switches to enable fast reactions to network events in large networks. We introduce an execution engine with computing and communication primitives for supporting message passing algorithms in P4 switches. We exemplify the framework's usefulness by improving the resiliency and reaction times of clock synchronization and source-routed multicast. In particular, our approach allows lower clock drift than Sundial and PTP, quickly recovers from multiple failures, and reduces the time uncertainty bound by up to 5x. Compared with state-of-the-art multicast solutions, our approach uses packet headers up to 33% smaller and has an order of magnitude faster reaction time.

READ FULL TEXT
research
09/05/2017

Trace-Based Run-time Analysis of Message-Passing Go Programs

We consider the task of analyzing message-passing programs by observing ...
research
07/10/2018

Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks

Understanding the run-time behavior of concurrent programs is a challeng...
research
11/21/2018

Encryption is Futile: Delay Attacks on High-Precision Clock Synchronization

Clock synchronization has become essential to modern societies since man...
research
12/05/2022

TIDE: Time Derivative Diffusion for Deep Learning on Graphs

A prominent paradigm for graph neural networks is based on the message p...
research
03/18/2022

Peaceable Self-Stabilizing Byzantine Pulse Synchronization

For reaching fast and efficient self-stabilizing Byzantine pulse synchro...
research
10/24/2019

Fast and Differentiable Message Passing for Stereo Vision

Despite the availability of many Markov Random Field (MRF) optimization ...
research
12/21/2017

Practically-Self-Stabilizing Vector Clocks in the Absence of Execution Fairness

Vector clock algorithms are basic wait-free building blocks that facilit...

Please sign up or login with your details

Forgot password? Click here to reset