메뉴 건너뛰기




Volumn 4516 LNCS, Issue , 2007, Pages 117-128

A robust routing plan to optimize throughput in core networks

Author keywords

Flow assignment; Graph theory; Quality of Service (QoS); Routing; Traffic engineering

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC;

EID: 38149022614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72990-7_14     Document Type: Conference Paper
Times cited : (11)

References (17)
  • 1
    • 0034461274 scopus 로고    scopus 로고
    • Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications
    • Kar, K., Kodialam, M., Lakshman, T.V.: Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE Journal on Selected Areas in Communications 18(12), 2566-2579 (2000)
    • (2000) IEEE Journal on Selected Areas in Communications , vol.18 , Issue.12 , pp. 2566-2579
    • Kar, K.1    Kodialam, M.2    Lakshman, T.V.3
  • 2
    • 38149055676 scopus 로고    scopus 로고
    • Awduche, D.O., Berger, L., Gan, D., Li, T., Swallow, G., Srinivasan, V.: Extensions to RSVP for LSP tunnels. Internet Draft draf-ietf-mpls-rsvp-lsp- tunnel-04.txt (September 1999)
    • Awduche, D.O., Berger, L., Gan, D., Li, T., Swallow, G., Srinivasan, V.: Extensions to RSVP for LSP tunnels. Internet Draft draf-ietf-mpls-rsvp-lsp- tunnel-04.txt (September 1999)
  • 3
    • 84949976956 scopus 로고    scopus 로고
    • Profile-Based Routing: A New Framework for MPLS Traffic Engineering
    • Quality of Future Internet Services, Springer Verlag, Heidelberg
    • Suri, S., Waldvogel, M., Warkhede, P.R.: Profile-Based Routing: A New Framework for MPLS Traffic Engineering. In: Quality of Future Internet Services. LNCS, vol. 2156, Springer Verlag, Heidelberg (2001)
    • (2001) LNCS , vol.2156
    • Suri, S.1    Waldvogel, M.2    Warkhede, P.R.3
  • 4
    • 33750177351 scopus 로고
    • Centrality in Networks: I. Conceptual Clarification
    • Freeman, L.C.: Centrality in Networks: I. Conceptual Clarification. Social Networks 1, 215-239 (1978/79)
    • (1978) Social Networks , vol.1 , pp. 215-239
    • Freeman, L.C.1
  • 5
    • 13944249973 scopus 로고    scopus 로고
    • Centrality and Network Flow
    • Borgatti, L.S.P.: Centrality and Network Flow. Social Networks 27(1), 55-71 (2005)
    • (2005) Social Networks , vol.27 , Issue.1 , pp. 55-71
    • Borgatti, L.S.P.1
  • 8
    • 0036417563 scopus 로고    scopus 로고
    • On the Scalability-Performance Tradeoffs in MPLS and IP Routing
    • May
    • Yilmaz, S., Matta, I.: On the Scalability-Performance Tradeoffs in MPLS and IP Routing. In: Proceedings of SPIE ITCOM (May (2002)
    • (2002) Proceedings of SPIE ITCOM
    • Yilmaz, S.1    Matta, I.2
  • 11
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k Shortest Paths. Society for Industrial and Applied Mathematics (SIAM)
    • Eppstein, D.: Finding the k Shortest Paths. Society for Industrial and Applied Mathematics (SIAM) Journal of Computing 28(2), 652-673 (1998)
    • (1998) Journal of Computing , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 15
    • 38149077339 scopus 로고    scopus 로고
    • Zhang-Shen, R., McKeown, N.: designing a Predictable Internet Backbone Networks. HotNet-III (November 2004)
    • Zhang-Shen, R., McKeown, N.: designing a Predictable Internet Backbone Networks. HotNet-III (November 2004)
  • 16
    • 38149107511 scopus 로고    scopus 로고
    • http://abilene.intemet2.edu/
  • 17
    • 38149061091 scopus 로고    scopus 로고
    • http://totem.info.ucl.ac.be/


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