메뉴 건너뛰기




Volumn 4868, Issue , 2002, Pages 69-77

On the scalability-performance tradeoffs in MPLS and IP routing

Author keywords

Constraint Based Routing; IP Routing; Multi Protocol Label Switching; Multicommodity Flow Algorithms; Simulation

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; OSCILLATIONS; QUALITY OF SERVICE; ROUTERS; SWITCHING; TELECOMMUNICATION TRAFFIC;

EID: 0036417563     PISSN: 0277786X     EISSN: None     Source Type: Journal    
DOI: 10.1117/12.475285     Document Type: Article
Times cited : (10)

References (22)
  • 2
    • 0004065895 scopus 로고    scopus 로고
    • Requirements for traffic engineering over MPLS
    • draft-awduche-mpls-eng-00.txt, April
    • D. Awduche, J. Macholm, M. O'Dell, and J. Mc-Manus. "Requirements for Traffic Engineering over MPLS". In Internet Draft, IETE draft-awduche-mpls-eng-00.txt, April 1998.
    • (1998) Internet Draft, IETE
    • Awduche, D.1    Macholm, J.2    O'Dell, M.3    Mc-Manus, J.4
  • 4
    • 0033873349 scopus 로고    scopus 로고
    • Internet traffic engineering by optimizing OSPF weights
    • Tel-Aviv, Israel, March
    • B. Fortz and M. Thorup. "Internet Traffic Engineering by Optimizing OSPF Weights". In Proceedings of IEEE INFOCOM, Tel-Aviv, Israel, March 2000.
    • (2000) Proceedings of IEEE INFOCOM
    • Fortz, B.1    Thorup, M.2
  • 5
    • 0017450139 scopus 로고
    • A minimum delay routing algorthm using distributed computation
    • R. Gallager. "A Minimum Delay Routing Algorthm Using Distributed Computation". IEEE Transactions on Communications, 25, 1977.
    • (1977) IEEE Transactions on Communications , vol.25
    • Gallager, R.1
  • 6
    • 0004186747 scopus 로고    scopus 로고
    • QoS routing mechanisms and OSPF extensions
    • Phoenix, AZ, November
    • R. Guerin, A. Orda, and D. Williams. "QoS Routing Mechanisms and OSPF Extensions". In Proceedings of Globecom, Phoenix, AZ, November 1997.
    • (1997) Proceedings of Globecom
    • Guerin, R.1    Orda, A.2    Williams, D.3
  • 7
    • 0034461274 scopus 로고    scopus 로고
    • Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications
    • Tel-Aviv, Israel, March
    • K. Kar, M. Kodialam, and T. Lakshman. "Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications". In Proceedings of IEEE INFOCOM, Tel-Aviv, Israel, March 2000.
    • (2000) Proceedings of IEEE INFOCOM
    • Kar, K.1    Kodialam, M.2    Lakshman, T.3
  • 8
    • 0000564361 scopus 로고
    • A polynomial time algorithm for linear programming
    • L.G. Khachiyan. "A Polynomial Time Algorithm for Linear Programming". Dokl. Akad. Nauk SSSR, 244, 1979.
    • (1979) Dokl. Akad. Nauk SSSR , pp. 244
    • Khachiyan, L.G.1
  • 9
    • 0024915854 scopus 로고
    • The revised ARPANET routing metric
    • Austin, Texas, September
    • A. Khanna and J. Zinky. "The Revised ARPANET Routing Metric". In Proceedings of ACM SIGCOMM, Austin, Texas, September 1989.
    • (1989) Proceedings of ACM SIGCOMM
    • Khanna, A.1    Zinky, J.2
  • 11
    • 0031674146 scopus 로고    scopus 로고
    • A load profiling approach to routing guaranteed bandwidth flows
    • March. Extended version in European Transactions on Telecommunications - Special Issue on Architectures, Protocols and Quality of Service for the Internet of the Future, March-April
    • I. Matta and A. Bestavros. "A Load Profiling Approach to Routing Guaranteed Bandwidth Flows". In Proceedings of IEEE INFOCOM, March 1998. Extended version in European Transactions on Telecommunications - Special Issue on Architectures, Protocols and Quality of Service for the Internet of the Future, March-April 1999.
    • (1998) Proceedings of IEEE INFOCOM
    • Matta, I.1    Bestavros, A.2
  • 13
    • 84994909605 scopus 로고    scopus 로고
    • The PPRN Package. http://www-eio.upc.es/̃jcastro/ppm.html.
    • The PPRN Package
  • 14
    • 0002990537 scopus 로고    scopus 로고
    • End-to-end routing behavior in the internet
    • Stanford, CA, August
    • V. Paxson. "End-to-End Routing Behavior in the Internet". In Proceedings of ACM SIGCOMM, Stanford, CA, August 1996.
    • (1996) Proceedings of ACM SIGCOMM
    • Paxson, V.1
  • 15
    • 0033204166 scopus 로고    scopus 로고
    • The end-to-end effects of internet path selection
    • Cambridge, MA, Sptember
    • S. Savage, A. Collins, and E. Hoffman. "The End-to-End Effects of Internet Path Selection". In Proceedings of ACM SIGCOMM, Cambridge, MA, Sptember 1999.
    • (1999) Proceedings of ACM SIGCOMM
    • Savage, S.1    Collins, A.2    Hoffman, E.3
  • 20
    • 0035013439 scopus 로고    scopus 로고
    • Internet traffic engineering without full mesh overlaying
    • April
    • Y. Wang, Z. Wang, and L. Zhang. "Internet Traffic Engineering without Full Mesh Overlaying". In Proceedings of IEEE INFOCOM, April 2001.
    • (2001) Proceedings of IEEE INFOCOM
    • Wang, Y.1    Wang, Z.2    Zhang, L.3
  • 21
    • 0002416734 scopus 로고
    • Analysis of shortest-path routing algorithms in dynamic network environment
    • April
    • Z. Wang and J. Crowcroft. "Analysis of Shortest-path Routing Algorithms in Dynamic Network Environment". ACM Computer Communication Review, 22(2), April 1992.
    • (1992) ACM Computer Communication Review , vol.22 , Issue.2
    • Wang, Z.1    Crowcroft, J.2


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