Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks
Edge computing architectures promise increased quality of service with low communication delays by bringing cloud services closer to the end-users, at the distributed edge servers of the network edge. Hosting server capabilities at access nodes, thereby yielding edge service nodes, offers service pr...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-10-01
|
| Series: | Information |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2078-2489/15/11/670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850227289684443136 |
|---|---|
| author | Efthymios Oikonomou Angelos Rouskas |
| author_facet | Efthymios Oikonomou Angelos Rouskas |
| author_sort | Efthymios Oikonomou |
| collection | DOAJ |
| description | Edge computing architectures promise increased quality of service with low communication delays by bringing cloud services closer to the end-users, at the distributed edge servers of the network edge. Hosting server capabilities at access nodes, thereby yielding edge service nodes, offers service proximity to users and provides QoS guarantees. However, the placement of edge servers should match the level of demand for computing resources and the location of user load. Thus, it is necessary to devise schemes that select the most appropriate access nodes to host computing services and associate every remaining access node with the most proper service node to ensure optimal service delivery. In this paper, we formulate this problem as an optimization problem with a bi-objective function that aims at both communication cost minimization and load balance optimization. We propose schemes that tackle this problem and compare their performance against previously proposed heuristics that have been also adapted to target both optimization goals. We study how these algorithms behave in lattice and random grid network topologies with uniform and non-uniform workloads. The results validate the efficiency of our proposed schemes in addition to the significantly lower execution times compared to the other heuristics. |
| format | Article |
| id | doaj-art-a4427ad39bab4fd89c230b702c552308 |
| institution | OA Journals |
| issn | 2078-2489 |
| language | English |
| publishDate | 2024-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Information |
| spelling | doaj-art-a4427ad39bab4fd89c230b702c5523082025-08-20T02:04:52ZengMDPI AGInformation2078-24892024-10-01151167010.3390/info15110670Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing NetworksEfthymios Oikonomou0Angelos Rouskas1Department of Digital Systems, University of Piraeus, 18532 Piraeus, GreeceDepartment of Digital Systems, University of Piraeus, 18532 Piraeus, GreeceEdge computing architectures promise increased quality of service with low communication delays by bringing cloud services closer to the end-users, at the distributed edge servers of the network edge. Hosting server capabilities at access nodes, thereby yielding edge service nodes, offers service proximity to users and provides QoS guarantees. However, the placement of edge servers should match the level of demand for computing resources and the location of user load. Thus, it is necessary to devise schemes that select the most appropriate access nodes to host computing services and associate every remaining access node with the most proper service node to ensure optimal service delivery. In this paper, we formulate this problem as an optimization problem with a bi-objective function that aims at both communication cost minimization and load balance optimization. We propose schemes that tackle this problem and compare their performance against previously proposed heuristics that have been also adapted to target both optimization goals. We study how these algorithms behave in lattice and random grid network topologies with uniform and non-uniform workloads. The results validate the efficiency of our proposed schemes in addition to the significantly lower execution times compared to the other heuristics.https://www.mdpi.com/2078-2489/15/11/670edge computingservice nodesaccess nodescommunication costload balancingcomputational times |
| spellingShingle | Efthymios Oikonomou Angelos Rouskas Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks Information edge computing service nodes access nodes communication cost load balancing computational times |
| title | Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks |
| title_full | Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks |
| title_fullStr | Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks |
| title_full_unstemmed | Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks |
| title_short | Efficient Schemes for Optimizing Load Balancing and Communication Cost in Edge Computing Networks |
| title_sort | efficient schemes for optimizing load balancing and communication cost in edge computing networks |
| topic | edge computing service nodes access nodes communication cost load balancing computational times |
| url | https://www.mdpi.com/2078-2489/15/11/670 |
| work_keys_str_mv | AT efthymiosoikonomou efficientschemesforoptimizingloadbalancingandcommunicationcostinedgecomputingnetworks AT angelosrouskas efficientschemesforoptimizingloadbalancingandcommunicationcostinedgecomputingnetworks |