Abstract
Mobile edge computing (MEC) transforms the network edge into an intelligent computing platform by deploying heterogeneous servers near end users. However, allocating resources to diverse users in MEC faces several challenges: wireless access may be limited by access point range, user demands often mismatch heterogeneous server configurations, and both computing and communication resources are constrained. Fair and efficient multi-resource allocation can promote sharing while utilizing idle capacity for high-workload users. To address this, we propose LMMTSF, a Lexicographically MaxMin Task Share Faireness allocation mechanism that accounts for server access and external wireless resource constraints. Theoretically, LMMTSF satisfies several desirable properties including envy-freeness, Pareto optimality, sharing incentives, and strategy-proofness. Large-scale simulations using Alibaba cluster traces show that LMMTSF outperforms state-of-the-art fair allocation mechanisms in resource utilization and upholds the sharing incentive property.
| Original language | English |
|---|---|
| Pages (from-to) | 18145-18158 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Vehicular Technology |
| Volume | 75 |
| Issue number | 8 |
| DOIs | |
| State | Published - 2026 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 1967-2012 IEEE.
Keywords
- Edge computing
- access constraints
- fair resource allocation
- lexicographically max-min
- task share fairness
Fingerprint
Dive into the research topics of 'A Strategy-Proof Mechanism for Fair Allocation of Multiple Resources With Access Constraints in Mobile Edge Computing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver