Details

Autor(en) / Beteiligte

• Almurshed, Osama
• Rana, Omer
• Chard, Kyle

Titel

Greedy Nominator Heuristic: Virtual function placement on fog resources

Ist Teil von

• Concurrency and computation, 2022-03, Vol.34 (6), p.n/a

Ort / Verlag

Hoboken: Wiley Subscription Services, Inc

Erscheinungsjahr

2022

Quelle

Access via Wiley Online Library

Beschreibungen/Notizen

• 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.