An Online Algorithm for Optimizing Network Transmission Cost of Federated Learning in the Cloud

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Haotian Yan;Li Pan;Shijun Liu;Dong Wu
{"title":"An Online Algorithm for Optimizing Network Transmission Cost of Federated Learning in the Cloud","authors":"Haotian Yan;Li Pan;Shijun Liu;Dong Wu","doi":"10.1109/TNSE.2025.3529718","DOIUrl":null,"url":null,"abstract":"Data privacy concerns and related regulations such as the General Data Protection Regulation in machine learning have fostered a boom in federated learning (FL). However, the costly infrastructure and time-consuming deployments pose significant barriers to the widespread adoption of FL in real-world scenarios. To increase the user-friendliness of federated learning while reducing deployment costs and improving its scalability, service providers are beginning to offer federated learning as a service (FLaaS) in the cloud. Due to the distributed nature of FL, communication overhead imposes significant network costs on FLaaS providers. In mainstream cloud platforms, there are two main types of billing methods for networking products, which are on-demand and reserved. How to optimally combine these two billing models to optimize communication cost in the face of time-varying demands of federated learning in the cloud poses a challenge to FLaaS providers. To address this problem, we propose OnlineNS, an online algorithm for optimally making networking product selection decisions without prior knowledge of future demand sequences. Our algorithm can achieve better cost performance compared to online algorithms that are widely used in practice. The theoretical analysis and simulations based on real-world traces as well as synthetic datasets validate the effectiveness of our online algorithm and demonstrate that it can achieve better cost performance compared to benchmarks with the same communication performance.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"1457-1469"},"PeriodicalIF":6.7000,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10845119/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Data privacy concerns and related regulations such as the General Data Protection Regulation in machine learning have fostered a boom in federated learning (FL). However, the costly infrastructure and time-consuming deployments pose significant barriers to the widespread adoption of FL in real-world scenarios. To increase the user-friendliness of federated learning while reducing deployment costs and improving its scalability, service providers are beginning to offer federated learning as a service (FLaaS) in the cloud. Due to the distributed nature of FL, communication overhead imposes significant network costs on FLaaS providers. In mainstream cloud platforms, there are two main types of billing methods for networking products, which are on-demand and reserved. How to optimally combine these two billing models to optimize communication cost in the face of time-varying demands of federated learning in the cloud poses a challenge to FLaaS providers. To address this problem, we propose OnlineNS, an online algorithm for optimally making networking product selection decisions without prior knowledge of future demand sequences. Our algorithm can achieve better cost performance compared to online algorithms that are widely used in practice. The theoretical analysis and simulations based on real-world traces as well as synthetic datasets validate the effectiveness of our online algorithm and demonstrate that it can achieve better cost performance compared to benchmarks with the same communication performance.
云环境下联邦学习网络传输成本在线优化算法
数据隐私问题和相关法规,如机器学习中的通用数据保护法规,促进了联邦学习(FL)的蓬勃发展。然而,昂贵的基础设施和耗时的部署对FL在现实场景中的广泛采用构成了重大障碍。为了提高联邦学习的用户友好性,同时降低部署成本并提高其可伸缩性,服务提供商开始在云中提供联邦学习即服务(FLaaS)。由于FL的分布式特性,通信开销给FLaaS提供商带来了巨大的网络成本。在主流云平台中,联网产品的计费方式主要有按需计费和预留计费两种。面对云中联邦学习的时变需求,如何将这两种计费模型最优地结合起来以优化通信成本,对FLaaS提供商提出了挑战。为了解决这个问题,我们提出了一种在线算法OnlineNS,它可以在不事先了解未来需求序列的情况下最优地做出网络产品选择决策。与实际应用中广泛使用的在线算法相比,我们的算法可以获得更好的性价比。基于现实世界轨迹和合成数据集的理论分析和仿真验证了我们的在线算法的有效性,并证明与具有相同通信性能的基准相比,它可以实现更好的性价比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术官方微信