Content-Specific and Buffer-Based Migration Schemes for Fog Computing

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-11-26 DOI:10.1109/TSC.2024.3506474
Mohammed A. Jasim
{"title":"Content-Specific and Buffer-Based Migration Schemes for Fog Computing","authors":"Mohammed A. Jasim","doi":"10.1109/TSC.2024.3506474","DOIUrl":null,"url":null,"abstract":"Fog computing and network function virtualization (NFV) technologies reduce latency and provide scalable services at the network edge. However, the limited resources of edge nodes pose a challenge in handling high traffic volumes from requests that demand high computation, extended lifetime, and low latency. To address this challenge, dynamic load migration schemes for NFV-based fog paradigms are proposed here. First, a content-specific scheme that diffuses excess loads to nearby locations hosting relevant virtual network functions (VNFs) of the requests. Second, a buffer scheme reserves a dedicated node to absorb loads from saturated nodes in the proximity of terminals. Third, a hybrid scheme integrates both strategies by initially migrating loads to the pre-allocated buffer to provide immediate relief without searching for candidate nodes. Upon the buffer saturation, it switches to the content-specific phase to distribute loads to the proximate nodes. The network introduces a novel request model comprised of dependent and independent VNFs of varying resource demands. Dependent VNFs are collectively mapped on a primary node while distributing independent VNFs across neighboring secondary nodes, forming a structured ring topology mapping method. These schemes enhance migration success rates, and reduce migration iterations, service downtime, and cost, as compared to prominent solutions.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 1","pages":"98-111"},"PeriodicalIF":5.8000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10768259/","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

Fog computing and network function virtualization (NFV) technologies reduce latency and provide scalable services at the network edge. However, the limited resources of edge nodes pose a challenge in handling high traffic volumes from requests that demand high computation, extended lifetime, and low latency. To address this challenge, dynamic load migration schemes for NFV-based fog paradigms are proposed here. First, a content-specific scheme that diffuses excess loads to nearby locations hosting relevant virtual network functions (VNFs) of the requests. Second, a buffer scheme reserves a dedicated node to absorb loads from saturated nodes in the proximity of terminals. Third, a hybrid scheme integrates both strategies by initially migrating loads to the pre-allocated buffer to provide immediate relief without searching for candidate nodes. Upon the buffer saturation, it switches to the content-specific phase to distribute loads to the proximate nodes. The network introduces a novel request model comprised of dependent and independent VNFs of varying resource demands. Dependent VNFs are collectively mapped on a primary node while distributing independent VNFs across neighboring secondary nodes, forming a structured ring topology mapping method. These schemes enhance migration success rates, and reduce migration iterations, service downtime, and cost, as compared to prominent solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
针对特定内容和基于缓冲区的雾计算迁移方案
雾计算和网络功能虚拟化(NFV)技术减少了网络延迟,并在网络边缘提供可扩展的服务。然而,边缘节点有限的资源在处理来自需要高计算、延长生命周期和低延迟的请求的高流量方面提出了挑战。为了解决这一挑战,本文提出了基于nfv的雾范式的动态负载迁移方案。首先,一个特定于内容的方案,将多余的负载分散到托管请求的相关虚拟网络功能(VNFs)的附近位置。其次,缓冲方案保留一个专用节点来吸收终端附近饱和节点的负载。第三,混合方案集成了这两种策略,首先将负载迁移到预分配的缓冲区,以提供即时缓解,而无需搜索候选节点。在缓冲区饱和时,它切换到特定于内容的阶段,将负载分配给邻近节点。该网络引入了一种新的请求模型,该模型由不同资源需求的依赖和独立vnf组成。相互依赖的VNFs被集中映射到一个主节点上,而独立的VNFs分布在相邻的辅助节点上,形成了一种结构化的环形拓扑映射方法。与突出的解决方案相比,这些方案提高了迁移成功率,减少了迁移迭代、服务停机时间和成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
NL2Filter: A Robust CNN Design for Visual Services Over Cloud and Device DALAD: Unsupervised Detection of Global and Local Anomalies in Microservice Systems A Knee Point-Driven Set-Based Swarm Optimizer for Computing Tasks Allocation Oriented to Marginal Utility in Fog Computing Kafka-Thor: A Kafka-based In-Edge Data Streaming Platform for Enhanced V2X Services PeerSync: Accelerating Containerized Model Inference at the Network Edge
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1