arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.04581cs.NI
收藏

一种高效精确的动态专用路径保护算法

Towards an efficient and exact algorithm for dynamic dedicated path protection

Ireneusz Szcześniak, Ireneusz Olszewski, Bożena Woźna-Szcześniak

摘要:

我们提出了一种新的算法,动态路由与专用路径保护,所提出的模拟结果表明,可以是高效和准确的。我们提出的算法在光网络的设置,但它应该适用于其他网络,其中服务必须得到保护,网络资源是有限的和离散的,例如,能够提前资源预留的无线电或网络。据我们所知,我们是第一个提出一个算法,这个长期存在的基本问题,这可以是有效的和准确的,模拟结果表明。该算法可以是高效的,因为它可以解决大的问题,它可以是准确的,因为它的结果是最佳的,通过模拟证明和证实。我们提供了一个最坏情况下的分析,认为搜索空间是多项式上界。网络运营、管理和控制需要高效而精确的算法,尤其是现在,人们更加重视网络性能、可靠性、软件化、灵活性和投资回报。该算法使用我们的通用Dijkstra算法的搜索图生成的“上的飞行”的基础上的输入图。我们证实了所提出的算法的最优结果与暴力枚举网络高达15个节点大。我们提出了广泛的模拟结果的专用路径保护与信号调制约束的弹性光网络的25,50和100个节点,并与160,320和640频谱单位。我们还比较了带宽阻塞概率与常用的边缘排除算法。我们有48,600次模拟运行,大约有4100万次搜索。

英文摘要:

We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be applicable to other networks, where services have to be protected, and where the network resources are finite and discrete, e.g., wireless radio or networks capable of advance resource reservation. To the best of our knowledge, we are the first to propose an algorithm for this long-standing fundamental problem, which can be efficient and exact, as suggested by simulation results. The algorithm can be efficient because it can solve large problems, and it can be exact because its results are optimal, as demonstrated and corroborated by simulations. We offer a worst-case analysis to argue that the search space is polynomially upper bounded. Network operations, management, and control require efficient and exact algorithms, especially now, when greater emphasis is placed on network performance, reliability, softwarization, agility, and return on investment. The proposed algorithm uses our generic Dijkstra algorithm on a search graph generated "on-the-fly" based on the input graph. We corroborated the optimality of the results of the proposed algorithm with brute-force enumeration for networks up to 15 nodes large. We present the extensive simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50, and 100 nodes, and with 160, 320, and 640 spectrum units. We also compare the bandwidth blocking probability with the commonly-used edge-exclusion algorithm. We had 48,600~simulation runs with about 41 million searches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