Toward reliability-satisfied and hop-constrained backup paths for industrial internet demands

IF 4.1 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

ICT Express Pub Date : 2024-12-01 DOI:10.1016/j.icte.2024.07.003

Huifen Huang , Xinchang Zhang

引用次数: 0

Abstract

Industrial data transfer must rapidly recover from possible link failures to ensure reliability. The backup path mechanism is one of the transfer protections against multiple link failures. In this paper, we study a reliability-satisfied and hop-constrained backup path model that strives to reduce network capacity consumption under constraints on the reliability and maximum hop number of the backup path. The constraint on the maximum hop number is used to ensure the reliability and delay of a backup path. We propose an approximation algorithm to solve the dynamic backup path arrangement problem that is NP-hard.

查看原文本刊更多论文

为满足工业互联网需求而开发可靠且跳数受限的备份路径

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

ICT Express Multiple-

CiteScore

10.20

自引率

1.90%

发文量

167

审稿时长

35 weeks

期刊介绍： The ICT Express journal published by the Korean Institute of Communications and Information Sciences (KICS) is an international, peer-reviewed research publication covering all aspects of information and communication technology. The journal aims to publish research that helps advance the theoretical and practical understanding of ICT convergence, platform technologies, communication networks, and device technologies. The technology advancement in information and communication technology (ICT) sector enables portable devices to be always connected while supporting high data rate, resulting in the recent popularity of smartphones that have a considerable impact in economic and social development.