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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Services Computing
Published
2024-11-26
DOI
https://doi.org/10.1109/tsc.2024.3506474
Citations
2
Primary Topic
Peer-to-Peer Network Technologies
Type
article
Field-Weighted Citation Impact
0.70
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Mohammed Jasim
2 citations
IEEE Transactions on Services Computing
Peer-to-Peer Network Technologies
0.70
article

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

Mohammed Jasim
article en
2 citations

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.

IEEE Transactions on Services ComputingVol. 18(1)
University of Washington Tacoma (US)
Reduced inequalities
Openalex Percentile: Top 26%
Peer-to-Peer Network Technologies
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.