Performance assessment of multicast node placement for multicast routing in WDM networks with sparse light splitting

Abstract

This article examines all-optical multicast routing for wavelength-routed optical networks with sparse Multicast Capable (MC) nodes in two phases. The first phase is MC node placement and use of a simple and straightforward Maximum Path Count First (MPCF) algorithm to obtain candidates for MC nodes. The second phase is multicast routing with MC-based schemes that minimizes the number of wavelength channels with minimum transmission delay as required by a given multicast session, in that a light-tree is first constructed to connect MC nodes in a multicast group by using two algorithms, namely, the Pre-computing Minimum Cost (PMC) tree algorithm and the Pre-computing Shortest Path (PSP) tree algorithm. System performance of the proposed MPCF MC node placement algorithm is compared with that of the Normalized Cuts (NC) MC node placement algorithm for both PMC and PSP multicast routing. Furthermore, simulation results compare PMC and PSP multicast routing based on MPCF and NC node placement with Re-route-to-Source (RTS), Re-route-to-Any (RTA), Member-First (MF), and Member-Only (MO) multicast routing based on a light forest for a given multicast session in terms of average number of wavelengths needed, average blocking probability, and mean maximum transmission delay.

Efficient Placement of Splitters in Optical WDM Network

“…As the problem of where to optimally place the multicast capable nodes in the network is an NP-complete problem [29,30], heuristic algorithms that give approximate solutions are the most used in practice. The main heuristics [26,[29][30][31][32][33] for efficient placement of splitters in optical network are described in the following. In [26], authors proposed two heuristics, called k-maximum Degree (kmaxD) and k-maximum Wavelength Reduction (WR).…”

“…At each time, the placement algorithms begin to select MC nodes according to their highest degree of node and if several nodes have the same node degree; the algorithms applies one of the criterion. In [32], the goal is to select a given number of MC nodes in the network for delivering packets among the nodes on a small multicast tree. Heuristic algorithms are proposed for minimizing the number of wavelength with minimum transmission delay as required by a given multicast session.…”

“…etc.) are optimized is called the splitter placement problem [26,[29][30][31][32][33]. In an optical network, some MC nodes reduce the overall link cost of a multicast session better than other MC nodes.…”

Virtual-node-based multicast routing and wavelength assignment in sparse-splitting optical networks

“…To minimize the wavelength channel cost and the overall blocking probability for a given network topology, the placement of VNs is an important issue [13]. In this paper, the VN is defined as a node having both splitting and wavelength conversion capabilities.…”

Design and analysis of p-cycle-based fault-restorable optical networks with multicast capability

“…In contrast, the random wavelength assignment was studied in [188]; in addition, multiple classes of requests were considered. A different approach was taken in [189], where an iterative approximation algorithm was developed for completely connected networks [166,181,[190][191][192][193] or limited wavelength conversion capability. In the sparse light splitting networks [194], not all nodes have light splitting capability [195,196].…”