{"title":"针对特定内容和基于缓冲区的雾计算迁移方案","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.5000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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.5000,\"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}","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}
Content-Specific and Buffer-Based Migration Schemes for Fog Computing
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.
期刊介绍:
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.