多模式多任务控制平面验证框架

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Network and Service Management Pub Date : 2024-08-12 DOI:10.1109/TNSM.2024.3442298
Yuqi Dai;Hua Zhang;Jingyu Wang;Jianxin Liao
{"title":"多模式多任务控制平面验证框架","authors":"Yuqi Dai;Hua Zhang;Jingyu Wang;Jianxin Liao","doi":"10.1109/TNSM.2024.3442298","DOIUrl":null,"url":null,"abstract":"Modern networks are susceptible to configuration errors, such as misconfigurations and policy conflicts due to the complex interactions of diverse devices through various protocols. Control plane verification offers an effective solution to prevent these errors. However, existing tools face several challenges: (i) prolonged verification times, (ii) the verification of only specific policies, and (iii) poor robustness against node and link failures. To address these issues, we propose a control plane verification framework based on a multimodal multitask learning model. This framework enables simultaneous verification of multiple policies directly from various network configuration files. The learning model utilizes modality fusion techniques to capture both topology-related and traffic-related network features. It is trained on datasets augmented with the failure model to enhance robustness against failures. We compare our framework with three state-of-the-art verification tools: Minesweeper, Hoyan, and Tiramisu. Our evaluation shows that our framework is 2600 times faster than Minesweeper, twice as fast as Hoyan, and 19 times faster than Tiramisu, while maintaining 100% verification accuracy. Furthermore, our framework excels in verifying traffic-related network policies and remains effective even under node and link failures.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6684-6702"},"PeriodicalIF":4.7000,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multimodal Multitask Control Plane Verification Framework\",\"authors\":\"Yuqi Dai;Hua Zhang;Jingyu Wang;Jianxin Liao\",\"doi\":\"10.1109/TNSM.2024.3442298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Modern networks are susceptible to configuration errors, such as misconfigurations and policy conflicts due to the complex interactions of diverse devices through various protocols. Control plane verification offers an effective solution to prevent these errors. However, existing tools face several challenges: (i) prolonged verification times, (ii) the verification of only specific policies, and (iii) poor robustness against node and link failures. To address these issues, we propose a control plane verification framework based on a multimodal multitask learning model. This framework enables simultaneous verification of multiple policies directly from various network configuration files. The learning model utilizes modality fusion techniques to capture both topology-related and traffic-related network features. It is trained on datasets augmented with the failure model to enhance robustness against failures. We compare our framework with three state-of-the-art verification tools: Minesweeper, Hoyan, and Tiramisu. Our evaluation shows that our framework is 2600 times faster than Minesweeper, twice as fast as Hoyan, and 19 times faster than Tiramisu, while maintaining 100% verification accuracy. Furthermore, our framework excels in verifying traffic-related network policies and remains effective even under node and link failures.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"21 6\",\"pages\":\"6684-6702\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10634210/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10634210/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

现代网络由于不同设备之间通过不同协议进行复杂的交互,容易出现配置错误、策略冲突等问题。控制平面验证为防止这些错误提供了有效的解决方案。然而,现有的工具面临着几个挑战:(i)验证时间延长,(ii)只验证特定的策略,以及(iii)对节点和链路故障的鲁棒性差。为了解决这些问题,我们提出了一个基于多模态多任务学习模型的控制平面验证框架。该框架支持直接从各种网络配置文件同时验证多个策略。该学习模型利用模态融合技术捕获拓扑相关和流量相关的网络特征。它在增强了故障模型的数据集上进行训练,以增强对故障的鲁棒性。我们将我们的框架与三种最先进的验证工具进行比较:扫雷器、Hoyan和提拉米苏。我们的评估表明,我们的框架比扫雷快2600倍,比Hoyan快2倍,比提拉米苏快19倍,同时保持100%的验证准确性。此外,我们的框架在验证流量相关的网络策略方面表现出色,即使在节点和链路故障的情况下仍然有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multimodal Multitask Control Plane Verification Framework
Modern networks are susceptible to configuration errors, such as misconfigurations and policy conflicts due to the complex interactions of diverse devices through various protocols. Control plane verification offers an effective solution to prevent these errors. However, existing tools face several challenges: (i) prolonged verification times, (ii) the verification of only specific policies, and (iii) poor robustness against node and link failures. To address these issues, we propose a control plane verification framework based on a multimodal multitask learning model. This framework enables simultaneous verification of multiple policies directly from various network configuration files. The learning model utilizes modality fusion techniques to capture both topology-related and traffic-related network features. It is trained on datasets augmented with the failure model to enhance robustness against failures. We compare our framework with three state-of-the-art verification tools: Minesweeper, Hoyan, and Tiramisu. Our evaluation shows that our framework is 2600 times faster than Minesweeper, twice as fast as Hoyan, and 19 times faster than Tiramisu, while maintaining 100% verification accuracy. Furthermore, our framework excels in verifying traffic-related network policies and remains effective even under node and link failures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
期刊最新文献
Table of Contents Table of Contents Guest Editors’ Introduction: Special Issue on Robust and Resilient Future Communication Networks A Novel Adaptive Device-Free Passive Indoor Fingerprinting Localization Under Dynamic Environment HSS: A Memory-Efficient, Accurate, and Fast Network Measurement Framework in Sliding Windows
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1