Greedy nominator heuristic: virtual function placement on fog resources

Almurshed, Osama, Rana, Omer ORCID: https://orcid.org/0000-0003-3597-2646 and Chard, Kyle 2022. Greedy nominator heuristic: virtual function placement on fog resources. Concurrency and Computation: Practice and Experience 34 (6) , e6765. 10.1002/cpe.6765

Preview

PDF - Accepted Post-Print Version Download (2MB) | Preview

Abstract

Fog computing is an intermediate infrastructure between edge devices (e.g., Internet of Things) and cloud systems that is used to reduce latency in real-time applications. An application can be composed of a collection of virtual functions, between which dependency constraints can be captured in a service function chain (SFC). Virtual functions within an SFC can be executed at different geo-distributed locations. However, virtual functions are prone to failure and often do not complete within a deadline. This results in function reallocation to other nodes within the infrastructure; causing delays, potential data loss during function migration, and increased costs. We proposed Greedy Nominator Heuristic (GNH) to address these issues. GNH is based on redundant deployment and failure tracking of virtual functions. GNH places replicas of each function at multiple locations—taking account of expected completion time, failure risk, and cost. We make use of a MapReduce-based mechanism, where Mappers find suitable locations in parallel, and a Reducer then ranks these locations. Our results show that GNH reduces latency by up to 68%, and is more cost effective than other approaches which rely on state-of-the-art optimization algorithms to allocate replicas.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	John Wiley and Sons
ISSN:	1532-0626
Date of First Compliant Deposit:	13 December 2021
Date of Acceptance:	5 November 2021
Last Modified:	07 Nov 2023 01:58
URI:	https://orca.cardiff.ac.uk/id/eprint/146099

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item