检索结果-内蒙古大学图书馆

10th International Symposium on Advanced Topics in Electrical Engineering (ATEE)

作者： Maila, Gelal Marius, Iordache Victor, Croitoru Univ Politehn Bucharest Romania Orange Romania Bucharest Romania

One of the main goals of the network was to obtain a perfect balance between the network optimization and the central intelligence. However the service providers desired a more simplified and optimized IP network, wit... 详细信息

ISBN: (纸本)9781509051601

关键词： segment routing MPLS SDN

来源：评论

学校读者我要写书评

暂无评论

segment routing for WSN using hybrid optimization with energy-efficient game theory-based clustering technique

引用

AUTOMATIKA 2025年第1期66卷 24-42页

作者： Sangeetha, S. Victoire, T. Aruldoss Albert Premkumar, M. Sowmya, R. Karpagam Coll Engn Comp Sci & Engn Coimbatore India Anna Univ Reg Campus Elect & Elect Engn Coimbatore India Dayananda Sagar Coll Engn Dept Elect & Elect Engn Bengaluru India Manipal Acad Higher Educ Manipal Inst Technol Dept Elect & Elect Engn Manipal 576104 Karnataka India

This research focuses on Wireless Sensor Networks (WSNs) and proposes a three-phase approach to achieve energy-efficient routing. The approach consists of node deployment using Voronoi diagrams, clustering, and Cluster Head (CH) selection using energy-efficient game theory, and a routing strategy based on Improved Pelican Optimization (ImPe) segment routing. Random deployment of sensor nodes in WSNs can lead to coverage issues, and hence, in order to address this, Voronoi-based node deployment is employed to ensure uniform and balanced coverage of the monitoring area. An energy-efficient game theory-based approach is used for CH selection by considering the energy levels to select CHs for enhancing network longevity. The proposed routing mechanism utilizes segment routing, which provides deterministic routing paths from CHs to the sink (Base Station). segment routing eliminates the need for route discovery and maintenance, making it energy-efficient. The ImPe algorithm that works on the characteristics of pelican search agents is employed to choose the optimal segment path for information sharing. The assessment based on delay, network lifetime, packet delivery ratio, residual energy, throughput, communication overhead, and energy utilization acquired the values of 2.57, 98.59, 98.29, 0.98, 238.51, 7.71, and 0.02 respectively.

关键词： segment routing game theory-based clustering hybrid optimization improved pelican algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

SNS: Smart Node Selection for Scalable Traffic Engineering in segment routing Networks

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2025年第1期22卷 92-106页

作者： Wang, Linghao Lu, Lu Wang, Miao Li, Zhiqiang Yang, Hongwei Zhu, Shuyong Zhang, Yujun Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing 101408 Peoples R China China Mobile Res Inst Dept Basic Network Technol Beijing 10053 Peoples R China Nanjing Inst InforSuperBahn Nanjing 211167 Peoples R China Jiangsu Future Networks Innovat Inst Nanjing 211111 Peoples R China

segment routing (SR) is an emerging architecture that can benefit traffic engineering (TE). Nowadays, TE in SR networks (SR-TE) is often solved as an optimization problem to optimize network performance such as link utilization. As network size grows rapidly, implementing SR-TE suffers from scalability issues, including long computation time, high control overhead and expensive deployment cost. In this paper, we propose Smart Node Selection (SNS), a scalable SR-TE method with learning-based node selection (NS). NS is a recently proposed technique for reducing computation time of SR-TE. It first selects a subset of nodes as candidate intermediate nodes to route traffic, then builds linear programming (LP) models that can be solved efficiently. However, existing NS methods use simple heuristics and consider only network topology, which may lead to unsatisfying network performance. To address this problem, we for the first time formulates NS as a reinforcement learning task, which learns a selection policy to achieve better trade-offs between TE performance and computation time, considering both topology and traffic. Besides, we extend NS with additional selection policies and a customized training algorithm, making it a unified framework for scalable SR-TE, which reduces not only computation time, but also control overhead and deployment cost. Performance evaluations on various real-world topologies and traffic matrices show that SNS significantly reduces computation time and control overhead of existing LP models while offering good network performance, and can also be used in partially deployed SR networks to reduce deployment cost.

