A cost-provable solution for reliable in-network computing-enabled services deployment

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Xiaorong Liu , Danyang Zheng , Huanlai Xing , Li Feng , Chengzong Peng , Xiaojun Cao
{"title":"A cost-provable solution for reliable in-network computing-enabled services deployment","authors":"Xiaorong Liu ,&nbsp;Danyang Zheng ,&nbsp;Huanlai Xing ,&nbsp;Li Feng ,&nbsp;Chengzong Peng ,&nbsp;Xiaojun Cao","doi":"10.1016/j.comnet.2024.110997","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, the in-network computing (INC) technique has been widely adopted by various applications including the reliability-sensitive ones such as remote surgery, and autonomous vehicle systems. To deploy reliable INC-enabled services, redundant task replicas are hosted by network devices to meet a specified service reliability threshold such as 99.9%, 99.99%, and 99.999%. Most existing works assume that this threshold is solely impacted by the software reliability while neglecting the hardware reliability. This neglectedness likely leads to unexpected service interruptions when the software replicas are co-deployed over one unreliable hardware. This work jointly considers the heterogeneous reliability brought by both software and hardware and identifies a novel phenomenon called “Software-Reliability-Only Experience Degradation” (SRO-ED). To address this, we mathematically establish the INC-enabled services adoption with heterogeneous reliability (ISAHR) problem to optimize service costs and prove its NP-hardness. We introduce an effective Cost-Reliability (CR) measure to indicate the average cost needed to satisfy each reliability unit while considering both software and hardware reliabilities. Next, we propose an innovative algorithm called CR measure-based INC services deployment (CR-D), which is proved to be logarithm-approximate in cost optimization. Extensive simulation results validate the logarithmic approximation of CR-D, and show that it outperforms the benchmarks by an average of 29.42% and 35.77% in cost optimization.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110997"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624008296","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, the in-network computing (INC) technique has been widely adopted by various applications including the reliability-sensitive ones such as remote surgery, and autonomous vehicle systems. To deploy reliable INC-enabled services, redundant task replicas are hosted by network devices to meet a specified service reliability threshold such as 99.9%, 99.99%, and 99.999%. Most existing works assume that this threshold is solely impacted by the software reliability while neglecting the hardware reliability. This neglectedness likely leads to unexpected service interruptions when the software replicas are co-deployed over one unreliable hardware. This work jointly considers the heterogeneous reliability brought by both software and hardware and identifies a novel phenomenon called “Software-Reliability-Only Experience Degradation” (SRO-ED). To address this, we mathematically establish the INC-enabled services adoption with heterogeneous reliability (ISAHR) problem to optimize service costs and prove its NP-hardness. We introduce an effective Cost-Reliability (CR) measure to indicate the average cost needed to satisfy each reliability unit while considering both software and hardware reliabilities. Next, we propose an innovative algorithm called CR measure-based INC services deployment (CR-D), which is proved to be logarithm-approximate in cost optimization. Extensive simulation results validate the logarithmic approximation of CR-D, and show that it outperforms the benchmarks by an average of 29.42% and 35.77% in cost optimization.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信