节点文献

基于Stackelberg Game诱导策略的网络调度算法

Network scheduling algorithm based on Stackelberg Game with incentive strategy

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 魏蛟龙胡进代文娟邹佳宏

【Author】 WEI Jiao-long, HU Jin, DAI Wen-juan, ZOU Jia-hong (Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, china)

【机构】 华中科技大学电子与信息工程系

【摘要】 首先建立了网络Stackelberg Game模型,分析了该模型下Nash均衡的存在性,给出了网络的队最优解。在网络资源管理中,引入基于Stackelberg Game的网络诱导策略,利用动态博弈和多次逐步诱导的方法,提出了一种网络由一般状态到最优运行状态的动态调度算法。队最优解保证了网络在最优运行状态下的稳定性。数值仿真验证了该算法的有效性。

【Abstract】 First, a Stackelberg Game network model was built. In this model, the existence of Nash equilibrium was analyzed and the team optimal solution of the network was available. Then a network scheduling algorithm based on Stackelberg Game with incentive strategy which can adjust the network from general state to optimal state by dynamic Game and gradual induction was introduced into the network resource management. The team-optimal solution ensures the stability of network in the optimal state. Finally, the simulation results demonstrate the effectiveness of the algorithm.

  • 【文献出处】 通信学报 ,Journal on Communications , 编辑部邮箱 ,2009年01期
  • 【分类号】TN915.01
  • 【被引频次】15
  • 【下载频次】351
节点文献中: 

本文链接的文献网络图示:

本文的引文网络