• 한국컴퓨터정보학회논문지
• /
• 제21권6호
• /
• pp.77-81
• /
• 2016

This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with $O(mn)^2$ time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of ($s_i,t_i$) city pair satisfied with demand of ($s_i,t_i$). The proposed algorithm can be get the same optimal solution as LP for experimental data.

• Communications for Statistical Applications and Methods
• /
• 제9권3호
• /
• pp.845-851
• /
• 2002

An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• 한국신뢰성학회:학술대회논문집
• /
• 한국신뢰성학회 2002년도 정기학술대회
• /
• pp.297-302
• /
• 2002

An efficient method is developed to obtain the maximum capacity flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• 한국신뢰성학회:학술대회논문집
• /
• 한국신뢰성학회 2001년도 정기학술대회
• /
• pp.455-462
• /
• 2001

We propose a new method to evaluate the network reliability which greatly reduces the intermediate steps toward calculations of maximum capacity flow by excluding unnecessary simple paths contained in the set of failure simple paths. By using signed simple paths and signed flow, we show that our method is more efficient than that of Lee and Park (2001a) in the number of generated composite paths and in the procedure for obtaining minimal success composite paths. Numerical examples are given to illustrate the use and the efficiency of the method.