Delay-Sensitive Task Offloading Optimization by Geometric Programming

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Cloud Computing Pub Date : 2024-03-28 DOI:10.1109/TCC.2024.3406384
Mohammad Fathi;Mohammad Saroughi;Azarhedi Zareie
{"title":"Delay-Sensitive Task Offloading Optimization by Geometric Programming","authors":"Mohammad Fathi;Mohammad Saroughi;Azarhedi Zareie","doi":"10.1109/TCC.2024.3406384","DOIUrl":null,"url":null,"abstract":"Mobile cloud computing is an emerging technology to address the resource limitation of mobile terminals. These terminals need to satisfy the performance requirements of emerging resource-consuming applications. Among these applications, delay-sensitive applications are becoming popular with the requirements of low execution times. Satisfying the delay requirements of these applications is the main objective in the task offloading of mobile cloud computing. In this paper, considering a network of wireless and wired infrastructures, a resource allocation problem in the form of a non-convex problem is formulated to provide a fair delay for offloaded tasks by delay-sensitive applications. Both transmission and computation delays are included in the formulation of the offloading delay. To tackle the problem's complexity, the assignment of mobile terminals to radio access networks and cloud servers is done by proposing greedy assignment solutions. The derived problem which is a geometric programming problem is then solved using convex programming. The performance of the proposed solution is evaluated versus the number of mobile terminals with different values of bandwidth resources at the radio network, workloads, and demand CPU cycles at mobile terminals. Numerical results demonstrate the effectiveness of the proposed solution to decrease the offloading delay in comparison with similar schemes.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"12 3","pages":"889-896"},"PeriodicalIF":5.3000,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10540256/","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

Mobile cloud computing is an emerging technology to address the resource limitation of mobile terminals. These terminals need to satisfy the performance requirements of emerging resource-consuming applications. Among these applications, delay-sensitive applications are becoming popular with the requirements of low execution times. Satisfying the delay requirements of these applications is the main objective in the task offloading of mobile cloud computing. In this paper, considering a network of wireless and wired infrastructures, a resource allocation problem in the form of a non-convex problem is formulated to provide a fair delay for offloaded tasks by delay-sensitive applications. Both transmission and computation delays are included in the formulation of the offloading delay. To tackle the problem's complexity, the assignment of mobile terminals to radio access networks and cloud servers is done by proposing greedy assignment solutions. The derived problem which is a geometric programming problem is then solved using convex programming. The performance of the proposed solution is evaluated versus the number of mobile terminals with different values of bandwidth resources at the radio network, workloads, and demand CPU cycles at mobile terminals. Numerical results demonstrate the effectiveness of the proposed solution to decrease the offloading delay in comparison with similar schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过几何编程优化对延迟敏感的任务卸载
移动云计算是一项新兴技术,旨在解决移动终端的资源限制问题。这些终端需要满足新出现的资源消耗型应用对性能的要求。在这些应用中,对延迟敏感的应用正变得越来越流行,它们要求较低的执行时间。满足这些应用的延迟要求是移动云计算任务卸载的主要目标。本文考虑了无线和有线基础设施网络,以非凸问题的形式提出了一个资源分配问题,为延迟敏感型应用的卸载任务提供公平的延迟。在制定卸载延迟时,传输和计算延迟都包括在内。为解决该问题的复杂性,通过提出贪婪分配方案,将移动终端分配到无线接入网络和云服务器。得出的问题是一个几何编程问题,然后使用凸编程法进行求解。根据移动终端数量、无线网络带宽资源、工作负载和移动终端 CPU 周期需求的不同值,对所提解决方案的性能进行了评估。数值结果表明,与类似方案相比,所提方案能有效减少卸载延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
期刊最新文献
COCSN: A Multi-Tiered Cascaded Optical Circuit Switching Network for Data Center Aggregate Monitoring for Geo-Distributed Kubernetes Cluster Federations Group Formation and Sampling in Group-Based Hierarchical Federated Learning HEXO: Offloading Long-Running Compute- and Memory-Intensive Workloads on Low-Cost, Low-Power Embedded Systems Joint Offloading and Resource Allocation for Collaborative Cloud Computing With Dependent Subtask Scheduling on Multi-Core Server
×
引用
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