发明名称 |
Compound masking and entropy for data packet classification using tree-based binary pattern matching |
摘要 |
A method in a network element of a packet data network classifies a data packet for application of a packet data network policy. A root node compound bit mask is applied to bits of a received data packet. The data packet has data in a plurality of fields. The compound bit mask has a plurality of bit masks each having bits in a different data packet field. The masked bits of the compound bit mask are applied to root node bit tables, one for each bit mask of the compound bit mask. A branch node from the root node is selected based on a bit table look up. |
申请公布号 |
US8750309(B2) |
申请公布日期 |
2014.06.10 |
申请号 |
US201213408771 |
申请日期 |
2012.02.29 |
申请人 |
Telefonaktiebolaget L M Ericsson (Publ) |
发明人 |
Ernström Lars |
分类号 |
H04L12/56 |
主分类号 |
H04L12/56 |
代理机构 |
|
代理人 |
|
主权项 |
1. A method in a network element of a packet data network to classify a data packet for application of a packet data network policy comprising:
applying a root node compound bit mask to bits of a received data packet, the data packet having data in a plurality of fields, the compound bit mask comprising a plurality of bit masks each having bits in a different data packet field; applying the masked bits of the compound bit mask to root node bit tables, one for each bit mask of the compound bit mask; selecting a branch node from the root node based on a root node bit table look up; applying a branch node bit mask associated with the selected branch node to bits of the received data packet; applying the masked bits of the selected branch node bit mask to at least one branch node bit table; and classifying the received data packet based on a branch node bit table look up.
|
地址 |
Stockholm SE |