Abstract
Supporting multicast communications in WDM networks has become an important and attractive topic recently. In this paper, we study constrained multicast routing with power consideration in WDM networks, where power is attenuated due to (i) the number of concatenated fanouts (splitting), and (ii) the propagation from source node to any multicast member. We propose a heuristic algorithm called Centralized-Splitting algorithm to re-construct the multicast routing paths established by the Member-Only algorithm [17], which can provide the best bandwidth and wavelength usage in the multicast routing construction with sparse splitting constrain. In comparison to the Member-Only algorithm [17], the Centralized-Splitting algorithm (i) does not increase time complexity significantly, especially when the size of multicast group is large; (ii) can reduce the power loss up to 17% in average, while it still maintains proper bandwidth, wavelength usage and delay requirement.
| Original language | English |
|---|---|
| Pages (from-to) | 513-517 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 2 |
| Publication status | Published - 2001 Jan 1 |
| Event | International Conference on Communications (ICC2001) - Helsinki, Finland Duration: 2000 Jun 11 → 2000 Jun 14 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering