Robust routing algorithms based on Valiant load balancing for wavelength-division- multiplexing mesh networks
Robust routing algorithms based on Valiant load balancing for wavelength-division- multiplexing mesh networks
复制标题
DOI：
10.1117/1.2338549
复制
发表时间：
2006-08
影响因子：
1.3
通讯作者：
Xiaoning Zhang;Le Min Li
中科院分区：
文献类型：
--
作者：
Xiaoning Zhang;Le Min Li
在波分复用（WDM）网状网络中，根据未来特定的流量需求，通常使用以前的路由算法；然而，实际意义上准确预测未来的交通需求是很困难的。我们针对多面体不确定性模型（即软管模型）提出了一种基于 WDM 网状网络中 Valiant 负载平衡的新型鲁棒路由方案，并将该方案应用于具有流量疏导方法的低速连接。我们的目标是最大限度地降低网络总成本。提出了 Valiant 负载平衡鲁棒路由方案的数学公式，并提出了两种快速启发式方法。在WDM网状网络中实施鲁棒路由方案时，提出了一种称为MHF（最小化跳数优先）的新流量疏导算法。与传统的流量疏导算法相比，我们使用 Valiant 负载平衡鲁棒路由方案来评估 MHF。
In wavelength-division-multiplexing (WDM) mesh networks, previous routing algorithms are commonly used under the specific future traffic demand; however, it is difficult to predict the future traffic demand accurately in a practical sense. We propose a novel robust routing scheme based on Valiant load balancing in WDM mesh networks for the model of polyhedral uncertainty (i.e., hose model) and apply the scheme to low-speed connections with a traffic grooming approach. Our objective is to minimize total network cost. A mathematic formulation of the Valiant load-balancing robust routing scheme is presented and two fast heuristics are also proposed. When implementing the robust routing scheme to WDM mesh networks, a new traffic grooming algorithm called MHF (minimizing hop first) is proposed. We evaluate the MHF with the Valiant load-balancing robust routing scheme compared with traditional traffic-grooming algorithms.