메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 421-428

A computational study for demand-wise shared protection

Author keywords

Demand wise shared protection; Integer linear programming; Network design; Resilience

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS;

EID: 33846285417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DRCN.2005.1563902     Document Type: Conference Paper
Times cited : (14)

References (19)
  • 3
    • 0141892328 scopus 로고    scopus 로고
    • Mesh-based Survivable Networks, Options and Strategies for Optical, MPLS, SONET and ATM Networking
    • W. D. Grover, "Mesh-based Survivable Networks, Options and Strategies for Optical, MPLS, SONET and ATM Networking," in Prentice Hall PTR, Upper Saddle River, New Jersey, U.S.A., 2003.
    • (2003) Prentice Hall PTR, Upper Saddle River, New Jersey, U.S.A
    • Grover, W.D.1
  • 4
    • 7244241839 scopus 로고    scopus 로고
    • draft-ietfbfd-base-02.txt, IETF Network Working Group, March
    • D. Katz and D. Ward, "Bidirectional Forwarding Direction," draft-ietfbfd-base-02.txt, IETF Network Working Group, March 2005.
    • (2005) Bidirectional Forwarding Direction
    • Katz, D.1    Ward, D.2
  • 9
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • J. Benders, "Partitioning procedures for solving mixed-variables programming problems," Numerische Mathematik, vol. 4, no. 1, pp. 238-252, 1962.
    • (1962) Numerische Mathematik , vol.4 , Issue.1 , pp. 238-252
    • Benders, J.1
  • 10
    • 0026124209 scopus 로고
    • A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • M. W. Padberg and G. Rinaldi, "A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems," SIAM Review, vol. 33, pp. 60-100, 1991.
    • (1991) SIAM Review , vol.33 , pp. 60-100
    • Padberg, M.W.1    Rinaldi, G.2
  • 11
    • 21344488548 scopus 로고
    • A polyhedral approach to multicommodity survivable network design
    • G. Dahl and M. Stoer, "A polyhedral approach to multicommodity survivable network design," Numerische Mathematik, vol. 68, no. 1, pp. 149-167, 1994.
    • (1994) Numerische Mathematik , vol.68 , Issue.1 , pp. 149-167
    • Dahl, G.1    Stoer, M.2
  • 12
    • 0001615533 scopus 로고
    • Valid inequalities for 0/1 knapsacks and MIPs with Generalized Upper Bound constraints
    • L. Wolsey, "Valid inequalities for 0/1 knapsacks and MIPs with Generalized Upper Bound constraints," Discrete Applied Mathematics, vol. 29, pp. 251-261, 1990.
    • (1990) Discrete Applied Mathematics , vol.29 , pp. 251-261
    • Wolsey, L.1
  • 14
    • 18244410473 scopus 로고    scopus 로고
    • Local and global restoration of node and link failures in telecommunication networks,
    • diploma thesis, Technische Universität Berlin, February, Available from
    • S. Orlowski, "Local and global restoration of node and link failures in telecommunication networks," diploma thesis, Technische Universität Berlin, February 2003. Available from http://www.zib.de/ orlowski.
    • (2003)
    • Orlowski, S.1
  • 15
    • 0001745044 scopus 로고
    • On an extension of the maximum-flow minimum-cut theorem to multicommodity flows
    • M. Iri, "On an extension of the maximum-flow minimum-cut theorem to multicommodity flows," Journal of the Operations Research Society of Japan, vol. 13, no. 3, pp. 129-135, 1971.
    • (1971) Journal of the Operations Research Society of Japan , vol.13 , Issue.3 , pp. 129-135
    • Iri, M.1
  • 16
    • 18244408797 scopus 로고    scopus 로고
    • Comparing restoration concepts using optima) network configurations with integrated hardware and routing decisions
    • March
    • S. Orlowski and R. Wessäly, "Comparing restoration concepts using optima) network configurations with integrated hardware and routing decisions," Journal of Network and System Management, vol. 13, pp. 99-118, March 2005.
    • (2005) Journal of Network and System Management , vol.13 , pp. 99-118
    • Orlowski, S.1    Wessäly, R.2
  • 17
    • 33846324594 scopus 로고    scopus 로고
    • CPLEX Version 9.1
    • "CPLEX Version 9.1," http://www.ilog.com.
  • 19
    • 33846279231 scopus 로고    scopus 로고
    • Survivable network design data library
    • "Survivable network design data library." http://sndlib.zib.de.


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