Traffic grooming for single-source multicast communication in WDM rings

We consider the problem of minimizing the number of ADMs for single-source multicast communication in WDM rings using traffic grooming. We examine two distinct models of communication, one permitting the same message to be sent on multiple distinct wavelengths and one each message to be sent exactly once. The problem of minimizing the number of ADMs is shown to be NP-complete in the strong sense for both models. However, we are able to solve a special case in polynomial time and provide good approximation algorithms and heuristics for the remaining cases. These approximation algorithms and heuristics are validated both theoretically and experimentally.