Node update in a software-defined network
A method may include identifying an update file for a plurality of nodes; selecting a first set of nodes of the plurality of nodes based on a set of node selection criteria; sending the update file to the first set of nodes via a software-defined network (SDN); receiving a first message from a first node of the first set of nodes indicating that the first node is ready to host the update file; identifying a second node that is connected to the first node responsive to receiving the first message from the first node; sending a first instruction to the second node for the second node to obtain the update file from the first node; receiving a second message from the second node indicating that the second node is ready to host the update file; and adding the second node to the first set of nodes.
1. A system comprising:
at least one control device in communication with a plurality of nodes via a software-defined network (SDN), the at least one control device configured to:
identify an update file for the plurality of nodes;
select a set of nodes of the plurality of nodes;
provide, to the set of nodes, access to the update file;
receive a first message from a first node of the set of nodes, the first message indicating that the first node is ready to host the update file;
in response to the first message, select a second node in communication with the first node;
send an instruction to the second node to obtain access to the update file from the first node;
receive a second message from the second node indicating that the second node is ready to host the update file;
add the second node to the set of nodes;
send an instruction to a third node to obtain access to the update file from the first node;
receive a third message from the third node indicating that the third node failed to access the update file from the first node; and
send an instruction to the third node for the third node to obtain the update file from a fourth node, wherein the fourth node is ready to host the update file.
2. The system of claim 1 , further comprising:
a management device in communication with the at least one control device, the management device configured to:
manage the at least one control device.
3. The system of claim 1 , wherein the set of nodes is selected based on a set of node selection criteria.
4. The system of claim 1 , wherein the set of node selection criteria includes at least one of a weighted score generated based on at least one of: a number of Bidirectional Forwarding Detection (BFD) sessions for the respective node, a link capacity of the respective node, a link cost of the respective node, and a link performance of the respective node.
5. The system of claim 1 , wherein access to the update file includes at least one of sending the update file, a link of the update file, or an address to the update file.
6. The system of claim 1 , wherein the second node is selected based on a weighted score generated based on at least one of: a number of Bidirectional Forwarding Detection (BFD) sessions, a link capacity, a link cost, and a link performance.
7. The system of claim 1 , wherein the control device is further configured to:
remove the first node from the set of nodes.
8. A method comprising:
identifying an update file for a plurality of nodes;
selecting a set of nodes of the plurality of nodes;
providing, to the set of nodes, access to the update file;
receiving a first message from a first node of the set of nodes, the first message indicating that the first node is ready to host the update file;
in response to the first message, selecting a second node in communication with the first node;
sending an instruction to the second node to obtain access to the update file from the first node;
receiving a second message from the second node indicating that the second node is ready to host the update file;
adding the second node to the set of nodes;
sending an instruction to a third node to obtain access to the update file from the first node;
receiving a third message from the third node indicating that the third node failed to access the update file from the first node; and
sending an instruction to the third node for the third node to obtain the update file from a fourth node, wherein the fourth node is ready to host the update file.
9. The method of claim 8 , wherein the set of nodes is selected based on a set of node selection criteria.
10. The method of claim 8 , wherein the set of node selection criteria includes at least one of a weighted score generated based on at least one of: a number of Bidirectional Forwarding Detection (BFD) sessions for the respective node, a link capacity of the respective node, a link cost of the respective node, and a link performance of the respective node.
11. The method of claim 8 , wherein access to the update file includes at least one of sending the update file, a link of the update file, or an address to the update file.
12. The method of claim 8 , wherein the second node is selected based on a weighted score generated based on at least one of: a number of Bidirectional Forwarding Detection (BFD) sessions, a link capacity, a link cost, and a link performance.
13. The method of claim 8 , further comprising:
removing the first node from the set of nodes.
14. At least one non-transitory computer readable medium storing instructions, which when executed by at least one processor causes the at least one processor to:
identify an update file for the plurality of nodes;
select a set of nodes of the plurality of nodes;
provide, to the set of nodes, access to the update file;
receive a first message from a first node of the set of nodes, the first message indicating that the first node is ready to host the update file;
in response to the first message, select a second node in communication with the first node;
send an instruction to the second node to obtain access to the update file from the first node;
receive a second message from the second node indicating that the second node is ready to host the update file;
add the second node to the set of nodes;
send an instruction to a third node to obtain access to the update file from the first node;
receive a third message from the third node indicating that the third node failed to access the update file from the first node; and
send an instruction to the third node for the third node to obtain the update file from a fourth node, wherein the fourth node is ready to host the update file.
15. The at least one non-transitory computer readable medium of claim 14 , wherein the set of nodes is selected based on a set of node selection criteria.
16. The at least one non-transitory computer readable medium of claim 14 , wherein access to the update file includes at least one of sending the update file, a link of the update file, or an address to the update file.
17. The at least one non-transitory computer readable medium of claim 14 ,
further comprising instructions, which when executed by the at least one processor causes the at least one processor to:
remove the first node from the set of nodes.
18. The at least one non-transitory computer readable medium of claim 14 , wherein the set of node selection criteria includes at least one of a weighted score generated based on at least one of: a number of Bidirectional Forwarding Detection (BFD) sessions for the respective node, a link capacity of the respective node, a link cost of the respective node, and a link performance of the respective node.
19. The at least one non-transitory computer readable medium of claim 14 , wherein the second node is selected based on a weighted score generated based on at least one of: a number of Bidirectional Forwarding Detection (BFD) sessions, a link capacity, a link cost, and a link performance.