Performance Assessment of MC Placement for Multicast Routing in WDM Networks with Spare Light Splitting

DOI

10.2991/jcis.2006.113How to use a DOI?

Keywords

Multicast Capable (MC), Light-tree, Maximum path count first (MPCF), Call blocking probability

Abstract

This investigation examines all-optical multicast routing in wavelength-routed optical networks with sparse Multicast Capable (MC) nodes that have three phases. The first phase is the MC node placement, and the maximum path count first (MPCF) algorithm is utilized to obtain candidates for MC nodes. The second phase is a multicast routing with MC-based schemes which including two algorithms, namely, the Pre-computing Minimum Cost Tree (PMC) and Pre-computing Shortest Path Tree (PSP) algorithms. Both algorithms use Steiner tree and shortest path tree to create an MC-based tree. The third phase is the system maintenance. System performance of PMC and PSP is compared with that of the Route to Source (RTS) algorithm in terms of average number of wavelengths needed、average call blocking probability and mean maximum transmission delay. Simulation results indicate that the proposed schemes utilize the minimum number of wavelengths needed and reduce blocking probability.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - I-Shyan Hwang
AU  - Tsung-Ching Lin
AU  - Zen-Der Shyu
PY  - 2006/10
DA  - 2006/10
TI  - Performance Assessment of MC Placement for Multicast Routing in WDM Networks with Spare Light Splitting
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.113
DO  - 10.2991/jcis.2006.113
ID  - Hwang2006/10
ER  -