检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王小洁 刘子依 唐守泽 祝海琳 周力 宁兆龙 郭磊[1] WANG Xiaojie;LIU Ziyi;TANG Shouze;ZHU Hailin;ZHOU Li;NING Zhaolong;GUO Lei(School of Communications and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;College of Electronic Science and Technology,National University of Defense Technology,Changsha 410073,China)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]国防科技大学电子科学学院,湖南长沙410073
出 处:《通信学报》2025年第2期83-96,共14页Journal on Communications
基 金:国家自然科学基金资助项目(No.62025105,No.62272075,No.62171449);重庆市自然科学基金资助项目(No.CSTB2024NSCQ-JQX0013,No.CSTB2024NSCQ-QCXMX0058);重庆市教委科学技术研究基金资助项目(No.KJZDM202200601,No.KJZD-K202300608)。
摘 要:为了缓解不断增长的并发交易数量导致的链下支付通道拥塞问题,提出了一种基于截止时间的优先级博弈调度(PGSD)算法。该算法将同向优先级调度和双向节点转发方向决策构建成2个相互关联的资源分配问题,采用合作博弈对优化目标(交易成功率和交易起始金额)进行求解,通过重复博弈和策略更新找到最优策略以达到动态纳什均衡,最终实现支付通道网络(PCN)中交易的高效调度。基于Kaggle信用卡数据集的仿真结果表明,所提多优先级调度算法具有理想的能效性能,与其他调度算法相比,能够实现更高的业务吞吐量和成功率。所提算法能够有效改善链下资源配置,实现了PCN频繁交易的可持续性优化和高效运行。To alleviate the congestion of off-chain channels caused by the increasing number of transactions and the sharing of concurrent transaction payment channels,a priority game scheduling based on deadline(PGSD)algorithm was proposed for off-chain transactions of the payment channel network(PCN).Two sub-problems of same-direction priority scheduling and bi-directional node forwarding direction decisions were constructed into two interrelated games.The optimization objectives(transaction success rate and initial transaction funds)were solved by using cooperative game theory,and the optimal strategy was found through repeated game play and adjustment of reaction strategies to achieve dynamic Nash equilibrium,ultimately realizing efficient scheduling of transactions in the PCN.Simulation results based on the Kaggle credit card dataset show that the proposed multi-priority scheduling algorithm has high energy efficiency performance,and can achieve higher transaction throughput and success rate than other scheduling algorithms.The proposed algorithm can effectively improve the off-chain resource allocation and achieve the sustainability optimization and efficient operation of PCN frequent transactions.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38