Optimization of splitting node placement in wavelength-routed optical networks

Maher, Ali

doi:10.1109/jsac.2002.803990

Cited by 43 publications

(43 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been several studies on the optimization of split node placement in optical multicast networks. Ali [5] considers split node placement problems for static and dynamic traffic in wavelength-routed networks. Poo and Zhou [6] addressed the multicast wavelength assignment (MC-WA) problem in wavelength-routed WDM networks with full light splitting and wavelength conversion.…”

Section: Previous Workmentioning

confidence: 99%

An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks

Barat¹,

Ghosh²,

Dutta³

et al. 2015

JACN

View full text Add to dashboard Cite

Abstract-MulticastCommunication over an optical fiber network is treated as a major problem in optical domain. As the need of one-to-many communication is increasing day by day, researchers are trying to devise novel and efficient approaches to solve this problem. Although the most of the efforts done in this field is heuristic in nature, evolutionary approaches are also started to be used to solve this as an optimization problem. In this paper we have used Genetic Algorithm to find an efficient multicast route (tree) to establish a multicast connection in WDM mesh network. We have proposed a novel fitness function which can optimize multiple objectives: reaching maximum no. of destinations, minimizing usage of optical channels, minimizing usage of splitters, very efficiently. We have established the truth of our claim by simulating our proposed algorithm over various optical fiber networks.

show abstract

Section: Previous Workmentioning

confidence: 99%

An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks

Barat¹,

Ghosh²,

Dutta³

et al. 2015

JACN

View full text Add to dashboard Cite

show abstract

“…In this paper, the VN is defined as a node having both splitting and wavelength conversion capabilities. In [14], the authors show that the splitter placement problem alone is NP-complete. In order to overcome the complexity of the NP-complete problem, a heuristic algorithm that selects the candidate nodes as VNs based on the hop count and delay is introduced.…”

Section: Virtual Node Placementmentioning

confidence: 99%

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

2009

View full text Add to dashboard Cite

This paper investigates several problems associated with optical multicast routing and wavelength assignment in sparse-splitting optical networks for interactive real-time media distribution. Unfortunately, the constrained multicast routing with optimized wavelength assignment leads to NP-complete condition. Thus, in this paper, a virtual-node-based multicast routing algorithm is first proposed to satisfy the requirements of interactive real-time multicasting as well as the constraints from underlying optical networks. For the constructed multicast tree, we then associate an effective wavelength assignment algorithm. The experimental results show that the proposed algorithm combination performs well in terms of (1) the wavelength channel cost, (2) the maximum variation of inter-destination node delays, (3) the signal quality, and (4) the number of wavelength conversions.Keywords Sparse-splitting optical networks · Multicast routing and wavelength assignment · Virtual-node · Hierarchy-based approach · End-to-end delay

show abstract

“…Ali [5,15] considers the splitter placement problems for static and stochastic traffic in wavelength-routed networks. In [5,Sect.…”

Section: Related Workmentioning

confidence: 99%

“…In [15] the traffic between nodes is stochastic and the objective is to minimize the blocking probability. The blocking performance is used to guide an iterative algorithm for the placement of split nodes, where the total number of split nodes to be placed in the network is fixed.…”

Section: Related Workmentioning

confidence: 99%

Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks

Siregar

Zhang²,

Takagi³

2005

IEICE Transactions on Communications

View full text Add to dashboard Cite

We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The maximum number of wavelengths that can be used is specified a priori. A genetic algorithm is proposed that exploits the combination of alternative shortest paths for the given multicast requests. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with the case where the split-capable node placement optimization is not performed while the specified number of wavelengths is not exceeded.

show abstract

Optimization of splitting node placement in wavelength-routed optical networks

Cited by 43 publications

References 14 publications

An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks

An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks

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

Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks

Contact Info

Product

Resources

About