메뉴 건너뛰기




Volumn 40, Issue 10, 2002, Pages 118-124

Traffic engineering with traditional IP routing protocols

Author keywords

[No Author keywords available]

Indexed keywords

GATEWAY PROTOCOLS; OPEN SHORTEST PATH FIRST; ROUTING PROTOCOLS; TRAFFIC ENGINEERING;

EID: 0036806665     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2002.1039866     Document Type: Article
Times cited : (353)

References (11)
  • 1
    • 0003972890 scopus 로고    scopus 로고
    • Overview and principles of internet traffic engineering
    • RFC 3272, May
    • D. O. Awduche et al., "Overview and Principles of Internet Traffic Engineering," RFC 3272, May 2002.
    • (2002)
    • Awduche, D.O.1
  • 4
    • 0033901740 scopus 로고    scopus 로고
    • NetScope: Traffic engineering for IP networks
    • Mar.
    • A. Feldmann et al. "NetScope: Traffic Engineering for IP Networks," IEEE Net., Mar. 2000, pp. 11-19.
    • (2000) IEEE Net. , pp. 11-19
    • Feldmann, A.1
  • 6
    • 0036578023 scopus 로고    scopus 로고
    • Optimizing OSPF/IS-IS weights in a changing world
    • May
    • B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS Weights in a Changing World," IEEE JSAC, vol. 20, May 2002, pp. 756-67.
    • (2002) IEEE JSAC , vol.20 , pp. 756-767
    • Fortz, B.1    Thorup, M.2
  • 7
    • 0033280926 scopus 로고    scopus 로고
    • MPLS and traffic engineering in IP networks
    • Dec.
    • D. O. Awduche, "MPLS and Traffic Engineering in IP Networks," IEEE Commun. Mag., Dec. 1999, pp. 42-47.
    • (1999) IEEE Commun. Mag. , pp. 42-47
    • Awduche, D.O.1
  • 8
    • 0027189260 scopus 로고
    • Minimax open shortest path first routing algorithms in networks supporting the SMDS services
    • F. Lin and J. Wang, "Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Services," Proc. IEEE ICC, vol. 2, 1993, pp. 666-670.
    • (1993) Proc. IEEE ICC , vol.2 , pp. 666-670
    • Lin, F.1    Wang, J.2
  • 9
    • 0034915656 scopus 로고    scopus 로고
    • Optimal routing in shortest-path data networks
    • Jan.-June
    • K. Ramakrishnan and M. A. Rodrigues, "Optimal Routing in Shortest-path Data Networks," Bell Labs Tech. J., vol. 6, Jan.-June 2001.
    • (2001) Bell Labs Tech. J. , vol.6
    • Ramakrishnan, K.1    Rodrigues, M.A.2
  • 10
    • 1842567282 scopus 로고    scopus 로고
    • A memetic algorithm for OSPF routing
    • L. S. Buriol et al., "A Memetic Algorithm for OSPF routing," Proc. INFORMS Telecom, 2002, pp. 187-188
    • Proc. INFORMS Telecom, 2002 , pp. 187-188
    • Buriol, L.S.1
  • 11
    • 0036722265 scopus 로고    scopus 로고
    • A genetic algorithm for the weight setting problem in OSPF routing
    • M. Ericsson, M. Resende, and P. Pardalos, "A Genetic Algorithm for the Weight Setting Problem in OSPF Routing," J. Combin. Optim., vol. 6, no. 3, 2002, pp. 299-333.
    • (2002) J. Combin. Optim. , vol.6 , Issue.3 , pp. 299-333
    • Ericsson, M.1    Resende, M.2    Pardalos, P.3


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