Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks

We propose a novel shared sub-path protection (SSPP) algorithm to protect the double-link failures in wavelength division multiplexing (WDM) mesh networks. SSPP segments the primary path into several equal-length sub-paths and searches two link-disjoint backup paths for each sub-path. When computing the paths, SSPP considers the load balance and the resource sharing degree, so that the blocking ratio can be effectively reduced. The simulation results show that SSPP not only can completely protect the double-link failures but also can make the tradeoffs between the resource utilization ratio (or blocking ratio) and the protection-switching time.     

Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks

We propose a novel shared sub-path protection (SSPP) algorithm to protect the double-link failures in wavelength division multiplexing (WDM) mesh networks. SSPP segments the primary path into several equal-length sub-paths and searches two link-disjoint backup paths for each sub-path. When computing the paths, SSPP considers the load balance and the resource sharing degree, so that the blocking ratio can be effectively reduced. The simulation results show that SSPP not only can completely protect the double-link failures but also can make the tradeoffs between the resource utilization ratio (or blocking ratio) and the protection-switching time.     

A new burst assembly technique for supporting QoS in optical burst switching networks

This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme. The assembly mechanism, which is fit well to multi-class burst assembly, not only matches with IP QoS mechanism based on packet classification, and also utilizes fairly and efficiently assembly capacity. Based on token-bucket model and burst segment selective discard (BSSD), the offset-time scheme can smooth the traffic to support OBS QoS. The simulation results show that the technique can improve the performance in terms of packet loss probability (PLP).     

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

提出了基于最大收益的捆绑疏导算法(MRA)来解决光网络中具有多种物理约束的业务量疏导问题。MRA首先在物理拓扑上逐个放置业务, 随后捆绑细粒度业务、实现管道实例化。即考虑业务的路由情况, 将其在物理拓扑上的路由都视为单跳的细粒度管道, 然后使用基于深度优先搜索的方法来检查哪些业务能够捆绑到一起形成多跳粗粒度的潜在管道, 以节省中间节点的细粒度交换容量。再从这些粗粒度的潜在管道中, 使用最大收益的方法遴选出具有最大成本收益的无冲突集合, 并加以实例化。仿真结果显示, 在处理多个物理约束时, MRA在容量和实现成本上均优于现有的算法, 并且它能处理多达百个节点以上的大网络中的业务量疏导问题。     

最小化成本的可靠虚拟基础设施设计(英文)

在保证虚拟网络可靠性需求的条件下以最小化映射成本为目标,研究了可靠虚拟基础设施映射.在RVIM算法的基础上提出了Improved_RVIM算法,算法中一些工作虚拟节点适当地映射在相同的设施节点上,可以在不增加备份计算资源的条件下节省通信成本,降低总映射成本.仿真结果表明Improved-RVIM算法相比其它算法成本更低.