ON THE PERFORMANCE ANALYSIS OF TRAFFIC SPLITTING ON LOAD IMBALANCING AND PACKET REORDERING OF BURSTY TRAFFIC

被引:5
作者
Prabhavat, Sumet [1 ]
Nishiyama, Hiroki [1 ]
Ansari, Nirwan [2 ]
Kato, Nei [1 ]
机构
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 980, Japan
[2] NJIT, ECE Dept, Adv Networking Lab, Newark, NJ USA
来源
2009 IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT, PROCEEDINGS | 2009年
关键词
D O I
10.1109/ICNIDC.2009.5360896
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. To be able to simultaneously and efficiently use such parallel paths, it is essential to facilitate high quality network services at high speeds. So, traffic splitting, having a significant impact on quality of services (QoS), is an important means to achieve load balancing. In general, most existing models can be classified into flow-based or packet-based models. Unfortunately, both classes exhibit some drawbacks, such as low efficiency under the high variance of flow size in flow-based models and the phenomenon of packet reordering in packet-based models. In contrast, Table-based Hashing with Reassignment (THR) and Flowlet Aware Routing Engine (FLARE), both belonging to the class of flow-based models, attempt to achieve both efficient bandwidth utilization and packet order preservation. An original flow can be split into several paths. As compared to the traditional flow-based models, load balancing deviation from ideal distribution decreases while the risk of packet reordering, increases. In this paper, we introduce analytical models of THR and FLAR-E, and derive the probabilities of traffic splitting and packet reordering for each model. Our analysis shows that FLARE is superior to THR in packet order preservation. Also, the performance of FLARE on bursty traffic is demonstrated and discussed.
引用
收藏
页码:236 / +
页数:2
相关论文
共 16 条
  • [1] [Anonymous], 1998, 2330 RFC
  • [2] [Anonymous], 2000, 2991 RFC
  • [3] CAO Z, 2000, P IEEE INFOCOM, P332
  • [4] Traffic distribution over equal-cost-multi-paths
    Chim, TW
    Yeung, KL
    Lui, KS
    [J]. COMPUTER NETWORKS, 2005, 49 (04) : 465 - 475
  • [5] Demichelis C., 2002, 3393 RFC
  • [6] THE MARKOV-MODULATED POISSON-PROCESS (MMPP) COOKBOOK
    FISCHER, W
    MEIERHELLSTERN, K
    [J]. PERFORMANCE EVALUATION, 1993, 18 (02) : 149 - 171
  • [7] Multi-path continuous media streaming: what are the benefits?
    Golubchik, L
    Lui, JCS
    Tung, TF
    Chow, ALH
    Lee, WJ
    Franceschinis, G
    Anglano, C
    [J]. PERFORMANCE EVALUATION, 2002, 49 (1-4) : 429 - 449
  • [8] Hopps C.E., 2000, Analysis of an Equal-Cost Multi-Path Algorithm, DOI [10.17487/RFC2992, DOI 10.17487/RFC2992]
  • [9] Jayasumana A., 2008, RFC 5236
  • [10] Kandula S, 2007, ACM SIGCOMM COMP COM, V37, P53