메뉴 건너뛰기




Volumn , Issue , 2005, Pages 250-254

A compact mathematical formulation for shared path protection with general shared risk groups

Author keywords

Least cost survivable routing; Shared protection; Shared Risk Group (SRG)

Indexed keywords

BANDWIDTH; GRAPH THEORY; PROBLEM SOLVING; ROUTERS; TOPOLOGY;

EID: 28344442947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (7)
  • 2
    • 0035000852 scopus 로고    scopus 로고
    • Approximating optimal spare capacity allocation by successive survivable routing
    • Anchorage, Alaska
    • Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proceedings IEEE INFOCOM (Anchorage, Alaska), 2001, pp. 699-708.
    • (2001) Proceedings IEEE INFOCOM , pp. 699-708
    • Liu, Y.1    Tipper, D.2    Siripongwutikorn, P.3
  • 4
    • 28344450791 scopus 로고    scopus 로고
    • Stalled Information Based Routing in Multi-domain Multilayer Networks
    • submitted
    • J. Szigeti, J. Tapolcai, T. Cinkler, T. Henk, Gy. Sallai, "Stalled Information Based Routing in Multi-domain Multilayer Networks", submitted to ONDM 2005
    • ONDM 2005
    • Szigeti, J.1    Tapolcai, J.2    Cinkler, T.3    Henk, T.4    Sallai, G.5
  • 5
    • 0033884540 scopus 로고    scopus 로고
    • Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks
    • Tel-Aviv, Israel, March
    • T. Cinkler, D. Marx, C. P. Larsen, D.Fogaras, "Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks", IEEE INFOCOM, Tel-Aviv, Israel, pp. 1000-1009 March 2000
    • (2000) IEEE INFOCOM , pp. 1000-1009
    • Cinkler, T.1    Marx, D.2    Larsen, C.P.3    Fogaras, D.4
  • 7
    • 84976859871 scopus 로고
    • Finding two disjoint paths between two pairs of vertices in a graph
    • MR 58 #8474
    • Y. Perl and Y. Shiloach, "Finding two disjoint paths between two pairs of vertices in a graph," J. Assoc. Comput. Mach. 25 (1978), no. 1, 1-9. MR 58 #8474
    • (1978) J. Assoc. Comput. Mach. , vol.25 , Issue.1 , pp. 1-9
    • Perl, Y.1    Shiloach, Y.2


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