Route prefix aggregation using reachable and non-reachable addresses in a computer network
First Claim
Patent Images
1. A method, comprising:
- determining, at a network device, a set of routes to one or more reachable addresses in a computer network;
determining a set of no-routes to one or more non-reachable addresses in the computer network;
recursively aggregating the routes and no-routes into one or more reachable route prefixes within which there are one or more corresponding non-reachable no-route prefix exceptions to exceptions, wherein aggregating includes;
creating a bitmap with bits corresponding to each address within a given range, wherein based on the routes and no-routes, the bits of the bitmap are populated with a first bit value for addresses corresponding to a route, and with a second bit value for addresses corresponding to a no-route, andrecursively merging each even prefix with its adjacently corresponding odd prefix for each decremented prefix length in a range of available prefix lengths; and
utilizing the route prefixes and no-route prefix exceptions.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a network device determines a set of routes to one or more reachable addresses and also a set of no-routes to one or more non-reachable addresses in a computer network. The routes and no-routes may then be aggregated into one or more reachable route prefixes with one or more corresponding non-reachable no-route prefix exceptions. As such, the aggregated combination of route prefixes and no-route prefix exceptions may be utilized by the network device.
25 Citations
21 Claims
-
1. A method, comprising:
-
determining, at a network device, a set of routes to one or more reachable addresses in a computer network; determining a set of no-routes to one or more non-reachable addresses in the computer network; recursively aggregating the routes and no-routes into one or more reachable route prefixes within which there are one or more corresponding non-reachable no-route prefix exceptions to exceptions, wherein aggregating includes; creating a bitmap with bits corresponding to each address within a given range, wherein based on the routes and no-routes, the bits of the bitmap are populated with a first bit value for addresses corresponding to a route, and with a second bit value for addresses corresponding to a no-route, and recursively merging each even prefix with its adjacently corresponding odd prefix for each decremented prefix length in a range of available prefix lengths; and utilizing the route prefixes and no-route prefix exceptions. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An apparatus, comprising:
-
one or more network interfaces to communicate in a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; determine a set of routes to one or more reachable addresses in the computer network; determine a set of no-routes to one or more non-reachable addresses in the computer network; recursively aggregate the routes and no-routes into one or more reachable route prefixes within which there are one or more corresponding non-reachable no-route prefix exceptions to exceptions, wherein the process when executed to aggregate is further operable to; create a bitmap with bits corresponding to each address within a given range, wherein based on the routes and no-routes, the bits of the bitmap are populated with a first bit value for addresses corresponding to a route, and with a second bit value for addresses corresponding to a no-route, and recursively merge each even prefix with its adjacently corresponding odd prefix for each decremented prefix length in a range of available prefix lengths; and utilize the route prefixes and no-route prefix exceptions. - View Dependent Claims (14, 15, 16, 17, 18)
-
-
19. A tangible, non-transitory, computer-readable media having software encoded thereon, the software when executed by a processor operable to:
-
determine a set of routes to one or more reachable addresses in the computer network; determine a set of no-routes to one or more non-reachable addresses in the computer network; recursively aggregate the routes and no-routes into one or more reachable route prefixes within which that are one or more corresponding non-reachable no-route prefix exceptions to exceptions, wherein the software when executed to aggregate is further operable to;
;create a bitmap with bits corresponding to each address within a given range, wherein based on the routes and no-routes, the bits of the bitmap are populated with a first bit value for addresses corresponding to a route, and with a second bit value for addresses corresponding to a no-route, and recursively merge each even prefix with its adjacently corresponding odd prefix for each decremented prefix length in a range of available prefix lengths; and utilize the route prefixes and no-route prefix exceptions. - View Dependent Claims (20, 21)
-
Specification