首页 | 本学科首页   官方微博 | 高级检索  
     

网络路由基于对策论的资源分配策略
引用本文:董军,詹聪明,舒静. 网络路由基于对策论的资源分配策略[J]. 电子学报, 2010, 38(Z1)
作者姓名:董军  詹聪明  舒静
作者单位:华东师范大学软件学院,上海,200062
基金项目:上海市优秀学科带头人计划,国家重点基础研究发展规划 
摘    要:对策论提供对独立参与者之间冲突进行建模的框架,可用以综合考虑路由选择和拥塞控制问题.经典的对策论不一定直接能应用于网络.本文在路由选择的多Agent系统的基础上,给出具有"惩恶扬善"行为的基于对策论的路由资源分配策略.它奖励避免拥塞、惩罚行为不合要求的用户.在用户都是理性的前提下,系统能稳定在纳什均衡状态.

关 键 词:对策论  路由选择  拥塞控制  多Agent系统  资源分配

Routing Resource Distribution Strategy Based on Game Theory
DONG Jun,ZHAN Cong-min,SHU Jing. Routing Resource Distribution Strategy Based on Game Theory[J]. Acta Electronica Sinica, 2010, 38(Z1)
Authors:DONG Jun  ZHAN Cong-min  SHU Jing
Affiliation:DONG Jun,ZHAN Cong-min,SHU Jing(Software Engineering Institute,East China Normal University,Shanghai 200062,China)
Abstract:Game theory is alternative framework to model confliction between independence players,which can be used to solve the problem.However,classic game theory couldn't be applied to network directly.Game theory based routing approach MPS,which can encourage merit and punish evil,is presented.It rewards congestion avoiding users and punishes misbehaving users.A Nash Equilibrium could be reached when players are rational.
Keywords:multi-agents system  game theory  routing  congestion control  resource distribution  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号