Matching-based Service Offloading for Compute-less Driven IoT Networks
Boubakr Nour, Soumaya Cherkaoui

TL;DR
This paper introduces matching-based schemes for service offloading in compute-less IoT networks, optimizing edge server utilization to reduce computation and communication delays, with proven stability and significant efficiency gains.
Contribution
It proposes a novel matching theory-based framework, WHISTLE, for efficient service offloading and computation reuse among edge servers in IoT networks.
Findings
Accelerates task completion time by 20%
Reduces computation by up to 77%
Decreases communication by up to 71%
Abstract
With the advent of the Internet of Things (IoT) and 5G networks, edge computing is offering new opportunities for business model and use cases innovations. Service providers can now virtualize the cloud beyond the data center to meet the latency, data sovereignty, reliability, and interoperability requirements. Yet, many new applications (e.g., augmented reality, virtual reality, artificial intelligence) are computation-intensive and delay-sensitivity. These applications are invoked heavily with similar inputs that could lead to the same output. Compute-less networks aim to implement a network with a minimum amount of computation and communication. This can be realized by offloading prevalent services to the edge and thus minimizing communication in the core network and eliminating redundant computations using the computation reuse concept. In this paper, we present matching-based…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT and Edge/Fog Computing
