 
Summary: Least cost heuristic for the delayconstrained capacitated minimum
spanning tree problem
YongJin Leea
, M. Atiquzzamanb,*
a
Department of Computer Science, Woosong University, 172 JayangDong, DongKu, Taejon 300718, South Korea
b
School of Computer Science, University of Oklahoma, 200 Felgar Street, Norman, OK 730196151, USA
Received 2 September 2004; revised 10 January 2005; accepted 10 January 2005
Available online 21 January 2005
Abstract
This study deals with the DelayConstrained Capacitated Minimum Spanning Tree (DCCMST) problem arising in topology discovery of
local network. While the traditional Capacitated Minimum Spanning Tree (CMST) problem deals with only traffic capacity constraint of a
port of a source node, and DelayConstrained Minimum Spanning Tree (DCMST) considers only the maximum endtoend delay constraint,
the DCCMST problem deals with mean network delay and traffic capacity constraints simultaneously. The DCCMST problem consists of
finding a set of minimum cost spanning trees to link endnodes to a source node which satisfy the traffic requirements at endnodes and the
required mean delay of a network. We formulate the DCCMST problem and present the LeastCost DCCMST Heuristic, which consists of
node exchange algorithm, node shift algorithm, and mean delay link capacity algorithm to solve the DCCMST problem. Results from
performance analysis show that the proposed heuristic can produce, in a very short computation time, better results than the previous CMST
algorithms modified to solve the DCCMST problem. The proposed LeastCost DCCMST Heuristic can be applied to the topological design
