메뉴 건너뛰기




Volumn 2001-January, Issue , 2001, Pages 61-66

Issues on diverse routing for WDM mesh networks with survivability

Author keywords

Cost function; Heuristic algorithms; IP networks; Mesh networks; Protection; Routing; Spine; Wavelength division multiplexing; WDM networks; Web and internet services

Indexed keywords

COMPUTER GRAPHICS; COST FUNCTIONS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTERNET; INTERNET PROTOCOLS; MESH GENERATION; NETWORK PERFORMANCE; NETWORK ROUTING; OPTIMIZATION; ROUTERS; TELECOMMUNICATION NETWORKS; WAVELENGTH DIVISION MULTIPLEXING; WIRELESS MESH NETWORKS (WMN);

EID: 84871132130     PISSN: 10952055     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICCCN.2001.956220     Document Type: Article
Times cited : (23)

References (16)
  • 6
    • 84950244163 scopus 로고    scopus 로고
    • A New Path Computation Approach in Survivable WDM Optical Networks
    • Chunsheng Xin, Yinghua ye, Sudhir Dixit, and Chunming Qiao, "A New Path Computation Approach in Survivable WDM Optical Networks", ICC'01.
    • ICC'01
    • Xin, C.1    Ye, Y.2    Dixit, S.3    Qiao, C.4
  • 9
    • 85013905744 scopus 로고    scopus 로고
    • Approaches for solving asymmetrically weighted optimal or near-optimal disjoint path-pair for the survivable optical networks
    • submitted
    • Janos Tapolcai, Peter Laborczi, Pin-Han Ho, Tibor Cinkler, Andras Recski, and Hussein T. Mouftah, "Approaches for solving asymmetrically weighted optimal or near-optimal disjoint path-pair for the survivable optical networks", submitted to Globecom 2001.
    • Globecom 2001
    • Tapolcai, J.1    Laborczi, P.2    Ho, P.-H.3    Cinkler, T.4    Recski, A.5    Mouftah, H.T.6
  • 10
    • 84950246017 scopus 로고    scopus 로고
    • Design & Efficiency
    • the Benjamin/Cummings Publishing Company, Inc.
    • B. M. E. Moret and H. D. Shapiro, Algorithms from P to NP Volume I Design & Efficiency, the Benjamin/Cummings Publishing Company, Inc.
    • Algorithms from P to NP , vol.1
    • Moret, B.M.E.1    Shapiro, H.D.2
  • 11
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • Yen JY. Finding the k shortest loopless paths in a network. Management Science 1971; 17:712-716.
    • (1971) Management Science , vol.17 , pp. 712-716
    • Yen, J.Y.1
  • 13
    • 0003260870 scopus 로고    scopus 로고
    • Network Planning Algorithms for the Optical Internet based on the Generalized MPLS Architecture
    • submitted
    • Pin-Han Ho and H. T. Mouftah, "Network Planning Algorithms for the Optical Internet based on the Generalized MPLS Architecture", submitted to Globecom'01.
    • Globecom'01
    • Ho, P.-H.1    Mouftah, H.T.2
  • 14
    • 0003011630 scopus 로고    scopus 로고
    • Survivability in Optical Networks
    • November/December
    • Dongyun Zhou and Suresh Subramaniam, "Survivability in Optical Networks", IEEE Network, November/December 2000.
    • (2000) IEEE Network
    • Zhou, D.1    Subramaniam, S.2
  • 15
    • 0000685484 scopus 로고
    • A procedure for computing the k best solution to discrete optimization problems and its application to the shortest path problem
    • Lawler EL. "A procedure for computing the k best solution to discrete optimization problems and its application to the shortest path problem". Management science, Theory Series 1972; 18:401-405.
    • (1972) Management Science, Theory Series , vol.18 , pp. 401-405
    • Lawler, E.L.1
  • 16
    • 0033890514 scopus 로고    scopus 로고
    • Routing Dependable Connections with Specified Failure Restoration Guarantees in WDM Networks
    • G. Mohan and Arun K. Somani, "Routing Dependable Connections with Specified Failure Restoration Guarantees in WDM Networks", Infocom 2000.
    • Infocom 2000
    • Mohan, G.1    Somani, A.K.2


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