关键词： Scalability routing Costs Computational modeling Network topology Task analysis Topology Traffic engineering segment routing reinforcement learning routing optimization

来源：评论

学校读者我要写书评

暂无评论

AutoSRv6: Configuration Synthesis for segment routing Over IPv6

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2025年第2期43卷 473-483页

作者： Liang, Bocheng Li, Fuliang Zheng, Naigong Wang, Xingwei Cao, Jiannong Northeastern Univ Dept Comp Sci & Engn Shenyang 110819 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

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.

关键词： routing Protocols routing protocols Multiprotocol label switching Indexes Complexity theory Telemetry Scalability IP networks Hardware Network management segment routing configuration synthesis IPv6

来源：评论

学校读者我要写书评

暂无评论

Leveraging duality for the gamma-robust segment routing traffic engineering problem

引用

DISCRETE APPLIED MATHEMATICS 2025年 364卷 199-212页

作者： Callebaut, Hugo De Boeck, Jerome Fortz, Bernard Univ Libre Bruxelles Dept Informat B-1050 Brussels Belgium Univ Liege HEC Liege Management Sch B-4000 Liege Belgium Inria INOCS F-59650 Villeneuve Dascq France

segment routing (SR), a modern network architecture enhancing traffic engineering, offers flexibility by allowing traffic to be routed through intermediate nodes or links. This paper addresses the challenge of optimizing routing in uncertain traffic distribution scenarios. Rather than relying on a single traffic matrix for optimization, we take a unique approach, considering an infinite set of matrices defined by linear constraints. Our goal is to optimize routing strategies under the worst-case scenario within this set. Through novel formulations, we achieve significant improvements in optimization speed compared to traditional methods that explore all extreme points or use iterative constraint generation for these matrices. This research contributes to the field by enhancing the robustness of SR-based traffic engineering, an area previously explored using different methodologies. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： segment routing Traffic engineering Robust optimization Mixed integer linear problem

来源：评论

学校读者我要写书评

暂无评论

Accelerating traffic engineering optimization for segment routing: A recommendation perspective

引用

COMPUTER NETWORKS 2025年 264卷

作者： Wang, Linghao Wang, Miao Lin, Chungang Zhang, Yujun Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100190 Peoples R China

Traffic engineering (TE) is important for improving network performance. Recently, segment routing (SR) has gained increasing attention in the TE field. Many segment routing traffic engineering (SR-TE) methods compute optimal routing policies by solving linear programming (LP) problems, which suffer from high computation time. Therefore, various methods have been proposed for accelerating TE optimization. However, prior methods solve individual TE optimization problems from scratch, overlooking valuable information from existing historical solutions. We argue that these data can imply the distribution of optimal solutions for solving future TE problems. In this paper, we provide a new perspective on accelerating SR-TE optimization. First, we generated and analyzed historical solutions of a widely used LP model, and revealed two key findings from the data: Flows are predominantly routed through a small subset of intermediate nodes;similar decisions can be made for some flows. Then, inspired by the findings, we propose RS4SR, the first framework to our knowledge leveraging historical solutions for SR-TE acceleration. It can significantly reduce the size of LP model by performing candidate recommendation and flow clustering. Experiments on real-world topologies and various traffic matrices demonstrate that a simple implementation of RS4SR is sufficient to obtain near-optimal solutions within the time limit of two seconds on large-scale networks, utilizing a small number of historical solutions.

关键词： Traffic engineering segment routing routing optimization

来源：评论

学校读者我要写书评

暂无评论

Mind the paths you choose: Speeding up segment routing-based traffic engineering with path preprocessing

引用

COMPUTER COMMUNICATIONS 2025年 238卷

作者： Brundiers, Alexander Schueller, Timmy Aschenbruck, Nils Osnabruck Univ Inst Comp Sci Friedrich Janssen Str 1 D-49069 Osnabruck Germany Deutsch Telekom Tech GmbH Wollbecker Str 268 D-48155 Munster Germany

