EPC: An ensemble packet classification framework for efficient and stable performance

被引:0
作者
Ren, Haiyang [1 ]
Qian, Shiyou [2 ]
Zheng, Zhonglong [1 ]
Liao, Zhengyu [2 ]
Hu, Hanwen [2 ]
Cao, Jian [2 ]
Xue, Guangtao [2 ]
Li, Minglu [3 ]
机构
[1] Zhejiang Normal Univ, Sch Comp Sci & Technol, Jinhua, Zhejiang, Peoples R China
[2] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
[3] Huawei Technol Co Ltd, Shenzhen, Peoples R China
关键词
Packet classification; Network transmission; Worst case; Stability; Load balancing; ALGORITHMS; QOS;
D O I
10.1016/j.comnet.2025.111306
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The increasing demands of emerging network applications have compelled routers to offer enhanced functions, such as traffic accounting and quality of service (QoS). These functions rely heavily on packet classification. With network transmission speeds reaching unprecedented levels, the optimization of throughput has become a common practice. One such method is the deployment of multiple algorithm replicas with the best parameter configuration for parallel packet classification. However, this solution fails to address the issue of performance fluctuations in individual specific instance of algorithm (SIA). This is because most algorithms prioritize optimization of average lookup speed, often neglecting overall performance stability. Our evaluation of state-of-the-art algorithms has revealed that these algorithms commonly suffer from performance fluctuations due to data skewness. To address this issue, this work proposes a novel solution called Ensemble Packet Classification (EPC) that aims to achieve efficient and stable performance. EPC leverages the principles ensemble learning to generate an optimal combination scheme of diverse SIAs that exhibit similar performance but possess complementary characteristics. To evaluate the effectiveness of EPC, we select five state-of-theart algorithms as baselines. The experiment results show that when augmented with EPC, the throughput parallel solutions based on these algorithms increases by 12.07%-19.26%. Additionally, the 95th percentile lookup time is reduced by 14.78%-26.77%. By fully harnessing the complementarity of SIAs, EPC effectively addresses the issue of long-tail while increasing throughput.
引用
收藏
页数:14
相关论文
共 53 条
  • [2] NETWORK FIREWALLS
    BELLOVIN, SM
    CHESWICK, WR
    [J]. IEEE COMMUNICATIONS MAGAZINE, 1994, 32 (09) : 50 - 57
  • [3] Space-Efficient TCAM-Based Classification Using Gray Coding
    Bremlerr-Barr, Anat
    Hendler, Danny
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (01) : 18 - 30
  • [4] DRES: Dynamic range encoding scheme for TCAM coprocessors
    Che, Hao
    Wang, Zhijun
    Zheng, Kai
    Liu, Bin
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (07) : 902 - 915
  • [5] TupleMerge: Fast Software Packet Processing for Online Packet Classification
    Daly, James
    Bruschi, Valerio
    Linguaglossa, Leonardo
    Pontarelli, Salvatore
    Rossi, Dario
    Tollet, Jerome
    Torng, Eric
    Yourtchenko, Andrew
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (04) : 1417 - 1431
  • [6] Daly J, 2018, IEEE INFOCOM SER, P2654, DOI 10.1109/INFOCOM.2018.8486215
  • [7] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [8] A survey on ensemble learning
    Dong, Xibin
    Yu, Zhiwen
    Cao, Wenming
    Shi, Yifan
    Ma, Qianli
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2020, 14 (02) : 241 - 258
  • [9] BILLING USERS AND PRICING FOR TCP
    EDELL, RJ
    MCKEOWN, N
    VARAIYA, PP
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (07) : 1162 - 1175
  • [10] Gray M., 1996, Internet growth summary