Allocation of multicast nodes in wavelength-routed networks

Research output: Contribution to journalConference article

10 Citations (Scopus)

Abstract

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
Volume2
StatePublished - Jan 1 2001
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: Jun 11 2000Jun 14 2000

Fingerprint

Wavelength
Simulated annealing
Blocking probability
Computational complexity

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Allocation of multicast nodes in wavelength-routed networks. / Ali, M.; Deogun, Jitender S.

In: IEEE International Conference on Communications, Vol. 2, 01.01.2001, p. 614-618.

Research output: Contribution to journalConference article

@article{91147fb2b2594704801846ae4fd1e146,
title = "Allocation of multicast nodes in wavelength-routed networks",
abstract = "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.",
author = "M. Ali and Deogun, {Jitender S}",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
volume = "2",
pages = "614--618",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Allocation of multicast nodes in wavelength-routed networks

AU - Ali, M.

AU - Deogun, Jitender S

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034870222&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034870222&partnerID=8YFLogxK

M3 - Conference article

VL - 2

SP - 614

EP - 618

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

ER -