Computer Communications最新文献_第2页

Multi-agent reinforcement learning with graph representation for green edge–cloud computation offloading 基于图表示的多智能体强化学习绿色边缘云计算卸载

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-23 DOI: 10.1016/j.comcom.2025.108176

Yifan Bo , Jinghan Feng , Shou Zhang , Biao Leng

{"title":"Multi-agent reinforcement learning with graph representation for green edge–cloud computation offloading","authors":"Yifan Bo , Jinghan Feng , Shou Zhang , Biao Leng","doi":"10.1016/j.comcom.2025.108176","DOIUrl":"10.1016/j.comcom.2025.108176","url":null,"abstract":"<div><div>Edge–Cloud Computing (ECC) stands as a widely adopted distributed computing architecture that facilitates the offloading of computation-intensive tasks from Internet of Things (IoT) devices to edge servers. The growing emphasis on energy conservation and environmental protection raises the concerns of green edge–cloud computation offloading technology. However, conventional computation offloading methods have difficulties in making real-time offloading decisions and adapting to dynamic environmental changes, such as the communication channels. In response to these challenges, we propose a multi-agent reinforcement learning method with graph representation to address the edge–cloud computing offloading schedule problem. Our approach constructs a multi-agent computation offloading reinforcement learning scenario and utilizes graph neural networks to represent the connectivity features between devices and edge servers. Experimental results demonstrate that our proposed method outperforms other algorithms in reducing system energy consumption and response delay. Furthermore, the time-consuming of our approach is significantly shorter compared to heuristic genetic algorithms, with a reduction of 10–20 times.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108176"},"PeriodicalIF":4.5,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimizing virtual payment channel establishment in the face of on-path adversaries 面对路径上的对手，优化虚拟支付通道的建立

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-22 DOI: 10.1016/j.comcom.2025.108155

Lukas Aumayr , Esra Ceylan , Yannik Kopyciok , Matteo Maffei , Pedro Moreno-Sanchez , Iosif Salem , Stefan Schmid

{"title":"Optimizing virtual payment channel establishment in the face of on-path adversaries","authors":"Lukas Aumayr , Esra Ceylan , Yannik Kopyciok , Matteo Maffei , Pedro Moreno-Sanchez , Iosif Salem , Stefan Schmid","doi":"10.1016/j.comcom.2025.108155","DOIUrl":"10.1016/j.comcom.2025.108155","url":null,"abstract":"<div><div>Payment channel networks (PCNs) are among the most promising solutions to the scalability issues in permissionless blockchains, allowing parties to pay each other off-chain through a path of payment channels (PCs). However, the cost of routing transactions is proportional to the number of intermediaries since each charges a fee. Analogous to other networks, malicious intermediaries on the path can lead to security/privacy threats. Virtual channels (VCs), i.e., bridges over PC paths, mitigate the above PCN issues: Intermediaries participate only in the VC setup but in no future VC payments. However, creating a VC has a cost that must be paid out of the bridged PCs’ balance. Currently, we are missing guidelines on how/where to set up VCs. Ideally, VCs should minimize transaction costs while mitigating security and privacy threats from on-path adversaries.</div><div>In this work, we address for the first time the VC setup problem, formalizing it as an optimization problem. We present an integer linear program (ILP) computing the globally optimal VC setup strategy in terms of cost, security, and privacy. We accompany this expensive ILP with a fast, greedy algorithm. Our model and algorithms can be used with any on-path adversary whose strategy can be expressed as a set of corrupted nodes. We evaluate the greedy algorithm over a snapshot of the Lightning Network (LN), the largest Bitcoin-based PCN. Our results confirm that the greedy strategy minimizes costs while protecting against security and privacy threats and may serve the LN community as guidelines for VC deployment.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108155"},"PeriodicalIF":4.5,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143865000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Modeling and performance analysis of slotted ALOHA with interference cancellation for mMTC mMTC干扰消除的开槽ALOHA建模与性能分析

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-22 DOI: 10.1016/j.comcom.2025.108177

Yuki Ichimura , Shigeo Shioda , Takeshi Hirai

