期刊文献+

Petri网与蚁群算法在CDN网络路由中的应用 被引量:1

Application of Petri nets and ant colony algorithm for solving routing problem on CDN
下载PDF
导出
摘要 CDN让用户以最快的速度从最近的地方获得所需的信息,它对QoS路由提出了更高的要求,单纯的采用蚁群算法或是依靠Petri网模型中变迁发生寻径的方法都不能较好的解决CDN路由问题。基于稳定的CDN网络构建图状拓扑结构,提出了一种将Petri网与蚁群算法相结合,考虑多个路由限制的优化QoS路由算法。实验仿真表明,该算法能有效地求解CDN网络中的路由问题。 Content Delivery Network(CDN),helps to efficiently deliver the content from content providers to a large community of geographical distributed clients,calling for more effective routing algorithm with higher quality of QoS.This paper presents a new algorithm joint with the ant colony algorithm and Petri nets,used to solve the routing in stability of connected graph topology, considering with delay,delay jitter,bandwidth,packet loss and the least cost constraint.Simulation results show that this algorithm is reasonable and effective.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第19期31-35,共5页 Computer Engineering and Applications
基金 国家自然科学基金(the National Natural Science Foundation of China under Grant No.60473030) 华为高校科技基金项目(the University Science Foundation of HuaWei Inc.under Grant No.YJCB2006057FT)
关键词 网络结构 服务质量 路由算法 蚁群算法 PETRI网 structured network QoS routing algorithm ant colony algorithm Petri nets
  • 相关文献

参考文献9

  • 1Stardust.com Inc.White paper-the ins and outs of content delivery networks[R/OL].(2001).http ://www.st ardust.com/cdnweek/whitepapers/ cdnspring01.San Francisco:Stanford University.
  • 2IETF Internet-Draft.Known CDN request-routing mechanisms[EB/OL].(2001-05 - 18) [2007 -09-10].http ://www.tools.ietf.org/html/draftcain-cdnp- known-request-routing-00.
  • 3Gary M R,Johnson D S.Computers and intractability:a guide to the theory of NP-completeness[M].San Francisco: W.H.Freeman and Company, 1979.
  • 4Xiao X P.Providing quality of service in the internet[D].Michigan: Michigan State University, 2000.
  • 5Dorigo M,Gambardella L M.Ant colonies for the traveling salesman problem[J].Bio-system, 1997,43 ( 2 ) : 73-81.
  • 6Dorigo M,Caro G D,Stutzle T.Ant algorlthms[J].Future Generation Computer System,2000,16( 1 ) :5-7.
  • 7Michlmayr E,Pany A,Kappel G.Using taxonomies for content-based routing with ants[J].Computer Networks, 2007,51 (16) : 4514-4528.
  • 8van der Aalst W M P,van Hee K.Workflw management models, methods and systems[M].Cambridge:MIT Press,2002.
  • 9Reisig W.Petri nets : an introduction[M].Berlin, Heidelberg: Springer- Verlag, 1985:17-135.

同被引文献13

  • 1孙力娟,王良俊,王汝传.改进的蚁群算法及其在TSP中的应用研究[J].通信学报,2004,25(10):111-116. 被引量:38
  • 2杨瑞臣,云庆夏.改进的蚁群算法在矿山物流配送路径优化中的研究[J].中国钼业,2004,28(6):16-18. 被引量:7
  • 3李洋,乐晓波.蚁群算法在模糊Petri网参数优化中的应用[J].计算机应用,2007,27(3):638-641. 被引量:11
  • 4ELLIOT R, JOSEPH P B. quality in lnternet retailing Physical distribution service service pricing, transaction attributes and fLrm attributes[J]. Journal of Operations Management, 2004, 21(6) : 651 - 672.
  • 5BIANCHI L, BIRATTARI M, CHIARANDINI M, et al. Hybrid metaheuristics for the vehicle routing prob- lem with stochastic demands[J]. Journal of Mathemati- cal Modelling and Algorithms, 2006, 5(1 ): 91 - 110.
  • 6ZHENG Y, LIU B. Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm [J]. Applied Mathematics and Computation, 2006, 176 (2): 673 683.
  • 7CIUFUDEAN C, GRAUR A, FILOTE C, et al. Diag nosis of complex systems using ant colony decision Petri nets[C]//Proceedings of the First International Confer- ence on Availability, Reliability and Security. Austrian: IEEE Computer Society, 2006:473 -481.
  • 8FIDANOVA S, ATANASSOV K. Generalized nets as tools for modeling of the ant colony optimization algo rithms[C]//Large-Scale Scientific Computing, 7th Inter- national Conference, LSSC 2009. Berlin: Springer-Ver lag Berlin Heidelberg, 2010.. 326 - 333.
  • 9NISHI T, SHIMATANI K, INUIGUCHI M. Decom position of Petri nets and Lagrangian relaxation for sol- ving routing problems for AGVs [J]. International Journal of Production Research, 2009, 47 ( 14 ): 3957 - 3977.
  • 10高辉,徐光辉,王哲人.改进量子进化算法及其在物流配送路径优化问题中的应用[J].控制理论与应用,2007,24(6):969-972. 被引量:19

引证文献1

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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