Patentable/Patents/US-11595302
US-11595302

Controlling routing behavior during router table-memory exhaustion events

PublishedFebruary 28, 2023
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

Systems and methods include obtaining a table having a plurality of addresses each having a plurality of attributes and classifications; responsive to a requirement to reduce a size of the table, reducing a number of the plurality of addresses based on one or more reduction approaches that use any of the plurality of attributes and classifications; and obtaining an output table having some or all of the plurality of addresses for a table receiver. The table can be obtained via control plane components including one or more of Interior Gateway Protocol (IGP) and Border Gateway Protocol (BGP). The requirement to reduce the size is based on a size of the table and a size of memory associated with the table receiver.

Patent Claims
16 claims

Legal claims defining the scope of protection, as filed with the USPTO.

2

2. The non-transitory computer-readable medium of claim 1, wherein the obtaining the table is via control plane components including one or more of Interior Gateway Protocol (IGP) and Border Gateway Protocol (BGP).

3

3. The non-transitory computer-readable medium of claim 1, wherein, when there is no requirement to reduce the size, the output table has a same number of the plurality of prefixes as the table.

4

4. The non-transitory computer-readable medium of claim 1, wherein the one or more reduction approaches utilize one or more of the plurality of attributes to sort the plurality of prefixes with the reducing based on the sorted plurality of prefixes.

5

5. The non-transitory computer-readable medium of claim 1, wherein the classifications are added by control plane components, and wherein the one or more reduction approaches utilize the classifications.

6

6. The non-transitory computer-readable medium of claim 5, wherein the classifications are any of priority-based, weightings, and hard partitioning per class.

7

7. The non-transitory computer-readable medium of claim 5, wherein the classifications are used for any of a current prefix and a next-hop prefix.

9

9. The method of claim 8, wherein the obtaining the table is via control plane components including one or more of Interior Gateway Protocol (IGP) and Border Gateway Protocol (BGP).

10

10. The method of claim 8, wherein, when there is no requirement to reduce the size, the output table has a same number of the plurality of prefixes as the table.

11

11. The method of claim 8, wherein the one or more reduction approaches utilize one or more of the plurality of attributes to sort the plurality of prefixes with the reducing based on the sorted plurality of prefixes.

12

12. The method of claim 8, wherein the classifications are added by control plane components, and wherein the one or more reduction approaches utilize the classifications.

13

13. The method of claim 12, wherein the classifications are any of priority-based, weightings, and hard partitioning per class.

14

14. The method of claim 12, wherein the classifications are used for any of a current prefix and a next-hop prefix.

16

16. The router of claim 15, wherein the table is obtained from control plane components including one or more of Interior Gateway Protocol (IGP) and Border Gateway Protocol (BGP).

17

17. The router of claim 15, wherein the one or more reduction approaches utilize one or more of the plurality of attributes to sort the plurality of prefixes with the reducing based on the sorted plurality of prefixes.

18

18. The non-transitory computer-readable medium of claim 1, wherein the one or more reduction approaches include i) classless or single class approaches that filter based on the attributes and ii) class-based approaches that filter based on the classifications.

20

20. The non-transitory computer-readable medium of claim 18, wherein the one or more reduction approaches are selected by an arbiter based on the size of the memory, the requirement, and the operator's configuration.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

September 23, 2020

Publication Date

February 28, 2023

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Controlling routing behavior during router table-memory exhaustion events” (US-11595302). https://patentable.app/patents/US-11595302

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.