메뉴 건너뛰기




Volumn 19, Issue 26, 2011, Pages B471-B477

A novel multicast routing algorithm and its application for protection against single-link and single-link/node failure scenarios in optical WDM mesh networks

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKING PROBABILITY; HEURISTIC ALGORITHMS; MULTICASTING; NETWORK ROUTING; TREES (MATHEMATICS); WIRELESS MESH NETWORKS (WMN);

EID: 83455188324     PISSN: None     EISSN: 10944087     Source Type: Journal    
DOI: 10.1364/OE.19.00B471     Document Type: Article
Times cited : (8)

References (8)
  • 1
    • 84944291613 scopus 로고
    • Multiwavelength lightwave networks for computer communication
    • R. Ramaswami, “Multiwavelength lightwave networks for computer communication, ” IEEE Commun. Mag. 31(2), 78-88(1993).
    • (1993) IEEE Commun. Mag , vol.31 , Issue.2 , pp. 78-88
    • Ramaswami, R.1
  • 3
    • 0033078487 scopus 로고    scopus 로고
    • Light-trees: Optical multicasting for improved performance in wavelength-routed networks
    • L. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks, ” IEEE Commun. Mag. 37(2), 67-73 (1999).
    • (1999) IEEE Commun. Mag. , vol.37 , Issue.2 , pp. 67-73
    • Sahasrabuddhe, L.1    Mukherjee, B.2
  • 4
    • 0003898182 scopus 로고
    • Reducibility among combinatorial problems: Complexity of computer computations
    • Chap. 8 in, R. E. Miller and J. W. Thatcher, eds. (Plenum Press
    • R. M. Karp, “Reducibility among combinatorial problems: Complexity of computer computations, ” Chap. 8 in 50 Years of Integer Programming 1958—2008, R. E. Miller and J. W. Thatcher, eds. (Plenum Press, 1972).
    • (1972) 50 Years of Integer Programming 1958—2008
    • Karp, R.M.1
  • 5
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. C. Prim, “Shortest connection networks and some generalizations, ” Bell Syst. Tech. J. 36, 1389-1401 (1957).
    • (1957) Bell Syst. Tech. J. , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 6
    • 0000133156 scopus 로고
    • An approximate solution for the Steiner problem in graphs
    • H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs, ” Math. Japonica 24(6), 573-577(1980).
    • (1980) Math. Japonica , vol.24 , Issue.6 , pp. 573-577
    • Takahashi, H.1    Matsuyama, A.2
  • 7
    • 0346972539 scopus 로고    scopus 로고
    • Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks
    • N. Singhal, L. H. Sahasrabuddhe, and B. Mukherjee, “Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks, ” J. Lightwave Technol. 21(11), 2587-2594 (2003).
    • (2003) J. Lightwave Technol. , vol.21 , Issue.11 , pp. 2587-2594
    • Singhal, N.1    Sahasrabuddhe, L.H.2    Mukherjee, B.3
  • 8
    • 82155201683 scopus 로고    scopus 로고
    • A novel technique for survivable multicast routing in optical WDM mesh networks
    • Geneva, Switzerland, Sept
    • C. K. Constantinou and G. Ellinas, “A novel technique for survivable multicast routing in optical WDM mesh networks, ” Proc. European Conf. On Optical Communications (ECOC), Geneva, Switzerland, Sept. 2011.
    • (2011) Proc. European Conf. On Optical Communications (ECOC)
    • Constantinou, C.K.1    Ellinas, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.