메뉴 건너뛰기




Volumn , Issue , 2004, Pages 199-204

IMSH: An iterative heuristic for SRLG diverse routing in WDM mesh networks

Author keywords

Dedicated and Shared Protection; Least Cost SRLG Diverse Routing (LC SDR); Shared Risk Link Group (SRLG); WDM Networks

Indexed keywords

HEURISTIC METHODS; OPTICAL COMMUNICATION; OPTICAL FIBERS; POLYNOMIALS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

EID: 17444415738     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (33)

References (15)
  • 1
    • 0038059231 scopus 로고    scopus 로고
    • Diverse routing in optical mesh networks
    • J. Q. Hu, "Diverse Routing in Optical Mesh Networks", IEEE Transactions on Communications, Vol. 51, No. 3, pp.489-494 2003.
    • (2003) IEEE Transactions on Communications , vol.51 , Issue.3 , pp. 489-494
    • Hu, J.Q.1
  • 2
    • 17444413611 scopus 로고    scopus 로고
    • State-of-the-art progress in developing survivable routing in optical metropolitan area networks
    • Pin-Han Ho, "State-of-the-Art Progress in Developing Survivable Routing in Optical Metropolitan Area Networks," IEEE Communications Surveys and Tutorials.
    • IEEE Communications Surveys and Tutorials
    • Ho, P.-H.1
  • 3
    • 0035249056 scopus 로고    scopus 로고
    • Issues for routing in the optical layer
    • Feb
    • J. Strand, A. L. Chiu, and R. Tkach, "Issues for Routing in the Optical Layer," IEEE Communications Magazine vol. 39, issue. 2, pp. 81-87, Feb 2001.
    • (2001) IEEE Communications Magazine , vol.39 , Issue.2 , pp. 81-87
    • Strand, J.1    Chiu, A.L.2    Tkach, R.3
  • 4
    • 0021441708 scopus 로고
    • A quick method for finding shortest pair of disjoint paths
    • J. W. Suurballe and R. E. Tarjan, "A Quick Method for Finding Shortest pair of Disjoint Paths," Networks, vol. 14, no. 2, pp. 325-336, 1984.
    • (1984) Networks , vol.14 , Issue.2 , pp. 325-336
    • Suurballe, J.W.1    Tarjan, R.E.2
  • 6
    • 0038664328 scopus 로고    scopus 로고
    • Path-protection Routing and Wavelength Assignment (RWA) in WDM mesh networks under duct layer constraints
    • April
    • H. Zang, C. (Sam) Ou, and B. Mukherjee, "Path-Protection Routing and Wavelength Assignment (RWA) in WDM Mesh Networks Under Duct Layer Constraints," IEEE/ACM Transactions on Networking, vol. 11, no. 2, April 2003.
    • (2003) IEEE/ACM Transactions on Networking , vol.11 , Issue.2
    • Zang, H.1    Ou, C.2    Mukherjee, B.3
  • 9
    • 3142783581 scopus 로고    scopus 로고
    • On achieving optimal survivable routing for shared protection in survivable next-generation internet
    • accepted
    • P-H. Ho, J. Tapolcai, and H. T. Mouftah, "On Achieving Optimal Survivable Routing for Shared Protection in Survivable Next-Generation Internet," IEEE Transaction on Reliability (accepted).
    • IEEE Transaction on Reliability
    • Ho, P.-H.1    Tapolcai, J.2    Mouftah, H.T.3
  • 10
    • 0035167780 scopus 로고    scopus 로고
    • Fiber span failure protection in mesh optical networks
    • OptiComm 2001: Optical Networking and Communications
    • G. Li, R. Doverspike, and C. Kalmanel, "Fiber Span Failure Protection in Mesh Optical Networks", in OptiComm 2001: Optical Networking and Communications, Proc. SPIE, Vol. 4599, pp. 130-142, 2001.
    • (2001) Proc. SPIE , vol.4599 , pp. 130-142
    • Li, G.1    Doverspike, R.2    Kalmanel, C.3
  • 12
    • 1242307773 scopus 로고    scopus 로고
    • Shared Risk Link Group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: Formulation and solution approaches
    • Dallas, TX, Oct.
    • L. Shen, X. Yang and B. Ramamurthy, "Shared Risk Link Group (SRLG)-Diverse Path Provisioning under Hybrid Service Level Agreements in Wavelength-Routed Optical Mesh Networks: Formulation and Solution Approaches," SPIE OptiComm 2003, Dallas, TX, Oct. 2003
    • (2003) SPIE OptiComm 2003
    • Shen, L.1    Yang, X.2    Ramamurthy, B.3
  • 15
    • 0000663732 scopus 로고
    • Finding the k shortest loop less paths in a network
    • J. Y. Yen, "Finding the k shortest loop less paths in a network," Management Science vol. 17, pp. 712-716, 1971.
    • (1971) Management Science , vol.17 , pp. 712-716
    • Yen, J.Y.1


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