arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.00991cs.NI
收藏

可变数据路径网络的可达性

Verifying Reachability in Networks with Mutable Datapaths

Aurojit Panda, Ori Lahav, Katerina Argyraki, Mooly Sagiv, Scott Shenker

摘要:

最近的工作在验证网络转发正确性方面取得了很大的进展。然而,这些方法不能用于验证包含中间盒的网络,例如缓存和防火墙,其转发行为取决于先前观察到的流量。我们将探讨如何验证网络的可达性属性,包括这样的“可变数据路径”的元素。我们希望我们的验证结果不仅适用于给定的网络,而且适用于存在故障的情况。主要的挑战在于扩展处理大型复杂网络的方法,我们通过开发和利用切片的概念来解决这个问题,它允许网络范围的验证只需要分析网络的一小部分。我们表明,切片验证许多生产网络上的不变量所需的时间是独立的网络本身的大小。

英文摘要:

Recent work has made great progress in verifying the forwarding correctness of networks . However, these approaches cannot be used to verify networks containing middleboxes, such as caches and firewalls, whose forwarding behavior depends on previously observed traffic. We explore how to verify reachability properties for networks that include such "mutable datapath" elements. We want our verification results to hold not just for the given network, but also in the presence of failures. The main challenge lies in scaling the approach to handle large and complicated networks, We address by developing and leveraging the concept of slices, which allow network-wide verification to only require analyzing small portions of the network. We show that with slices the time required to verify an invariant on many production networks is independent of the size of the network itself.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