唯一最短路径路由问题的一种新数学模型
A Novel Mathematical Model for the Unique Shortest Path Routing Problem
摘要：
链路权重是最短路径路由协议的主要参数，最短路径路由协议是IP网络中最常用的协议。研究了唯一最短路径路由的链路权值优化问题。由于所涉及的约束条件的复杂性，存在的挑战，制定适当的问题，使解决方案的算法可以被证明是更有效的比那些已经存在的。在本文中，一个新的完整的制定与多项式数量的约束，首先介绍，然后数学证明是正确的。它进一步说明，制定有优势的约束结构和模型大小方面的建议的分解方法来解决这个问题。
英文摘要：
Link weights are the principal parameters of shortest path routing protocols, the most commonly used protocols for IP networks. The problem of optimally setting link weights for unique shortest path routing is addressed. Due to the complexity of the constraints involved, there exist challenges to formulate the problem properly, so that a solution algorithm may be developed which could prove to be more efficient than those already in existence. In this paper, a novel complete formulation with a polynomial number of constraints is first introduced and then mathematically proved to be correct. It is further illustrated that the formulation has advantages over a prior one in terms of both constraint structure and model size for a proposed decomposition method to solve the problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
