메뉴 건너뛰기




Volumn , Issue , 2003, Pages 15-22

Comparing restoration concepts using optimal network configurations with integrated hardware and routing decisions

Author keywords

Add drop multiplexers; Algorithm design and analysis; Cost function; Hardware; Mathematical model; Protection; Routing; Telecommunication network topology; Telecommunication traffic; World Wide Web

Indexed keywords

COMPUTER HARDWARE; COST BENEFIT ANALYSIS; COST FUNCTIONS; COSTS; DESIGN; FUNCTIONS; HARDWARE; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; RESTORATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; TOPOLOGY; WORLD WIDE WEB;

EID: 84882048866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DRCN.2003.1275333     Document Type: Conference Paper
Times cited : (4)

References (17)
  • 5
    • 0031352890 scopus 로고    scopus 로고
    • Restoration strategies and spare capacity requirements in self-healing ATM networks
    • Y. Xiong, L. Mason: "Restoration strategies and spare capacity requirements in self-healing ATM networks," IEEE Infocom '97, pp. 353-360, 1997.
    • (1997) IEEE Infocom '97 , pp. 353-360
    • Xiong, Y.1    Mason, L.2
  • 7
    • 0032097259 scopus 로고    scopus 로고
    • Optimal capacity placement for path restoration in STM or ATM mesh survivable networks
    • R. Iraschko, M. MacGregor, W.D. Grover: "Optimal capacity placement for path restoration in STM or ATM mesh survivable networks," IEEE/ACM Transactions on Networking vol. 6, no. 3, pp. 325-336, 1998.
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.3 , pp. 325-336
    • Iraschko, R.1    MacGregor, M.2    Grover, W.D.3
  • 9
    • 21344488548 scopus 로고
    • A polyhedral approach to multicommodity survivable network design
    • ZIB-Report
    • G. Dahl and M. Stoer: "A polyhedral approach to multicommodity survivable network design," Numerische Mathematik 68(1) pp. 149-167, ZIB-Report SC-93-09, www.zib.de, 1993.
    • (1993) Numerische Mathematik , vol.68 , Issue.1 , pp. 149-167
    • Dahl, G.1    Stoer, M.2
  • 11
    • 77956963178 scopus 로고
    • Optimum synthesis of a network with non-simultaneous MCF requirements
    • P. Hansen (ed.), North Holland Publishing Company
    • M. Minoux: "Optimum synthesis of a network with non-simultaneous MCF requirements," Studies on Graphs and Discrete Programming, P. Hansen (ed.), pp. 269-277. North Holland Publishing Company 1981.
    • (1981) Studies on Graphs and Discrete Programming , pp. 269-277
    • Minoux, M.1
  • 13
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • J. Benders: "Partitioning procedures for solving mixed-variables programming problems," Numerische Mathematik 4(1): pp. 238-252, 1962.
    • (1962) Numerische Mathematik , vol.4 , Issue.1 , pp. 238-252
    • Benders, J.1
  • 14
    • 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 Review no. 33, pp. 60-100, 1991.
    • (1991) SIAM Review , Issue.33 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 15
    • 0001615533 scopus 로고
    • Valid inequalities for 0/1 knapsacks and MIPs with Generalised Upper Bound constraints
    • L.A. Wolsey: "Valid inequalities for 0/1 knapsacks and MIPs with Generalised Upper Bound constraints," Discrete Applied Mathematics no. 29, pp. 251-261, 1990.
    • (1990) Discrete Applied Mathematics , Issue.29 , pp. 251-261
    • Wolsey, L.A.1
  • 17
    • 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, 13(3):129-135, 1971.
    • (1971) Journal of the Operations Research Society of Japan , vol.13 , Issue.3 , pp. 129-135
    • Iri, M.1


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