University of Oulu

G. Lee, W. Saad and M. Bennis, "An online secretary framework for fog network formation with minimal latency," 2017 IEEE International Conference on Communications (ICC), Paris, 2017, pp. 1-6. doi: 10.1109/ICC.2017.7996574

An online secretary framework for fog network formation with minimal latency

Saved in:
Author: Lee, Gilsoo1; Saad, Walid1; Bennis, Mehdi2
Organizations: 1Wireless@VT, Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, USA
2Centre for Wireless Communications, University of Oulu, Finland
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.2 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2018073133161
Language: English
Published: Institute of Electrical and Electronics Engineers, 2017
Publish Date: 2018-07-31
Description:

Abstract

Fog computing is seen as a promising approach to perform distributed, low-latency computation for supporting Internet of Things applications. However, due to the unpredictable arrival of available neighboring fog nodes, the dynamic formation of a fog network can be challenging. In essence, a given fog node must smartly select the set of neighboring fog nodes that can provide low-latency computations. In this paper, this problem of fog network formation and task distribution is studied considering a hybrid cloud-fog architecture. The goal of the proposed framework is to minimize the maximum computational latency by enabling a given fog node to form a suitable fog network, under uncertainty on the arrival process of neighboring fog nodes. To solve this problem, a novel approach based on the online secretary framework is proposed. To find the desired set of neighboring fog nodes, an online algorithm is developed to enable a task initiating fog node to decide on which other nodes can be used as part of its fog network, to offload computational tasks, without knowing any prior information on the future arrivals of those other nodes. Simulation results show that the proposed online algorithm can successfully select an optimal set of neighboring fog nodes while achieving a latency that is as small as the one resulting from an ideal, offline scheme that has complete knowledge of the system. The results also show how, using the proposed approach, the computational tasks can be properly distributed between the fog network and a remote cloud server.

see all

Series: IEEE International Conference on Communications
ISSN: 1550-3607
ISSN-E: 1938-1883
ISSN-L: 1550-3607
ISBN: 978-1-4673-8999-0
ISBN Print: 978-1-4673-9000-2
Pages: 1 - 6
DOI: 10.1109/ICC.2017.7996574
OADOI: https://oadoi.org/10.1109/ICC.2017.7996574
Host publication: 2017 IEEE International Conference on Communications (ICC)
Conference: IEEE International Conference on Communications
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Funding: This research been supported by the U.S. National Science Foundation under Grant CNS-1460333 and the Academy of Finland CARMA project.
Copyright information: © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.