| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] |
¡@
Der-Rong Din
Department of Computer Science and Information Engineering
National Changhua University of Education
Changhua City, 500 Taiwan
E-mail: deron@cc.ncue.edu.tw
Wavelength Division Multiplexing (WDM) is an important technique to make use of
the large amount of bandwidths in optical fibers to meet the bandwidth requirements of
applications. In this paper, two new models (MWDCRP and MCRP) of multicast routing
on WDM networks are studied. In these models, it is assumed that each switch on WDM
network can perform 'drop,' 'continue' and 'drop and continue' operations. In MWDCRP,
given the multicast request and the delay constraint, the goal is to find a minimal wavelength
light-forest to route the multicast request under the delay constraint. In MCRP, the
objective cost of the multicast routing problem has two components: one is the transmitting
cost, the other is the number of used wavelengths. Given the WDM network and the
multicast request, the goal is to find a minimal cost light-forest to route the multicast request.
Since these problems are NP-hard, four heuristic algorithms (named as Maximal-
Delay-First (MDF), miNimal-Delay-First (NDF), Farthest-Greedy (FG), and Nearest-
Greedy (NG)) are proposed to solve these problems. Simulation results demonstrate that
the proposed algorithms can generate good solutions.
Received April 13, 2007; revised August 10, 2007 & May 12, 2008; accepted June 26, 2008.
Communicated by Takeshi Tokuyama.