{"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}
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