Abstract
With the development of multi-access edge computing (also called mobile edge computing, MEC), more and more service-based applications are deployed to edge servers in order to ensure desired quality of service (QoS), especially in the scenario of Internet of things (IoT). In edge environment, how to reasonably deploy application services emerges as a challenging problem due to the limited resources, heterogeneous servers and different geographical locations of users. Benefiting from its reusability, a single service can be used by multiple applications. Yet only a few studies about the deployment problem in edge environment consider such property of services. This work considers the redundant deployment of reused services by different applications, so as to achieve high QoS. Due to the importance of cost for providers, it aims to minimize transmission cost and network latency under the constraint of deployment budget. This work firstly builds a redundant service deployment model under heterogeneous edge environment, and defines it as a multi-objective optimization problem under a given budget constraint. Then, service priority is calculated to determine redundancy, and K-medoids clustering algorithm based on request frequency filtering is used to conduct edge server selection. It next proposes a genetic algorithm based on priority to obtain an optimized plan. Finally, this work conducts experiments on real-world datasets to prove the superiority of the proposed method over existing ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.