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
{"title":"Toward reliability-satisfied and hop-constrained backup paths for industrial internet demands","authors":"Huifen Huang ,&nbsp;Xinchang Zhang","doi":"10.1016/j.icte.2024.07.003","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1273-1279"},"PeriodicalIF":4.1000,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICT Express","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S240595952400081X","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
为满足工业互联网需求而开发可靠且跳数受限的备份路径
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ICT Express
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.
期刊最新文献
Editorial Board A filter-and-refine approach to lightweight application traffic classification Learning to route and schedule links in reconfigurable networks Cross-domain autonomous driving visual segmentation based on enhanced target data learning Optimizing Crystals-Dilithium implementation in 16-bit MSP430 environment utilizing hardware multiplier
×
引用
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