Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms.

中文翻译：

---

弹性光网络中改进的双路径分配算法

双路径分配问题被认为是弹性光网络中多路径路由的一种情况。本文提出了优化问题，并提出了解决该问题的双路径分配算法。在所考虑的问题中，每个请求的所有流量都被分成两个相等的部分，它们沿着两条链路不相交的路径定向。任何链路故障后，每个受影响请求的一半流量都会实现。所提出的算法基于两个权重矩阵：第一个的元素取决于链接的实际长度及其利用率，而第二个的元素假设网络中存在链接的单位值。所提出的算法拒绝较小的请求，并提供比其他分析算法低得多的带宽阻塞概率。