메뉴 건너뛰기




Volumn , Issue , 2008, Pages 5246-5251

Traffic grooming and delay constrained multicast routing in IP over WDM networks

Author keywords

Delay constrained multicast routing; Ip over WDM; Lagrangean relaxation; RWA; Traffic grooming

Indexed keywords

FIBER OPTIC NETWORKS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; HOUSING; INTEGER PROGRAMMING; INTERNET PROTOCOLS; METAL VAPOR LAMPS; MULTICASTING; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; WAVELENGTH DIVISION MULTIPLEXING;

EID: 51249100231     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2008.985     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 1
    • 0033078487 scopus 로고    scopus 로고
    • Light-Trees: Optical multicasting for improved performance in wavelength routing networks
    • Feb
    • L. H. Sahasrabuddhe and B. Mukherjee, "Light-Trees: optical multicasting for improved performance in wavelength routing networks," IEEE Comm. Mag., pp. 67-73, Feb. 1999.
    • (1999) IEEE Comm. Mag , pp. 67-73
    • Sahasrabuddhe, L.H.1    Mukherjee, B.2
  • 2
    • 33645910526 scopus 로고    scopus 로고
    • Design and Provisioning of WDM Networks with Multicast Traffic Grooming
    • April
    • R. Ul-Mustafa and A. E. Kamal, "Design and Provisioning of WDM Networks with Multicast Traffic Grooming," IEEE J. Select. Areas Commun., vol. 24, no. 4, pp. 37-53, April 2006.
    • (2006) IEEE J. Select. Areas Commun , vol.24 , Issue.4 , pp. 37-53
    • Ul-Mustafa, R.1    Kamal, A.E.2
  • 3
    • 33645916728 scopus 로고    scopus 로고
    • Traffic Grooming in Path, Star and Tree Networks: Complexity, Bounds, and Algorithms
    • Apr
    • S. Huang, R. Dutta and G. N. Rouskas, "Traffic Grooming in Path, Star and Tree Networks: Complexity, Bounds, and Algorithms," IEEE J. Select. Areas Commun., vol. 24, no. 4, pp. 66-82, Apr. 2006.
    • (2006) IEEE J. Select. Areas Commun , vol.24 , Issue.4 , pp. 66-82
    • Huang, S.1    Dutta, R.2    Rouskas, G.N.3
  • 4
    • 6944240954 scopus 로고    scopus 로고
    • Traffic Grooming, Routing and Wavelength Assignment in Optical WDM Mesh Networks
    • J.Q. Hu and B. Leida, "Traffic Grooming, Routing and Wavelength Assignment in Optical WDM Mesh Networks", IEEE INFOCOM, 2004.
    • (2004) IEEE INFOCOM
    • Hu, J.Q.1    Leida, B.2
  • 5
    • 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, vol. 24, no. 6, pp. 573-577, 1980.
    • (1980) Math. Japonica , vol.24 , Issue.6 , pp. 573-577
    • Takahashi, H.1    Matsuyama, A.2
  • 6
    • 0032139255 scopus 로고    scopus 로고
    • An Iterative Algorithm for Delay-constrained Minimum-cost Multicasting
    • Aug
    • M. Parsa, Q. Zhu and J. J. Garcia-Luna-Aceves, "An Iterative Algorithm for Delay-constrained Minimum-cost Multicasting," IEEE/ACM Trans. Networking, vol. 6, pp. 461-474, Aug. 1998.
    • (1998) IEEE/ACM Trans. Networking , vol.6 , pp. 461-474
    • Parsa, M.1    Zhu, Q.2    Garcia-Luna-Aceves, J.J.3
  • 8
    • 9744285046 scopus 로고    scopus 로고
    • A Lagrangean Relaxation-Based Approach for Routing and Wavelength Assignment in Multigranularity Optical WDM Networks
    • Nov
    • S. Lee, M. Yuang, P. Tien, and S. Lin, "A Lagrangean Relaxation-Based Approach for Routing and Wavelength Assignment in Multigranularity Optical WDM Networks," IEEE J. Select. Areas Commun, vol.22, no.9, pp. 1741-1751, Nov. 2004.
    • (2004) IEEE J. Select. Areas Commun , vol.22 , Issue.9 , pp. 1741-1751
    • Lee, S.1    Yuang, M.2    Tien, P.3    Lin, S.4


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