Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers
Volunteer Edge Computing (VEC) is a promising solution for addressing the challenge of high round-trip latency in traditional cloud computing systems. Leveraging distributed computing resources reduces latency and improves performance. However, resource management in VEC is challenging, first, due t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10285340/ |
| _version_ | 1797655649189888000 |
|---|---|
| author | Yousef Alsenani Abdulaziz S. Alnori |
| author_facet | Yousef Alsenani Abdulaziz S. Alnori |
| author_sort | Yousef Alsenani |
| collection | DOAJ |
| description | Volunteer Edge Computing (VEC) is a promising solution for addressing the challenge of high round-trip latency in traditional cloud computing systems. Leveraging distributed computing resources reduces latency and improves performance. However, resource management in VEC is challenging, first, due to the uncertain behavior of volunteers, which frequently go offline unexpectedly, and second, since sequences of tasks can be executed on different volunteers, which requires transmitting data from one to another volunteer, which can lead to processing interruptions and network overhead. To address these challenges, we propose a trust-aware scheduling procedure that consists of two stages. First, we train a regression model based on lagged data suitable to accurately predict volunteer availability. Second, we assign tasks to volunteers using a metric based on the predicted availability from the first stage. The metric assesses the likelihood that a candidate volunteer can successfully complete a task and the likelihood that nearby nodes are available for successor tasks or as replacements if the processing is not completed. Thereby, we increase the chances of assigning tasks with dependencies to nearby resources, thus reducing long-distance communication and hence latency. We evaluate our approach in a discrete-event simulation using real data from Telecom’s base stations. The simulation results indicate significant improvements in task failures, task completion rates, delays, and average execution times when compared to the existing alternative algorithm. |
| first_indexed | 2024-03-11T17:17:31Z |
| format | Article |
| id | doaj.art-7a4bea10263746daa9d198587e3b26d0 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-03-11T17:17:31Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-7a4bea10263746daa9d198587e3b26d02023-10-19T23:00:47ZengIEEEIEEE Access2169-35362023-01-011111351411352510.1109/ACCESS.2023.332417810285340Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable ServersYousef Alsenani0https://orcid.org/0000-0001-5059-6277Abdulaziz S. Alnori1https://orcid.org/0009-0007-5501-8987Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi ArabiaFaculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi ArabiaVolunteer Edge Computing (VEC) is a promising solution for addressing the challenge of high round-trip latency in traditional cloud computing systems. Leveraging distributed computing resources reduces latency and improves performance. However, resource management in VEC is challenging, first, due to the uncertain behavior of volunteers, which frequently go offline unexpectedly, and second, since sequences of tasks can be executed on different volunteers, which requires transmitting data from one to another volunteer, which can lead to processing interruptions and network overhead. To address these challenges, we propose a trust-aware scheduling procedure that consists of two stages. First, we train a regression model based on lagged data suitable to accurately predict volunteer availability. Second, we assign tasks to volunteers using a metric based on the predicted availability from the first stage. The metric assesses the likelihood that a candidate volunteer can successfully complete a task and the likelihood that nearby nodes are available for successor tasks or as replacements if the processing is not completed. Thereby, we increase the chances of assigning tasks with dependencies to nearby resources, thus reducing long-distance communication and hence latency. We evaluate our approach in a discrete-event simulation using real data from Telecom’s base stations. The simulation results indicate significant improvements in task failures, task completion rates, delays, and average execution times when compared to the existing alternative algorithm.https://ieeexplore.ieee.org/document/10285340/Edge computingvolunteer edge computingtrustavailabilityschedulingtask dependencies |
| spellingShingle | Yousef Alsenani Abdulaziz S. Alnori Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers IEEE Access Edge computing volunteer edge computing trust availability scheduling task dependencies |
| title | Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers |
| title_full | Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers |
| title_fullStr | Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers |
| title_full_unstemmed | Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers |
| title_short | Trust-Aware Scheduling for Edge Computing With Task Dependencies and Unreliable Servers |
| title_sort | trust aware scheduling for edge computing with task dependencies and unreliable servers |
| topic | Edge computing volunteer edge computing trust availability scheduling task dependencies |
| url | https://ieeexplore.ieee.org/document/10285340/ |
| work_keys_str_mv | AT yousefalsenani trustawareschedulingforedgecomputingwithtaskdependenciesandunreliableservers AT abdulazizsalnori trustawareschedulingforedgecomputingwithtaskdependenciesandunreliableservers |