Less Carbon Footprint in Edge Computing by Joint Task Offloading and Energy Sharing

Zhanwei Yu;Yi Zhao;Tao Deng;Lei You;Di Yuan
{"title":"Less Carbon Footprint in Edge Computing by Joint Task Offloading and Energy Sharing","authors":"Zhanwei Yu;Yi Zhao;Tao Deng;Lei You;Di Yuan","doi":"10.1109/LNET.2023.3286933","DOIUrl":null,"url":null,"abstract":"We address reducing carbon footprint (CF) in the context of edge computing. The carbon intensity of electricity supply largely varies spatially as well as temporally. We consider optimal task scheduling and offloading, as well as battery charging to minimize the total CF. We formulate this optimization problem as a mixed integer linear programming model. However, we demonstrate that, via a graph-based reformulation, the problem can be cast as a minimum-cost flow problem, and global optimum can be admitted in polynomial time. Numerical results using real-world data show that optimization can reduce up to 83.3% of the total CF.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"245-249"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10154013","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10154013/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We address reducing carbon footprint (CF) in the context of edge computing. The carbon intensity of electricity supply largely varies spatially as well as temporally. We consider optimal task scheduling and offloading, as well as battery charging to minimize the total CF. We formulate this optimization problem as a mixed integer linear programming model. However, we demonstrate that, via a graph-based reformulation, the problem can be cast as a minimum-cost flow problem, and global optimum can be admitted in polynomial time. Numerical results using real-world data show that optimization can reduce up to 83.3% of the total CF.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过联合任务卸载和能源共享减少边缘计算的碳足迹
我们要解决的是在边缘计算中减少碳足迹(CF)的问题。电力供应的碳强度在很大程度上因空间和时间而异。我们考虑优化任务调度和卸载以及电池充电,以最大限度地减少总碳足迹。我们将这一优化问题表述为混合整数线性规划模型。不过,我们证明,通过基于图的重新表述,该问题可被视为最小成本流问题,并可在多项式时间内达到全局最优。使用真实世界数据的数值结果表明,优化可以减少高达 83.3% 的总 CF。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Table of Contents IEEE Networking Letters Author Guidelines IEEE COMMUNICATIONS SOCIETY IEEE Communications Society Optimal Classifier for an ML-Assisted Resource Allocation in Wireless Communications
×
引用
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