利用P-圈保护WDM网络通信的启发式方案
Heuristic Solution to Protect Communications in WDM Networks using P-cycles
摘要:
光WDM网状网络能够传输大量的信息。然而,这种技术的使用带来了防止诸如光纤切断之类的故障的问题。在WDM光网络中,链路保护的主要方法之一是预配置保护周期(p-cycle)。这种保护方法的主要问题在于找到一组最佳的p-圈,保护网络的工作能力的一个给定的分布。现有的算法生成一个大的p-循环候选集,这些候选集完全独立于网络状态,然后从中选择将保护网络的p-循环的良好子集。本文提出了一种基于最短圈增量聚合的p-圈生成算法。我们生成的p-圈取决于网络的状态。这使得我们能够选择一组有效的p-圈来保护网络。我们生成的p-圈集是保护网络的最终集,换句话说,我们的启发式算法不需要经过p-圈选择的额外步骤
英文摘要:
Optical WDM mesh networks are able to transport huge amount of information. The use of such technology however poses the problem of protection against failures such as fibre cuts. One of the principal methods for link protection used in optical WDM networks is pre-configured protection cycle (p-cycle). The major problem of this method of protection resides in finding the optimal set of p-cycles which protect the network for a given distribution of working capacity. Existing heuristics generate a large set of p-cycle candidates which are entirely independent of the network state, and from then the good sub-set of p-cycles which will protect the network is selected. In this paper, we propose a new algorithm of generation of p-cycles based on the incremental aggregation of the shortest cycles. Our generation of p-cycles depends on the state of the network. This enables us to choose an efficient set of p-cycles which will protect the network. The set of p-cycles that we generate is the final set which will protect the network, in other words our heuristic does not go through the additional step of p-cycle selection
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。