公开(公告)号：KR100411251B1

公开(公告)日：2003-12-18

申请号：KR1020010074723

申请日：2001-11-28

Applicant: 한국전자통신연구원

Inventor： 김창훈 ,  이영석 ,  석영호 ,  최양희 ,  정태수

IPC: H04L12/28

CPC classification number: H04L45/50 ,  H04L45/12 ,  H04L45/122 ,  H04L45/24

Abstract: Disclosed herein is a constrained multipath routing method. In a Multi-Protocol Label Switching (MPLS) network, network conditions and traffic engineering requirements assigned to each link are set. The amount of assignments of each traffic requirement assigned to each link and a minimum value of each maximum link utilization α are calculated. A traffic rate (Xijkl) in which the degree of resource utilization is minimized in the minimized maximum link utilization α is calculated using the calculated amount of assignments of each traffic requirement and which is assigned to each link. Multiple paths corresponding to each traffic requirement and traffic division ratios of the multipath are calculated using the calculated traffic rate.

Abstract translation: 这里公开了一种约束多路径路由方法。 在多协议标签交换（MPLS）网络中，分配给每个链路的网络条件和流量工程要求被设置。 分配给每个链路的每个业务需求的分配量和每个最大链路利用率＆lt; 被计算。 业务速率（Xijkl），其中资源利用程度在最小化的最大链路利用率＆amp; 使用计算出的每个业务需求的分配量以及分配给每个链路的值来计算。 使用所计算的业务速率来计算与每个业务需求和多路径的业务划分比率相对应的多个路径。

公开(公告)号：KR1020030044134A

公开(公告)日：2003-06-09

申请号：KR1020010074723

申请日：2001-11-28

Applicant: 한국전자통신연구원

Inventor： 김창훈 ,  이영석 ,  석영호 ,  최양희 ,  정태수

IPC: H04L12/28

CPC classification number: H04L45/50 ,  H04L45/12 ,  H04L45/122 ,  H04L45/24

Abstract: PURPOSE: A multiple path allocating method satisfying a limit condition is provided to optimize performance of an Internet backbone network by dividing an optimum traffic of multipath in an MPLS(Multi-Protocol Label Switching) network. CONSTITUTION: A traffic request matrix that given network link connection information, link capacity information, information on nodes, and traffic quantity required between input/output nodes are recorded at every node is recorded(S201). An NTI(Network Topology Information) on general situations of a network is set(S202). A traffic engineering problem for minimizing a maximum link utilization by using the traffic request matrix and the NTI is mathematically modeled by using an MIP(Mixed integer Programming)(S203). A minimum value of the maximum link utilization(a) and a corresponding traffic rate(Xijkl) satisfying it are obtained by performing the mathematically using the MIP(S204). The minimum value of the maximum link utilization(A) is fixed as a constant 'C' and the sum of every resource used for a network, a new network optimization reference, is minimized(S205). A mathematical modeling using the MIP is performed by using the traffic rate assigned to each link in order to obtain multiple paths for each traffic request value and a value of traffic split rate(S206). The maximum utilization(a) of a link and a resource utilization are minimized in setting up multiple paths, and a multiple path satisfying a limit condition of used hops is set(S207).

Abstract translation: 目的：提供满足限制条件的多路径分配方法，通过在MPLS（多协议标签交换）网络中划分多路径的最优流量来优化互联网骨干网络的性能。 规定：记录在每个节点处记录给定网络链路连接信息，链路容量信息，节点信息和输入/输出节点之间所需的流量的业务请求矩阵（S201）。 设置网络的一般情况的NTI（网络拓扑信息）（S202）。 通过使用流量请求矩阵和NTI来最小化最大链路利用率的流量工程问题通过使用MIP（混合整数编程）（S203）进行数学建模。 通过使用MIP进行数学运算，获得满足该最大链路利用率（a）的最大链路利用率（a）的最小值和对应的业务速率（Xijkl）（S204）。 最大链路利用率（A）的最小值被固定为常数“C”，并且使用于网络的每个资源的总和（新的网络优化参考）被最小化（S205）。 通过使用分配给每个链路的流量速率来执行使用MIP的数学建模，以便为每个流量请求值和流量分流速率的值获得多个路径（S206）。 链路的最大利用率（a）和资源利用率在设置多个路径时被最小化，并且设置满足所使用跳数的限制条件的多路径（S207）。