An Efficient Winner and Payment Determination Algorithm in Reverse Auction for Edge Federation

IF 4.7 2区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Network and Service Management Pub Date : 2025-01-01 DOI:10.1109/TNSM.2024.3524605

Taeyun Kim;Joonwoo Kim;Hochan Lee;Seoyul Oh;Sangheon Pack

{"title":"An Efficient Winner and Payment Determination Algorithm in Reverse Auction for Edge Federation","authors":"Taeyun Kim;Joonwoo Kim;Hochan Lee;Seoyul Oh;Sangheon Pack","doi":"10.1109/TNSM.2024.3524605","DOIUrl":null,"url":null,"abstract":"Edge federation is a promising approach for reducing the workload of each operator by facilitating resource sharing amongst operators. However, operators often exhibit selfish behavior, prioritizing their own benefits. They may refrain from participating in edge federation or misrepresent the actual value of their resources, which ultimately diminishes the overall benefits of edge federation. To address this issue, we first establish a Vickrey-Clarke-Groves (VCG)-based reverse auction framework for task offloading in edge federation. In the framework, a winner determination problem is formulated as an integer linear programming (ILP) problem. The ILP problem formulated has high computational complexity and cannot be applied to large and dynamic network environments. Thus, we propose an efficient winner and payment (W&P) determination algorithm to obtain sub-optimal solutions in polynomial time. Extensive simulation results demonstrate that the proposed algorithm increases the total profit of edge federation by up to 119.7% and reduces total resource usage by up to 54.8%, respectively, compared to other comparison algorithms.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1945-1954"},"PeriodicalIF":4.7000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10819483/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

Edge federation is a promising approach for reducing the workload of each operator by facilitating resource sharing amongst operators. However, operators often exhibit selfish behavior, prioritizing their own benefits. They may refrain from participating in edge federation or misrepresent the actual value of their resources, which ultimately diminishes the overall benefits of edge federation. To address this issue, we first establish a Vickrey-Clarke-Groves (VCG)-based reverse auction framework for task offloading in edge federation. In the framework, a winner determination problem is formulated as an integer linear programming (ILP) problem. The ILP problem formulated has high computational complexity and cannot be applied to large and dynamic network environments. Thus, we propose an efficient winner and payment (W&P) determination algorithm to obtain sub-optimal solutions in polynomial time. Extensive simulation results demonstrate that the proposed algorithm increases the total profit of edge federation by up to 119.7% and reduces total resource usage by up to 54.8%, respectively, compared to other comparison algorithms.

查看原文本刊更多论文

边缘联邦逆向拍卖中一种有效的赢家和支付确定算法

边缘联合是一种很有前途的方法，可以通过促进运营商之间的资源共享来减少每个运营商的工作量。然而，运营商往往表现出自私的行为，优先考虑自己的利益。他们可能不参与边缘联合或歪曲其资源的实际价值，这最终会减少边缘联合的总体利益。为了解决这个问题，我们首先建立了一个基于Vickrey-Clarke-Groves （VCG）的反向拍卖框架，用于边缘联邦中的任务卸载。在该框架中，将胜利者确定问题表述为整数线性规划问题。所提出的ILP问题计算复杂度高，不能应用于大型动态网络环境。因此，我们提出了一种有效的赢家和报酬（W&P）确定算法，以在多项式时间内获得次优解。大量的仿真结果表明，与其他比较算法相比，该算法将边缘联合的总利润提高了119.7%，将总资源利用率降低了54.8%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications

CiteScore

9.30

自引率

15.10%

发文量

325

期刊介绍： IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.