Systems and methods of in-band network configuration
In a method, computer system, and computer program product include for re-configuring a network, program code identifies relationships between nodes on a network, where each relationship of the relationships includes a first node running a routing protocol and a second node running the routing protocol, where the first node and the second node are physically connected, and where the nodes include at least one controller and a plurality of routers. The program code performs, starting at the at least one controller a reverse breadth search of the relationships to determine for each router, a number of relationships comprising a path from the controller to the router. The program code, for example, program code that is executed on the at least one controller, reconfigures the routers in descending order of magnitude of the number of relationships comprising the path from each router of the plurality of routers to the controller.
1. A method re-configuring a network in-band comprising:
identifying, by one or more processors, relationships between nodes on a network, wherein each relationship of the relationships includes a first node running a routing protocol and a second node running the routing protocol, wherein the first node and the second node are physically connected, and wherein the nodes comprise at least one controller and a plurality of routers;
performing, by the one or more processors, starting at the at least one controller a reverse breadth search of the relationships to determine for each router of the plurality of routers a number of relationships comprising a path from the controller to the router;
reconfiguring, by the one or more processors, the routers in descending order of magnitude of the number of relationships comprising the path from each router of the plurality of routers to the controller;
generating, by the one or more processors, a network graph representing the number of relationships comprising the path from the controller to each router of the plurality of routers, wherein an edge represents each relationship; and
utilizing by the one or more processors the network graph during the reconfiguring to establish the descending order.
2. The method of claim 1 , wherein the first node and the second node run interfaces that sit on a given subnet.
3. The method of claim 1 , wherein the identifying comprises:
extracting, by the one or more processors, data related to the at least one controller and a the plurality of routers from at least one system file; and
utilizing, by the one or more processor, the data in the generating of the network graph.
4. The method of claim 3 , wherein the data comprises at least one of: a router name, an interface IP address, or a network mask.
5. The method of claim 4 , wherein the at least one system file comprises a Distributed Assured and Dynamic Configuration (DADC) solution file.
6. The method of claim 1 , wherein the reconfiguring further comprises:
maintaining, by the one or more processors, during the reconfiguring, network connectivity of the nodes to the routers of the plurality of routers yet to be reconfigured.
7. A computer program product comprising:
a non-transitory computer readable storage medium readable by one or more processors and storing instructions for execution by the one or more processors for performing a method comprising:
identifying, by the one or more processors, relationships between nodes on a network, wherein each relationship of the relationships includes a first node running a routing protocol and a second node running the routing protocol, wherein the first node and the second node are physically connected, and wherein the nodes comprise at least one controller and a plurality of routers;
performing, by the one or more processors, starting at the at least one controller a reverse breadth search of the relationships to determine for each router of the plurality of routers a number of relationships comprising a path from the controller to the router;
reconfiguring, by the one or more processors, the routers in descending order of magnitude of the number of relationships comprising the path from each router of the plurality of routers to the controller;
generating, by the one or more processors, a network graph representing the number of relationships comprising the path from the controller to each router of the plurality of routers, wherein an edge represents each relationship; and
utilizing, by the one or more processors, the network graph, during the reconfiguring, to establish the descending order.
8. The computer program product of claim 7 , wherein the first node and the second node run interfaces that sit on a given subnet.
9. The computer program product of claim 7 , wherein the identifying comprises:
extracting, by the one or more processors, data related to the at least one controller and a the plurality of routers from at least one system file; and
utilizing, by the one or more processor, the data in the generating of the network graph.
10. The computer program product of claim 9 , wherein the data comprises at least one of: a router name, an interface IP address, or a network mask.
11. The computer program product of claim 10 , wherein the at least one system file comprises a Distributed Assured and Dynamic Configuration (DADC) solution file.
12. The computer program product of claim 7 , wherein the reconfiguring further comprises:
maintaining, by the one or more processors, during the reconfiguring, network connectivity of the nodes to the routers of the plurality of routers yet to be reconfigured.
13. A system comprising:
a memory;
one or more processors in communication with the memory; and
program instructions executable by the one or more processors via the memory to perform a method, the method comprising:
identifying, by the one or more processors, relationships between nodes on a network, wherein each relationship of the relationships includes a first node running a routing protocol and a second node running the routing protocol, wherein the first node and the second node are physically connected, and wherein the nodes comprise at least one controller and a plurality of routers;
performing, by the one or more processors, starting at the at least one controller a reverse breadth search of the relationships to determine for each router of the plurality of routers a number of relationships comprising a path from the controller to the router;
reconfiguring, by the one or more processors, the routers in descending order of magnitude of the number of relationships comprising the path from each router of the plurality of routers to the controller;
generating, by the one or more processors, a network graph representing the number of relationships comprising the path from the controller to each router of the plurality of routers, wherein an edge represents each relationship; and
utilizing, by the one or more processors, the network graph, during the reconfiguring, to establish the descending order.
14. The system of claim 13 , wherein the first node and the second node run interfaces that sit on a given subnet.
15. The system of claim 13 , wherein the identifying comprises:
extracting, by the one or more processors, data related to the at least one controller and a the plurality of routers from at least one system file; and
utilizing, by the one or more processor, the data in the generating of the network graph.
16. The system of claim 15 , wherein the data comprises at least one of: a router name, an interface IP address, or a network mask.
17. The system of claim 16 , wherein the at least one system file comprises a Distributed Assured and Dynamic Configuration (DADC) solution file.