This paper addresses the problem of multiple multicast in WDM networks. It presents three efficient algorithms to construct an optimal/sub-optimal multicast tree for each multicast and minimise the network congestion on wavelengths. The first two algorithm achieve an optimal network congestion for a specific class of networks whose all wavelengths are globally accessible and convertible at a unit cost. The third algorithm produces an approximation solution for the general case of WDM networks.
|Number of pages
|IEICE Transactions on Information and Systems
|Published - 1999
- Wdm networks