Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1074-1078 |
Number of pages | 5 |
Journal | IEICE Transactions on Information and Systems |
Volume | E82-D |
Issue number | 6 |
Publication status | Published - 1999 |
Externally published | Yes |
Keywords
- Algorithm
- Communication
- Multicast
- Wdm networks