All one needs to know about fog computing and related edge computing paradigms: A complete survey

With the Internet of Things (IoT) becoming part of our daily life and our environment, we expect rapid growth in the number of connected devices. IoT is expected to connect billions of devices and humans to bring promising advantages for us. With this growth, fog computing, along with its related edge computing paradigms, such as multi-access edge computing (MEC) and cloudlet, are seen as promising solutions for handling the large volume of security-critical and time-sensitive data that is being produced by the IoT. In this paper, we first provide a tutorial on fog computing and its related computing paradigms, including their similarities and differences. Next, we provide a taxonomy of research topics in fog computing, and through a comprehensive survey, we summarize and categorize the efforts on fog computing and its related computing paradigms. Finally, we provide challenges and future directions for research in fog computing.

All One Needs to Know about Fog Computing and Related Edge Computing Paradigms: A Complete Survey

Contrary to using distant and centralized cloud data center resources, employing decentralized resources at the edge of a network for processing data closer to user devices, such as smartphones and tablets, is an upcoming computing paradigm, referred to as fog/edge computing. Fog/edge resources are typically resource-constrained, heterogeneous, and dynamic compared to the cloud, thereby making resource management an important challenge that needs to be addressed. This article reviews publications as early as 1991, with 85% of the publications between 2013 and 2018, to identify and classify the architectures, infrastructure, and underlying algorithms for managing resources in fog/edge computing.

/pdf/resource-management-in-fog-edge-computing-a-survey-on-524cfs4xck.pdf

Resource Management in Fog/Edge Computing: A Survey on Architectures, Infrastructure, and Algorithms

Contrary to using distant and centralized cloud data center resources, employing decentralized resources at the edge of a network for processing data closer to user devices, such as smartphones and tablets, is an upcoming computing paradigm, referred to as fog/edge computing. Fog/edge resources are typically resource-constrained, heterogeneous, and dynamic compared to the cloud, thereby making resource management an important challenge that needs to be addressed. This article reviews publications as early as 1991, with 85% of the publications between 2013-2018, to identify and classify the architectures, infrastructure, and underlying algorithms for managing resources in fog/edge computing.

/pdf/resource-management-in-fog-edge-computing-a-survey-nbyahhyns9.pdf

Resource Management in Fog/Edge Computing: A Survey.

In the past decade, network data communication has experienced a rapid growth, which has led to explosive congestion in heterogeneous networks. Moreover, the emerging industrial applications, such as automatic driving put forward higher requirements on both networks and devices. On the contrary, running computation-intensive industrial applications locally are constrained by the limited resources of devices. Correspondingly, fog computing has recently emerged to reduce the congestion of content-centric networks. It has proven to be a good way in industry and traffic for reducing network delay and processing time. In addition, device-to-device offloading is viewed as a promising paradigm to transmit network data in mobile environment, especially for autodriving vehicles. In this paper, jointly taking both the network traffic and computation workload of industrial traffic into consideration, we explore a fundamental tradeoff between energy consumption and service delay when provisioning mobile services in vehicular networks. In particular, when the available resource in mobile vehicles becomes a bottleneck, we propose a novel model to depict the users’ willingness of contributing their resources to the public. We then formulate a cost minimization problem by exploiting the framework of Markov decision progress (MDP) and propose the dynamic reinforcement learning scheduling algorithm and the deep dynamic scheduling algorithm to solve the offloading decision problem. By adopting different mobile trajectory traces, we conduct extensive simulations to evaluate the performance of the proposed algorithms. The results show that our proposed algorithms outperform other benchmark schemes in the mobile edge networks.

Traffic and Computation Co-Offloading With Reinforcement Learning in Fog Computing for Industrial Applications

Device to Device communication enables the deployment of mobile cloudlets in LTE-advanced networks. The distributed nature of mobile users and dynamic task arrivals makes it challenging to schedule tasks fairly among multiple devices. Leveraging the idea of software defined networking, we propose a software defined cooperative offloading model (SDCOM), where the SDCOM controller is deployed at the PDN gateway and schedules tasks in a centralized manner to save the energy of mobile devices and reduce the traffic on access links. We formulate the minimum-energy task scheduling problem as a 0-1 knapsack problem and prove its NP-hardness. To compute the optimal solution as a benchmark, we design the conditioned optimal algorithm based on the aggregated analysis of energy consumption. The greedy algorithm with a polynominal-time complexity is proposed to solve large-scale problems efficiently. To address the problem without predicting future information on task arrivals, we further design an online task scheduling algorithm (OTS). It can minimize the energy consumption arbitrarily close to the optimal solution by appropriately setting the tradeoff coefficient. Moreover, we extend OTS to design a proportional fair online task scheduling algorithm to achieve the fair energy consumption among mobile devices. Extensive trace-based simulations demonstrate the effectiveness of SDCOM for a variety of typical mobile devices and applications.

Software Defined Cooperative Offloading for Mobile Cloudlets

Cooperative cache has become a promising technique to optimize the traffic by caching big data in networks. However, controlling distributed cache nodes to update cached contents synergistically is still challenging in designing cooperative cache systems. This paper proposes an SDN-based Cooperative Cache Network (SCCN) for ISP networks, aiming to minimize the content transmission latency while reducing the inter-ISP traffic. Based on the proposed increment recording mechanism, the SCCN Controller can timely capture the change of content popularity, and place the most popular contents on the appropriate SCCN Switches. We formulate the optimal content placement as a specific multi-commodity facility location problem and prove its NP-hardness. We propose a Relaxation Algorithm (RA) based on relaxation-rounding technique to solve the problem, which can achieve an approximation ratio of $1/2$ in the worst case. To solve large scale problems for big data efficiently, we further design a Heuristic Algorithm (HA), which can find a near-optimal solution with three orders of magnitude speedup compared to RA. Specifically, HA can achieve a desirable tradeoff between the transmission delay and the Internet traffic. We implement a prototype based on Open vSwitch to demonstrate the feasibility of SCCN. Extensive trace-based simulation results show the effectiveness of SCCN under various network conditions.

SDN-Based Big Data Caching in ISP Networks

The invention discloses an energy-consumption-optimization adaptive streaming media distribution method suitable for a 4G environment. The method comprises the following steps: designing an adaptive streaming media distributor suitable for the 4G environment, performing a deployment on a gateway, combining data blocks into burst streams, issuing the burst streams to users, and optimizing network throughput, watching experiences of the users and energy consumption of user equipment in a combined way; designing a utility function for calculating user utilities, including a video definition and penalties of user experiences, of unit energy consumption, in order to realize proportional fairness among a plurality of users and smooth playing; modeling an optimal user utility problem into a non-linear integer programming problem and giving an efficient online allocation algorithm; executing the online algorithm based on channel quality and a caching state of the user equipment in order to allocate resources to the users; and affecting bit rate selections of the users through the resource allocation in order to finally realize effective video transmission under a multi-user situation.

Qingmei Ren

Papers

Software Defined Cooperative Offloading for Mobile Cloudlets

SDN-Based Big Data Caching in ISP Networks

Energy-consumption-optimization adaptive streaming media distribution method for intelligent terminal