IP Library Granted Patent US 10,693,723
Granted Patent B2
US 10,693,723 · App. 16/042,047 · Granted Jun 23, 2020

Network upgrades

Inventors: Srinivas Rao Killadi (Bangalore, IN); Sree Vasthav Shatdarshanam Venkata (Bangalore, IN); Indu Shree Akasapu (Bangalore, IN)
Assignee: Hewlett Packard Enterprise Development LP
H04L41/082H04L43/067
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,693,723
App. No.
16/042,047
Granted
Jun 23, 2020
Kind
B2
Abstract

An example of a system may include a processing resource and a computing device comprising instructions executable by the processing resource to determine an interval based on an amount of time to upgrade a network; determine a series of time windows based on the interval; analyze data traffic in the network over the series of time windows; identify a subset of the series of time windows that are sequential and non-overlapping; and select a particular time window from the subset of the series of time windows to perform an upgrade of the network based on the analyzed data traffic.

Claims (40)

1. A system comprising:

a processing resource;

a computing device comprising instructions executable by the processing resource to:

determine an interval based on an amount of time to upgrade a network;

determine a series of time windows based on the interval;

analyze data traffic in the network over the series of time windows;

identify a subset of the series of time windows that are sequential and non-overlapping;

monitor the data traffic at each of a plurality of controllers making up a cluster of controllers;

record the monitored data traffic for a configurable monitoring period;

overwrite a portion of data traffic recorded at the beginning of the monitoring period with data traffic recorded immediately following the lapsing of the monitoring period;

select a particular time window from the subset of the series of time windows to perform an upgrade of the network based on the analyzed data traffic.

2. The system of claim 1 , wherein the series of time windows include a plurality of overlapping and non-identical time windows.

3. The system of claim 1 , wherein the instructions to analyze the data traffic in the network include instructions to determine a number of clients utilizing the network during each of the series of time windows.

4. The system of claim 1 , wherein the instructions to analyze the data traffic in the network include instructions to determine a type of client session utilizing the network during each of the series of time windows.

5. The system of claim 1 , wherein the instructions to analyze the data traffic in the network include instructions to determine a load on each of a plurality of controllers of the network.

6. The system of claim 1 , wherein the instructions to analyze the data traffic in the network include instructions to determine a number of active sessions on each of a plurality of controllers of the network.

7. The system of claim 1 , wherein the instructions to select the particular time window include instructions to select the particular time window from the subset of the series of time windows with a least number of clients utilizing the network.

8. The system of claim 1 , wherein the instructions to select the particular time window include instructions to select the particular time window from the subset of the series of time windows with a least amount of sessions of a particular type on the network.

9. A non-transitory machine-readable medium storing instructions executable by a processing resource to:

determine a series of time windows based on a predetermined interval of time;

analyze data traffic in a network over the series of time windows;

identify a subset of the series of time windows that are sequential and non-overlapping;

identify a pattern of the data traffic over the series of time windows;

predict a number of clients and a type of traffic on the network for each of a plurality of future time windows corresponding to the subset of the series of time windows based on the pattern of data traffic over the series of time windows;

select a future time window, corresponding to a particular time window of the subset of the series of time windows, predicted to have a least amount of data traffic based on the analyzed data traffic to complete an upgrade of the network.

10. The non-transitory machine-readable medium of claim 9 , including instructions executable to predict the future time window with the least amount of data traffic based on a comparison of the number of clients and the type of traffic on the network for each of the plurality of future time windows corresponding to the subset of the series of time windows.

11. The non-transitory machine-readable medium of claim 9 , wherein predetermined interval is an amount of time to complete the upgrade of the network.

12. The non-transitory machine-readable medium of claim 11 , including instructions executable to schedule the upgrade of the network for the selected future time window.

13. A method comprising:

determining an interval based on an amount of time to upgrade a network;

determining a series of time windows based on the interval;

analyzing data traffic in the network over the series of time windows;

identifying a subset of the series of time windows that are sequential and non-overlapping;

monitoring the data traffic at each of a plurality of controllers making up a cluster of controllers;

recording the monitored data traffic for a configurable monitoring period;

overwriting a portion of data traffic recorded at the beginning of the monitoring period with data traffic recorded immediately following the lapsing of the monitoring period;

selecting a particular time window from the subset of the series of time windows based on an amount of data traffic and a type of data traffic during the particular time window; and

performing an upgrade to the network at a future time corresponding to the particular time window.

14. The method of claim 13 , including determining a number of clients in an active voice or video streaming session on the network over the series of time windows based on the analyzed data traffic.

15. The method of claim 13 , determining the particular time window from the subset of time windows has a relatively smaller amount of the type of data traffic than other time windows of the subset of time windows.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 7, 2018
From: KILLADI, SRINIVAS RAO; SHATDARSHANAM VENKATA, SREE VASTHAV; AKASAPU, INDU SHREE
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 046574/0587 →
Continuity (1)
Related Publication 20200028738A1 · Jan 23, 2020