.png){kind=icon}
.png){kind=icon}
Return
ESMA: Towards elevating system happiness in a decentralized serverless edge computing framework
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2023.104762.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the rapid growth in the adoption of numerous technologies, such as smartphones and the Internet of Things (IoT), edge and serverless computing have started gaining momentum in today's computing infrastructure. It has led to the production of huge amounts of data and has also resulted in increased network traffic, which if not managed well can cause network congestion. To address this and maintain the quality of service (QoS), in this work, a novel dispatch (destination selection) algorithm called Egalitarian Stable Matching Algorithm (ESMA) for faster data processing has been developed while also considering the best use of server resources in a decentralized Serverless-Edge environment. This will allow us to effectively utilize the enormous volumes of data that are generated. The proposed algorithm has been able to achieve lower overall dissatisfaction scores for the entire system. Individually, the client's happiness as well as the server's happiness have improved over the baseline. Moreover, there has been a drop of 25.7% in the total execution time and the total network resources consumed are lower as compared to the baseline algorithm as well as random-allocation algorithm. (c) 2023 Elsevier Inc. All rights reserved.
Keywords:
Edge computing
Serverless computing
Matching theory
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
View more organizations