메뉴 건너뛰기




Volumn 26, Issue 8, 2003, Pages 845-860

Quality of service provisioning through traffic engineering with applicability to IP-based production networks

Author keywords

Differentiated services; Production networks; Quality of service; Traffic engineering

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; CONTROL SYSTEMS; MULTIMEDIA SYSTEMS; PACKET NETWORKS; SATELLITE LINKS; WORLD WIDE WEB;

EID: 0037457631     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(02)00218-9     Document Type: Article
Times cited : (14)

References (31)
  • 5
    • 0003484248 scopus 로고    scopus 로고
    • Requirements for support of Diff-Serv-aware MPLS traffic engineering
    • 〈ietf-tewg-diff-te-reqts-05.txt〉, in press
    • Le Faucheur F., Lai W. Requirements for support of Diff-Serv-aware MPLS traffic engineering. IETF Internet draft. June:2002;. 〈ietf-tewg-diff-te-reqts-05.txt〉, in press.
    • (2002) IETF Internet Draft , vol.JUNE
    • Le Faucheur, F.1    Lai, W.2
  • 6
    • 0035439338 scopus 로고    scopus 로고
    • IP network configuration for intradomain traffic engineering
    • Feldmann A., Rexford J. IP network configuration for intradomain traffic engineering. IEEE Network Magazine. 15:(5):2001;46-57.
    • (2001) IEEE Network Magazine , vol.15 , Issue.5 , pp. 46-57
    • Feldmann, A.1    Rexford, J.2
  • 8
    • 0033873349 scopus 로고    scopus 로고
    • Internet traffic engineering by optimising {OSPF} weights
    • Tel Aviv, Israel, March
    • Fortz B., Thorup M. Internet traffic engineering by optimising {OSPF} weights. Proceedings of IEEE INFOCOM 2000,Tel Aviv, Israel. March:2000;519-528.
    • (2000) Proceedings of IEEE INFOCOM 2000 , pp. 519-528
    • Fortz, B.1    Thorup, M.2
  • 9
    • 0033907680 scopus 로고    scopus 로고
    • Minimum interference routing with applications to traffic engineering
    • Israel, March
    • Kodialam M., Lakshman T.V. Minimum interference routing with applications to traffic engineering. Proceedings of IEEE INFOCOM2000, Israel. March:2000;884-893.
    • (2000) Proceedings of IEEE INFOCOM2000 , pp. 884-893
    • Kodialam, M.1    Lakshman, T.V.2
  • 11
    • 0033293537 scopus 로고    scopus 로고
    • A case study of multiservice, multipriority traffic engineering design for data networks
    • Rio de Janeiro, December
    • Mitra D., Ramakrishnan K.G. A case study of multiservice, multipriority traffic engineering design for data networks. Proceedings of IEEE GLOBECOM 99, Rio de Janeiro. December:1999;1087-1093.
    • (1999) Proceedings of IEEE GLOBECOM 99 , pp. 1087-1093
    • Mitra, D.1    Ramakrishnan, K.G.2
  • 12
  • 15
    • 0035013439 scopus 로고    scopus 로고
    • Internet traffic engineering without full mesh overlaying
    • Alaska, April
    • Wang Z., Wang Y., Zhang L. Internet traffic engineering without full mesh overlaying. Proceedings of IEEE INFOCOM, Alaska. April:2001.
    • (2001) Proceedings of IEEE INFOCOM
    • Wang, Z.1    Wang, Y.2    Zhang, L.3
  • 19
    • 0033885344 scopus 로고    scopus 로고
    • Performance of hashing-based schemes for Internet load balancing
    • Tel Aviv, Israel, March
    • Cao Z., Wang Z., Zegura E. Performance of hashing-based schemes for Internet load balancing. Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel. March:2000;332-341.
    • (2000) Proceedings of IEEE INFOCOM 2000 , pp. 332-341
    • Cao, Z.1    Wang, Z.2    Zegura, E.3
  • 20
    • 0012444835 scopus 로고    scopus 로고
    • New terminology and clarifications for Diffserv
    • April
    • Grossman D. New terminology and clarifications for Diffserv. IETF Informational RFC-3260. April:2002.
    • (2002) IETF Informational RFC , vol.3260
    • Grossman, D.1
  • 23
    • 0004024119 scopus 로고    scopus 로고
    • Provider architecture for differentiated services and traffic engineering (PASTE)
    • October
    • Li T., Rekhter Y. Provider architecture for differentiated services and traffic engineering (PASTE). IETF Informational RFC-2430. October:1998.
    • (1998) IETF Informational RFC , vol.2430
    • Li, T.1    Rekhter, Y.2
  • 29
    • 0032108018 scopus 로고    scopus 로고
    • Finding k-shortest paths
    • Eppstein D. Finding k-shortest paths. SIAM Journal on Computing. 28:(2):1998;652-673.
    • (1998) SIAM Journal on Computing , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 30
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra E.W. A note on two problems in connection with graphs. Numerische Mathematik. 1:1959;269-271.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1


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