Distributed Server Allocation for Internet-of-Things Monitoring Services With Preventive Start-Time Optimization Against Server Failure

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Shoya Imanaka;Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki
{"title":"Distributed Server Allocation for Internet-of-Things Monitoring Services With Preventive Start-Time Optimization Against Server Failure","authors":"Shoya Imanaka;Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki","doi":"10.1109/TNSM.2025.3555277","DOIUrl":null,"url":null,"abstract":"Internet-of-Things (IoT) services require high performance regarding low delay and fault tolerance. Distributed server allocation is well-suited for meeting these requirements in IoT monitoring services. Previous work focused on reducing delay but overlooked the need for fault tolerance in distributed server allocation. This paper proposes a distributed server allocation model based on preventive start-time optimization (PSO) for IoT monitoring services against server failure. The proposed model preventively determines the server allocation to minimize the largest maximum delay between IoT devices and application servers and between database and application servers among all failure patterns. We formulate the proposed model as an integer linear programming (ILP) problem. We introduce a server allocation algorithm based on PSO to accelerate the computation to obtain an optimal server allocation, compared to the ILP approach. We prove that the introduced algorithm obtains a PSO-based optimal allocation in polynomial time. Numerical results show that the introduced algorithm outputs an optimal server allocation faster than the ILP approach. We compare the PSO-based server allocation with allocations based on the start-time and run-time optimization. We observe that the PSO-based allocation reduces the largest maximum delay by 5.5% for a network model with eleven servers compared to the start-time optimization and avoids unnecessary network disconnections while increasing the maximum delay by 5.1% compared to the run-time optimization.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2679-2701"},"PeriodicalIF":4.7000,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10943239","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10943239/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Internet-of-Things (IoT) services require high performance regarding low delay and fault tolerance. Distributed server allocation is well-suited for meeting these requirements in IoT monitoring services. Previous work focused on reducing delay but overlooked the need for fault tolerance in distributed server allocation. This paper proposes a distributed server allocation model based on preventive start-time optimization (PSO) for IoT monitoring services against server failure. The proposed model preventively determines the server allocation to minimize the largest maximum delay between IoT devices and application servers and between database and application servers among all failure patterns. We formulate the proposed model as an integer linear programming (ILP) problem. We introduce a server allocation algorithm based on PSO to accelerate the computation to obtain an optimal server allocation, compared to the ILP approach. We prove that the introduced algorithm obtains a PSO-based optimal allocation in polynomial time. Numerical results show that the introduced algorithm outputs an optimal server allocation faster than the ILP approach. We compare the PSO-based server allocation with allocations based on the start-time and run-time optimization. We observe that the PSO-based allocation reduces the largest maximum delay by 5.5% for a network model with eleven servers compared to the start-time optimization and avoids unnecessary network disconnections while increasing the maximum delay by 5.1% compared to the run-time optimization.
针对服务器故障进行预防性启动时间优化的物联网监控服务的分布式服务器分配
物联网(IoT)业务需要低延迟和容错的高性能。分布式服务器分配非常适合满足物联网监控服务中的这些需求。以前的工作侧重于减少延迟,但忽略了分布式服务器分配中容错的需求。提出了一种基于预防性启动时间优化(PSO)的分布式服务器分配模型,用于针对服务器故障的物联网监控服务。提出的模型预防性地确定服务器分配,以最小化所有故障模式中物联网设备与应用服务器之间、数据库与应用服务器之间的最大延迟。我们将所提出的模型表述为整数线性规划(ILP)问题。我们引入了一种基于粒子群算法的服务器分配算法,以加速计算以获得最优的服务器分配,与ILP方法相比。证明了该算法在多项式时间内得到了基于粒子群的最优分配。数值结果表明,所引入的算法比ILP方法更快地输出最优服务器分配。我们比较了基于pso的服务器分配与基于启动时和运行时优化的分配。我们观察到,与启动时优化相比,基于pso的分配使具有11台服务器的网络模型的最大延迟减少了5.5%,避免了不必要的网络断开,同时与运行时优化相比,最大延迟增加了5.1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信