Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (29): 106-109.DOI: 10.3778/j.issn.1002-8331.2010.29.029

• 网络、通信、安全 • Previous Articles     Next Articles

Dynamic algorithm to groom traffic in IP/DWDM optical Internet

LIU Zhen-yu,CHEN Ming-hua   

  1. Department of Computer Science,Dalian Neusoft Institute of Information,Dalian,Liaoning 116023,China
  • Received:2009-03-11 Revised:2010-08-20 Online:2010-10-11 Published:2010-10-11
  • Contact: LIU Zhen-yu

IP/DWDM光Internet中通信量动态疏导算法

刘振宇,陈明华   

  1. 大连东软信息学院 计算机系,辽宁 大连 116023
  • 通讯作者: 刘振宇

Abstract: This paper studies the dynamic traffic grooming problem in IP/DWDM optical Internet,which has been proved a NP-hard problem.Heuristic and intelligent algorithms are adopted to solve the problem.In this paper,network and mathematics models are set up,and an artificial immune algorithm is designed to route and assign wavelengths for the new-coming connection request,minimizing the cost for the request as well.In order to check the feasibility and the validity of the algorithms,a simulation environment is developed with VC++ 6.0 and several practical optical networks,such as the NSFNET,the CERNET1,the CERNET2 and the GéANT,are tested.The experimental results show that the algorithm presented here can gain better result than the current heuristic algorithm.

摘要: 研究IP/DWDM光Internet中网状拓扑下的动态通信量疏导问题。网状拓扑下的通信量疏导问题已证明是NP难问题,需要采用启发式算法或智能优化算法来解决。针对动态通信量疏导问题,建立了网络和数学模型,提出了求解该问题的人工免疫算法,为新到达的通信量请求路由和分配带宽等网络资源,同时最小化满足该通信量请求的网络费用。为验证算法的可行性和有效性,用VC++6.0开发了一个仿真环境,同时以美国自然科学基金网NSFNET、中国教育和科研计算机网CERNET1和CERNET2以及欧洲巨人网GéANT等的骨干网拓扑为仿真用实例,与现有启发式算法进行性能比较,并对网络参数对算法的影响进行了分析。实验表明,提出的算法可以获取比现有启发式算法更加优化的解。

CLC Number: