动态专用路径保护是可解的吗?
Is dynamic dedicated path protection tractable?
AI总结:
针对受限路径成本下寻找两条链路不相交路径的难解性问题,本文证明在光网络中即使存在频谱约束,也可通过通用 Dijkstra 算法在多项式有界搜索空间上精确求解,从而证明该问题可解。
摘要:
如果路径成本受限,寻找两条成本最小的链路不相交路径的问题是难解的,因为它是划分问题的特例。在光网络中,该限制可由信号调制距离引入。即使没有此限制,现有文献也因频谱连续性和邻接性约束认为该问题难解,但我们证明该问题可在多项式有界搜索空间上通过新近提出的通用 Dijkstra 算法精确求解,从而证明该问题是可解的。
英文摘要:
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm over a polynomially-bounded search space, thus proving the problem tractable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。