Längste Präfixübereinstimmungssuchen mit Unterschiedlichen Präfixanzahlen

Details

Veröffentlichungs-Nr.

EP2640021

Aktenzeichen

EP13157924

Anmeldetag

6. März 2013

Veröffentlichung

19. Juni 2019

Erteilung

19. Juni 2019

Rechtsraum

EP

IPC

H04L12/743H04L12/745

Abstract

An example network device includes a control plane and a filter lookup module that includes a Bloom filter that supports parallel lookup of a maximum number of different prefix lengths. The filter lookup module accesses the Bloom filter to determine a longest length prefix that matches an entry in a set of prefixes. The control plane receives prefix lengths that include more than the maximum number of different prefix lengths supported by the Bloom filter, wherein the set of prefix lengths is associated with one application, generates, based on the received set of prefix lengths, two or more groups of different prefix lengths, wherein each of the two or more groups of different prefix lengths includes no more than the maximum number of different prefix lengths, and programs the filter lookup module with the two or more groups of different prefix lengths associated with the one application.

Anmelder

Firma

Juniper Networks, Inc.

Land

🇺🇸 USA

Fachgebiete