Packet Classification using Hierarchical Intelligent Cuttings分层智能插穗的数据包分类.pptVIP

下载本文档

6
0
约 25页
2017-03-08 发布于上海
举报
版权申诉

Packet Classification using Hierarchical Intelligent Cuttings分层智能插穗的数据包分类.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Packet Classification using Hierarchical Intelligent Cuttings分层智能插穗的数据包分类

08/18/1999 hhjh Packet Classificationusing Hierarchical Intelligent Cuttings Pankaj Gupta and Nick McKeown Stanford University {pankaj, nickm}@ Outline Introduction and Motivation Overview of the proposed algorithm Details of the algorithm Implementation Results Conclusions Packet Classification Multi-field Packet Classification Performance Metrics of a Classification Algorithm Data structure storage requirements Packet classification time Preprocessing time Incremental Update time Previous Work Bounds from Computational Geometry Point Location among N non-overlapping regions in k dimensions takes either O(log N) time with O(Nk) space, or O(logk-1N) time with O(N) space Observations No single good solution for all cases. But real classifiers have structure. Perhaps an algorithm can exploit this structure. A heuristic hybrid scheme …. Proposed Algorithm: Basic Idea Example 2-D Classifier Geometric View Decision Tree using Hierarchical Intelligent Cuttings (HiCuts) With each internal node v, associate: A rectangle, or a box B(v) A set of rules, CollidingRuleSet, R(v) A HiCut C(v) = (dimension d, #partitions of B(v) across d) HiCuts HiCuts Heuristics to exploit classifier structure Picking a suitable dimension to hicut across. Minimize the maximum number of rules into any one partition, OR Maximize the entropy of the distribution of rules across the partition, OR Maximise the different number of specifications in one dimension Picking the suitable number of partitions (HiCuts) to be made. Affects the space consumed and the classification time. Tuned by a parameter, spfac. Tunable Parameters Binth, the maximum size of the set of rules at each leaf Spfac, a parameter which guides the partitioning process to choose the number of partitions Implementation Results: Four dimensional real-life classifiers 40 access-lists taken from real ISP and enterprise networks Four dimensions: (Src IP, Dst IP, L4 protocol, L4 destination port) 100-1733 rules Size of the