Performance Analysis of an Edge Computing SaaS System for Mobile Users

2020 ◽  
Vol 69 (2) ◽  
pp. 2049-2057 ◽  
Author(s):  
Alessio Bonadio ◽  
Francesco Chiti ◽  
Romano Fantacci
Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 594 ◽  
Author(s):  
Tri Nguyen ◽  
Tien-Dung Nguyen ◽  
Van Nguyen ◽  
Xuan-Qui Pham ◽  
Eui-Nam Huh

By bringing the computation and storage resources close proximity to the mobile network edge, mobile edge computing (MEC) is a key enabling technology for satisfying the Internet of Vehicles (IoV) infotainment applications’ requirements, e.g., video streaming service (VSA). However, the explosive growth of mobile video traffic brings challenges for video streaming providers (VSPs). One known issue is that a huge traffic burden on the vehicular network leads to increasing VSP costs for providing VSA to mobile users (i.e., autonomous vehicles). To address this issue, an efficient resource sharing scheme between underutilized vehicular resources is a promising solution to reduce the cost of serving VSA in the vehicular network. Therefore, we propose a new VSA model based on the lower cost of obtaining data from vehicles and then minimize the VSP’s cost. By using existing data resources from nearby vehicles, our proposal can reduce the cost of providing video service to mobile users. Specifically, we formulate our problem as mixed integer nonlinear programming (MINP) in order to calculate the total payment of the VSP. In addition, we introduce an incentive mechanism to encourage users to rent its resources. Our solution represents a strategy to optimize the VSP serving cost under the quality of service (QoS) requirements. Simulation results demonstrate that our proposed mechanism is possible to achieve up to 21% and 11% cost-savings in terms of the request arrival rate and vehicle speed, in comparison with other existing schemes, respectively.


2019 ◽  
Vol 11 (9) ◽  
pp. 184
Author(s):  
Wenming Zhang ◽  
Yiwen Zhang ◽  
Qilin Wu ◽  
Kai Peng

In mobile edge computing, a set of edge servers is geographically deployed near the mobile users such that accessible computing capacities and services can be provided to users with low latency. Due to user’s mobility, one fundamental and critical problem in mobile edge computing is how to select edge servers for many mobile users so that the total waiting time is minimized. In this paper, we propose a multi-user waiting time computation model about composite services and show the resource contention of the edge server among mobile users. Then, we introduce a novel and optimal Multi-user Edge server Selection method based on Particle swarm optimization (MESP) in mobile edge computing, which selects edge servers for mobile uses in advance within polynomial time. Extensive simulations on a real-world data-trace show that the MESP algorithm can effectively reduce the total waiting time compared with traditional approaches.


2019 ◽  
Vol 9 (11) ◽  
pp. 2308 ◽  
Author(s):  
Juyong Lee ◽  
Daeyoub Kim ◽  
Jihoon Lee

Recently, new mobile applications and services have appeared thanks to the rapid development of mobile devices and mobile network technology. Cloud computing has played an important role over the past decades, providing powerful computing capabilities and high-capacity storage space to efficiently deliver these mobile services to mobile users. Nevertheless, existing cloud computing delegates computing to a cloud server located at a relatively long distance, resulting in significant delays due to additional time to return processing results from a cloud server. These unnecessary delays are inconvenient for mobile users because they are not suitable for applications that require a real-time service environment. To cope with these problems, a new computing concept called Multi-Access Edge Computing (MEC) has emerged. Instead of sending all requests to the central cloud to handle mobile users’ requests, the MEC brings computing power and storage resources to the edge of the mobile network. It enables the mobile user device to run the real-time applications that are sensitive to latency to meet the strict requirements. However, there is a lack of research on the efficient utilization of computing resources and mobility support when mobile users move in the MEC environment. In this paper, we propose the MEC-based mobility management scheme that arranges MEC server (MECS) as the concept of Zone so that mobile users can continue to receive content and use server resources efficiently even when they move. The results show that the proposed scheme reduce the average service delay compared to the existing MEC scheme. In addition, the proposed scheme outperforms the existing MEC scheme because mobile users can continuously receive services, even when they move frequently.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Binbin Huang ◽  
Yuanyuan Xiang ◽  
Dongjin Yu ◽  
Jiaojiao Wang ◽  
Zhongjin Li ◽  
...  

Mobile edge computing as a novel computing paradigm brings remote cloud resource to the edge servers nearby mobile users. Within one-hop communication range of mobile users, a number of edge servers equipped with enormous computation and storage resources are deployed. Mobile users can offload their partial or all computation tasks of a workflow application to the edge servers, thereby significantly reducing the completion time of the workflow application. However, due to the open nature of mobile edge computing environment, these tasks, offloaded to the edge servers, are susceptible to be intentionally overheard or tampered by malicious attackers. In addition, the edge computing environment is dynamical and time-variant, which results in the fact that the existing quasistatic workflow application scheduling scheme cannot be applied to the workflow scheduling problem in dynamical mobile edge computing with malicious attacks. To address these two problems, this paper formulates the workflow scheduling problem with risk probability constraint in the dynamic edge computing environment with malicious attacks to be a Markov Decision Process (MDP). To solve this problem, this paper designs a reinforcement learning-based security-aware workflow scheduling (SAWS) scheme. To demonstrate the effectiveness of our proposed SAWS scheme, this paper compares SAWS with MSAWS, AWM, Greedy, and HEFT baseline algorithms in terms of different performance parameters including risk probability, security service, and risk coefficient. The extensive experiments results show that, compared with the four baseline algorithms in workflows of different scales, the SAWS strategy can achieve better execution efficiency while satisfying the risk probability constraints.


Sign in / Sign up

Export Citation Format

Share Document