Bocheng Liang;Fuliang Li;Naigong Zheng;Xingwei Wang;Jiannong Cao
{"title":"AutoSRv6: Configuration Synthesis for Segment Routing Over IPv6","authors":"Bocheng Liang;Fuliang Li;Naigong Zheng;Xingwei Wang;Jiannong Cao","doi":"10.1109/JSAC.2025.3528808","DOIUrl":null,"url":null,"abstract":"Segment Routing over IPv6 (SRv6) is an innovative and adaptable source routing technique that enhances interconnection services. It plays a pivotal role in next-generation networking technologies, providing crucial support for network telemetry, computing power networks, and related technologies. The end-to-end connectivity capability of SRv6 is highly regarded by ISPs, driving its widespread deployment in networks. However, configuring an SRv6 network can be challenging and prone to errors due to the complexity of low-level configuration languages and numerous protocol parameters. To address this issue, we present AutoSRv6, a system designed to synthesize SRv6 configurations for large, evolving networks using high-level abstractions of network topology and policies. AutoSRv6 leverages formal constraint-solving techniques and SMT solvers to compute protocol parameters and generate configuration files that align with network policies. Furthermore, AutoSRv6 incorporates a mechanism to overcome the constraints imposed by hardware, mapping the end-to-end path to a SID (Segment Identifier) sequence. We have developed a prototype of AutoSRv6 and conducted experiments on diverse network topologies, evaluating its performance with various network policies. The results show that autoSRv6 can generate the network configuration satisfying the policy, the time cost of IGP synthesis is better than the existing method, and the length of the segment list is optimized by more than 2 times.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":"43 2","pages":"473-483"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10850629/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Segment Routing over IPv6 (SRv6) is an innovative and adaptable source routing technique that enhances interconnection services. It plays a pivotal role in next-generation networking technologies, providing crucial support for network telemetry, computing power networks, and related technologies. The end-to-end connectivity capability of SRv6 is highly regarded by ISPs, driving its widespread deployment in networks. However, configuring an SRv6 network can be challenging and prone to errors due to the complexity of low-level configuration languages and numerous protocol parameters. To address this issue, we present AutoSRv6, a system designed to synthesize SRv6 configurations for large, evolving networks using high-level abstractions of network topology and policies. AutoSRv6 leverages formal constraint-solving techniques and SMT solvers to compute protocol parameters and generate configuration files that align with network policies. Furthermore, AutoSRv6 incorporates a mechanism to overcome the constraints imposed by hardware, mapping the end-to-end path to a SID (Segment Identifier) sequence. We have developed a prototype of AutoSRv6 and conducted experiments on diverse network topologies, evaluating its performance with various network policies. The results show that autoSRv6 can generate the network configuration satisfying the policy, the time cost of IGP synthesis is better than the existing method, and the length of the segment list is optimized by more than 2 times.