### Abstract

In this paper, we introduce the splitter placement problem in wavelength-routed networks (SP-WRN). Given a network topology, a set of multicast sessions, and a fixed number of multicast-capable cross-connects, the SP-WRN problem entails the placement of the multicast-capable cross-connects so that the blocking probability is minimized. The SP-WRN problem is NP-complete as it includes as a subproblem the routing and wavelength assignment problem which is NP-complete. 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 the CPLEX general solver to solve an integer-linear program (ILP) of the problem. The second heuristic is based on a greedy approach and is called most-saturated node first (MSNF). The third heuristic employs simulated annealing (SA) with route-coordination. Through numerical examples on a wide variety of network topologies we demonstrate that: (1) no more than 50% of the cross-connects need to be multicast-capable, (2) the proposed SA heuristic provides fast near-optimal solutions, and (3) it is not practical to use general solvers such as CPLEX for solving the SP-WRN problem.

Original language | English (US) |
---|---|

Pages (from-to) | 247-265 |

Number of pages | 19 |

Journal | Photonic Network Communications |

Volume | 2 |

Issue number | 3 |

DOIs | |

State | Published - Jan 1 2000 |

### Fingerprint

### Keywords

- And power considerations
- Genetic algorithms
- Multicasting
- Optical amplification
- Routing and wavelength assignment
- Simulated annealing
- Splitter placement

### ASJC Scopus subject areas

- Software
- Atomic and Molecular Physics, and Optics
- Hardware and Architecture
- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

**Allocation of Splitting Nodes in All-Optical Wavelength-Routed Networks.** / Ali, Maher; Deogun, Jitender S.

Research output: Contribution to journal › Article

*Photonic Network Communications*, vol. 2, no. 3, pp. 247-265. https://doi.org/10.1023/A:1010004424502

}

TY - JOUR

T1 - Allocation of Splitting Nodes in All-Optical Wavelength-Routed Networks

AU - Ali, Maher

AU - Deogun, Jitender S.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In this paper, we introduce the splitter placement problem in wavelength-routed networks (SP-WRN). Given a network topology, a set of multicast sessions, and a fixed number of multicast-capable cross-connects, the SP-WRN problem entails the placement of the multicast-capable cross-connects so that the blocking probability is minimized. The SP-WRN problem is NP-complete as it includes as a subproblem the routing and wavelength assignment problem which is NP-complete. 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 the CPLEX general solver to solve an integer-linear program (ILP) of the problem. The second heuristic is based on a greedy approach and is called most-saturated node first (MSNF). The third heuristic employs simulated annealing (SA) with route-coordination. Through numerical examples on a wide variety of network topologies we demonstrate that: (1) no more than 50% of the cross-connects need to be multicast-capable, (2) the proposed SA heuristic provides fast near-optimal solutions, and (3) it is not practical to use general solvers such as CPLEX for solving the SP-WRN problem.

AB - In this paper, we introduce the splitter placement problem in wavelength-routed networks (SP-WRN). Given a network topology, a set of multicast sessions, and a fixed number of multicast-capable cross-connects, the SP-WRN problem entails the placement of the multicast-capable cross-connects so that the blocking probability is minimized. The SP-WRN problem is NP-complete as it includes as a subproblem the routing and wavelength assignment problem which is NP-complete. 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 the CPLEX general solver to solve an integer-linear program (ILP) of the problem. The second heuristic is based on a greedy approach and is called most-saturated node first (MSNF). The third heuristic employs simulated annealing (SA) with route-coordination. Through numerical examples on a wide variety of network topologies we demonstrate that: (1) no more than 50% of the cross-connects need to be multicast-capable, (2) the proposed SA heuristic provides fast near-optimal solutions, and (3) it is not practical to use general solvers such as CPLEX for solving the SP-WRN problem.

KW - And power considerations

KW - Genetic algorithms

KW - Multicasting

KW - Optical amplification

KW - Routing and wavelength assignment

KW - Simulated annealing

KW - Splitter placement

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

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

U2 - 10.1023/A:1010004424502

DO - 10.1023/A:1010004424502

M3 - Article

AN - SCOPUS:0034357522

VL - 2

SP - 247

EP - 265

JO - Photonic Network Communications

JF - Photonic Network Communications

SN - 1387-974X

IS - 3

ER -