基于标记的空间分解算法:一种新的多字段分组分类算法

Ons Jelassi, O. Paul
{"title":"基于标记的空间分解算法:一种新的多字段分组分类算法","authors":"Ons Jelassi, O. Paul","doi":"10.1109/HPSR.2006.1709679","DOIUrl":null,"url":null,"abstract":"Packet classification is a central function in several network applications such as firewalls and QoS-enhanced routers. Several schemes were proposed for fast packet classification, but few ones support incremental updates. In this paper, we present a new multi-fields packet classification algorithm and show its advantages compared to previous proposed algorithms. We present performance measurements using a free benchmark developed at Washington University. We show how this algorithm performs improved search times without any limitation in terms of incremental updates","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Markers-based space decomposition algorithm: a new algorithm for multi-fields packet classification\",\"authors\":\"Ons Jelassi, O. Paul\",\"doi\":\"10.1109/HPSR.2006.1709679\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Packet classification is a central function in several network applications such as firewalls and QoS-enhanced routers. Several schemes were proposed for fast packet classification, but few ones support incremental updates. In this paper, we present a new multi-fields packet classification algorithm and show its advantages compared to previous proposed algorithms. We present performance measurements using a free benchmark developed at Washington University. We show how this algorithm performs improved search times without any limitation in terms of incremental updates\",\"PeriodicalId\":274390,\"journal\":{\"name\":\"2006 Workshop on High Performance Switching and Routing\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Workshop on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2006.1709679\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Workshop on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2006.1709679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

包分类是防火墙和qos增强路由器等几种网络应用程序的核心功能。提出了几种快速分组分类方案,但很少有方案支持增量更新。本文提出了一种新的多字段分组分类算法,并与已有算法进行了比较。我们使用华盛顿大学开发的免费基准来提供性能测量。我们将展示该算法如何在没有任何增量更新限制的情况下执行改进的搜索时间
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Markers-based space decomposition algorithm: a new algorithm for multi-fields packet classification
Packet classification is a central function in several network applications such as firewalls and QoS-enhanced routers. Several schemes were proposed for fast packet classification, but few ones support incremental updates. In this paper, we present a new multi-fields packet classification algorithm and show its advantages compared to previous proposed algorithms. We present performance measurements using a free benchmark developed at Washington University. We show how this algorithm performs improved search times without any limitation in terms of incremental updates
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信