mlsanityData to 14 Oct 2026

Resource Sharing in the Edge: A Distributed Bargaining-Theoretic Approach

arXiv 2001.04229 ↗First posted 13 Jan 2020cs.GT cs.DC cs.MAcited by 1

Not on the map. Why?

Abstract (arXiv)

The growing demand for edge computing resources, particularly due to increasing popularity of Internet of Things (IoT), and distributed machine/deep learning applications poses a significant challenge. On the one hand, certain edge service providers (ESPs) may not have sufficient resources to satisfy their applications according to the associated service-level agreements. On the other hand, some ESPs may have additional unused resources. In this paper, we propose a resource-sharing framework that allows different ESPs to optimally utilize their resources and improve the satisfaction level of applications subject to constraints such as communication cost for sharing resources across ESPs. Our framework considers that different ESPs have their own objectives for utilizing their resources, thus resulting in a multi-objective optimization problem. We present an N-person Nash Bargaining Solution (NBS) for resource allocation and sharing among ESPs with Pareto optimality guarantee. Furthermore, we propose a distributed, primal-dual algorithm to obtain the NBS by proving that the strong-duality property holds for the resultant resource sharing optimization problem. Using synthetic and real-world data traces, we show numerically that the proposed NBS based framework not only enhances the ability to satisfy applications' resource demands, but also improves utilities of different ESPs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 13 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.