基于流标签、源地址和目的地址的IPv6报文分类

Eric C. K. Poh, H. Ewe
{"title":"基于流标签、源地址和目的地址的IPv6报文分类","authors":"Eric C. K. Poh, H. Ewe","doi":"10.1109/ICITA.2005.165","DOIUrl":null,"url":null,"abstract":"Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"IPv6 packet classification based on flow label, source and destination addresses\",\"authors\":\"Eric C. K. Poh, H. Ewe\",\"doi\":\"10.1109/ICITA.2005.165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.\",\"PeriodicalId\":371528,\"journal\":{\"name\":\"Third International Conference on Information Technology and Applications (ICITA'05)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Information Technology and Applications (ICITA'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITA.2005.165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Information Technology and Applications (ICITA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITA.2005.165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

分组分类对于支持多字段分组路由、服务质量(QoS)、实时数据流应用程序和防火墙非常重要。IPv4中的现有方案使用5元组方法,这在数据平面处理中带来了很大的开销。引入IPv6流标签字段,方便对属于同一流的数据包进行标签;现在可以使用3元组方法进行分类。本文提出了一种基于层次结构的三元组数据包分类算法,该算法具有低存储要求和最佳搜索速度。包过滤器是基于分层方法进行评估的,从流标签开始,依次是源地址和目的地址。本文还描述了具有地址冲突解析的散列模型,该模型可以最大限度地减少内存消耗。查找过程的时间复杂度受报头字段长度的限制,与三元组大小无关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IPv6 packet classification based on flow label, source and destination addresses
Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信