{"title":"Modeling and performance analysis of slotted ALOHA with interference cancellation for mMTC","authors":"Yuki Ichimura , Shigeo Shioda , Takeshi Hirai","doi":"10.1016/j.comcom.2025.108177","DOIUrl":"10.1016/j.comcom.2025.108177","url":null,"abstract":"<div><div>We propose an analytical model to evaluate the performance of slotted ALOHA with NOMA for mMTC under the assumption that base stations and devices are distributed according to mutually independent stationary point processes. For NOMA, we consider a simple scenario in which perfect interference cancellation can be conducted at each base station. As performance metrics, we focus on the probability of a device successfully transmitting data to the nearest base station (transmission success probability) and the expected number of devices from which a base station can correctly decode the signals (throughput of base station). We establish analytical expressions for the two performance metrics for three schemes: simple slotted ALOHA, slotted ALOHA with interference cancellation, and slotted ALOHA with power control. Through several numerical experiments, we show that the application of interference cancellation improves the throughput by up to 20%; however, the application of interference cancellation does not solve the near-far problem. We also show that the application of power control solves the near-far problem but significantly degrades the performance of slotted ALOHA.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108177"},"PeriodicalIF":4.5,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143881544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

KPI-aware service provisioning for remote industrial control systems management 面向远程工业控制系统管理的kpi感知服务提供

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-18 DOI: 10.1016/j.comcom.2025.108191

Albert Pagès, Enric Guasch, Fernando Agraz, Salvatore Spadaro

{"title":"KPI-aware service provisioning for remote industrial control systems management","authors":"Albert Pagès, Enric Guasch, Fernando Agraz, Salvatore Spadaro","doi":"10.1016/j.comcom.2025.108191","DOIUrl":"10.1016/j.comcom.2025.108191","url":null,"abstract":"<div><div>The advent of B5G/6G communication infrastructures answers to the requirements posed by emerging use cases and business models, such as Industry 4.0 and autonomous guided vehicles, which impose a set of highly demanding Key Performance Indicators (KPIs). In this regard, time-engineered applications are of particular importance. Said applications, while do not may impose very demanding latencies, they impose a strict control over them to ensure a deterministic service performance. This has given rise to the concept of Deterministic Networking that relies on adding deterministic capabilities to all involved network infrastructures. In general, optical networks are seen as one of the main enablers of latency and jitter-bounded communications, due to their intrinsic deterministic nature. In the framework of Industry 4.0 use cases, such capability can be exploited to enable remote control of optically interconnected smart factories, contributing this way to reduce both CAPEX and OPEX. However, the estimation of KPIs across optically interconnected smart factories/client domains and the provisioning of end-to-end (E2E) services arises several challenges. In this work, we present firstly multiple service provisioning schemas (single-vs multi-path) leveraging the capabilities of the Software Defined Networking (SDN) paradigm. Then, we provide tools and algorithms for best-case KPI estimation and resource allocation decision and analyze the impact of supporting heterogeneous KPIs into the obtained overall network performance.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108191"},"PeriodicalIF":4.5,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143859666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-Agent Proximal Policy Optimization based efficient user association and resource allocation in UAV-assisted Heterogeneous Cellular Networks 无人机辅助异构蜂窝网络中基于高效用户关联和资源分配的多智能体近端策略优化

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-17 DOI: 10.1016/j.comcom.2025.108172

Yueqian Song , Qingtian Zeng , Geng Chen , Guiyuan Yuan , Hua Duan

{"title":"Multi-Agent Proximal Policy Optimization based efficient user association and resource allocation in UAV-assisted Heterogeneous Cellular Networks","authors":"Yueqian Song , Qingtian Zeng , Geng Chen , Guiyuan Yuan , Hua Duan","doi":"10.1016/j.comcom.2025.108172","DOIUrl":"10.1016/j.comcom.2025.108172","url":null,"abstract":"<div><div>The rapid growth in wireless communication demands has placed unprecedented pressure on modern networks, particularly concerning capacity enhancement and coverage expansion. Heterogeneous Cellular Networks (HCNs), with their flexible multi-layered architecture, present a promising solution to these challenges. However, these networks face considerable complexity and resource constraints. Consequently, developing efficient User Association and Resource Allocation (UARA) schemes is essential for establishing sustainable, high-performance wireless communication systems. In this work, we establish a paradigm for an Unmanned Aerial Vehicle (UAV)-assisted HCN with multiple User Equipment (UEs). An optimization scheme for UAV deployment and UARA policy is proposed to maximize the long-term system utility while ensuring quality of service for UEs. Specifically, we employ an efficient greedy deployment algorithm to dynamically update UAV locations and maximize the coverage utility. For UARA decision-making, we introduce a dynamic non-convex mixed-integer nonlinear programming problem and model it as a partially observable Markov decision process. Subsequently, an Independent Reward-based Hybrid action space Multi-Agent Proximal Policy Optimization algorithm (IRH-MAPPO) is proposed. Additionally, we utilize a centralized training and distributed execution framework and incorporate value normalization and action masking to improve its efficiency. Experimental results demonstrate that our algorithm significantly outperforms the baselines in terms of system utility, particularly in Spectral Efficiency (SE) and Energy Efficiency (EE), which confirms its effectiveness, superiority, and scalability.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108172"},"PeriodicalIF":4.5,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143873657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

