Abstract
A large number of computing task requests are generated by user terminals during peak hours in high-demand areas, but the resource capacity of edge servers is limited. It is necessary to design appropriate resource allocation and pricing mechanisms to address this resource competition dilemma. This paper proposes an auction-based mechanism called GMPO from an economic perspective. A market where multiple buyers and sellers compete with each other is considered, and the auction mechanisms is used to prevent these entities from falsely reporting information. As an extension of the concept of the age of information, the value of delay-sensitive computing tasks will decrease over time. This paper allocates resources greedily according to defined priorities and charge based on critical prices. The experiment results demonstrate that the proposed mechanism can effectively improve social welfare and guarantee the economic properties of auctions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zhang, C., Du, H., Ye, Q., Liu, C., Yuan, H.: DMRA: a decentralized resource allocation scheme for multi-SP mobile edge computing. In: 2019 IEEE 39th international conference on distributed computing systems (ICDCS), pp. 390–398. IEEE(2019)
Zeng, G., Zhang, C., Du, H.: An efficient mechanism for resource allocation in mobile edge computing. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 657–668. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-64843-5_44
Chen, W., Su, Z., Xu, Q., Luan, T.H., Li, R.: VFC-based cooperative UAV computation task offloading for post-disaster rescue. In: IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pp. 228–236. IEEE. (2020)
Qiu, H., et al.: Applications of auction and mechanism design in edge computing: a survey. IEEE Trans. Cogn. Commun. Netw. 8(2), 1034–58 (2022)
Hung, Y.H., Wang, C.Y., Hwang, R.H.: Optimizing social welfare of live video streaming services in mobile edge computing. IEEE Trans. Mob. Comput. 19(4), 922–34 (2019)
Yang, S.: A task offloading solution for internet of vehicles using combination auction matching model based on mobile edge computing. IEEE Access. 8, 53261–73 (2020)
Kaul, S., Yates, R., Gruteser, M.: Real-time status: how often should one update?. In: 2012 Proceedings IEEE INFOCOM, pp. 2731–2735. IEEE. (2012)
Yates, R.D., Sun, Y., Brown, D.R., Kaul, S.K., Modiano, E., Ulukus, S.: Age of information: an introduction and survey. IEEE J. Sel. Areas Commun. 39(5), 1183–210 (2021)
Lv, H., Zheng, Z., Wu, F., Chen, G.: Strategy-proof online mechanisms for weighted AoI minimization in edge computing. IEEE J. Sel. Areas Commun. 39(5), 1277–92 (2021)
Chen, Y., Li, Z., Yang, B., Nai, K., Li, K.: A Stackelberg game approach to multiple resources allocation and pricing in mobile edge computing. Futur. Gener. Comput. Syst. 108, 273–87 (2020)
He, X., Shen, Y., Ren, J., Wang, S., Wang, X., Xu, S.: An online auction-based incentive mechanism for soft-deadline tasks in collaborative edge computing. Futur. Gener. Comput. Syst. 137, 1–3 (2022)
Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58–73 (1981)
Acknowledgment
This work is supported by National Natural Science Foundation of China (No. 62172124). It was also supported by the Shenzhen Basic Research Program (Project No. JCYJ20190806143011274).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, Q., Wang, Z., Du, H. (2024). Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets. In: Wu, W., Guo, J. (eds) Combinatorial Optimization and Applications. COCOA 2023. Lecture Notes in Computer Science, vol 14462. Springer, Cham. https://doi.org/10.1007/978-3-031-49614-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-49614-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49613-4
Online ISBN: 978-3-031-49614-1
eBook Packages: Computer ScienceComputer Science (R0)