Multicast routing, load balancing, and wavelength assignment on tree of rings

IEEE Communications Letters

Volumn 6, Issue 2, 2002, Pages 79-81

  Jia, Xiaohua ^a   Hu, Xiao Dong ^b   Ruan, Lu ^c   Sun, Jianhua ^d  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

^c Iowa State University   (United States)

^d University of Minnesota   (United States)

Author keywords

Competitive algorithm; Multicast routing; Wavelength assignment

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; INTERCONNECTION NETWORKS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING; WAVELENGTH DIVISION MULTIPLEXING;

COMPETITIVE ALGORITHM; LOAD BALANCING; MULTICAST ROUTING; WAVELENGTH ASSIGNMENT;

MULTICASTING;

EID: 0036476507     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.984702     Document Type: Article

References (11)

1. Lower bounds for on-line graph problems with application to on-line circuit and optical routing
2. Wavelength allocation on trees of rings
3. An optimal greedy algorithm for wavelength allocation in directed tree networks
4. Balancing minimum spanning trees and shortest-path trees
5. Light-trees: Optical multicasting for improved performance in wavelength-routed networks
6. Multicast routing algorithms and protocols: A tutorial
7. Amortized efficiency of list update and paging rules
8. Optimal on-line coloring of circular arc graphs
9. Ring routing and wavelength translation