VERCEL: Verification and Rectification of Configuration Errors With Least Squares

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Abhiram Singh;Sidharth Sharma;Ashwin Gumaste
{"title":"VERCEL: Verification and Rectification of Configuration Errors With Least Squares","authors":"Abhiram Singh;Sidharth Sharma;Ashwin Gumaste","doi":"10.1109/TNET.2024.3422035","DOIUrl":null,"url":null,"abstract":"We present Vercel, a network verification and automatic fault rectification tool that is based on a computationally tractable, algorithmically expressive, and mathematically aesthetic domain of linear algebra. Vercel works on abstracting out packet headers into standard basis vectors that are used to create a port-specific forwarding matrix \n<inline-formula> <tex-math>$\\mathcal {A}$ </tex-math></inline-formula>\n, representing a set of packet headers/prefixes that a router forwards along a port. By equating this matrix \n<inline-formula> <tex-math>$\\mathcal {A}$ </tex-math></inline-formula>\n and a vector b (that represents the set of all headers under consideration), we are able to apply least squares (which produces a column rank agnostic solution) to compute which headers are reachable at the destination. Reachability now simply means evaluating if vector b is in the column space of \n<inline-formula> <tex-math>$\\mathcal {A}$ </tex-math></inline-formula>\n, which can efficiently be computed using least squares. Further, the use of vector representation and least squares opens new possibilities for understanding network behavior. For example, we are able to map rules, routing policies, what-if scenarios to the fundamental linear algebraic form, \n<inline-formula> <tex-math>$\\mathcal {A}x=b$ </tex-math></inline-formula>\n, as well as determine how to configure forwarding tables appropriately. We show Vercel is faster than the state-of-art such as NetPlumber, Veriflow, APKeep, AP Verifier, when measured over diverse datasets. Vercel is almost as fast as Deltanet, when rules are verified in batches and provides better scalability, expressiveness and memory efficiency. A key highlight of Vercel is that while evaluating for reachability, the tool can incorporate intents, and transform these into auto-configurable table entries, implying a recommendation/correction system.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4600-4614"},"PeriodicalIF":3.0000,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/ACM Transactions on Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10731630/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

We present Vercel, a network verification and automatic fault rectification tool that is based on a computationally tractable, algorithmically expressive, and mathematically aesthetic domain of linear algebra. Vercel works on abstracting out packet headers into standard basis vectors that are used to create a port-specific forwarding matrix $\mathcal {A}$ , representing a set of packet headers/prefixes that a router forwards along a port. By equating this matrix $\mathcal {A}$ and a vector b (that represents the set of all headers under consideration), we are able to apply least squares (which produces a column rank agnostic solution) to compute which headers are reachable at the destination. Reachability now simply means evaluating if vector b is in the column space of $\mathcal {A}$ , which can efficiently be computed using least squares. Further, the use of vector representation and least squares opens new possibilities for understanding network behavior. For example, we are able to map rules, routing policies, what-if scenarios to the fundamental linear algebraic form, $\mathcal {A}x=b$ , as well as determine how to configure forwarding tables appropriately. We show Vercel is faster than the state-of-art such as NetPlumber, Veriflow, APKeep, AP Verifier, when measured over diverse datasets. Vercel is almost as fast as Deltanet, when rules are verified in batches and provides better scalability, expressiveness and memory efficiency. A key highlight of Vercel is that while evaluating for reachability, the tool can incorporate intents, and transform these into auto-configurable table entries, implying a recommendation/correction system.
VERCEL:用最小二乘验证和纠正配置错误
我们提出了Vercel,一种网络验证和自动故障纠正工具,它基于线性代数的计算易于处理,算法表达和数学美学领域。Vercel致力于将包头抽象为标准基向量,用于创建端口特定的转发矩阵$\mathcal {a}$,表示路由器沿端口转发的一组包头/前缀。通过将这个矩阵$\mathcal {A}$和向量b(表示正在考虑的所有标头的集合)相等,我们能够应用最小二乘(它产生列秩不可知的解决方案)来计算哪些标头在目的地是可到达的。可达性现在仅仅意味着计算向量b是否在$\mathcal {A}$的列空间中,这可以用最小二乘法有效地计算出来。此外,向量表示和最小二乘的使用为理解网络行为开辟了新的可能性。例如,我们能够将规则,路由策略,假设场景映射到基本的线性代数形式,$\mathcal {A}x=b$,以及确定如何适当地配置转发表。我们表明,在不同的数据集上进行测量时,Vercel比NetPlumber、Veriflow、APKeep、AP Verifier等最先进的技术更快。Vercel几乎和Deltanet一样快,当规则被批量验证时,它提供了更好的可扩展性、表现力和内存效率。Vercel的一个关键亮点是,在评估可达性时,该工具可以合并意图,并将其转换为自动配置的表项,这意味着一个推荐/纠正系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking 工程技术-电信学
CiteScore
8.20
自引率
5.40%
发文量
246
审稿时长
4-8 weeks
期刊介绍: The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking, covering all sorts of information transport networks over all sorts of physical layer technologies, both wireline (all kinds of guided media: e.g., copper, optical) and wireless (e.g., radio-frequency, acoustic (e.g., underwater), infra-red), or hybrids of these. The journal welcomes applied contributions reporting on novel experiences and experiments with actual systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信