计算感知网络的最优路由和异构资源分配

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

ICT Express Pub Date : 2024-06-01 DOI:10.1016/j.icte.2024.01.004

Hongqing Ding , Fujun He , Pengfei Zhang , Liang Zhang , Xiaoxiao Zhang , Meiyu Qi

{"title":"计算感知网络的最优路由和异构资源分配","authors":"Hongqing Ding , Fujun He , Pengfei Zhang , Liang Zhang , Xiaoxiao Zhang , Meiyu Qi","doi":"10.1016/j.icte.2024.01.004","DOIUrl":null,"url":null,"abstract":"<div><p>Computing-aware networking (CAN) is introduced to unite the computing resources distributed in different platforms. This paper proposes a joint routing and resource allocation model to minimize the total operational cost in CAN. We formulate the problem as an integer linear programming problem. We introduce a polynomial-time algorithm for larger-size problems. The numerical results reveal that the introduced algorithm reduces the computation time 9.18 times, with increasing the objective no more than 4% compared to the optimal solution; the proposed model can reduce 70% of the total cost compared to a baseline adopting a two-stage strategy in our examined cases.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 3","pages":"Pages 614-619"},"PeriodicalIF":4.1000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959524000043/pdfft?md5=7f67010b74f61693f4d4107c7f0f7b8b&pid=1-s2.0-S2405959524000043-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Optimal routing and heterogeneous resource allocation for computing-aware networks\",\"authors\":\"Hongqing Ding , Fujun He , Pengfei Zhang , Liang Zhang , Xiaoxiao Zhang , Meiyu Qi\",\"doi\":\"10.1016/j.icte.2024.01.004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Computing-aware networking (CAN) is introduced to unite the computing resources distributed in different platforms. This paper proposes a joint routing and resource allocation model to minimize the total operational cost in CAN. We formulate the problem as an integer linear programming problem. We introduce a polynomial-time algorithm for larger-size problems. The numerical results reveal that the introduced algorithm reduces the computation time 9.18 times, with increasing the objective no more than 4% compared to the optimal solution; the proposed model can reduce 70% of the total cost compared to a baseline adopting a two-stage strategy in our examined cases.</p></div>\",\"PeriodicalId\":48526,\"journal\":{\"name\":\"ICT Express\",\"volume\":\"10 3\",\"pages\":\"Pages 614-619\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2405959524000043/pdfft?md5=7f67010b74f61693f4d4107c7f0f7b8b&pid=1-s2.0-S2405959524000043-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICT Express\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2405959524000043\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICT Express","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2405959524000043","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

计算感知网络（CAN）的引入是为了联合分布在不同平台上的计算资源。本文提出了一种联合路由和资源分配模型，以最小化 CAN 中的总运行成本。我们将该问题表述为一个整数线性规划问题。我们为较大的问题引入了一种多项式时间算法。数值结果表明，与最优解相比，引入的算法减少了 9.18 倍的计算时间，目标增加不超过 4%；在我们研究的案例中，与采用两阶段策略的基线相比，所提出的模型可减少 70% 的总成本。

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

查看原文本刊更多论文

Optimal routing and heterogeneous resource allocation for computing-aware networks

Computing-aware networking (CAN) is introduced to unite the computing resources distributed in different platforms. This paper proposes a joint routing and resource allocation model to minimize the total operational cost in CAN. We formulate the problem as an integer linear programming problem. We introduce a polynomial-time algorithm for larger-size problems. The numerical results reveal that the introduced algorithm reduces the computation time 9.18 times, with increasing the objective no more than 4% compared to the optimal solution; the proposed model can reduce 70% of the total cost compared to a baseline adopting a two-stage strategy in our examined cases.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.