计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (19): 31-35.

• 博士论坛 • 上一篇    下一篇

Petri网与蚁群算法在CDN网络路由中的应用

叶剑虹1,2,孙世新1,张运生1,周益民1   

  1. 1.电子科技大学 计算机科学与工程学院,成都 610054
    2.艾因霍芬科技大学 数学与计算机学院,荷兰艾因霍芬 P.O.Box 513,NL-5600 MB
  • 收稿日期:2008-03-06 修回日期:2008-04-24 出版日期:2008-07-01 发布日期:2008-07-01
  • 通讯作者: 叶剑虹

Application of Petri nets and ant colony algorithm for solving routing problem on CDN

YE Jian-hong1,2,SUN Shi-xin1,ZHANG Yun-sheng1,ZHOU Yi-min1   

  1. 1.School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu 610054,China
    2.Department of Mathematics and Computer Sciences,Eindhoven University of Technology,P.O.Box 513,NL-5600 MB Eindhoven,The Netherlands
  • Received:2008-03-06 Revised:2008-04-24 Online:2008-07-01 Published:2008-07-01
  • Contact: YE Jian-hong

摘要: CDN让用户以最快的速度从最近的地方获得所需的信息,它对QoS路由提出了更高的要求,单纯的采用蚁群算法或是依靠Petri网模型中变迁发生寻径的方法都不能较好的解决CDN路由问题。基于稳定的CDN网络构建图状拓扑结构,提出了一种将Petri网与蚁群算法相结合,考虑多个路由限制的优化QoS路由算法。实验仿真表明,该算法能有效地求解CDN网络中的路由问题。

关键词: 网络结构, 服务质量, 路由算法, 蚁群算法, Petri网

Abstract: 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.

Key words: structured network, QoS, routing algorithm, ant colony algorithm, Petri nets