Evaluation on real hardware under sustained overload shows that PRICE outperforms both fixed-allocation and dynamic-pricing baselines in accepted throughput and CPU utilization and is robust across pricing function families, task-duration distributions, and client populations.
Abstract
Edge nodes are capacity-constrained by design, yet many edge workloads can trade result quality for resource efficiency at runtime. Existing edge pricing mechanisms largely treat requests as fixed-configuration submissions and rarely exploit per-request quality flexibility under overload. We present PRICE, an incentive mechanism that couples a utilization-dependent price signal to per-request quality selection. As utilization increases, rising acceptance prices make resource-intensive variants less likely to be selected, shifting accepted requests toward lighter execution and allowing the node to serve significantly more requests while operating near capacity. Evaluation on real hardware under sustained overload shows that PRICE outperforms both fixed-allocation and dynamic-pricing baselines in accepted throughput and CPU utilization. The results are robust across pricing function families, task-duration distributions, and client populations. Result-quality flexibility is a powerful but underused control dimension for overload management at the edge, and pricing is an effective mechanism to exploit it.
The results show that soft SLO limits reduce corrective rescheduling actions by 49% compared to hard-limit approaches while maintaining acceptable performance guarantees, and resource-aware scheduling decreases node-level congestion and further mitigates SLO violations, demonstrating the effectiveness of incorporating...
Oliver Larsson, Thijs Metsch, Cristian Klein et al.· 0 citations
This paper presents a service-aware network capacity planning suite that systematically improves network efficiency with a service collaboration approach, and proposes the "safe capacity" abstraction which enables services to incorporate current and projected network conditions into their compute and storage allocation...
Vinayak Dangui, A. Razmjoo, Guanqing Yan et al.· Conference on Applications,...· 0 citations
This work proposes CAPSUM, a capacity-aware admission policy with an elastic specialization, CAPSUM-E, and implements an exact local offline dynamic program and compares against direct common-model baselines and documented source-derived adapters for EDP-A, OREO, and uEDC-L.
Hailiang Zhao, Zi-Qi Wang, Yi-Fei Zhang et al.· 0 citations
When inference demand exceeds available compute capacity, model providers must decide which requests should be served first. Users have different tolerances for delay from an LLM API, but current priority pricing schemes compress these differences into coarse fixed-price service tiers. We design an inference auction th...
Keegan Harris, Siddharth Prasad, Asher Trockman et al.· 0 citations
The economic theory of LLM pricing treats tokens as a homogeneous commodity considering aggregate token count as the main features buyers and sellers consider. We model inference as a service market where buyers have three-dimensional private information - willingness-to-pay, task volume, and time preference - and util...
This article proposes Volunteer Edge, a cost-effective real-time task offloading framework that exploits underutilized computing resources of privately managed nodes to execute offloaded workloads and reduces edge rental costs by 54.0% on average compared with conventional public-edge-based offloading while maintaining...