Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2003.10C.3.367

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

Lee, Yong-Jin (우송대학교 컴퓨터전자정보공학부)
Publication Information
The KIPS Transactions:PartC / v.10C, no.3, 2003 , pp. 367-376 More about this Journal
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.
Keywords
Topological Design; CMST(Capacitated Minimum Spanning Tree); DCMST(Delay Constrained Capacitated Minimum Spanning Tree); Heuristic Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Sedgewick, 'Algorithms,' Addison-Wesley, pp.452-461, 1989
2 R. Sharma, 'Design of an Economical Multidrop Network Topology with Capacity Constraints,' IEEE Trans.on Comm, Vol.31, No.4, pp.590-591, 1983   DOI
3 C. H. Papadimitriou, 'The Complexity of the Capacitated Tree Problem,' Networks, vol.8, pp.217-230, 1978   DOI   ScienceOn
4 A. S. Tanenbaum, 'Computer Networks,' pp.62-87, Prentice-Hall, 1981
5 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
6 Y. Zheng and S. Akhtar, 'Networks for Computer Scientists and Engineers,' Oxford University Press, pp.364-372, 2002
7 L. R. Esau and Williams, 'On teleprocessing system design, partII,' IBM Syst. J, Vol.5, No.3, pp.1062-1066, 1972   DOI
8 B. Gavish, 'Augmented Based Algorithms for Centralized Network Design,' IEEE Trans.on.Comm, Vol.33, No.12, pp.1247-1257, 1985   DOI
9 B. Gavish, 'Topological Design of Telecommunication Networks-Local Access Design Methods,' Annals of Operations Research, Vol.33, No.1, pp.17-71, 1991   DOI
10 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   DOI   ScienceOn
11 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   DOI
12 A. Kershenbaum, 'Telecommunication Network Design Algorithm,' McGraw-Hill, pp.183-200, 1993
13 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   DOI   ScienceOn
14 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
15 V. Ahuja, 'Design and Analysis of Computer Communication Networks,' Design and Analysis of Computer Communication Networks, pp.115-149, 1985
16 K. M. Chandy and T. Lo, 'The Capacitated Minimum Spanning Tree,' Networks, pp.173-181, 1973
17 B. Gavish, 'Formulations and Algorithms for the capacitated minimal directed tree problem,' Journal of ACM, Vol.30, pp.118-132, 1983   DOI   ScienceOn
18 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