Multicasting in a class of multicast-capable WDM networks

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn 2000-October, Issue , 2000, Pages 184-191

  Wang, Yang ^a   Yangt, Yuanyuan ^b  

^a University of Vermont Burlington ^*  (United States)

^b Stony Brook University   (United States)

Author keywords

Graph coloring; Light splitting; Multicast; Permutation; WDM optical networks

Indexed keywords

OPTICAL SWITCHES;

DESTINATION NODES; GRAPH COLORINGS; LIGHT SPLITTING; MULTICAST CAPABLE; MULTIPLE DESTINATIONS; PERMUTATION; SINGLE SOURCE; SOURCE NODES; WDM NETWORKS; WDM OPTICAL NETWORKS;

MULTICASTING;

EID: 0008396766     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2000.885489     Document Type: Conference Paper

References (9)

1. Y.Yang, J. Wang and C. Qiao, “NonblockingWDM multicast switching networks”, Proc. of 2000 Intemational Conference on ParallelProcessing, Toronto, Canada, August 2000.
2. C. Zhou and Y. Yang, “Embedding multicast in a class of optical WDM networks”, Proc. of the Intemutional Conferenceon Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, vol. 2, pp. 597-604, July 1998.
3. C. Zhou and Y. Yang, “Multicast communication in a class of rearrangeable optical WDM networks,” Proc. of the IEEE 5th Intemational Conferenceon Massively Parallel Processing Using Optical Interconnections(MPPOI ’98),Las Vegas, Nevada, June 1998,pp. 68-75.
4. C. Qiao and Y.Mei, “Off-line permutation embedding and schedulingin multiplexed optical networks with regular topologies:’ IEEELACM Trans.Networking, vol. 7, no. 2, April 1999, pp. 241-250.
5. C. Qiao and Y. Mei, “A comparativestudy of cost effective multiplexing approaches in optical networks”, Proc. of the 3rd Intemationul Conferenceon Massively Parallel Processing using Optical Interconnections(MPP01’96),pp.24-31, Oct. 1996.
6. C. Berge, Graphs and Hypergraphs, North-Holland, 1973.
7. C. Berge, ‘‘Fabungvon Graphen, deren shliche bzw. deren ungerade Kreise starr sind”, Wiss. Z Martin-Luther-Univ. Halle-WittemburgMath.-Nut.Reihe 10(1961),pp. 114-115.
8. L. Lovdsz, “Normal hypergraphs and the perfect graph conjecture,” Discrete Mathematics, 2(1972),pp. 253-267.
9. M. Grotschel, L. Lovdsz and A. Schujver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica, 1(1981),pp. 169-197.