淡江大學機構典藏:Item 987654321/127398
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64185/96959 (66%)
造访人次 : 11340923      在线人数 : 103
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/127398


    题名: MLTree: an efficient packet classification algorithm using multiple layered trees in software defined networks
    作者: Chuang, Po‑Jen;Yao, Jung‑Chun
    关键词: Software defined networks (SDN);OpenvSwitch;Packet classification;Tuple space search;Decision trees;Performance evaluation
    日期: 2025-06
    上传时间: 2025-06-04 12:05:36 (UTC+8)
    摘要: 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.
    關聯: The Journal of Supercomputing, 81,p.1-35
    DOI: 10.1007/s11227-025-07425-1
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML0检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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