An efficient algorithm for optimal manycast routing problem over WDM networks

摘要

In this paper, we discuss the problem of supporting resource optimization of manycasting service over wavelength division multiplexing (WDM) optical networks. Manycast is a novel group communication paradigm wherein the source is required to send data packets to a certain number of a set of pre-specified group members. Since it integrates the characteristic of multicast and anycast, manycast is attracting increasing interest from researchers over wavelength division multiplexing (WDM) optical networks. Splitter, cost, wavelength channel are three parameters which are taken into consideration for the first time in WDM. Finding a manycast tree which span the resource and selected nodes with minimum number of splitter, cost and wavelength channel is an NP-complete problem, and therefore we propose a simple and efficient heuristic solution: based-frequency manycast routing (BFM) algorithm to construct manycast trees with the aim of reducing the use of network resources. For a set of manycast requests, the simulation result shows BFM builds manycast trees with the smallest number of resources than other algorithms.