Search

A theory to allocate a wavelength in the tree networks coordinated arrangement in m-arity networks is proposed. Wavelength required equations to support all-to-all unicasting in the network according to its depth are presented. Three cases are examined: when nodes are only targets, sources or target and source in the same time. The trade-off between wavelength cost and wavelength conversion cost is considered; therefore, concentration is on wavelength allocation without conversion.

The construction of light-trees is one of the principal sub-problems for all-optical multicast technology in wavelength division multiplexing (WDM) networks. In this paper a new algorithm proposed to maximize quality of service by minimizing dispersion on the converted wavelength. Network cost is significantly reduced by decreasing number of wavelengths and Number of wavelength converters utilized to produce multicast services. The simulation results show that the proposed algorithms have a better performance when compared to existing optimal algorithms.

Dynamic wavelength allocation (DWA) in multicast (MC) switching is investigated in this paper. The aim for this investigation is to maximize the network capacity and minimize the blocking probability in the wavelength division multiplexer network (WDM). By using light splitters (LS) and wavelength converters (WC) in the joint nodes, the WDM network is improved and the wavelength reuse was increased. The result shows that our optimization has increased the network capacity by about 41% compared with previous work.

Dynamic wavelength allocation (DWA) in multicast (MC) switching has been investigated in this paper. The aim for this investigation is to maximize the network capacity and minimize the blocking probability in the wavelength division multiplexing network (WDM). By using light splitters (LS) and wavelength converters (WC) in the joint nodes, the WDM network has been improved. By using our multicast switch the power, delay and desperation have been reduced. The results show that our new algorithm called Highest Number of Destinations (HND) has increased the network capacity compared with previous work.