메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 399-404

A comparative study of restoration schemes and spare capacity assignments in mesh networks

Author keywords

Computational efficiency; Computer networks; Computer science; Costs; Intelligent networks; Mesh networks; Power generation economics; Scalability; Telecommunication network topology; Telecommunication traffic

Indexed keywords

COMPUTATIONAL EFFICIENCY; COMPUTER GRAPHICS; COMPUTER NETWORKS; COMPUTER SCIENCE; COST BENEFIT ANALYSIS; COSTS; INTELLIGENT NETWORKS; MESH GENERATION; RESTORATION; SCALABILITY; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

EID: 33749384357     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2003.1284200     Document Type: Conference Paper
Times cited : (9)

References (24)
  • 3
    • 0032679135 scopus 로고    scopus 로고
    • Restoration strategies and spare capacity requirements in self-healing ATM networks
    • Feb.
    • Y. Xiong and L. G. Mason, "Restoration strategies and spare capacity requirements in self-healing ATM networks," IEEE/ACM Transactions on Networking, vol. 7, no. 1, pp. 98-110, Feb. 1999.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.1 , pp. 98-110
    • Xiong, Y.1    Mason, L.G.2
  • 8
    • 0029214372 scopus 로고
    • Joint optimization of capacity and flow assignment for self-healing ATM networks
    • Seattle, June
    • K. Murakami and H. S. Kim, "Joint optimization of capacity and flow assignment for self-healing ATM networks," in Proc. of IEEE International Conference on Communications, vol. 1, Seattle, June 1995, pp. 216-220.
    • (1995) Proc. of IEEE International Conference on Communications , vol.1 , pp. 216-220
    • Murakami, K.1    Kim, H.S.2
  • 10
    • 0030703516 scopus 로고    scopus 로고
    • Spare capacity assignment for different restoration strategies in mesh survivable networks
    • Montreal, June
    • B. V. Caenegem, N. Wauters, and P. M. Demeester, "Spare capacity assignment for different restoration strategies in mesh survivable networks," in Proc. of IEEE International Conference on Communications, vol. 1, Montreal, June 1997, pp. 288-292.
    • (1997) Proc. of IEEE International Conference on Communications , vol.1 , pp. 288-292
    • Caenegem, B.V.1    Wauters, N.2    Demeester, P.M.3
  • 11
    • 0001488083 scopus 로고
    • On the complexity of timetable and multi-commodity flow problems
    • S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multi-commodity flow problems," SIAM Journal of Computing, vol. 5, no. 4, pp. 691-703, 1976.
    • (1976) SIAM Journal of Computing , vol.5 , Issue.4 , pp. 691-703
    • Even, S.1    Itai, A.2    Shamir, A.3
  • 13
    • 0000703001 scopus 로고
    • Multi-commodity network flows
    • May/June
    • T. C. Hu, "Multi-commodity network flows," Operations Research, vol. 11, pp. 344-360, May/June 1963.
    • (1963) Operations Research , vol.11 , pp. 344-360
    • Hu, T.C.1
  • 14
    • 0029533861 scopus 로고
    • The hop-limit approach for spare-capacity assignment in survivable networks
    • Dec.
    • M. Herzberg, S. J. Bye, and A. Utano, "The hop-limit approach for spare-capacity assignment in survivable networks," IEEE/ACM Transactions on Networking, vol. 3, no. 6, pp. 775-784, Dec. 1995.
    • (1995) IEEE/ACM Transactions on Networking , vol.3 , Issue.6 , pp. 775-784
    • Herzberg, M.1    Bye, S.J.2    Utano, A.3
  • 15
    • 0013039914 scopus 로고    scopus 로고
    • Optimal resource allocation for path restoration in mesh-type self-healing networks
    • Washington, D. C., June
    • M. Herzberg, D. Wells, and A. Herschtal, "Optimal resource allocation for path restoration in mesh-type self-healing networks," in Proc. of 15th International Teletraffic Congress, vol. 15, Washington, D.C., June 1997, pp. 351-360.
    • (1997) Proc. of 15th International Teletraffic Congress , vol.15 , pp. 351-360
    • Herzberg, M.1    Wells, D.2    Herschtal, A.3
  • 16
    • 0032097259 scopus 로고    scopus 로고
    • Optimal capacity placement for path restoration in STM or ATM mesh survivable networks
    • June
    • R. R. Iraschko, M. H. MacGregor, and 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, June 1998.
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.3 , pp. 325-336
    • Iraschko, R.R.1    MacGregor, M.H.2    Grover, W.D.3
  • 17
    • 0034475392 scopus 로고    scopus 로고
    • Fault restoration and spare capacity allocation with QoS constraints for MPLS networks
    • San Francisco, Nov.
    • T. H. Oh, T. M. Chen, and J. L. Kennington, "Fault restoration and spare capacity allocation with QoS constraints for MPLS networks," in Proc. of IEEE Global Communications Conference, San Francisco, Nov. 2000, pp. 1731-1735.
    • (2000) Proc. of IEEE Global Communications Conference , pp. 1731-1735
    • Oh, T.H.1    Chen, T.M.2    Kennington, J.L.3
  • 18
    • 0034821462 scopus 로고    scopus 로고
    • Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs
    • Anaheim, Mar.
    • J. Doucette, W. D. Grover, and T. Bach, "Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs," in Proc. of Optical Fiber Communications Conference, vol. 2, Anaheim, Mar. 2001, pp. TuG2-T1-3.
    • (2001) Proc. of Optical Fiber Communications Conference , vol.2 , pp. TuG2-T13
    • Doucette, J.1    Grover, W.D.2    Bach, T.3
  • 19
    • 23044519733 scopus 로고    scopus 로고
    • Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing
    • D. Medhi and D. Tipper, "Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing," Telecommunication Systems, vol. 13, no. 2, pp. 269-291, 2000.
    • (2000) Telecommunication Systems , vol.13 , Issue.2 , pp. 269-291
    • Medhi, D.1    Tipper, D.2
  • 20
    • 0035000852 scopus 로고    scopus 로고
    • Approximating optimal spare capacity allocation by successive survivable routing
    • Anchorage, Apr.
    • Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. of IEEE INFOCOM, vol. 2, Anchorage, Apr. 2001, pp. 699-708.
    • (2001) Proc. of IEEE INFOCOM , vol.2 , pp. 699-708
    • Liu, Y.1    Tipper, D.2    Siripongwutikorn, P.3
  • 21
    • 0031164504 scopus 로고    scopus 로고
    • Optimal spare capacity preconfiguration for faster restoration of mesh networks
    • June
    • M. H. MacGregor, W. D. Grover, and K. Ryhorchuk, "Optimal spare capacity preconfiguration for faster restoration of mesh networks," Journal of Network and System Management, vol. 5, no. 2, pp. 159- 171, June 1997.
    • (1997) Journal of Network and System Management , vol.5 , Issue.2 , pp. 159-171
    • MacGregor, M.H.1    Grover, W.D.2    Ryhorchuk, K.3
  • 22
    • 0031373078 scopus 로고    scopus 로고
    • Comparative study on restoration schemes of survivable ATM networks
    • Kobe, Japan, Apr.
    • K. Murakami and H. S. Kim, "Comparative study on restoration schemes of survivable ATM networks," in Proc. of INFOCOM '97, vol. 1, Kobe, Japan, Apr. 1997, pp. 345-352.
    • (1997) Proc. of INFOCOM '97 , vol.1 , pp. 345-352
    • Murakami, K.1    Kim, H.S.2
  • 24
    • 84952338830 scopus 로고    scopus 로고
    • Using the CPLEX callable library, ILOG Inc., Incline Village, NV, 1997
    • Using the CPLEX callable library, ILOG Inc., Incline Village, NV, 1997.


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