Multi-Topology Traffic with Metrics not based on ECMP

提出了一种使用多个度量来实现流量工程（TE）的方法。我们的建议的特点是只选择最短的路径。这简化了网络内的传输处理。在分解实现TE的每个流之后，我们确定每个流的度量。我们描述了如何确定路径和成本集，即链路成本组，并描述了进行的仿真。仿真结果表明，所需成本集的数量在节点数的1/3 ~ 1/2之间，也低于整个流程的数量，其数量级为n*n （n为节点数）。

We propose a method that uses more than one metric to realize Traffic Engineering (TE). The characteristics of our proposal are that only the shortest path is selected. This simplifies the transmission processing within a network. After decomposing each flow that realizes TE, we determine metric for each flow. We describe how to determine paths and cost sets, which are groups of link costs, and describe a simulation conducted. Simulation results show that the required number of cost sets is between 1/3 to 1/2 the number of nodes and is also lower than the number of the entire flows, which is of the order of n*n where n is the number of nodes.