메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1925-1933

On progressive network recovery after a major disruption

Author keywords

Disruption; Network flow; Recovery

Indexed keywords

DIFFERENT ORDER; DISRUPTION; NETWORK CAPACITY; NETWORK DESIGN; NETWORK FLOW; NUMERICAL EXPERIMENTS; OPTIMAL RECOVERY; OPTIMIZATION PROBLEMS; OTHER APPLICATIONS; RECOVERY PROCESS; RECOVERY STAGES; SOURCE-DESTINATION PAIRS;

EID: 79960851780     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934996     Document Type: Conference Paper
Times cited : (76)

References (18)
  • 2
    • 11844265913 scopus 로고    scopus 로고
    • Loopback recovery from double-link failures in optical mesh networks
    • Dec.
    • H. Choi, S. Subramaniam, and H.-A. Choi, "Loopback recovery from double-link failures in optical mesh networks", IEEE/ACM Trans. Networking, vol. 12, no. 6, pp. 1119-30, Dec. 2004.
    • (2004) IEEE/ACM Trans. Networking , vol.12 , Issue.6 , pp. 1119-30
    • Choi, H.1    Subramaniam, S.2    Choi, H.-A.3
  • 5
    • 33747606730 scopus 로고    scopus 로고
    • Dual-homing based scalable partial multicast protection
    • J. Wang, M. Yang, B. Yang, and S.Q. Zheng, "Dual-homing based scalable partial multicast protection", IEEE Transactions on Computers, vol. 55, no. 9, pp. 1130-1141, 2006.
    • (2006) IEEE Transactions on Computers , vol.55 , Issue.9 , pp. 1130-1141
    • Wang, J.1    Yang, M.2    Yang, B.3    Zheng, S.Q.4
  • 8
    • 44849134816 scopus 로고    scopus 로고
    • Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
    • Jan.
    • T. Matisziw and A. Murray, "Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure", Computer & Operations Research, vol. 36, no. 1, pp. 16-26, Jan. 2009.
    • (2009) Computer & Operations Research , vol.36 , Issue.1 , pp. 16-26
    • Matisziw, T.1    Murray, A.2
  • 9
    • 0028277131 scopus 로고
    • Contigency/diaster recovery planning for transmission systems of the defense information system network
    • D. Smith, W. Cybrowski, F. Zawislan, D. Arnstein, A. Dayton, and T. Studwell, "Contigency/diaster recovery planning for transmission systems of the defense information system network", IEEE JSAC, vol. 12, no. 1, pp. 13-22, 1994.
    • (1994) IEEE JSAC , vol.12 , Issue.1 , pp. 13-22
    • Smith, D.1    Cybrowski, W.2    Zawislan, F.3    Arnstein, D.4    Dayton, A.5    Studwell, T.6
  • 13
    • 1842660094 scopus 로고    scopus 로고
    • Supply chain coordination with demand disruptions
    • X. Qi, J.F. Bard, G. Yu, Supply chain coordination with demand disruptions, Omega, vol. 32, pp. 301-312, 2004.
    • (2004) Omega , vol.32 , pp. 301-312
    • Qi, X.1    Bard, J.F.2    Yu, G.3
  • 14
    • 33744966565 scopus 로고    scopus 로고
    • Disruption management for machine scheduling: The case of SPT schedules
    • X. Qi, J.F. Bard, G. Yu, Disruption management for machine scheduling: The case of SPT schedules, International Journal of Production Economics, vol. 103, pp. 166-184, 2006.
    • (2006) International Journal of Production Economics , vol.103 , pp. 166-184
    • Qi, X.1    Bard, J.F.2    Yu, G.3
  • 15
    • 0141764679 scopus 로고    scopus 로고
    • Shortest-path network interdiction
    • E. Israeli and R.K. Wood, "Shortest-path network interdiction", Networks, vol. 40, no. 2, pp. 97-111, 2002.
    • (2002) Networks , vol.40 , Issue.2 , pp. 97-111
    • Israeli, E.1    Wood, R.K.2
  • 16
    • 38249007197 scopus 로고
    • Deterministic network interdiction
    • R.K. Wood, "Deterministic network interdiction", Mathematical and Computer Modeling, vol. 17, no. 2, pp. 1-18, 1993.
    • (1993) Mathematical and Computer Modeling , vol.17 , Issue.2 , pp. 1-18
    • Wood, R.K.1
  • 18
    • 0030127682 scopus 로고    scopus 로고
    • Approximate max-flow min-(multi)cut theorems and their applications
    • N. Garg, V.V. Vazirani, and M. Yannakakis, "Approximate max-flow min-(multi)cut theorems and their applications", SIAM Journal on Computing, vol. 25, no. 2, pp. 235-251, 1996.
    • (1996) SIAM Journal on Computing , vol.25 , Issue.2 , pp. 235-251
    • Garg, N.1    Vazirani, V.V.2    Yannakakis, M.3


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