首页 | 本学科首页   官方微博 | 高级检索  
     

光网络组播业务梳理的新方法
引用本文:范 晨,陈美娅,苏丽君,杨大成.光网络组播业务梳理的新方法[J].北京邮电大学学报,2006,29(4):45-48.
作者姓名:范 晨  陈美娅  苏丽君  杨大成
作者单位:北京邮电大学 光通信中心,北京 100876
基金项目:国家自然科学基金,国家高技术研究发展计划(863计划)
摘    要:为了最小化光网络使用的电设备数和波长资源,提出了利用遗传算法对组播业务进行排序,以此顺序梳理汇聚业务;并提出了两种基于无限制多跳的梳理算法。同时从理论上计算出网络需要的最小电设备数并与遗传算法进行比较。仿真证明遗传算法的结果接近于理论最小值,同时说明遗传算法对业务梳理的不同情况都有较强的适用性。

关 键 词:组播  梳理  光网络  遗传算法
文章编号:1007-5321(2006)04-0045-04
收稿时间:2005-09-03
修稿时间:2005年9月3日

Threshold Controlling Algorithm for Adaptive Modulation and Coding System
JIA Peng,LI Jian,GU Wan-yi.Threshold Controlling Algorithm for Adaptive Modulation and Coding System[J].Journal of Beijing University of Posts and Telecommunications,2006,29(4):45-48.
Authors:JIA Peng  LI Jian  GU Wan-yi
Affiliation:Optical Communication Centre, Beijing University of Posts and Telecommunications, Beijing 100876, China
Abstract:In order to minimize the number of electric equipments and wavelengths in optical networks, a genetic algorithm of arranging the order of multicast traffics was proposed and therefore the traffics were groomed according to the order. Two grooming algorithms based on non-restricted multihop 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.
Keywords:multicast  grooming  optical network  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号