[1]陶军,林辉.非合作流速与拥塞控制博弈的应用[J].东南大学学报(自然科学版),2006,36(1):52-57.[doi:10.3969/j.issn.1001-0505.2006.01.011]
 Tao Jun,Lin Hui.Application and research on non-cooperative flow and congestion control game[J].Journal of Southeast University (Natural Science Edition),2006,36(1):52-57.[doi:10.3969/j.issn.1001-0505.2006.01.011]
点击复制

非合作流速与拥塞控制博弈的应用()
分享到:

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

卷:
36
期数:
2006年第1期
页码:
52-57
栏目:
计算机科学与工程
出版日期:
2006-01-20

文章信息/Info

Title:
Application and research on non-cooperative flow and congestion control game
作者:
陶军1 林辉2
1 东南大学计算机科学与工程系, 南京 210096; 2 南京大学商学院, 南京 210093
Author(s):
Tao Jun1 Lin Hui2
1 Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China
2 Business School, Nanjing University, Nanjing 210093, China
关键词:
非合作博弈 Nash均衡 效用 流速与拥塞控制
Keywords:
non-cooperative game Nash equilibrium utility flow and congestion control
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2006.01.011
摘要:
针对Internet用户的贪婪行为,引入非合作博弈理论,为非合作网络中的流速与拥塞控制行为建立模型,论证了上述博弈模型中Nash均衡点的存在性和惟一性.在分析了求解Nash均衡点解析解的基础上,设计实现了一种分布式流速控制算法(FCAG-SL).仿真实验表明,FCAG-SL算法具有良好的收敛性,应用流可以获得比其他拥塞控制算法更高的效用和整个系统的效用,验证了算法的可行性和有效性.
Abstract:
Because of the greedy behaviors of Internet users, the non-cooperative game theory is introduced to model the behaviors of flow and congestion control in non-cooperative network. The existence and uniqueness of the Nash equilibrium point are proved. After the analytic solution of flow was found through ratiocinating and proving, a distributed flow control algorithm, flow control asynchronous algorithm based on game theory for single link(FCAG-SL), was brought forward. Subsequently, the implement of FCAG-SL algorithm was presented. Finally, FCAG-SL algorithm was simulated in specific network environment. The results of simulation were compared with other protocols, such as Reno and Newreno. It is shown that application flow adopting FCAG-SL algorithm can gain higher utility. Thus the feasibility and effectiveness of the algorithm is verified by results of experiment and simulation.

参考文献/References:

[1] 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.
[2] Mo J,La R J,Anantharam V,et al.Analysis and comparison of TCP reno and vegas[C] // IEEE INFOCOM’99 .New York,NY,1999:1556-1563.
[3] La R J,Anantharam V.Window-based congestion control with heterogeneous users [C] //Proc IEEE INFOCOM 2001.Anchorage,Alaska,2001:1320-1329.
[4] Chandrayana K,Kalyanaraman S.Uncooperative congestion control [C] // Proc of ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems.New York,2004:258-269.
[5] Fayek D,Kesidis G,Vannelli A.Hierarchical virtual paths allocation in large-scale ATM networks using noncooperative game models [EB/OL].[1999-10-18)[2004-11-08].http://www.cse.psu.edu/~kesidis/papers/default.htm.
[6] Odlyzko A.A modest proposal for preventing internet congestion [R].Technical Report TR 97.35.1,AT&T Research,1997.
[7] Mitra D.Asymptotically optimal design of congestion control for high speed data network [J]. IEEE Transactions on Communications,1992,40(2):301-311.
[8] Mitra D,Mitrani I.Efficient window flow control for high speed data networks with small buffers [J]. Annals of Operations Research,1994,49(6):1-24.
[9] Fendick K,Mitra D,Mitrani I,et al.An approach to high-performance,high-speed data networks [J]. IEEE Communications Magazine,1991,29(10):74-82.
[10] Cohen J E.Cooperation and self-interest:pareto-inefficiency of Nash equilibria in finite random games [J]. Proc Natl Acad Sci USA,1998,95(17):9724-9731.
[11] Papadimitriou C H,Yannakakis M.On the approximability of trade-offs and optimal access of Web sources[C] // Proc 41st Annual Symposium on Foundations of Computer Science.Redondo Beach,California,2000:86-92.
[12] 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.
[13] Bertsekas D P.Nonlinear programming [M].Belmont,MA:Athena Scientific,1995:169-177.
[14] University of California.Network simulator(NS)[EB/OL].1997[2004-11-08].http://www.nrg.ee.lbl.gov/NS.

相似文献/References:

[1]陶军,吴家皋,刘业.无限重复流速与拥塞控制博弈实例的应用[J].东南大学学报(自然科学版),2005,35(6):853.[doi:10.3969/j.issn.1001-0505.2005.06.005]
 Tao Jun,Wu Jiagao,Liu Ye.Application of examples of infinite repeated flow and congestion control game[J].Journal of Southeast University (Natural Science Edition),2005,35(1):853.[doi:10.3969/j.issn.1001-0505.2005.06.005]
[2]黄园高,周晶.收费公路和公共交通之间的定价博弈分析[J].东南大学学报(自然科学版),2004,34(2):268.[doi:10.3969/j.issn.1001-0505.2004.02.030]
 Huang Yuangao,Zhou Jing.Fare competition between highway and public transport[J].Journal of Southeast University (Natural Science Edition),2004,34(1):268.[doi:10.3969/j.issn.1001-0505.2004.02.030]
[3]林辉,陈行,陶军.基于静态非合作博弈的网络报文取样模型[J].东南大学学报(自然科学版),2010,40(3):481.[doi:10.3969/j.issn.1001-0505.2010.03.009]
 Lin Hui,Chen Hang,Tao Jun.Network packets sampling modeling based on static non-cooperative game[J].Journal of Southeast University (Natural Science Edition),2010,40(1):481.[doi:10.3969/j.issn.1001-0505.2010.03.009]

备注/Memo

备注/Memo:
基金项目: 高等学校博士学科点专项基金资助项目(20040286001).
作者简介: 陶军(1975—),男,博士,讲师,juntao@seu.edu.cn.
更新日期/Last Update: 2006-01-20