[1]陶军,陆一飞.一种基于Stackelberg博弈的流速与拥塞控制算法[J].东南大学学报(自然科学版),2009,39(4):710-715.[doi:10.3969/j.issn.1001-0505.2009.04.012]
 Tao Jun,Lu Yifei.Flow and congestion control algorithm based on Stackelberg game theory[J].Journal of Southeast University (Natural Science Edition),2009,39(4):710-715.[doi:10.3969/j.issn.1001-0505.2009.04.012]
点击复制

一种基于Stackelberg博弈的流速与拥塞控制算法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
39
期数:
2009年第4期
页码:
710-715
栏目:
计算机科学与工程
出版日期:
2009-07-20

文章信息/Info

Title:
Flow and congestion control algorithm based on Stackelberg game theory
作者:
陶军 陆一飞
东南大学计算机网络和信息集成教育部重点实验室,南京 210096; 东南大学计算机科学与工程学院, 南京 210096
Author(s):
Tao Jun Lu Yifei
Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 210096, China
School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
关键词:
效用 层次Stackelberg均衡 流速与拥塞控制
Keywords:
utility hierarchical Stackelberg equilibrium flow and congestion control
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2009.04.012
摘要:
研究了Stackelberg流速与拥塞博弈问题,对一次非合作流速与拥塞控制博弈模型中的Nash均衡点进行了推理和证明.接着深入研究了单跟随者与多跟随者流速与拥塞博弈模型,论证和推导了均衡的存在性和均衡解向量.在此基础上,扩展模型到多层次的Stackelberg博弈结构中,并找出均衡点上领导者和多跟随者流速率的解析解.基于Stackelberg拥塞博弈模型,提出了相关流速与拥塞控制算法(HCAS)的框架,包括层速率控制算法和端系统速率控制算法2个部分,在层速率计算完毕后,层内端系统速率将由层内端系统速率分配算法决定.仿真实验表明,HCAS能够较好地实现层速率分配以及端系统速率的计算工作,验证了算法的可行性和有效性.
Abstract:
The problem of Stackelberg flow and congestion control game is studied. After one-shot non-cooperative flow and congestion control game model and the solutions for flow control game equilibrium are deduced, this paper further studies the flow and congestion control model based on the single/multi-follower Stackelberg game model. Subsequently, the existence and the vector solution of the Stackelberg equilibrium are proved. Furthermore, the single/multi-follower model is extended to hierarchical Stackelberg game structure. Moreover, the analytic solution of leaders’ and multi-follower’s flow rate on equilibrium point is found. Finally, a framework of hierarchical flow control algorithm based on Stackelberg game theory(HCAS)is presented. The HCAS algorithm includes two parts, the layer rate control algorithm and the end system flow control algorithm. After layer rate is calculated by the layer rate control algorithm, the flow rate is allocated among users in the same layer by the end system flow control algorithm. The results of experiments and simulations show that the HCAS algorithm can perform layer rate calculation and flow rate allocation among users. Therefore, the feasibility and effectiveness of the algorithm are verified.

参考文献/References:

[1] Altman E.Flow control using the theory of zero sum Markov games [J].IEEE Transactions on Automatic Control,1994,39(4):814-818.
[2] La R J,Anantharam V.Utility-based rate control in the Internet for elastic traffic [J].IEEE/ACM Transactions on Networking,2002,10(2):272-286.
[3] Mo J,La R J,Anantharam V,et al.Analysis and comparison of TCP Reno and Vegas [C] //IEEE INFOCOM 1999.New York,1999:1556-1563.
[4] La R J,Anantharam V.Window-based congestion control with heterogeneous users [C] //Proc IEEE INFOCOM 2001.Anchorage,Alaska,USA,2001:1320-1329.
[5] Karakostas G,Kolliopoulos S G.Edge pricing of multicommodity networks for heterogeneous selfish users[C] //Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science.Rome,Italy,2004:268-276.
[6] Feldman Michal,Chuang John.Overcoming free-riding behavior in peer-to-peer systems [J].SIGecom Exchanges,2005,5(3):41-50.
[7] Fotakis D.Stackelberg strategies for atomic congestion games [C] //European Symposium on Algorithms.Eilat,Israel,2007:299-310.
[8] Alpcan T,Basar T.A utility-based congestion control scheme for Internet-style networks with delay [C] //Proc IEEE INFOCOM 2003.San Francisco,CA,USA,2003,3:2039-2048.
[9] Kwok Yu-Kwong,Song ShanShan,Hwang Kai.Selfish grid computing:game-theoretic modeling and NAS performance results [C] //Proceedings of the International Symposium on Cluster Computing and the Grid.Cardiff,UK,2005:1143-1150.
[10] Basar T,Srikant R.Revenue-maximizing pricing and capacity expansion in a many-users regime [C] //Proc IEEE INFOCOM 2002.New York,2002:1556-1563.
[11] Bertsekas D P. Nonlinear programming [M].Belmont,MA:Athena Scientific,1995:169-177.
[12] Bialas W F.Cooperative N-person Stackelberg games [C] //IEEE Conference on Decision and Control.Tampa,FL,USA,1989:2439-2444.

相似文献/References:

[1]钟晓,陶军.分布式分级结构的用户路由行为模型[J].东南大学学报(自然科学版),2011,41(2):237.[doi:10.3969/j.issn.1001-0505.2011.02.005]
 Zhong Xiao,Tao Jun.Distributed hierarchy routing behavior model[J].Journal of Southeast University (Natural Science Edition),2011,41(4):237.[doi:10.3969/j.issn.1001-0505.2011.02.005]

备注/Memo

备注/Memo:
作者简介: 陶军(1978—),男,博士,juntao@seu.edu.cn.
基金项目: 国家自然科学基金重大研究计划资助项目(90604003)、国家自然科学基金资助项目(60603067).
引文格式: 陶军,陆一飞.一种基于Stackelberg博弈的流速与拥塞控制算法[J].东南大学学报:自然科学版,2009,39(4):710-715. [doi:10.3969/j.issn.1001-0505.2009.04.012]
更新日期/Last Update: 2009-07-20