Bottom-up construction of dynamic multicast trees in WDM networks

Guoliang Xue, R. Banka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The high throughput provided by WDM technology in fiber optic networks has made WDM networks the choice of future high speed networks. Many efficient routing and wavelength assignment algorithms have been proposed in the literature. However, efficient construction of multicast trees in all-optical WDM networks is still a challenging problem. Due to the difficulty of partitioning the destinations into different wavelength groups, minimizing the network usage of a multicast tree in an all-optical WDM network is much harder than its counterpart in IP networks. In this paper, we present a simple greedy heuristic for constructing a dynamic multicast tree in an all-optical WDM network. Our algorithm can establish a multicast tree as long as all destinations are reachable from the source node. Computational results show that: (1) the blocking probability of our algorithm is considerably lower than other known WDM multicast algorithms; (2) the network usage required by our multicast tree is less than that of the multicast tree induced from minimum cost unicasts; (3) the time required to establish a multicast tree is very short.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the IEEE International Performance, Computing, and Communications Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages49-56
Number of pages8
Volume2003-January
ISBN (Print)0780378938
DOIs
StatePublished - 2003
Event22nd IEEE International Performance, Computing, and Communications Conference, IPCCC 2003 - Phoenix, United States
Duration: Apr 9 2003Apr 11 2003

Other

Other22nd IEEE International Performance, Computing, and Communications Conference, IPCCC 2003
CountryUnited States
CityPhoenix
Period4/9/034/11/03

Fingerprint

Wavelength division multiplexing
Wavelength
HIgh speed networks
Blocking probability
Fiber optic networks
Throughput
Costs

Keywords

  • multicast routing
  • performance evaluation
  • WDM all-optical networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Xue, G., & Banka, R. (2003). Bottom-up construction of dynamic multicast trees in WDM networks. In Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Vol. 2003-January, pp. 49-56). [1203683] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/PCCC.2003.1203683

Bottom-up construction of dynamic multicast trees in WDM networks. / Xue, Guoliang; Banka, R.

Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. p. 49-56 1203683.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xue, G & Banka, R 2003, Bottom-up construction of dynamic multicast trees in WDM networks. in Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. vol. 2003-January, 1203683, Institute of Electrical and Electronics Engineers Inc., pp. 49-56, 22nd IEEE International Performance, Computing, and Communications Conference, IPCCC 2003, Phoenix, United States, 4/9/03. https://doi.org/10.1109/PCCC.2003.1203683
Xue G, Banka R. Bottom-up construction of dynamic multicast trees in WDM networks. In Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. Vol. 2003-January. Institute of Electrical and Electronics Engineers Inc. 2003. p. 49-56. 1203683 https://doi.org/10.1109/PCCC.2003.1203683
Xue, Guoliang ; Banka, R. / Bottom-up construction of dynamic multicast trees in WDM networks. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. pp. 49-56
@inproceedings{c423eba59cc84086beca7f1bb640bd58,
title = "Bottom-up construction of dynamic multicast trees in WDM networks",
abstract = "The high throughput provided by WDM technology in fiber optic networks has made WDM networks the choice of future high speed networks. Many efficient routing and wavelength assignment algorithms have been proposed in the literature. However, efficient construction of multicast trees in all-optical WDM networks is still a challenging problem. Due to the difficulty of partitioning the destinations into different wavelength groups, minimizing the network usage of a multicast tree in an all-optical WDM network is much harder than its counterpart in IP networks. In this paper, we present a simple greedy heuristic for constructing a dynamic multicast tree in an all-optical WDM network. Our algorithm can establish a multicast tree as long as all destinations are reachable from the source node. Computational results show that: (1) the blocking probability of our algorithm is considerably lower than other known WDM multicast algorithms; (2) the network usage required by our multicast tree is less than that of the multicast tree induced from minimum cost unicasts; (3) the time required to establish a multicast tree is very short.",
keywords = "multicast routing, performance evaluation, WDM all-optical networks",
author = "Guoliang Xue and R. Banka",
year = "2003",
doi = "10.1109/PCCC.2003.1203683",
language = "English (US)",
isbn = "0780378938",
volume = "2003-January",
pages = "49--56",
booktitle = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Bottom-up construction of dynamic multicast trees in WDM networks

AU - Xue, Guoliang

AU - Banka, R.

PY - 2003

Y1 - 2003

N2 - The high throughput provided by WDM technology in fiber optic networks has made WDM networks the choice of future high speed networks. Many efficient routing and wavelength assignment algorithms have been proposed in the literature. However, efficient construction of multicast trees in all-optical WDM networks is still a challenging problem. Due to the difficulty of partitioning the destinations into different wavelength groups, minimizing the network usage of a multicast tree in an all-optical WDM network is much harder than its counterpart in IP networks. In this paper, we present a simple greedy heuristic for constructing a dynamic multicast tree in an all-optical WDM network. Our algorithm can establish a multicast tree as long as all destinations are reachable from the source node. Computational results show that: (1) the blocking probability of our algorithm is considerably lower than other known WDM multicast algorithms; (2) the network usage required by our multicast tree is less than that of the multicast tree induced from minimum cost unicasts; (3) the time required to establish a multicast tree is very short.

AB - The high throughput provided by WDM technology in fiber optic networks has made WDM networks the choice of future high speed networks. Many efficient routing and wavelength assignment algorithms have been proposed in the literature. However, efficient construction of multicast trees in all-optical WDM networks is still a challenging problem. Due to the difficulty of partitioning the destinations into different wavelength groups, minimizing the network usage of a multicast tree in an all-optical WDM network is much harder than its counterpart in IP networks. In this paper, we present a simple greedy heuristic for constructing a dynamic multicast tree in an all-optical WDM network. Our algorithm can establish a multicast tree as long as all destinations are reachable from the source node. Computational results show that: (1) the blocking probability of our algorithm is considerably lower than other known WDM multicast algorithms; (2) the network usage required by our multicast tree is less than that of the multicast tree induced from minimum cost unicasts; (3) the time required to establish a multicast tree is very short.

KW - multicast routing

KW - performance evaluation

KW - WDM all-optical networks

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

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

U2 - 10.1109/PCCC.2003.1203683

DO - 10.1109/PCCC.2003.1203683

M3 - Conference contribution

AN - SCOPUS:84954457096

SN - 0780378938

VL - 2003-January

SP - 49

EP - 56

BT - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

PB - Institute of Electrical and Electronics Engineers Inc.

ER -