期刊文献+

一种基于思维进化计算和博弈论的QoS组播路由算法 被引量:3

A QoS Multicast Routing Algorithm Based on Mind Evolutionary Computation and Game Theory
下载PDF
导出
摘要 针对满足多个约束条件的服务质量(QoS)组播路由的特点,提出了一种应用于下一代互联网的基于思维进化计算和博弈论的QoS组播路由算法.该算法由三部分组成:引入隶属度函数来描述"边"对用户QoS需求的适合程度;通过博弈分析判断网络方与用户在"边"上的效用能否达到Nash均衡;采用思维进化计算方法建立组播路由树,使得在树上不仅用户QoS要求得到满足而且网络方效用与用户效用达到或接近Nash均衡下的Pareto最优.仿真结果表明,提出的算法是可行和有效的. Taking the characteristics of multi-constraint QoS(quality of service) routing in NGI (next generation Internet) into account, a QoS multicast routing algorithm based on MEC(mind evolutionary computation) and game theory is presented. It introduces the membership functions to evaluate the adaptability of candidate edges to users' requirements for QoS; makes sure of whether the network provider has been in Nash equilibrium with users in respect to the utility on edges through gaming analysis; constructs a multicast routing tree via MEC so as to enable users' QoS requirements to be satisfied and the utility of both network provider and users to reach or approach Pareto optimum when both are in Nash equilibrium. Simulation results showed that the proposed algorithm is feasible and effective.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第2期201-204,212,共5页 Journal of Northeastern University(Natural Science)
基金 教育部新世纪优秀人才支持计划项目 国家自然科学基金资助项目(60473089) 国家发改委CNGI示范工程项目(CNGI-04-13-2T,CNGI-04-6-2T,CNGI-04-15-7A)
关键词 服务质量 组播路由 思维进化计算 博弈分析 NASH均衡 QoS (quality of service ) multicast routing MEC (mind evolutionary computation) game analysis Nash equilibrium
  • 相关文献

参考文献9

  • 1Wang Z, Crowcroft J. Quality of service routing for supporting multimedia applications [ J ]. IEEE Journal on Selected Areas in Communications, 1996, 14 ( 7 ) : 1228 - 1234.
  • 2Turgay K, Marwan K. Bandwidth-delay constrained path selection under inaccurate state information [J]. IEEE/ ACM Transactions on Networking, 2003, 11 (3) : 384 - 398.
  • 3Mines C, Joseph N, Baruch S. Resource optimization in QoS multieast routing of real-time multimedia[J ]. IEEE/ACM Transactions on Networking , 2004,12(2) :340 -348.
  • 4Daniel Z. Alternate path routing for multicast [J]. IEEE/ ACM Transactions on Networking, 2004,12( 1 ) : 30 - 43.
  • 5Oh J S, Bae S I, Ahn J H, et al. Route reinforcement for efficient QoS routing based on ant algorithm [ J ]. LNCS, 2004,3090 : 342 - 349.
  • 6Wang J W, Wang X W, Huang M. A hybrid intelligent QoS multicast routing algorithm in NGI [ C ] //Proceedings of Parallel and Distributed Computation Application and Technology (PDCAT 2005). New York: IEEE Computer Society, 2005 : 723 - 727.
  • 7罗杰·迈尔森.博弈论[M].北京:中国经济出版社,2001..
  • 8Chen P J, Zeng J C. Mind evolutionary computation for a kind of non-numerical optimization problems [ C ] // Proceedings of 3rd International Conference on Machine Leaming and Cybernetics. New York: IEEE, 2004:2257- 2261.
  • 9王兴伟,程辉,黄敏,于瑞云.下一代互联网中的智能QoS组播路由算法[J].东北大学学报(自然科学版),2004,25(3):235-238. 被引量:10

二级参考文献8

  • 1[2]Wang B, Hou J C. A survey on multicast routing and its QoS extensions: problems, algorithms, and protocols[J]. IEEE Network Magazine, 2000,14(1):22-36.
  • 2[3]Hwang F, Richards D. Steiner tree problems[J]. Networks, 1992,22(1):55-89.
  • 3[4]Gen M, Cheng R W. Genetic algorithms and engineering design[M]. New York: John Wiley & Sons, 1996.1-55.
  • 4[5]Mendivil F, Shonkwiler R, Spruill M C. Restarting search algorithms with applications to simulated annealing[J]. Advances in Applied Probability, 2000,33(1):242-259.
  • 5[7]Xin Y. Heuristic algorithms for multi-constrained quality-of-service routing[J]. IEEE/ACM Transaction on Networking, 2002,10(2):244-256.
  • 6[8]Wang X W, Cheng H, Cao J N, et al. QoS-driven multicast tree generation using genetic algorithm[J]. Lecture Notes in Computer Science, 2003,2834:121-131.
  • 7[9]Wang X W, Cheng H, Cao J N, et al. A Simulated-annealing-based QoS multicasting algorithm[A]. Proceedings of International Conference on Communication Technology[C]. Beijing: IEEE, 2003.469-473.
  • 8[10]Wang X W, Cheng H, Cao J N, et al. A Tabu-search-based QoS Multicasting Algorithm[A]. Proceedings of International Conference for Young Computer Scientists[C]. Harbin: CCF, 2003.63-66.

共引文献12

同被引文献21

  • 1孙岩,马华东,刘亮.一种基于蚁群优化的多媒体传感器网络服务感知路由算法[J].电子学报,2007,35(4):705-711. 被引量:22
  • 2Sally McClean, Bryan Scotney, Mary Shapcott. Aggregation ofimprecise and uncertain information in databases[J]. IEEE Tran-sactions on Knowledge and Data Engineering, 2001,13 (6) : 902-- 912.
  • 3V Vasanth, FMichael. Power reduction techniques formicroprocessor system[J]. ACM computing survey, 2005, 37(3): 195--237.
  • 4郭军.网络管理[M].北京:北京邮电大学出版社,2004.297-311.
  • 53GPP. TS 23. 228, V10.5.0, IP multimedia subsystem, stage 2, release 10 [ S]. Valbonne: 3GPP, 2011.
  • 6ETSI. ES 282 003, V3.5.1, resource and admission control sub-system (RACS) : functional architecture release 2 [ S ]. Sophia Antipolis: ETSI, 2011.
  • 73GPP. TS 23. 203, V9. 4. 0, policy and charging control architecture release 9 [ S]. Valbonne : 3GPP, 2010.
  • 8Lee S K, Sriram K, Kim K, et al. Vertical handoff decision algorithms for providing optimized performance in heterogeneous wireless networks[J ]. IEEE Transactions on Vehicular Technology, 2009,58(2) :865 - 881.
  • 9Niyato D, Hossain E. Competitive pricing for spectrum sharing in cognitive radio networks: dynamic game, inefficiency of Nash equilibrium, and collusion [ J]. IEEE Journal on Selected Areas in Communications, 2008, 26 (1):192-202.
  • 10Noam N, Tim R, Eva T, et al. Algorithmic game theory [ M]. Cambrige : Cambridge University Press, 2007.

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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