End-To-End Network Access Analysis
First Claim
1. A computer-implemented method, comprising:
- populating instances of router models with configuration data (27) from real-world devices that serve as routers in a network and populating instances of filter models with configuration data (27) from real-world devices that serve as filters in the network (20);
deriving a route advertising graph from the router model instances (21), wherein the route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers;
determining consolidated routing data for the ones of the real-world devices serving as routers, wherein the determining comprises iterating to stability the propagation of routes indicated by the route advertising graph (21);
for a destination node in the network, constructing from the consolidated routing data a respective route graph indicating available paths to the destination node from each source node in the network (22); and
classifying services between each source node and the destination node based on a full traversal of the route advertising graph (23).
4 Assignments
0 Petitions
Accused Products
Abstract
Instances of router models and filter models respectively are populated with configuration data from routers and filters in a network (20). A route advertising graph is derived from the router model instances (21). The route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers. Consolidated routing data is determined for the ones of the real-world devices serving as routers (21). In this process, the propagation of routes indicated by the route advertising graph is iterated to stability. For a destination node in the network, a respective route graph indicating available paths to the destination node from each source node in the network is constructed from the consolidated routing data (22). Services between each source node and the destination node are classified based on a full traversal of the route advertising graph (23).
-
Citations
20 Claims
-
1. A computer-implemented method, comprising:
-
populating instances of router models with configuration data (27) from real-world devices that serve as routers in a network and populating instances of filter models with configuration data (27) from real-world devices that serve as filters in the network (20); deriving a route advertising graph from the router model instances (21), wherein the route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers; determining consolidated routing data for the ones of the real-world devices serving as routers, wherein the determining comprises iterating to stability the propagation of routes indicated by the route advertising graph (21); for a destination node in the network, constructing from the consolidated routing data a respective route graph indicating available paths to the destination node from each source node in the network (22); and classifying services between each source node and the destination node based on a full traversal of the route advertising graph (23). - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. Apparatus, comprising:
-
a computer-readable medium (26) storing computer-readable instructions; and a processor (25) coupled to the computer-readable medium, operable to execute the instructions, and based at least in part on the execution of the instructions operable to perform operations comprising populating instances of router models with configuration data (27) from real-world devices that serve as routers in a network and populating instances of filter models with configuration data from real-world devices that serve as filters in the network (20); deriving a route advertising graph from the router model instances (21), wherein the route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers; determining consolidated routing data for the ones of the real-world devices serving as routers (21), wherein the determining comprises iterating to stability the propagation of routes indicated by the route advertising graph; for a destination node in the network, constructing from the consolidated routing data a respective route graph indicating available paths to the destination node from at least one source node in the network (22); and classifying services between the source node and the destination node based on a full traversal of the route advertising graph (24). - View Dependent Claims (14, 15, 16)
-
-
17. At least one computer-readable medium (26) having computer-readable program code embodied therein, the computer-readable program code adapted to be executed by a computer (25) to implement a method comprising:
-
populating instances of router models with configuration data from real-world devices that serve as routers in a network and populating instances of filter models with configuration data from real-world devices that serve as filters in the network (20); deriving a route advertising graph from the router model instances (21), wherein the route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers; determining consolidated routing data for the ones of the real-world devices serving as routers (21), wherein the determining comprises iterating to stability the propagation of routes indicated by the route advertising graph; for a destination node in the network, constructing from the consolidated routing data a respective route graph indicating available paths to the destination node from each source node in the network (22); and classifying services between each source node and the destination node based on a full traversal of the route advertising graph (23). - View Dependent Claims (18, 19, 20)
-
Specification