Bridging the gap between theory and practice for distributed graph algorithms

我在欧洲逗留期间，我们的项目取得了很大进展。在实践方面，我们在P4交换机上实现了许多理论原语（扳手、同步器、生成树），并检查了它们在处理数据中心网络故障方面的效率。我们考虑的主要问题是时钟同步和组播。我们表明，使用我们的技术可以比其他技术更快地从故障中恢复。在理论方面，我们定义了具有有限内存的分布式计算的理论模型。我们相信，这种双向的方法将大大增加理论与网络社区之间的交流。

During my stay in Europe we achieved great progress in the project. On the practical side, we implemented many theory primitives (spanners, synchronizers, spanning trees) on P4 switches and checked their efficiency at handling failures in datacenter networks. The main problems we considered are clock synchronization and multicast. We show that using our techniques we can recover from failures considerably faster than other techniques.On the theory side we defined a theoretical model for distributed computation with bounded memory. We believe that this two way approach will greatly increase the communication between the theory and networking community.