IP Library Granted Patent US 7,936,764
Granted Patent B1
US 7,936,764 · App. 12/100,246 · Granted May 3, 2011

Method for optimizing IP route table size through IP route aggregation

Assignee: Extreme Networks, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,936,764
App. No.
12/100,246
Filed
Apr 9, 2008
Granted
May 3, 2011
Kind
B1
Art Unit
2477
USPC
370/395.31
Abstract

A subset of route entries having the same next hop is identified in a route table. The subset of entries falls within a range of prefixes. Gaps in the subset of route entries that prevent the subset from being contiguous are identified. The gaps in the subset are filled with route entries to make the subset contiguous. All of the route entries in the contiguous subset of route entries have the same next hop, thus the contiguous subset can be aggregated into a single route entry in a forwarding table. For each gap-filling entry added to the route table, an additional route entry having forwarding priority over the gap-filling entry is added to the forwarding table.

Claims (28)

1. A method for reducing the size of a route table having a plurality of route entries, the method comprising:

identifying a subset of route entries having a same next hop in a route table, the route entries within a range of prefixes;

identifying a missing route for which no route entry exists within the subset of route entries, wherein the missing route prevents the subset of route entries within the range of prefixes from being contiguous in the route table;

adding the missing route as a route entry to the route table to create a contiguous subset of route entries within the range of prefixes;

adding a new route entry to the route table, the new route entry having a prefix corresponding to and longer than a prefix of the route entry of the missing route, wherein the new route entry has forwarding priority over the route entry for the missing route; and

aggregating, by a processor, the contiguous subset of route entries into a single aggregated route entry in the route table.

2. The method of claim 1 , further comprising:

receiving an indication of a route entry deleted from the contiguous subset;

maintaining an equivalent route entry in the route table corresponding to the deleted route entry;

adding an additional route entry in the route table corresponding to the deleted route entry, the additional route entry having a prefix corresponding to and longer than a prefix of the equivalent route entry in the route table corresponding to the deleted route entry, wherein the additional route entry has forwarding priority over the equivalent route entry for the route entry deleted from the contiguous subset.

3. The method of claim 1 , wherein each additional route corresponds to a different next hop than the next hop of the route entries in the contiguous subset of route entries.

4. The method of claim 2 , wherein the additional route entry corresponding to the deleted route corresponds to a different next hop in the route table than the next hop of the equivalent route entry in the route table.

5. The method of claim 1 , further comprising aggregating aggregated route entries into a single route entry to further compress the route table.

6. The method of claim 1 , wherein identifying the subset of route entries having the same next hop in a route table further comprises identifying a subset of equal cost multi-path (ECMP) route entries in the route table having a same set of ECMP paths.

7. A non-transitory computer-readable storage medium having content stored thereon to provide instructions that, when executed by a processor in an electronic device, result in the electronic device performing a method for reducing the size of a route table having a plurality of route entries, wherein the method comprises:

identifying a subset of route entries having a same next hop in a route table, the route entries within a range of prefixes;

identifying a missing route for which no route entry exists within the subset of route entries, wherein the missing route prevents the subset of route entries within the range of prefixes from being contiguous in the route table;

adding the missing route as a route entry to the route table to create a contiguous subset of route entries within the range of prefixes;

adding a new route entry to the route table, the new route entry having a prefix corresponding to and longer than a prefix of the route entry of the missing route, wherein the new route entry has forwarding priority over the route entry for the missing route; and

aggregating the contiguous subset of route entries into a single aggregated route entry in the route table.

8. The non-transitory computer-readable storage medium article of manufacture of claim 7 , wherein the method further comprises:

receiving an indication of a route entry deleted from the contiguous subset;

maintaining an equivalent route entry in the route table corresponding to the deleted route entry;

adding an additional route entry in the route table corresponding to the deleted route entry, the additional route entry having a prefix corresponding to and longer than a prefix of the equivalent route entry in the route table corresponding to the deleted route entry, wherein the additional route entry has forwarding priority over the equivalent route entry for the route entry deleted from the contiguous subset.

9. The non-transitory computer-readable storage medium of claim 7 , wherein each additional route entry corresponds to a different next hop than the next hop of the route entries in the contiguous subset of route entries.

10. The non-transitory computer-readable storage medium of claim 8 , wherein the additional route entry corresponding to the deleted route entry corresponds to a different next hop than the next hop of the equivalent route entry in the route table.

11. The non-transitory computer-readable storage medium of claim 7 , wherein the method further comprises:

aggregating aggregated route entries into a single route entry to further compress the route table.

Assignments (10)
RELEASE OF PATENT AND TRADEMARK SECURITY INTEREST AT REEL/FRAME NO. 46050/0546 Recorded Jul 30, 2026
From: BANK OF MONTREAL, AS AGENT
To: EXTREME NETWORKS, INC.
Reel/Frame 076081/0088 →
SECURITY INTEREST Recorded Jul 29, 2026
From: EXTREME NETWORKS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 076078/0590 →
AMENDED SECURITY AGREEMENT Recorded Aug 18, 2023
From: EXTREME NETWORKS, INC.; AEROHIVE NETWORKS, INC.
To: BANK OF MONTREAL
Reel/Frame 064782/0971 →
SECURITY INTEREST Recorded May 1, 2018
From: EXTREME NETWORKS, INC.
To: BANK OF MONTREAL
Reel/Frame 046050/0546 →
RELEASE OF SECURITY INTEREST Recorded May 1, 2018
From: SILICON VALLEY BANK
To: EXTREME NETWORKS, INC.
Reel/Frame 046051/0775 →
THIRD AMENDED AND RESTATED PATENT AND TRADEMARK SECURITY AGREEMENT Recorded Oct 31, 2017
From: EXTREME NETWORKS, INC.
To: SILICON VALLEY BANK
Reel/Frame 044639/0300 →
SECOND AMENDED AND RESTATED PATENT AND TRADEMARK SECURITY AGREEMENT Recorded Jul 14, 2017
From: EXTREME NETWORKS, INC.
To: SILICON VALLEY BANK
Reel/Frame 043200/0614 →
AMENDED AND RESTATED PATENT AND TRADEMARK SECURITY AGREEMENT Recorded Oct 31, 2016
From: EXTREME NETWORKS, INC.
To: SILICON VALLEY BANK
Reel/Frame 040521/0762 →
SECURITY AGREEMENT Recorded Jul 27, 2015
From: EXTREME NETWORKS, INC.
To: SILICON VALLEY BANK
Reel/Frame 036189/0284 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 6, 2008
From: KRISHNAN, RAM
To: EXTREME NETWORKS, INC.
Reel/Frame 020908/0927 →