Multicast routing under optical layer constraints

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2004, Pages 2731-2742

  Xin, Yufeng ^a   Rouskas, George N ^b  

^a MCNC   (United States)

^b North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESTINATION NODES; MULTI-PROTOCOL LABEL SWITCHING (MPLS); MULTICAST ROUTING; OPTICAL CROSS CONNECTS (OXC); OPTICAL LAYERS;

BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; NETWORK PROTOCOLS; OPTICAL COMMUNICATION; OPTICAL INTERCONNECTS; PROBLEM SOLVING; TREES (MATHEMATICS); WAVELENGTH DIVISION MULTIPLEXING;

MULTICASTING;

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

References (33)

1. M. Ali and J. Deogun. Allocation of splitting nodes in wavelength-routed networks. Photonic Network Communications, 2(3):245-263, August 2000.
2. M. Ali and J. Deogun. Power-efficient design of multicast wavelength-routed networks. IEEE Journal on Selected Areas in Communications, 18(10):1852-1862, 2000.
3. P. Ashwood-Smith et al. Generalized MPLS - signaling functional description. IETF Draft 〈draft-ietf-mpls-generalized-signaling-06. txt〉, April 2001. Work in progress.
4. F. Bauer and A. Varma. Degree-constrained multicasting in point-to-point networks. In Proceedings of INFOCOM '95, pages 369-376. IEEE, April 1995.
5. C. Chow. On multicast path finding algorithms. In Proceedings of INFOCOM '91, pages 1311-1317. IEEE, 1991.
6. M. Doar and I. Leslie. How bad is naive multicast routing. In Proceedings of INFOCOM '93, pages 82-89. IEEE, April 1993.
7. K. A. Dowsland. Hill-climbing simulated annealing and the steiner problem in graphs. Eng. Opt., 17:91-107, 1991.
8. H. Esbensen. Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm. Networks, 26:173-185, 1995.
9. M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing steiner minimal trees. SIAM Journal of Applied Mathematics, 32(4):835-859, June 1977.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: W. H. Freeman and Co., New York, 1979.
11. S. L. Hakimi. Steiner's problem in graphs and its implications. Networks, 1:113-133, 1971.
12. W. S. Hu and Q. J. Zeng. Multicasting optical cross connects employing splitter-and-delivery switch. IEEE Photonics Technology Letters, 10:970-972, July 1998.
13. X.-H. Jia, D.-Z. Du, X.-D. Hu, M.-K. Lee, and J. Gu. Optimization of wavelength assignment for QoS multicast in WDM networks. IEEE Transactions on Communications, 49(2):341-350, Feb. 2001.
14. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking, 1(3):286-292, June 1993.
15. L. Kou, G. Markowsky, and L. Berman. A fast algorithm for steiner trees. Acta Informatica, 15:141-145, 1981.
16. J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society, 7:48-50, 1956.
17. Juerg Leuthold and Charles H. Joyner. Multimode interference couplers with tunable power splitting ratios. IEEE/OSA Journal of Lightwave Technology, 19(5):700-706, May 2001.
18. D. Li, X. Du, X. Hu, L. Ruan, and X. Jia. Minimizing number of wavelengths in multicast routing trees in WDM networks. Networks, 35(4):260-265, 2000.
19. R. Ramaswami and K. N. Sivarajan. Optical Networks. Morgan Kaufmann Publishers, San Francisco, California, 1998.
20. C. C. Ribeiro and M. C. De Souza. Tabu search for the steiner problem in graphs. Networks, 36(2):138-146. September 2000.
21. E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol label switching architecture. RFC 3031, January 2001.
22. G. N. Rouskas. Optical layer multicast: Rationale, building blocks, and challenges. IEEE Network, 17(1):60-65, January/February 2003.
23. G. N. Rouskas and I. Baldine. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications, 15(3):346-356, April 1997.
24. L. H. Sahasrabuddhe and B. Mukherjee. Light-trees: Optical multicasting for improved performance in wavelength-routed networks. IEEE Communications, 37(2):67-73, February 1999.
25. G. Sahin and M. Azizoglu. Multicast routing and wavelength assignment in wide-area networks. In Proceedings of SPIE, volume 3531, pages 196-208, November 1998.
26. P-R. Sheu and S-T. Chen. A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem. Computer Communications, 2001.
27. T. E. Stern and K. Bala. Multiwavelength Optical Networks. Prentice Hall, Upper Saddle River, New Jersey, 2000.
28. J. Strand, A. L. Chiu, and R. Tkach. Issues for routing in the optical layer. IEEE Communications, 39:81-87, February 2001.
29. H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. Math. Japonica, 24(6):573-577, 1980.
30. W.-Y. Tseng and S.-Y. Kuo. All-optical multicasting on wavelength-routed WDM networks with partial replication. In ICIN-2001, pages 813-818. IEEE, 2001.
31. B. W. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617-1622, December 1988.
32. K.-D. Wu, J.-C. Wu, and C.-S. Yang. Multicast routing with power consideration in sparse splitting WDM networks. In Proceedings of IEEE ICC, pages 513-517, 2001.
33. X. Zhang, J. Y. Wei, and C. Qiao. Constrained multicast routing in WDM networks with sparse light splitting. Journal of Lightwave Technology, 18(12):1917-1927, December 2000.