Dynamic Waveband Switching in WDM Mesh Networks Based on a Generic Auxiliary Graph Model
Dynamic Waveband Switching in WDM Mesh Networks Based on a Generic Auxiliary Graph Model
复制标题
DOI：
10.1007/s11107-005-3493-x
复制
发表时间：
2005-11
影响因子：
1.7
通讯作者：
Mengke Li;B. Ramamurthy
中科院分区：
文献类型：
--
作者：
Mengke Li;B. Ramamurthy
波带交换(WBS)是波分复用(WDM)网络中降低光域交换和传输成本的一种很有前途的技术。本文研究了在WDM网状网中使用WBS提供动态业务的问题。感兴趣的网络是同构的WBS网络，其中每个节点都具有WBS的功能。这个问题被称为动态WBS问题，它涉及到为动态到达的业务请求搜索波带路由或波长路由。其目标是将光域中的总交换和传输成本降至最低。为了解决动态WBS问题，提出了一种捕捉网络状态的辅助图模型。基于辅助图，提出了两种不同波段分组策略的启发式在线WBS算法，即基于辅助图的波长优先WBS算法(WFAUG)和基于辅助图的波带优先WBS算法(BFAUG)。仿真结果表明，WBS是一种很有吸引力的技术，可以将网络中的整体交换和传输成本降低高达30%。实验结果还表明，WFAUG算法在端口节省和开销节约方面优于BFAUG算法。
Waveband switching (WBS) is a promising technique to reduce the switching and transmission costs in the optical domain of a wavelength-division multiplexing (WDM) network. This paper considers the problem of provisioning dynamic traffic using WBS in a WDM mesh network. The network of interest is a homogeneous WBS network, where each node has the functionality of WBS. The problem is called the dynamic WBS problem, which involves searching waveband-routes or wavelength-routes for the dynamically arriving traffic requests. The objective is to minimize the total switching and transmission costs in the optical domain. To solve the dynamic WBS problem, an auxiliary graph model capturing the network state is proposed. Based on the auxiliary graph, two heuristic on-line WBS algorithms with different waveband grouping policies are proposed, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Simulation results indicate that WBS is an attractive technique which reduces the overall switching and transmission costs by up to 30% in the network. The results also show that the WFAUG algorithm outperforms the BFAUG algorithm in terms of port savings and cost savings.