Multicast routing and wavelength assignment in WDM networks with limited drop-offs

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 487-494

  Hu, X D ^a   Shuai, T P ^a   Jia, Xiaohua ^b   Zhang, Mu Hong ^c  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; MULTICASTING; MULTIMEDIA SYSTEMS; ROUTERS; SET THEORY; WAVELENGTH DIVISION MULTIPLEXING; WIDE AREA NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

LIGHT-PATH TREE METHOD; MULTICAST ROUTING; OPTICAL NETWORK; OPTICAL SIGNALS;

TELECOMMUNICATION NETWORKS;

EID: 8344251724     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. M. Ali and J. S. Deogun, Power-efficient design of multicast wavelength-routed networks, IEEE Journal on Selected Areas in Communications, 18 (10) (2000), 1852-1862.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximatio: Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag: Berlin and Heidelberg, 1999.
3. D. Banerjee and B. Mukherjee, A practical approach for routing and wavelength assignment in large wavelength-routed optical networks, IEEE Journal on Selected Areas in Communications, 14 (5) (1996), 903-908.
4. K. Bharath-Kumar and J. M. Jaffa, Routing to multiple destinations in computer networks, IEEE Transactions on Communications, 31 (3) (1983), 343-351.
5. N. Christonfides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report, GSIA, Carnegie-Mellon University, 1976.
6. V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research, 4 (3) (1979), 233-235.
7. S.-X. Gao, X.-H. Jia, X.-D. Hu, and D.-Y. Li, Wavelength requirements and routing for multicast connections in lightpath and light-tree models of WDM networks with limited drops, IEE Proceedings on Communications, 148 (6) (2001), 363-367.
8. J. Gu, X.-D. Hu, and M.-H. Zhang, Algorithms for multicast connection under multi-path routing model, Information Processing Letters, 84 (1) (2002), 31-39.
9. R. L. Hadas, Efficient collective communication in WDM networks with a power budget, in proceedings of IEEE International Conference on Computer Communication Network, (2000), 612-616.
10. Xiaohua Jia, X.-D. Hu, M. Lee, D.-Z. Du, and J. Gu, Optimization of Wavelength Assignment for QoS Multicast in WDM Networks, IEEE Trans on Communications, 49(2)(2001), 341-350.
11. D. W. Matula, G. Marble, and J. D. Isaacson, Graph coloring algorithms, in Graph Theory and Computing, R. C. Read, Ed., New York and London: Academic, 1972, 109-122.
12. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
13. L. H. Sahasrabuddhe and B. Mukherjee, Multicast routing algorithms and protocols: a tutorial, IEEE Network, 14 (1) (2000), 90-102.
14. L. H. Sahasrabuddhe and B. Mukherjee, Light-trees: optical multicasting for improved performance in wavelength-routed networks, IEEE Communications Magazine, 37 (2) (1999), 67-73.
15. B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, 6 (1988), 1617-1622.
16. Guoliang Xue and R. Banka, Bottom-up construction of dynamic multicast trees in WDM networks, Proceedings of IEEE International Conference on Performance, Computing, and Communications Conference, 2003, 49-56.
17. X. Zhang, J. Wei, and C. Qiao, Constrained multicast routing in WDM networks with sparse light splitting, Proceedings of 19th IEEE Conference on Computer Communications, March 26-30, 2000.