최소비용을 갖는 데이터통신망 설계 알고리즘

Data communication network design algorithm with minimum cost

In this paper, the problem of obtaining topoloty for mesh network given the link costs and traffic requirements between all pairs of nodes is considered. The proposed DCN algorithm can be applied to the mesh network in a unified manner. Among the cost conditions, the triangle intequality of the MENTOR algorithm is removed in the proposed algorithm. The computational complexity of the algorithm is order N$^{3}$, where N is the number of nodes in the network. The performances of proposed algorithm are better than those of the MENTOR algorithm in the case of the cost and the reliability of network.