期刊文献+

非合作流速与拥塞控制博弈的应用 被引量:3

Application and research on non-cooperative flow and congestion control game
在线阅读 下载PDF
导出
摘要 针对Internet用户的贪婪行为,引入非合作博弈理论,为非合作网络中的流速与拥塞控制行为建立模型,论证了上述博弈模型中Nash均衡点的存在性和惟一性.在分析了求解Nash均衡点解析解的基础上,设计实现了一种分布式流速控制算法(FCAG-SL).仿真实验表明,FCAG-SL算法具有良好的收敛性,应用流可以获得比其他拥塞控制算法更高的效用和整个系统的效用,验证了算法的可行性和有效性. 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.
作者 陶军 林辉
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2006年第1期52-57,共6页 Journal of Southeast University:Natural Science Edition
基金 高等学校博士学科点专项基金资助项目(20040286001)
关键词 非合作博弈 NASH均衡 效用 流速与拥塞控制 non-cooperative game Nash equilibrium utility flow and congestion control
  • 相关文献

参考文献14

  • 1La 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.
  • 2Mo 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.
  • 3La R J,Anantharam V.Window-based congestion control with heterogeneous users [C]//Proc IEEE INFOCOM 2001.Anchorage,Alaska,2001:1320-1329.
  • 4Chandrayana 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.
  • 5Fayek 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.
  • 6Odlyzko A.A modest proposal for preventing internet congestion [R].Technical Report TR 97.35.1,AT&T Research,1997.
  • 7Mitra D.Asymptotically optimal design of congestion control for high speed data network [J].IEEE Transactions on Communications,1992,40(2):301-311.
  • 8Mitra 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.
  • 9Fendick 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.
  • 10Cohen 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.

同被引文献18

  • 1綦朝晖,孙济洲,李小图.基于队列的模糊拥塞控制算法[J].软件学报,2005,16(2):286-294. 被引量:16
  • 2Chen H,Jin H,Sun J H,et al.Analysis of large-scale topological properties for peer-to-peer networks[C]∥Proc of International Symposium on Cluster Computing and the Grid (CCGird04).Los Angeles:IEEE Press,2004:27-34.
  • 3Fuks H,Lawniczak A T,Volkov S.Packet delay in data network models[J].ACM Transactions on Modeling and Computer Simulation,2001,11(3):233-250.
  • 4Kleinrock L.Queueing systems,Vol.1:Theory[M].New York:Wiley,1976.
  • 5COHENJ E.Cooperation and self-interest:Pare to-ineficiency ofNash equilibria in finite random games. Proceedings of the Na-tional Academy of Sciences of the United States of America . 1998
  • 6BASAR T,SRIKANTR.Revenue-maximizing pricing and capacity ex-pansion in a many-users regime. Proceedings of the 21st AnnualJoint Conference on Computer and Communications Societies:INFOCOM2002 . 2002
  • 7Altman E,Basar T,Srikant R.Nash Equilibria for Combined Flow Control and Routing in Networks: Asymptotic Behavior for a Large Number of Users. IEEE Transactions on Automatic Control . 2002
  • 8La R J,Anantharam V.Utility-based Rate Control in the Internet for Elastic Traffic. IEEE ACM Transactions on Networking . 2002
  • 9Otrok H,Mehrandish M,Assi C,et al.Game theoreticmodels for detecting network intrusions. Computer Communications . 2008
  • 10Alpcan T,Basar T.A game theoretic analysis of intru-sion detection in access control systems. Proceed-ings of the43rd IEEE Conference on Decision and Con-trol . 2004

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部