Performance analysis of flow loss probability and link utilization in MPLS networks for traffic engineering

被引:0
作者
Tamura, H [1 ]
Kawahara, K [1 ]
Oie, Y [1 ]
机构
[1] Kyushu Inst Technol, Dept Comp Sci & Elect, Fukuoka 8208502, Japan
来源
ADVANCES IN COMPUTING SCIENCE-ASIAN 2002: INTERNET-COMPUTING AND MODELING, GRID COMPUTING, PEER-TO PEER COMPUTING, AND CLUSTER COMPUTING | 2002年 / 2550卷
关键词
traffic engineering; MPLS; M/M/c/c queueing system; flow loss probability; link utilization; performance analysis;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
As the Internet grows, various types of traffic, such as voice, video and data, have been transmitted. Therefore, the Internet should provide Quality of Service(QoS) required by each traffic as well as end-to-end connectivity; and routing decision should be based on the utilization of links/routers and/or application types of each traffic. This kind of routing is called Traffic Engineering (TE) and its objective is to improve performance for users, such as the flow loss probability, and. for networks, such as the utilization of links, simultaneously, and some studies claim that MPLS(Multi-protocol Label Switching) technique can easily implement TE. So far, there are some experimental results that showed how effective TE on MPLS network is, however, its performance would not be theoretically and quantitatively analyzed. Thus, in this paper, we will investigate basic and preliminary performance of MPLS networks for TE by analyzing flow loss probability and Smoothness index of link utilization in the queueing system.
引用
收藏
页码:168 / 180
页数:13
相关论文
共 7 条
  • [1] Awduche D., 1999, RFC2702
  • [2] BAYLE T, 2001, P ISOC INET2001 JUN
  • [3] THE MARKOV-MODULATED POISSON-PROCESS (MMPP) COOKBOOK
    FISCHER, W
    MEIERHELLSTERN, K
    [J]. PERFORMANCE EVALUATION, 1993, 18 (02) : 149 - 171
  • [4] Jain R., 1991, ART COMPUTER SYSTEMS
  • [5] Nakazawa S, 2002, IEICE T COMMUN, VE85B, P165
  • [6] NAKAZAWA S, 2002, IN PRESS P 10 INT C
  • [7] Rosen E., 2001, 3031 RFC, P1, DOI [10.17487/RFC3031, DOI 10.17487/RFC3031]