메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1512-1520

A robust optimization approach to backup network design with random failures

Author keywords

[No Author keywords available]

Indexed keywords

BACKUP PATH; LARGE-SCALE NETWORK; LIMIT CAPACITY; LINK FAILURES; NETWORK DESIGN; RANDOM FAILURES; RANDOM LINK FAILURES; RESOURCE SHARING; ROBUST OPTIMIZATION; ROUTING STRATEGIES; SIMULATION RESULT;

EID: 79960879257     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934940     Document Type: Conference Paper
Times cited : (21)

References (25)
  • 1
    • 33645591228 scopus 로고    scopus 로고
    • Mesh-based survivable networks: Options and strategies for optical
    • prentice hall
    • W. Grover, Mesh-based survivable networks: options and strategies for optical, MPLS, SONET, and ATM Networking. prentice hall, 2004.
    • (2004) MPLS, SONET, and ATM Networking
    • Grover, W.1
  • 2
    • 0034454860 scopus 로고    scopus 로고
    • Capacity versus robustness: A tradeoff for link restoration in mesh networks
    • S. Lumetta et al., "Capacity versus robustness: a tradeoff for link restoration in mesh networks,"Journal of Lightwave Technology, vol. 18, no. 12, p. 1765, 2000.
    • (2000) Journal of Lightwave Technology , vol.18 , Issue.12 , pp. 1765
    • Lumetta, S.1
  • 3
    • 0003011630 scopus 로고    scopus 로고
    • Survivability in optical networks
    • D. Zhou and S. Subramaniam, "Survivability in optical networks,"IEEE network, vol. 14, no. 6, pp. 16-23, 2000.
    • (2000) IEEE Network , vol.14 , Issue.6 , pp. 16-23
    • Zhou, D.1    Subramaniam, S.2
  • 4
    • 15544375036 scopus 로고    scopus 로고
    • Approximating optimal spare capacity allocation by successive survivable routing
    • Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing,"IEEE/ACM Trans. Netw., vol. 13, no. 1, pp. 198-211, 2005.
    • (2005) IEEE/ACM Trans. Netw. , vol.13 , Issue.1 , pp. 198-211
    • Liu, Y.1    Tipper, D.2    Siripongwutikorn, P.3
  • 6
    • 2342468779 scopus 로고    scopus 로고
    • A review of fault management in wdm mesh networks: Basic concepts and research challenges
    • Mar.
    • J. Zhang and B. Mukherjee, "A review of fault management in wdm mesh networks: Basic concepts and research challenges,"IEEE Network, pp. 41-48, Mar. 2004.
    • (2004) IEEE Network , pp. 41-48
    • Zhang, J.1    Mukherjee, B.2
  • 7
    • 77953300333 scopus 로고    scopus 로고
    • Designing low-capacity backup networks for fast restoration
    • M. Banner and A. Orda, "Designing low-capacity backup networks for fast restoration,"in Proc. of INFOCOM. IEEE, 2010.
    • (2010) Proc. of INFOCOM. IEEE
    • Banner, M.1    Orda, A.2
  • 8
    • 0036346598 scopus 로고    scopus 로고
    • On double-link failure recovery in wdm optical networks
    • Citeseer
    • H. Choi, S. Subramaniam, and H. Choi, "On double-link failure recovery in wdm optical networks,"in IEEE INFOCOM, vol. 2. Citeseer, 2002, pp. 808-816.
    • (2002) IEEE INFOCOM , vol.2 , pp. 808-816
    • Choi, H.1    Subramaniam, S.2    Choi, H.3
  • 9
    • 20744460923 scopus 로고    scopus 로고
    • Segment shared protection for survivable meshed wdm optical networks
    • L. Guo, H. Yu, and L. Li, "Segment shared protection for survivable meshed wdm optical networks,"Optics communications, vol. 251, no. 4-6, pp. 328-338, 2005.
    • (2005) Optics Communications , vol.251 , Issue.4-6 , pp. 328-338
    • Guo, L.1    Yu, H.2    Li, L.3
  • 10
    • 84883884773 scopus 로고    scopus 로고
    • Surviving multiple network failures using shared backup path protection
    • B. Jozsa, D. Orincsay, and A. Kern, "Surviving multiple network failures using shared backup path protection,"in Proc. ISCC, vol. 1, 2003, pp. 1333-1340.
    • (2003) Proc. ISCC , vol.1 , pp. 1333-1340
    • Jozsa, B.1    Orincsay, D.2    Kern, A.3
  • 11
    • 0029533861 scopus 로고
    • The hop-limit approach for sparecapacity assignment in survivable networks
    • M. Herzberg, S. Bye, and A. Utano, "The hop-limit approach for sparecapacity assignment in survivable networks,"IEEE/ACM Transactions on Networking (TON), vol. 3, no. 6, p. 784, 1995.
    • (1995) IEEE/ACM Transactions on Networking (TON) , vol.3 , Issue.6 , pp. 784
    • Herzberg, M.1    Bye, S.2    Utano, A.3
  • 12
    • 2942565524 scopus 로고    scopus 로고
    • Inference of shared risk link groups. [Online]. Available
    • D. Papadimitriou et al., "Inference of shared risk link groups,"Internet Draft. [Online]. Available: http://www3.tools.ietf.org/ html/draft-manyinference-srlg-02
    • Internet Draft
    • Papadimitriou, D.1
  • 14
    • 0036577226 scopus 로고    scopus 로고
    • Survivable lightpath routing - A new approach to the design of wdm-based networks
    • May
    • E. Modiano and A. Narula-Tam, "Survivable lightpath routing - a new approach to the design of wdm-based networks,"IEEE Journal on Selected Areas in Communications, vol. 20, no. 4, pp. 800-809, May 2002.
    • (2002) IEEE Journal on Selected Areas in Communications , vol.20 , Issue.4 , pp. 800-809
    • Modiano, E.1    Narula-Tam, A.2
  • 15
    • 0036749418 scopus 로고    scopus 로고
    • A disjoint path selection scheme with shared risk link groups in gmpls networks
    • Sep.
    • E. Oki, N. Matsuura, K. Shiomoto, and N. Yamanaka, "A disjoint path selection scheme with shared risk link groups in gmpls networks,"IEEE Communications Letters, vol. 6, no. 9, pp. 406-408, Sep. 2002.
    • (2002) IEEE Communications Letters , vol.6 , Issue.9 , pp. 406-408
    • Oki, E.1    Matsuura, N.2    Shiomoto, K.3    Yamanaka, N.4
  • 16
    • 0346342622 scopus 로고    scopus 로고
    • Trap avoidance and protection schemes in networks with shared risk link groups
    • Nov.
    • D. Xu, Y. Xiong, C. Qiao, and G. Li, "Trap avoidance and protection schemes in networks with shared risk link groups,"IEEE/OSA Journal of Lightwave Technology, vol. 21, no. 11, pp. 2683-2693, Nov. 2003.
    • (2003) IEEE/OSA Journal of Lightwave Technology , vol.21 , Issue.11 , pp. 2683-2693
    • Xu, D.1    Xiong, Y.2    Qiao, C.3    Li, G.4
  • 17
    • 0010680207 scopus 로고
    • Convex programming with set-inclusive constraints and applications to inexact linear programming
    • A. Soyster, "Convex programming with set-inclusive constraints and applications to inexact linear programming,"Operations research, vol. 21, no. 5, pp. 1154-1157, 1973.
    • (1973) Operations Research , vol.21 , Issue.5 , pp. 1154-1157
    • Soyster, A.1
  • 18
    • 0032664938 scopus 로고    scopus 로고
    • Robust solutions of uncertain linear programs
    • A. Ben-Tal and A. Nemirovski, "Robust solutions of uncertain linear programs,"Operations Research Letters, vol. 25, no. 1, pp. 1-14, 1999.
    • (1999) Operations Research Letters , vol.25 , Issue.1 , pp. 1-14
    • Ben-Tal, A.1    Nemirovski, A.2
  • 21
    • 1642546937 scopus 로고    scopus 로고
    • Service provisioning to provide per-connection-based availability guarantee in wdm mesh networks
    • Atlanta, GA, Mar.
    • J. Zhang, K. Zhu, H. Zang, and B. Mukherjee, "Service provisioning to provide per-connection-based availability guarantee in wdm mesh networks,"in OFC, Atlanta, GA, Mar. 2003.
    • (2003) OFC
    • Zhang, J.1    Zhu, K.2    Zang, H.3    Mukherjee, B.4
  • 23
    • 43449102818 scopus 로고    scopus 로고
    • Topology-focused availability analysis of basic protection schemes in optical transport networks
    • J. Segovia, E. Calle, P. Vila, J. Marzo, and J. Tapolcai, "Topology-focused availability analysis of basic protection schemes in optical transport networks,"Journal of Optical Networking, vol. 7, pp. 351-364, 2008.
    • (2008) Journal of Optical Networking , vol.7 , pp. 351-364
    • Segovia, J.1    Calle, E.2    Vila, P.3    Marzo, J.4    Tapolcai, J.5
  • 24
    • 0000728412 scopus 로고
    • Optimization using simulated annealing
    • S. Brooks and B. Morgan, "Optimization using simulated annealing,"The Statistician, vol. 44, no. 2, pp. 241-257, 1995.
    • (1995) The Statistician , vol.44 , Issue.2 , pp. 241-257
    • Brooks, S.1    Morgan, B.2


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