Allocation of multicast nodes in wavelength-routed networks

M. Ali, J. Deogun

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations


We investigate the allocation of multicast nodes and formalize it as splitter placement in wavelength-routed networks (SP-WRN) problem. The SP-WRN problem entails the placement of multicast nodes so that the overall network blocking probability is minimized. To gain a deeper insight into the computational complexity of the SP-WRN problem, we define a graph-theoretic version of the splitter placement problem (SPG), and show that even SPG is NP-complete. We develop three heuristics for the SP-WRN problem with different degrees of trade-off between computation time and quality of solution. The first heuristic uses CPLEX, the second heuristic is based on a greedy approach, and the third heuristic employs Simulated Annealing. Numerical examples demonstrate that: i) no more than 50% of the cross-connects need to be multicast-capable, and ii) the iterative simulated annealing heuristic provides fast near-optimal solutions.

Original languageEnglish (US)
Pages (from-to)614-618
Number of pages5
JournalIEEE International Conference on Communications
StatePublished - 2001
Externally publishedYes
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: Jun 11 2000Jun 14 2000

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Allocation of multicast nodes in wavelength-routed networks'. Together they form a unique fingerprint.

Cite this