The constructing of multicast light-trees in WDM network with sparse splitting has been proven to be an NP-complete
problem. The Member-Only (MO) algorithm provides the best links stress and wavelength usage, and the Distance
Priority (DP) algorithm reduces the diameter of tree and average delay, which are sensitive in multicast applications. In
order to diminish the diameter of tree and average delay further while maintaining the same link stress and average cost,
we present an algorithm called Nearest Connector First Heuristic (NCFH) in this paper. Simulation results show that the
proposed algorithm achieves a good performance.