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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.