TokenGuard: A novel framework for robust access management in SDN controllers TokenGuard：一个用于SDN控制器中健壮访问管理的新框架

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-15 DOI: 10.1016/j.comcom.2025.108169

Mahmoud Elzoghbi , Hui He

{"title":"TokenGuard: A novel framework for robust access management in SDN controllers","authors":"Mahmoud Elzoghbi , Hui He","doi":"10.1016/j.comcom.2025.108169","DOIUrl":"10.1016/j.comcom.2025.108169","url":null,"abstract":"<div><div>Software-defined networks (SDNs) are increasingly popular due to their simplified network management and centralized control through an SDN controller. However, ensuring secure authentication and authorization for REST web services in SDN controllers is a critical challenge. This paper introduces TokenGuard, a novel security framework designed to enhance the protection of REST web services in SDN controllers. TokenGuard uses dynamic and unique access tokens for each REST request between network applications and the SDN controller. These tokens are generated using a specialized mathematical model, the Fractional Logistic Map (FLM), which incorporates a fixed memory length. This approach significantly improves the robustness of SDN controllers against REST replay attacks involving stolen access tokens. Extensive simulations demonstrate that TokenGuard outperforms standard and federated token-based authentication systems in terms of performance and security. Specifically, TokenGuard achieves approximately 10.5% faster response times than standard token-based systems and 78.1% faster than federated token-based systems. Additionally, TokenGuard’s content sizes are 1.95% smaller than standard token-based systems and 35.28% smaller than federated token-based systems. Moreover, TokenGuard handles requests per second 1.03 times more efficiently than standard token-based systems and 4.82 times more efficiently than federated token-based systems. By employing dynamic access token sequences, TokenGuard significantly mitigates the risks associated with token replay attacks and stolen access tokens, offering a substantial security advantage over the static single-token mechanisms used in traditional systems. This paper also addresses the challenges and limitations of current SDN controllers and highlights how TokenGuard fills these gaps. Practical aspects of deploying TokenGuard in real-world SDN environments are discussed, including its scalability, performance impact, and interoperability.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108169"},"PeriodicalIF":4.5,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143842451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A two-way dynamic adaptive pricing resource allocation model based on combinatorial double auctions in computational network 计算网络中基于组合双拍卖的双向动态自适应定价资源分配模型

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-15 DOI: 10.1016/j.comcom.2025.108170

Yanjun Xu , Chunqi Tian , Wei Wang , Lizhi Bai , Xuhui Xia

{"title":"A two-way dynamic adaptive pricing resource allocation model based on combinatorial double auctions in computational network","authors":"Yanjun Xu , Chunqi Tian , Wei Wang , Lizhi Bai , Xuhui Xia","doi":"10.1016/j.comcom.2025.108170","DOIUrl":"10.1016/j.comcom.2025.108170","url":null,"abstract":"<div><div>Efficient resource allocation in computing networks is essential for managing fluctuating demands and optimizing system performance. Traditional auction and pricing models often fail to adapt to diverse demands and supply–demand fluctuations, resulting in inefficiencies. This paper proposes a bidirectional price-adaptive bundled resource auction model that considers not only the autonomous adjustment of sellers’ quotations in response to supply–demand fluctuations but also the impact of these fluctuations on buyers’ willingness to pay and bidding behavior. The model integrates Combinatorial Double Auction (CDA) mechanism and Genetic Algorithm (GA), constructing a bundled resource auction mechanism that accommodates diverse resource demands and an adaptive pricing strategy that dynamically responds to real-time supply–demand variations. This approach enhances resource allocation accuracy in dynamic and competitive computing network environments. Furthermore, a reserve price mechanism and a delay compensation strategy are introduced to ensure that the proposed mechanism satisfies individual rationality, budget balance, and incentive compatibility while maintaining computational efficiency. Simulation results demonstrate that, compared to traditional methods, the proposed model not only improves allocation efficiency and enhances resource utilization but also helps reduce operational costs. Specifically, resource allocation dispersion decreases by 4.26%, while service providers’ revenue increases by 7.47%. This study provides a scalable and adaptive solution for dynamic resource allocation in cloud and edge computing platforms. It contributes significantly to the development of resource management and flexible pricing strategies in markets characterized by diverse demands and fluctuating conditions.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108170"},"PeriodicalIF":4.5,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143864999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhanced load balancing technique for SDN controllers: A multi-threshold approach with migration of switches SDN控制器的增强负载均衡技术：带交换机迁移的多阈值方法

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-14 DOI: 10.1016/j.comcom.2025.108167

