English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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&#x2019;s base stations. The results demonstrate an average reduction of 43.44% in the number of failed dependent tasks, an increase of 5% in completed tasks, a reduction of 85.68% in failed tasks, a reduction of 47.32%. in delay duration, and a reduction of 3.06% in average execution task, compared to the existing alternative algorithm.

Trust-aware Scheduling for Edge Computing with Task Dependencies and Unreliable Servers