Priority-based Resource Allocation Scheme for Mobile Edge Computing
Edge computing offers cloud-like services at the edge of mobile network to meet the increasing user demands for delay sensitive and rapid computation applications. But it is constrained with limited resources hence, an effective and efficient resource allocation technique is required for optimal res...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | ["eprint_typename_conference\_item" not defined] |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2022
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85126757657&doi=10.1109%2fICCIT52419.2022.9711641&partnerID=40&md5=554f5fe962bf4d7f879906082570f0fc http://eprints.utp.edu.my/33769/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Edge computing offers cloud-like services at the edge of mobile network to meet the increasing user demands for delay sensitive and rapid computation applications. But it is constrained with limited resources hence, an effective and efficient resource allocation technique is required for optimal resources utilization. This paper is thus presenting an adaptive resource allocation mechanism for resources utilization in edge computing. For resource allocation, the computing resources are allocated dynamically (adaptability) by considering the time constraint nature of the incoming requests. To complete the task, the proposed scheme shall adapt to the resource demands and the priorities of the incoming requests. After identifying the received request, which can be either priority-based or normal request, each will be processed with three possibilities. Available resources are managed at the edge node to facilitate the maximum number of incoming requests for resources and to optimize the utilization of limited resources. According to simulation results, our proposed approach demonstrates a better performance and efficiency in terms of average latency, average response time, and resource utilization when comparing with benchmark algorithms and a scheme. © 2022 IEEE. |
|---|