Many state-of-the-art segment routing (SR) Traffic Engineering (TE) algorithms rely on Linear Program (LP)- based optimization. However, the poor scalability of the latter and the resulting high computation times impose severe restrictions on the practical usability of such approaches for many use cases. A promising way to address these issues is to preemptively limit the number of SR paths considered during optimization by employing certain preprocessing strategies. In the first part of this paper, we conduct an extensive literature review of such preprocessing approaches together with a large-scale comparative performance study on a plethora of real-world topologies, including recent data from a Tier-1 Internet Service Provider (ISP). In the second part, we then use the insights gained from the former study to develop a novel combined preprocessing approach which also guarantees to not interfere with the satisfiability of practically important latency bound constraints. Our approach is able to reduce the number of SR paths to consider during optimization by as much as 97%-99%, while still allowing to achieve close to optimal solutions. This facilitates an around 10x speedup for different LP-based SR TE algorithms, which is more than twice as good as what is achievable with any of the previously existing methods. Finally, we also study the applicability of the path preprocessing paradigm to the use case of tactical TE, showing that it facilitates an around 37% speedup in this context as well. All in all, this constitutes a major improvement over the current state-of-the-art and further facilitates the reliable use of LP-based TE optimization for large segment-routed networks.

关键词： Traffic engineering segment routing Optimization Performance

来源：评论

学校读者我要写书评

暂无评论

segment routing

Segment Routing

引用

International Symposium on Advanced Topics in Electrical Engineering

作者： Gelal Maila Iordache Marius Croitoru Victor University of Politehnica Bucharest Orange Romania

关键词： segment routing MPLS SDN

来源：评论

学校读者我要写书评

暂无评论

Multitopology routing With Virtual Topologies and segment routing

引用

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT 2025年第1期35卷

作者： Huin, Nicolas Martin, Sebastien Leguay, Jeremie IMT Atlantique IRISA UMR CNRS 6074 Rennes France Huawei Technol Ltd Paris Res Ctr Paris France

Multitopology routing (MTR) provides an attractive alternative to segment routing (SR) for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and the need to frequently update link weights to follow evolving network conditions, MTR is often limited to a small number of topologies and the satisfaction of loose QoS constraints. To overcome these limitations, we propose virtual MTR (vMTR), an MTR extension where demands are routed over virtual topologies that are silent;that is, they do not exchange LSA messages and that are continuously derived from a very limited set of real topologies, optimizing each QoS parameter. In this context, we present a polynomial and exact algorithm for vMTR and, as a benchmark, a local search algorithm for MTR. We show that vMTR helps to reduce drastically the number of real topologies and that it is more robust to QoS changes. In the case where SR can actually be rolled-out, we also show that vMTR allows to drastically reduce SR overhead.

关键词： multitopology routing quality of service segment routing traffic engineering

来源：评论

学校读者我要写书评

暂无评论

Fast Reroute Mechanism for Satellite Networks Based on segment routing and Dual Timers Switching

引用

AEROSPACE 2025年第3期12卷 233-233页

作者： Du, Jinyan Zhang, Ran Hu, Jiangbo Xia, Tian Liu, Jiang China United Network Commun Grp Co Ltd Beijing 100033 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China

Low-Earth-Orbit (LEO) satellite networks have the advantage of global internet coverage and low latency, and they have enjoyed great success in the past few years. In LEO satellite networks, laser-based inter-satellite links (ISLs) are widely employed to achieve on-board data relay, and further to provide high-capacity backhaul worldwide. However, ISLs are prone to break due to the outage of the ISL capturing, tracking, and aiming systems. Meanwhile, breaks caused by different reasons can last from milliseconds to hours. The hybrid ISL fault leads to the on-board routing protocol to flap frequently, thus causing high routing overheads, low convergence speed, and degraded service consistency. In this work, we propose a hybrid fault detection mechanism to identify transient and long-term ISL outage. Further, for transient link outage, the segment routing-based loop-free backup path is adopted to provide real-time transmission recovery, and precise global route convergence is adopted to restore the long-term routing failure. For the inconsistent routing table switch between the phase from transient to long-term fault, we propose a dual timer mechanism to make sure the path can be smoothly switched without micro-loops. Simulation results validate the feasibility and efficiency of the proposed scheme.

关键词： segment routing fast rerouting dual-timer mechanism backup path design LEO satellite networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：