The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Two Phase Heuristic Algorithm for Mean Delay constrained Capacitated Minimum Spanning Tree Problem

평균 지연 시간과 트래픽 용량이 제한되는 스패닝 트리 문제의 2단계 휴리스틱 알고리즘

  • 이용진 (우송대학교 컴퓨터전자정보공학부)
  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

본 연구는 로컬 네트워크의 토폴로지를 설계하거나 루트 노드로부터 여러 개의 통신 경로를 구하는 데 사용될 수 있는 DCMST(Delay constrained Capacitated Minimum Spanning Tree) 문제를 다룬다. 기존의 CMST 문제는 루트 노드의 한 포트가 담당하는 트래픽의 용량에만 제한이 있는 데 비해 DCMST 문제에는 네트워크 평균 지연 시간의 제약 조건이 추가된다. 이 문제는 종단 노드의 트래픽 요구량과 네트워크의 평균 지연 시간을 만족시키는 스패닝 트리의 집합을 구하는 것으로 목적 함수는 전체 링크 비용을 최소로 하는 것이다. 본 연구에서는 트레이드-오프에 기준한 노드 교환 알고리즘과 노드 이동 알고리즘 그리고 평균 지연 알고리즘으로 구성되는 2 단계 휴리스틱을 제시한다. 실제 계산 경험과 성능 분석을 통해 제안한 알고리즘이 평균 지연을 고려한 기존의 CMST 알고리즘보다 비용 측면에 있어 더 우수한 해를 생성할 수 있음을 보였다.

Keywords

References

  1. V. Ahuja, 'Design and Analysis of Computer Communication Networks,' Design and Analysis of Computer Communication Networks, pp.115-149, 1985
  2. K. M. Chandy and T. Lo, 'The Capacitated Minimum Spanning Tree,' Networks, pp.173-181, 1973
  3. K. M. Chandy and R. A. Russell, 'The Design of Multipoint Linkages in a Teleprocessing Tree Network,' IEEE Trans. on Computers, Vol.21, No.10, pp.1062-1066, 1972 https://doi.org/10.1109/T-C.1972.223452
  4. L. R. Esau and Williams, 'On teleprocessing system design, partII,' IBM Syst. J, Vol.5, No.3, pp.1062-1066, 1972 https://doi.org/10.1147/sj.53.0142
  5. B. Gavish, 'Formulations and Algorithms for the capacitated minimal directed tree problem,' Journal of ACM, Vol.30, pp.118-132, 1983 https://doi.org/10.1145/322358.322367
  6. B. Gavish, 'Augmented Based Algorithms for Centralized Network Design,' IEEE Trans.on.Comm, Vol.33, No.12, pp.1247-1257, 1985 https://doi.org/10.1109/TCOM.1985.1096250
  7. B. Gavish, 'Topological Design of Telecommunication Networks-Local Access Design Methods,' Annals of Operations Research, Vol.33, No.1, pp.17-71, 1991 https://doi.org/10.1007/BF02061657
  8. B. Gavish and K. Altinkemer, 'Parallel Savings Heuristic for the Topological Design of Local Access Tree Networks,' Proceedings IEEE-INFOCOM'86, pp.139-139, 1986
  9. A. Kershenbaum, R. Boorstyn and R. Oppenheim, 'Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design,' IEEE Trans.on Comm, Vol.28, No.10, pp.1835-1838, 1980 https://doi.org/10.1109/TCOM.1980.1094601
  10. A. Kershenbaum, 'Telecommunication Network Design Algorithm,' McGraw-Hill, pp.183-200, 1993
  11. Y. Lee and T. Kim, 'An Algorithm for the Capacitated Minimum Spanning Tree in Local Area Network,' Jornal of the Korea Information Science Society, Vol.21, No.6, pp.1097-1106, 1994
  12. Y. Lee and T. Kim, 'Two-Phase Heuristic Algorithm for Delay Constrained Minimal Cost Loop Problem,' International Journal of Network Management, Vol.6, No.3, pp.142-149, 1996 https://doi.org/10.1002/(SICI)1099-1190(199605/06)6:3<142::AID-NEM202>3.0.CO;2-Q
  13. Y. Lee and D. Lee, 'Two-Phase Algorithm for the Topological Design of Local Access Tree Network,' Proceedings of the IASTED International Conference-Networks, pp.67-70, 1996
  14. C. H. Papadimitriou, 'The Complexity of the Capacitated Tree Problem,' Networks, vol.8, pp.217-230, 1978 https://doi.org/10.1002/net.3230080306
  15. R. Sedgewick, 'Algorithms,' Addison-Wesley, pp.452-461, 1989
  16. R. Sharma, 'Design of an Economical Multidrop Network Topology with Capacity Constraints,' IEEE Trans.on Comm, Vol.31, No.4, pp.590-591, 1983 https://doi.org/10.1109/TCOM.1983.1095845
  17. A. S. Tanenbaum, 'Computer Networks,' pp.62-87, Prentice-Hall, 1981
  18. Y. Zheng and S. Akhtar, 'Networks for Computer Scientists and Engineers,' Oxford University Press, pp.364-372, 2002