Multicast routing with power consideration in sparse splitting WDM networks

K. D. Wu, J. C. Wu, C. S. Yang

Research output: Contribution to journalConference article

25 Citations (Scopus)

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 languageEnglish
Pages (from-to)513-517
Number of pages5
JournalIEEE International Conference on Communications
Volume2
Publication statusPublished - 2001 Jan 1
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: 2000 Jun 112000 Jun 14

Fingerprint

Wavelength division multiplexing
Bandwidth
Wavelength
Heuristic algorithms
Communication

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{38256a3a78744998a868185235b0cb56,
title = "Multicast routing with power consideration in sparse splitting WDM networks",
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.",
author = "Wu, {K. D.} and Wu, {J. C.} and Yang, {C. S.}",
year = "2001",
month = "1",
day = "1",
language = "English",
volume = "2",
pages = "513--517",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Multicast routing with power consideration in sparse splitting WDM networks. / Wu, K. D.; Wu, J. C.; Yang, C. S.

In: IEEE International Conference on Communications, Vol. 2, 01.01.2001, p. 513-517.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Multicast routing with power consideration in sparse splitting WDM networks

AU - Wu, K. D.

AU - Wu, J. C.

AU - Yang, C. S.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034863995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034863995&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0034863995

VL - 2

SP - 513

EP - 517

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

ER -