메뉴 건너뛰기




Volumn 3, Issue 2, 1996, Pages 187-195

Optimal routing designs in self-healing communications networks

Author keywords

Multi commodity network flows; Optimal routing design; Reliable communications networks

Indexed keywords


EID: 0000138054     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1996.tb00045.x     Document Type: Article
Times cited : (13)

References (11)
  • 1
    • 85040397995 scopus 로고
    • Robust design of dynamic routing networks
    • F.Roberts, et al. (Eds). DIMACS Workshop Dec. 1989, AMS-ACM
    • Ash, G., (1991). Robust design of dynamic routing networks. In Reliability of Computer and Communication Networks, F.Roberts et al. (Eds). DIMACS Workshop Dec. 1989. AMS-ACM.
    • (1991) Reliability of Computer and Communication Networks
    • Ash, G.1
  • 2
    • 0019623559 scopus 로고
    • Design and optimization of networks with dynamic routing
    • Ash, G., Cardwell, R., & Murray, R., (1981). Design and optimization of networks with dynamic routing. Bell Sys. Tech. Jour., Vol. 60.
    • (1981) Bell Sys. Tech. Jour. , vol.60
    • Ash, G.1    Cardwell, R.2
  • 3
    • 0024751277 scopus 로고
    • Computer aided design procedures for survivable fiber optic networks
    • Cardwell, R., Monma, C., & Wu, T., (1989). Computer aided design procedures for survivable fiber optic networks. IEEE Select. Areas Commun., Vol. 7.
    • (1989) IEEE Select. Areas Commun. , vol.7
    • Cardwell, R.1    Monma, C.2
  • 5
    • 0010463119 scopus 로고
    • An application of generalized linear programming to network flows
    • Gomory, R., & Hu, T., (1962). An application of generalized linear programming to network flows. Journal of SIAM, Vol. 10, No. 2.
    • (1962) Journal of SIAM , vol.10 , Issue.2
    • Gomory, R.1
  • 7
    • 84977292629 scopus 로고
    • Solving large telecommunications network loading problems
    • Lee, D., Medhi, K., Strand, J., Cox, R.G., & Chen, S., (1989). Solving large telecommunications network loading problems. AT&T Technical Journal, Vol. 68, No. 3.
    • (1989) AT&T Technical Journal , vol.68 , Issue.3
    • Lee, D.1    Medhi, K.2    Strand, J.3    Cox, R.G.4
  • 8
    • 0024701993 scopus 로고
    • Methods for designing communication networks with certain two-connected survivability constraints
    • Monma, C., & Shallcross, D., (1989). Methods for designing communication networks with certain two-connected survivability constraints. Opns. Res., Vol. 37.
    • (1989) Opns. Res. , vol.37
    • Monma, C.1
  • 11
    • 0014606247 scopus 로고
    • The design of minimal cost survivable networks
    • Steiglitz, K., Weiner, P., & Kleitman, D., (1969). The design of minimal cost survivable networks. IEEE Trans. Cir. Theory, Vol. CT-16, No. 4.
    • (1969) IEEE Trans. Cir. Theory , vol.CT-16 , Issue.4
    • Steiglitz, K.1    Weiner, P.2


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