检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中山大学信息科学与技术学院,广东广州510006 [2]暨南大学华文学院,广东广州510610
出 处:《光学学报》2013年第7期128-135,共8页Acta Optica Sinica
基 金:国家自然科学基金-广东联合基金重点项目基金(U0735002);国家863计划(2007AA01Z449);中央高校基本科研业务费专项资金(12JNKY008);湖北省自然科学基金(2011CDB088)
摘 要:现有波分复用网络选播研究假设网络节点都具备分光能力或都不具备分光能力。综合网络性能和成本,稀疏分光网络更符合现实。研究了稀疏分光网络中多目标函数的选播路由问题。提出了光迹的概念,设计了禁忌搜索算法(TTS)。大量仿真实验表明,相对于最优多播路由算法基础上的选播成员优先算法(MOM),TTS算法明显优于MOM算法,更加适合稀疏分光网络。The premise of all literatures about manycast routing and wavelength assignment problem in wavelength division multiplexing (WDM) networks is that all nodes are either split-capable or split-incapable. Sparse splitting network is a more realistic assumption considering network performance and cost. Manycast routing problem over sparse splitting optical networks with respect to several target functions is studied, The concept of light track and a trail-based tabu search (TTS) are proposed. Manycast member only algorithm (MOM) is an algorithm slightly adapted from the member only algorithm which is known as the best algorithm for sparse splitting multicast routing. Simulation results show that TTS algorithm performs well in comparison with MOM algorithm and is more suitable for sparse splitting networks.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42