US 11,770,463 B2
Packet filtering using binary search trees
Sherwood Johnson, Shakopee, MN (US)
Assigned to VIAVI SOLUTIONS INC., Chandler, AZ (US)
Filed by VIAVI SOLUTIONS INC., San Jose, CA (US)
Filed on Apr. 21, 2021, as Appl. No. 17/236,830.
Application 17/236,830 is a division of application No. 15/252,943, filed on Aug. 31, 2016, granted, now 11,005,977.
Prior Publication US 2021/0243282 A1, Aug. 5, 2021
Int. Cl. H04L 69/22 (2022.01); H04L 45/745 (2022.01); H04L 49/00 (2022.01); H04L 49/9047 (2022.01); H04L 49/90 (2022.01)
CPC H04L 69/22 (2013.01) [H04L 45/745 (2013.01); H04L 49/3018 (2013.01); H04L 49/9036 (2013.01); H04L 49/9047 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A packet filter system comprising:
an interface to receive data packets from a data packet communication stream;
a first memory to store binary search trees comprising node values to compare to the received data packets for packet filtering;
a second memory to store the received data packets, wherein the second memory is partitioned into a first half of memory addresses and a second half of memory addresses; and
a processing circuit to alternate storing incoming data packets of the received data packets in the first half and the second half of the second memory, and, at a same time, alternate processing stored data packets of the received data packets in the second half and the first half of the second memory,
wherein the processing circuit is to store a first data packet of the received data packets in the first half of the second memory and, at the same time, process a second data packet of the received data packets previously stored in the second half of the second memory, and
wherein to process the second data packet, the processing circuit is to compare the second data packet to the node values of the binary search trees in the first memory.