光学学报, 2008, 28 (s2): 219, 网络出版: 2009-01-05   

一种带物理约束的光网络业务量疏导方法

Traffic-Grooming in WDM Network under Physical Constraints
作者单位
1 电子科技大学宽带光纤传输与通信网技术教育部重点实验室, 四川 成都 610054
2 中国电信北京研究院, 北京 100035
摘要
提出了基于最大收益的捆绑疏导算法(MRA)来解决光网络中具有多种物理约束的业务量疏导问题。MRA首先在物理拓扑上逐个放置业务, 随后捆绑细粒度业务、实现管道实例化。即考虑业务的路由情况, 将其在物理拓扑上的路由都视为单跳的细粒度管道, 然后使用基于深度优先搜索的方法来检查哪些业务能够捆绑到一起形成多跳粗粒度的潜在管道, 以节省中间节点的细粒度交换容量。再从这些粗粒度的潜在管道中, 使用最大收益的方法遴选出具有最大成本收益的无冲突集合, 并加以实例化。仿真结果显示, 在处理多个物理约束时, MRA在容量和实现成本上均优于现有的算法, 并且它能处理多达百个节点以上的大网络中的业务量疏导问题。
Abstract
The traffic demands in optical networks are often irregular associated with various physical constraints such as SRLG disjoint, taboo link, taboo node and so on. The virtual topology design methods in the literature could hardly to solve traffic grooming problems with multiple kinds of constraints. We propose a packing grooming with max revenue algorithm (MRA). The traffic demands are placed directly in the physical topology, which are treated as low-granularity single-hop-pipes. To save the low-granularity switch capacity in the intermediate nodes, MRA checks which demands could be packed into high-granularity multi-hop potential pipes. Among the high-granularity potential pipes, we search the maximum set of potential pipes which do not collide with each other by a max-revenue approach and instantiate them. Numerical results show that MRA algorithm has better performance than existing algorithms in capacity and cost of network, and it could be used in large networks with more than one hundred nodes.

曾凌, 徐世中, 王晟, 王雄, 李乐民, 周开宇. 一种带物理约束的光网络业务量疏导方法[J]. 光学学报, 2008, 28(s2): 219. Zeng Ling, Xu Shizhong, Wang Sheng, Wang Xiong, Li Lemin, Zhou Kaiyu. Traffic-Grooming in WDM Network under Physical Constraints[J]. Acta Optica Sinica, 2008, 28(s2): 219.

本文已被 2 篇论文引用
被引统计数据来源于中国光学期刊网
引用该论文: TXT   |   EndNote

相关论文

加载中...

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!