An Online Auction Approach to Computing Resource Allocation in Mobile AIGC Networks

We study resource allocation and task scheduling for mobile artificial intelligence generated content (AIGC) in a three-layer cloud-edge-device network. Escalating industry demand for computational resources presents significant challenges in resource allocation and optimization, particularly for edge-side AIGC, which faces high computational costs and requires advanced techniques for efficient model deployment on mobile devices. Optimal resource allocation in mobile AIGC networks is naturally formulated into a 0-1 ILP, which is proven NP-hard. We reformulate the problem into both its Comp-Exp and dual forms. Then, we design an online auction framework online AIGC task scheduling (OATS) to optimize decisions on instances and time schedules, maximizing social welfare for the AIGC ecosystem. Our analysis demonstrates that OATS achieves high social welfare through appropriate bid acceptance and resource allocation. Simulation results corroborate the theoretical analysis, showcasing the efficacy of our online algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-12-11
DOI
https://doi.org/10.1109/jiot.2024.3515166
Citations
1
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Online Auction Approach to Computing Resource Allocation in Mobile AIGC Networks

Nan Guan, Hong Xu, Zongpeng Li, Yeqiao Hou et al.
1 citations
IEEE Internet of Things Journal
Distributed and Parallel Computing Systems
0.35
article

An Online Auction Approach to Computing Resource Allocation in Mobile AIGC Networks

Nan Guan, Hong Xu, Zongpeng Li, Yeqiao Hou, Kaiwei Mo, Xianglong Li
article en
1 citations

Abstract

We study resource allocation and task scheduling for mobile artificial intelligence generated content (AIGC) in a three-layer cloud-edge-device network. Escalating industry demand for computational resources presents significant challenges in resource allocation and optimization, particularly for edge-side AIGC, which faces high computational costs and requires advanced techniques for efficient model deployment on mobile devices. Optimal resource allocation in mobile AIGC networks is naturally formulated into a 0-1 ILP, which is proven NP-hard. We reformulate the problem into both its Comp-Exp and dual forms. Then, we design an online auction framework online AIGC task scheduling (OATS) to optimize decisions on instances and time schedules, maximizing social welfare for the AIGC ecosystem. Our analysis demonstrates that OATS achieves high social welfare through appropriate bid acceptance and resource allocation. Simulation results corroborate the theoretical analysis, showcasing the efficacy of our online algorithms.

IEEE Internet of Things JournalVol. 12(8)
City University of Hong Kong (HK), Chinese University of Hong Kong (HK), Wuhan University (CN), Communication University of Zhejiang (CN), University of Hong Kong (HK)
Openalex Percentile: Top 36%
Distributed and Parallel Computing Systems
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Online Auction Approach to Computing Resource Allocation in Mobile AIGC Networks — Nan Guan, Hong Xu, et al. · IEEE Internet of Things Journal (2024) | TGRS Research Map | TGRS