System and method for seamless live upgrade of access points using neighbor data
Systems and methods are provided for performing a live upgrade process of one or more devices (e.g., access points (APs), etc.) in a large scale network environment. For example, the system can use neighbor path loss data between the APs. The neighbor path loss data may identify the signal strength between two points as an indication of the ability to transmit power and receive power from the individual APs. When the ability to transmit and receive power is present in one AP is unavailable the user device may connect to a second AP to avoid losing connectivity. This neighbor path loss data may be utilized to perform a live upgrade process of APs in parallel at multiple locations of the user site.
1. A server for updating a plurality of access points (APs), the server comprising:
a memory; and
one or more processors configured to access the memory and execute machine readable instructions stored to:
receive, from the plurality of APs, neighbor data, wherein an AP of the plurality of APs provide network connectivity to a user device;
determine a set of APs that correspond with a radio frequency (RF) domain;
within the set of APs that correspond with the RF domain, determine a first subset of the set of APs and a second subset of the set of APs, wherein APs in the first subset of the set of APs and APs in the second subset of the set of APs do not overlap; and
transmit a command to an AP of the first subset of the set of APs and an AP of the second subset of the set of APs,
wherein the command disables network access to the user device communicatively connected with the AP of the first subset of the set of APs,
wherein the user device reconnects to a different AP in the first subset of the set of APs without moving locations, and
wherein the AP of the second subset of the set of APs receive the command in parallel with the AP of the first subset of the set of APs.
2. The server of claim 1 , wherein the set of APs provide roaming network connectivity without disassociation and data loss.
3. The server of claim 1 , wherein the RF domain identifies a physical barrier separating the set of APs of the plurality of APs from a second set of APs of the plurality of APs.
4. The server of claim 1 , wherein the neighbor data is received from the plurality of APs at a predetermined time threshold.
5. The server of claim 1 , wherein the plurality of APs comprise a first AP communicatively connected with a second AP, and a third AP that is not communicatively connected with the first AP or the second AP, and wherein the first AP and the second AP are included with the first subset of the set of APs and the third AP is not included with the first subset of the set of APs.
6. The server of claim 1 , wherein the one or more processors are configured to access the memory and execute machine readable instructions stored to:
upgrade the AP of the first subset of the set of APs and the AP of the second subset of the set of APs with a faster upgrade than determining the first subset of the set of APs according to their base channels.
7. The server of claim 1 , wherein the one or more processors are configured to access the memory and execute machine readable instructions stored to:
determine a second set of APs that correspond with a second RF domain; and
upgrade, in parallel with the set of APs, a second set of APs that correspond with the second RF domain.
8. The server of claim 7 , wherein the second RF domain is in a separate building from the RF domain, and wherein the RF domain and the second RF domain are associated with a single entity.
9. A method for updating a plurality of access points (APs), the method comprising:
receiving, from the plurality of APs, neighbor data, wherein an AP of the plurality of APs provide network connectivity to a user device;
determining a set of APs that correspond with a radio frequency (RF) domain;
within the set of APs that correspond with the RF domain, determining a first subset of the set of APs and a second subset of the set of APs, wherein APs in the first subset of the set of APs and APs in the second subset of the set of APs do not overlap; and
transmitting a command to an AP of the first subset of the set of APs and an AP of the second subset of the set of APs,
wherein the command disables network access to the user device communicatively connected with the AP of the first subset of the set of APs,
wherein the user device reconnects to a different AP in the first subset of the set of APs without moving locations, and
wherein the AP of the partition of the second subset of the set of APs receive the command in parallel with the AP of the first subset of the set of APs.
10. The method of claim 9 , wherein the set of APs provide roaming network connectivity without disassociation and data loss.
11. The method of claim 9 , wherein the RF domain identifies a physical barrier separating the set of APs of the plurality of APs from a second set of APs of the plurality of APs.
12. The method of claim 9 , wherein the neighbor data is received from the plurality of APs at a predetermined time threshold.
13. The method of claim 9 , wherein the plurality of APs comprise a first AP communicatively connected with a second AP, and a third AP that is not communicatively connected with the first AP or the second AP, and wherein the first AP and the second AP are included with the first subset of the set of APs and the third AP is not included with the first subset of the set of APs.
14. The method of claim 9 , further comprising:
upgrading the AP of the first subset of the set of APs and the AP of the second subset of the set of APs with a faster upgrade than determining the first subset of the set of APs according to their base channels.
15. The method of claim 9 , further comprising:
determining a second set of APs that correspond with a second RF domain;
upgrading, in parallel with the set of APs, a second set of APs that correspond with the second RF domain.
16. The method of claim 15 , wherein the second RF domain is in a separate building from the RF domain, and wherein the RF domain and the second RF domain are associated with a single entity.
17. A non-transitory computer-readable storage medium storing a plurality of instructions executable by one or more processors, the plurality of instructions when executed by the one or more processors cause the one or more processors to:
receive, from a plurality of access points (APs), neighbor data, wherein an AP of the plurality of APs provide network connectivity to a user device;
determine a set of APs that correspond with a radio frequency (RF) domain;
within the set of APs that correspond with the RF domain, determine a first subset of the set of APs and a second subset of the set of APs, wherein APs in the first subset of the set of APs and APs in the second subset of the set of APs do not overlap; and
transmit a command to an AP of the first subset of the set of APs and an AP of the second subset of the set of APs,
wherein the command disables network access to the user device communicatively connected with the AP of the first subset of the set of APs,
wherein the user device reconnects to a different AP in the first subset of the set of APs without moving locations, and
wherein the AP of the second subset of the set of APs receive the command in parallel with the AP of the first subset of the set of APs.
18. The non-transitory computer-readable storage medium of claim 17 , wherein the set of APs provide roaming network connectivity without disassociation and data loss.
19. The non-transitory computer-readable storage medium of claim 17 , wherein the RF domain identifies a physical barrier separating the set of APs of the plurality of APs from a second set of APs of the plurality of APs.
20. The non-transitory computer-readable storage medium of claim 17 , wherein the neighbor data is received from the plurality of APs at a predetermined time threshold.