淡江大學機構典藏:Item 987654321/127398
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64185/96959 (66%)
Visitors : 11340920      Online Users : 99
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/127398


    Title: MLTree: an efficient packet classification algorithm using multiple layered trees in software defined networks
    Authors: Chuang, Po‑Jen;Yao, Jung‑Chun
    Keywords: Software defined networks (SDN);OpenvSwitch;Packet classification;Tuple space search;Decision trees;Performance evaluation
    Date: 2025-06
    Issue Date: 2025-06-04 12:05:36 (UTC+8)
    Abstract: In software defined networks (SDN), the open-source virtual switch tends to face challenges due to enormous rule processing and intricate data forwarding. Packet classification becomes a vitally important topic. A good classification strategy should achieve fast rule lookup and update at reasonable memory cost. It is challenging for both tuple-based and tree-based algorithms to simultaneously maintain desirable lookup and update performance. Tuple-based algorithms may attain efficient updates but experience unappealing lookup, while tree-based algorithms may attain better lookup by tree traversal but surrender update performance to potential rule replication. The main goal of this investigation is to construct a new algorithm to improve the classification efficiency of previous approaches—particularly to secure a proper performance balance between lookup and update. The proposed MLTree algorithm is an essentially tree-based approach. It maintains the lookup benefits of decision trees and also produces desirable updates by tuple-based multilayer partitioning which fits better to the universality of varying field lengths and scalability of multiple fields in SDN. Evaluation results show that, with feasible cost, MLTree realizes steadily better lookup and update performance than previous algorithms.
    Relation: The Journal of Supercomputing, 81,p.1-35
    DOI: 10.1007/s11227-025-07425-1
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML0View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback