Abstract

Fog computing computes and stores data locally based upon distributed architectures that extend cloud to the edge of the network. This enables fog paradigms to be suitable for delay‐sensitive applications that demand various network functions (NFs). These NFs here are provided using network function virtualization (NFV) to allow elastic NF deployment on the fog nodes, that is, virtual network functions (VNFs). Now a major challenge for NFV‐based fog architectures is the limited resources, which vulnerate them to premature saturation and load imbalance. Hence resource management schemes are necessary for fog networks, in particular load migration and redistribution. Along this, an efficient migration scheme is proposed here using the coordinated generalized pattern search (CGPS) heuristic method. The scheme migrates excess load from heavily‐loaded (HL) nodes to lightly‐loaded (LL) nodes in proximity. The scheme adopts two criteria, termed as exclusive and common use of VNF instances. Results show that the proposed scheme achieves high migration success at reduced delays, as well as alleviating resources with low migration frequency.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.