Mohammad Kazemiesfeh, Somaye Imanpour, Ahmadreza Montazerolghaem

{"title":"Enhanced load balancing technique for SDN controllers: A multi-threshold approach with migration of switches","authors":"Mohammad Kazemiesfeh, Somaye Imanpour, Ahmadreza Montazerolghaem","doi":"10.1016/j.comcom.2025.108167","DOIUrl":"10.1016/j.comcom.2025.108167","url":null,"abstract":"<div><div>Deploying multiple controllers in the control panel of software-defined networks increases scalability, availability, and performance, but it also brings challenges, such as controller overload. To address this, load-balancing techniques are employed in software-defined networks. Controller load balancing can be categorized into two main approaches: (1) single-level thresholds and (2) multi-level thresholds. However, previous studies have predominantly relied on single-level thresholds, which result in an imprecise classification of controllers or have assumed uniform controller capacities in multi-level threshold methods. This study explores controller load balancing with a focus on utilizing multi-level thresholds to accurately assess controller status. Switch migration operations are utilized to achieve load balancing, considering factors such as the degree of load imbalance of the target controller and migration efficiency. This includes evaluating the post-migration status of the target controller and the distance between the migrating switch and the target controller to select the appropriate target controller and migrating switch. The proposed scheme reduces controller response time, migration costs, communication overhead, and throughput rate. Results demonstrate that our scheme outperforms others regarding response time and overall performance.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108167"},"PeriodicalIF":4.5,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143859665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On flexible association and placement in disaggregated RAN designs 可分解RAN设计中的柔性关联与布局

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-11 DOI: 10.1016/j.comcom.2025.108166

Hiba Hojeij , Guilherme Iecker Ricardo , Mahdi Sharara , Sahar Hoteit , Véronique Vèque , Stefano Secci

{"title":"On flexible association and placement in disaggregated RAN designs","authors":"Hiba Hojeij , Guilherme Iecker Ricardo , Mahdi Sharara , Sahar Hoteit , Véronique Vèque , Stefano Secci","doi":"10.1016/j.comcom.2025.108166","DOIUrl":"10.1016/j.comcom.2025.108166","url":null,"abstract":"<div><div>In Open RAN architectures, the classic gNB radio protocol stack is disaggregated into virtualized components: the Centralized Unit (CU), the Distributed Unit (DU), and the Radio Unit (RU). Each unit is deployed throughout a cloud-enabled RAN infrastructure to meet users’ Quality of Service (QoS) requirements. In this framework, we propose Open RAN unit placement methods that maximize User Equipment (UE) admission while ensuring their QoS needs. We focus on two primary tasks: (i) establishing UE-RU associations and (ii) placing CUs and DUs across the network’s cloud hosts. We formulate the joint association-placement UE-DU-CU optimization problem as an Integer Linear Programming (ILP) model and propose two resolution approaches besides the optimal one: (i) an algorithm that decomposes and sequentially solves the ILP model and (ii) a Recurrent Neural Network (RNN) heuristic that emulates the joint optimization model. We assess the optimal model’s performance across varying network resource availability. Compared to baseline models, simulations demonstrate that our approaches ensure higher admissibility levels while minimizing deployment costs and increasing fairness. The RNN heuristic presents a small optimality gap, with up to 9% fewer admissions while reducing the execution time by up to 99.98%, making it suitable for real-time implementation.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108166"},"PeriodicalIF":4.5,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143842165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mind the paths you choose: Speeding up segment routing-based traffic engineering with path preprocessing 注意您选择的路径：使用路径预处理加速基于分段路由的流量工程

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2025-04-11 DOI: 10.1016/j.comcom.2025.108156

Alexander Brundiers , Timmy Schüller , Nils Aschenbruck

{"title":"Mind the paths you choose: Speeding up segment routing-based traffic engineering with path preprocessing","authors":"Alexander Brundiers , Timmy Schüller , Nils Aschenbruck","doi":"10.1016/j.comcom.2025.108156","DOIUrl":"10.1016/j.comcom.2025.108156","url":null,"abstract":"<div><div>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 10<span><math><mo>×</mo></math></span> 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.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108156"},"PeriodicalIF":4.5,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143842466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0