메뉴 건너뛰기




Volumn 110, Issue 1, 1998, Pages 63-75

Economic spare capacity planning for DCS mesh-restorable networks

Author keywords

Branch and cut; Integer programming; Spare channel assignment

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL METHODS; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTICAL COMMUNICATION; OPTICAL LINKS; TELECOMMUNICATION TRAFFIC;

EID: 0032189392     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00199-9     Document Type: Article
Times cited : (2)

References (18)
  • 1
    • 0026237664 scopus 로고
    • Using distributed topology update and preplanned configurations to achieve trunk network survivability
    • B.A. Coan, W.E. Leland, M.P. Vecchi, A. Weinrib, L.T. Wu, Using distributed topology update and preplanned configurations to achieve trunk network survivability, IEEE Trans. Reliability 40 (1991) 404-416.
    • (1991) IEEE Trans. Reliability , vol.40 , pp. 404-416
    • Coan, B.A.1    Leland, W.E.2    Vecchi, M.P.3    Weinrib, A.4    Wu, L.T.5
  • 7
    • 0027261776 scopus 로고
    • Two strategies for spare capacity placement in mesh restorable networks
    • B.D. Venables, W.D. Grover, M.H. MacGregor, Two strategies for spare capacity placement in mesh restorable networks, ICC (1993) 267-271.
    • (1993) ICC , pp. 267-271
    • Venables, B.D.1    Grover, W.D.2    Macgregor, M.H.3
  • 12
    • 0026365213 scopus 로고
    • A multi-layered model for survivability in intra-LATA transport networks
    • R.D. Doverspike, A multi-layered model for survivability in intra-LATA transport networks, Proceedings of IEEE Globecom '94, 1994, pp. 2025-2031.
    • (1994) Proceedings of IEEE Globecom '94 , pp. 2025-2031
    • Doverspike, R.D.1
  • 14
    • 21344488548 scopus 로고
    • A polyhedral approach to multicommodity survivable network design
    • M. Stoer, G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik 68 (1994) 149-167.
    • (1994) Numerische Mathematik , vol.68 , pp. 149-167
    • Stoer, M.1    Dahl, G.2
  • 15
    • 0001258594 scopus 로고
    • Modeling and solving the two facility capacitated network loading problem
    • T.L. Magnanti, P. Mirchandani, R. Vachani, Modeling and solving the two facility capacitated network loading problem, Oper. Res. 43 (1995) 142-157.
    • (1995) Oper. Res. , vol.43 , pp. 142-157
    • Magnanti, T.L.1    Mirchandani, P.2    Vachani, R.3
  • 16
    • 0026124209 scopus 로고
    • A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • M. Padberg, G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev. 33 (1991) 60-100.
    • (1991) SIAM Rev. , vol.33 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2


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