北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (4): 45-48.doi: 10.13190/jbupt.200604.45.053

• 论文 • 上一篇    下一篇

光网络组播业务梳理的新方法

贾 鹏,李 健,顾畹仪   

  1. 北京邮电大学 光通信中心,北京 100876
  • 收稿日期:2005-09-03 修回日期:1900-01-01 出版日期:2006-08-30 发布日期:2006-08-30
  • 通讯作者: 贾鹏

A New Approach for Multicast Traffic Grooming in Optical Networks

JIA Peng, LI Jian, GU Wan-yi   

  1. Optical Communication Centre, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2005-09-03 Revised:1900-01-01 Online:2006-08-30 Published:2006-08-30
  • Contact: JIA Peng

摘要:

为了最小化光网络使用的电设备数和波长资源,提出了利用遗传算法对组播业务进行排序,以此顺序梳理汇聚业务;并提出了两种基于无限制多跳的梳理算法。同时从理论上计算出网络需要的最小电设备数并与遗传算法进行比较。仿真证明遗传算法的结果接近于理论最小值,同时说明遗传算法对业务梳理的不同情况都有较强的适用性。

关键词: 组播, 梳理, 光网络, 遗传算法

Abstract:

In order to minimize the number of electric equipment and wavelength in optical networks, a genetic algorithm of arranging the order of multicast traffics was proposed and therefore the traffics were groomed according to the orders. Two grooming algorithms based on non-restricted multi-hop provisioning were also proposed. The minimum value of required electric equipments of theory was calculated and compared with the result of genetic algorithm. Simulations show that the value of genetic algorithm is close to that of theory and genetic algorithm is applicable for traffic grooming under different conditions.

Key words: multicast, grooming, optical network, genetic algorithm

中图分类号: