Marginal Value-Based Edge Resource Pricing and Allocation for Deadline-Sensitive Tasks
Puwei Wang, Zhouxing Sun, Ying Zhan, Haoran Li, Xiaoyong Du
Abstract
In edge computing (EC), resource allocation is to allocate computing, storage and networking resources on the edge nodes (ENs) efficiently and reasonably to tasks generated by users. Due to the resource-limitation of ENs, the tasks often need to compete for the resources. Pricing mechanisms are widely used to deal with the resource allocation problem, and the valuations of tasks play a critical role in the price mechanisms. However, users naturally are not willing to expose the valuations of their tasks due to conflicts of interests. Current research works usually adopt truthful auctions to motivate the users to report honestly the valuations of their tasks. In this paper, we introduce the marginal value to estimate the valuations of tasks, and propose a marginal value-based pricing mechanism using the incentive theory, which motivates the tasks with higher marginal values to actively request more resources. The EC platform sets the resource prices using the price mechanism, and then the users determine their resource requests relying on the resource prices and the valuations of their tasks. After receiving the deadline-sensitive tasks from the users, the resource allocation can be modeled as a knapsack problem with the deadline constraints. Extensive experimental results demonstrate that our approach is computationally efficient and is promising in enhancing the utility of the EC platform and the tasks.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 2b700f75-a9e3-4052-a687-2c1e4b3be756Related papers
- Following the Usage, Not the Request: Risk-Aware Task Scheduling with Overbooking in Edge CloudsTie Ma, Shan Zhang, Xiaoyu Zhang, Zichuan Zheng et al.INFOCOM 2026
- An Incentive Mechanism Design for Efficient Edge Learning by Deep Reinforcement Learning ApproachYufeng Zhan, Jiang ZhangINFOCOM 2020 · 102 citations
- Socially-Optimal Mechanism Design for Incentivized Online LearningZhiyuan Wang, Lin Gao, Jianwei HuangINFOCOM 2022 · 11 citations
- Let's Share VMs: Optimal Placement and Pricing across Base Stations in MEC SystemsMarie Siew, Kun Guo, Desmond W. H. Cai, Lingxiang Li et al.INFOCOM 2021 · 24 citations
- INVAR: Inversion Aware Resource Provisioning and Workload Scheduling for Edge ComputingBin Wang, David Irwin, Prashant J. Shenoy, Don TowsleyINFOCOM 2024 · 11 citations
