Tree-based protection of multicast services in WDM mesh networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2009, Pages

  Long, ^a   Kamal, Ahmed E ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE NUMBERS; COST-EFFICIENT; LINK FAILURES; MULTICAST SERVICES; MULTICAST SESSIONS; MULTICAST TREE; MULTICASTS; NUMERICAL RESULTS; OPTIMAL SOLUTIONS; PROTECTION PATHS; PROTECTION SCHEMES; RECOVERY PERFORMANCE; SEGMENT-BASED; TREE-BASED; WDM MESH NETWORK;

MESH NETWORKING; MULTICASTING; NUMERICAL ANALYSIS; WIRELESS MESH NETWORKS (WMN);

TREES (MATHEMATICS);

EID: 77951520765     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2009.5425703     Document Type: Conference Paper

References (15)

1. J. He, Gary Chan and Danny H.K. Tsang, "Multicasting in WDM networks," IEEE Commun. Surveys and tutorials, Dec. 2002.
2. N. K. Singhal, L. H. Sahasrabuddhe, and B. Mukherjee, "Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks", J. Lightwave Technol, vol. 21, pp. 2587-2594, 2003.
3. L. H. Sahasrabuddhe and B. Mukherjee, "Light trees: Optical multicasting for improved performance in wavelength routed networks," IEEE Commun. Mag., vol. 37, no. 2, pp. 67-73, Feb. 1999.
4. M. Medard, S. G. Finn, R. A. Barry, and R. G. Gallager, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge redundant graphs," IEEE/ACMTrans. Netw., vol. 7, no. 5, pp. 641-652, Oct. 1999.
5. N. Singhal and B. Mukherjee, "Protecting multicast sessions in WDM optical mesh network," IEEE/OSA J. Lightwave Technol., vol. 21, no. 4, pp. 884-892, April 2003.
6. H. Luo, L. Li, H. Yu and S. Wang, "Achieving shared protection for dynamic multicast sessions in survivable mesh WDM networks", IEEE J. on Sel. Area in Commun., Vol. 25, No. 9, Dec. 2007.
7. N. K. Singhal, C. Ou, and B. Mukherjee, "Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks,"Computer Networks., vol. 50, no. 2, pp. 200-206, 2006.
8. F. Zhang, W. Zhong, and Y. Jin, "Optimizations of p-Cycle-based protection of optical multicast sessions," J. Lightwave Technol, vol. 26, No. 19, Oct. 2008.
9. R. Koetter, M. Medard, "An Algebraic Approach to Network Coding", IEEE/ACM Trans. on Netw., Vol. 11, No. 5, Oct. 2003.
10. S. L. Hakimi, "Steiners problem in graphs and its implications," Networks, vol. 1, no. 2, pp. 113-133, 1971.
11. H. Takahashi and A. Matsuyama, "An Approximate Solution for the Steiner Problem in Graphs", Mathematica Japonica 6 (1980), 573-577.
12. L. Kou, G. Markowsky and L. Berman, "A fast algorithm for Steiner trees". Acta Informatica 15 (1981), pp. 141-145.
13. T. H. Corman, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," 2nd ed. Cambridge, MA: MIT Press, 2001.
14. S. Thorpe, G. Edwards, and D. Stevenson, "Using Just-in-Time to Enable Optical Networking for Grids", Proc. IEEE Broadnets Workshop, Oct. 2004.
15. S. Baroni, "Routing and wavelength allocation in WDM optical networks", PhD Thesis, University College London, May 1998, pp. 118.