IP Library › Granted Patent US 12,675,333
Granted Patent B2
US 12,675,333 · App. 18/366,538 · Granted Jul 7, 2026

Systems and methods for continued edge resource demand load estimation

Inventors: William Jeffery White (Plano, TX); Said Tabet (Austin, TX)
Assignee: DELL PRODUCTS L.P.
G06F9/505G06F9/5072
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 12,675,333
App. No.
18/366,538
Filed
Aug 7, 2023
Granted
Jul 7, 2026
Kind
B2
Examiner
HO, ANDY
Art Unit
2194
USPC
718/105
Abstract

Managing the resource demand load for edge systems is significantly more complex than for other systems, such as cloud environments. Embodiments herein provide edge resource demand load estimation systems and methods that inform scheduling and associated edge orchestration to ensure that edge system resource capacity is appropriately utilized. Efficient utilization allows an increased number of applications to be deployed at a reduced level of reserved resources. Also presented are embodiments of assurance mechanisms for monitoring edge resource demand load characterizations. In one or more embodiments, when an estimate or estimates are deemed to not be valid (e.g., having experienced stationary drift), updated estimates may be obtained.

Claims (82)

1 . A processor-implemented method for estimating edge resource demand load, the method comprising:

given, for each task of a set of one or more tasks, time series of statistical resource demand values for one or more edge resources for handling the task:

gauging stationarity using one or more stationarity methods; and

responsive to detecting non-stationarity for at least one statistical resource demand value for at least one edge resource for a task:

dispatching the task to a target edge system, in which the task is flagged to notify the target edge system to collect resource-related data associated with handling the task;

after receiving the resource-related data associated with handling the task, using a dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task;

determining, for the task, one or more resource demand values for the at least one of the one or more edge resources using at least one of the one or more resource statistics; and

storing the one or more resource demand values.

2 . The processor-implemented method of claim 1 wherein the one or more stationarity methods comprises at least one of: Kwiatkowski-Phillips-Schmidt-Shin (KPSS) and Augmented Dickey-Fuller (ADF).

3 . The processor-implemented method of claim 1 further comprising:

responsive to not detecting non-stationarity for any statistical resource demand values:

determining whether a last time non-stationarity was detected exceeds a maximum threshold time;

responsive to the last time non-stationarity was detected not exceeding the maximum threshold time, waiting a scheduled time and returning to the step of gauging stationarity using one or more stationarity methods; and

responsive to the last time non-stationarity was detected exceeding the maximum threshold time, for each task from a group of one or more tasks:

dispatching the task to a target edge system, in which the task is flagged to notify the target edge system to collect resource-related data associated with handling the task;

after receiving the resource-related data associated with handling the task, using a dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task;

determining, for the task, one or more resource demand values for the at least one of the one or more edge resources using at least one of the one or more resource statistics; and

storing the one or more resource demand values.

4 . The processor-implemented method of claim 3 further comprising:

determining a frequency of occurrence of stationary drift; and

using the frequency of occurrence of stationary drift to set the scheduled time for checking for stationary drift.

5 . The processor-implemented method of claim 1 wherein the step of using the dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task comprises:

using the dataset comprising the resource-related data associated with handling the task and a resource uncertainty estimator, which uses a M-PCM-OFFD (Multivariate Probabilistic Collocation Method-Orthogonal Fractional Factorial Design) methodology, to obtain the resource statistics for the one or more edge resources for the task.

6 . The processor-implemented method of claim 1 wherein the dataset comprises resource-related data associated with handling the task collected from a plurality of instances of the target edge system handling the task over an evaluation time.

7 . The processor-implemented method of claim 1 wherein the one or more resource demand values for the task comprises, for each of a set of edge resources:

a lower control limit for the edge resource;

a mean for the edge resource; and

an upper control limit for the edge resource.

8 . One or more information handling systems collectively comprising:

one or more processors; and

one or more non-transitory computer-readable medium or media comprising one or more sets of instructions which, when executed by at least one of the one or more processors, causes steps to be performed comprising:

given, for each task of a set of one or more tasks, time series of statistical resource demand values for one or more edge resources for handling the task:

gauging stationarity using one or more stationarity methods; and

responsive to detecting non-stationarity for at least one statistical resource demand value for at least one edge resource for a task:

dispatching the task to a target edge system, in which the task is flagged to notify the target edge system to collect resource-related data associated with handling the task;

after receiving the resource-related data associated with handling the task, using a dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task;

determining, for the task, one or more resource demand values for the at least one of the one or more edge resources using at least one of the one or more resource statistics; and

storing the one or more resource demand values.

9 . The one or more information handling systems of claim 8 wherein the one or more stationarity methods comprises at least one of: Kwiatkowski-Phillips-Schmidt-Shin (KPSS) and Augmented Dickey-Fuller (ADF).

10 . The one or more information handling systems of claim 8 wherein the one or more non-transitory computer-readable medium or media further comprise one or more sets of instructions which, when executed by at least one of the one or more processors, causes steps to be performed comprising:

responsive to not detecting non-stationarity for any statistical resource demand values:

determining whether a last time non-stationarity was detected exceeds a maximum threshold time;

responsive to the last time non-stationarity was detected not exceeding the maximum threshold time, waiting a scheduled time and returning to the step of gauging stationarity using one or more stationarity methods; and

responsive to the last time non-stationarity was detected exceeding the maximum threshold time, for each task from a group of one or more tasks:

dispatching the task to a target edge system, in which the task is flagged to notify the target edge system to collect resource-related data associated with handling the task;

after receiving the resource-related data associated with handling the task, using a dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task;

determining, for the task, one or more resource demand values for the at least one of the one or more edge resources using at least one of the one or more resource statistics; and

storing the one or more resource demand values.

11 . The one or more information handling systems of claim 10 wherein the one or more non-transitory computer-readable medium or media further comprise one or more sets of instructions which, when executed by at least one of the one or more processors, causes steps to be performed comprising:

determining a frequency of occurrence of stationary drift; and

using the frequency of occurrence of stationary drift to set the scheduled time for checking for stationary drift.

12 . The one or more information handling systems of claim 8 wherein the step of using the dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task comprises:

using the dataset comprising the resource-related data associated with handling the task and a resource uncertainty estimator, which uses a M-PCM-OFFD (Multivariate Probabilistic Collocation Method-Orthogonal Fractional Factorial Design) methodology, to obtain the resource statistics for the one or more edge resources for the task.

13 . The one or more information handling systems of claim 8 wherein the dataset comprises resource-related data associated with handling the task collected from a plurality of instances of the target edge system handling the task over an evaluation time.

14 . The one or more information handling systems of claim 8 wherein the one or more resource demand values for the task comprises, for each of a set of edge resources:

a lower control limit for the edge resource;

a mean for the edge resource; and

an upper control limit for the edge resource.

15 . A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:

given, for each task of a set of one or more tasks, time series of statistical resource demand values for one or more edge resources for handling the task:

gauging stationarity using one or more stationarity methods; and

responsive to detecting non-stationarity for at least one statistical resource demand value for at least one edge resource for a task:

dispatching the task to a target edge system, in which the task is flagged to notify the target edge system to collect resource-related data associated with handling the task;

after receiving the resource-related data associated with handling the task, using a dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task;

determining, for the task, one or more resource demand values for the at least one of the one or more edge resources using at least one of the one or more resource statistics; and

storing the one or more resource demand values.

16 . The non-transitory computer-readable medium or media of claim 15 wherein the one or more stationarity methods comprises at least one of: Kwiatkowski-Phillips-Schmidt-Shin (KPSS) and Augmented Dickey-Fuller (ADF).

17 . The non-transitory computer-readable medium or media of claim 15 further comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:

responsive to not detecting non-stationarity for any statistical resource demand values:

determining whether a last time non-stationarity was detected exceeds a maximum threshold time;

responsive to the last time non-stationarity was detected not exceeding the maximum threshold time, waiting a scheduled time and returning to the step of gauging stationarity using one or more stationarity methods; and

responsive to the last time non-stationarity was detected exceeding the maximum threshold time, for each task from a group of one or more tasks:

dispatching the task to a target edge system, in which the task is flagged to notify the target edge system to collect resource-related data associated with handling the task;

after receiving the resource-related data associated with handling the task, using a dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task;

determining, for the task, one or more resource demand values for the at least one of the one or more edge resources using at least one of the one or more resource statistics; and

storing the one or more resource demand values.

18 . The non-transitory computer-readable medium or media of claim 17 further comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:

determining a frequency of occurrence of stationary drift; and

using the frequency of occurrence of stationary drift to set the scheduled time for checking for stationary drift.

19 . The non-transitory computer-readable medium or media of claim 15 wherein the step of using the dataset comprising the resource-related data associated with handling the task to determine one or more resource statistics for at least one of the one or more edge resources for the task comprises:

using the dataset comprising the resource-related data associated with handling the task and a resource uncertainty estimator, which uses a statistical technique known as M-PCM-OFFD (Multivariate Probabilistic Collocation Method-Orthogonal Fractional Factorial Design), to obtain the resource statistics for the one or more edge resources for the task.

20 . The non-transitory computer-readable medium or media of claim 15 wherein the dataset comprises resource-related data associated with handling the task collected from a plurality of instances of the target edge system handling the task over an evaluation time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 18, 2024
From: WHITE, WILLIAM JEFFERY; TABET, SAID
To: DELL PRODUCTS L.P.
Reel/Frame 067158/0407 →
Continuity (3)
Continuation In Part 18355351 · Jul 19, 2023
Provisional Application 63450237 · Mar 6, 2023
Related Publication 20240303129A1 · Sep 12, 2024
References Cited (58)
US 8386495B1 · Sandler et al. · 2013 [cited by applicant]
US 10169101B2 · Banerjee · 2019 [cited by examiner]
US 10698717B2 · Tang et al. · 2020 [cited by applicant]
US 10977078B2 · Rehman · 2021 [cited by applicant]
US 11171831B2 · Patel et al. · 2021 [cited by applicant]
US 11228527B2 · Bangalore Krishnamurthy · 2022 [cited by applicant]
US 11356349B2 · Cui · 2022 [cited by examiner]
US 11836656B2 · Cai et al. · 2023 [cited by applicant]
US 11966788B2 · MacDonald et al. · 2024 [cited by applicant]
US 12250159B2 · Chaurasia et al. · 2025 [cited by applicant]
US 20040103387A1 · Teig et al. · 2004 [cited by applicant]
US 20230138568A1 · Singh · 2023 [cited by applicant]
US 20230185472A1 · Higginson et al. · 2023 [cited by applicant]
US 20230244537A1 · Wang · 2023 [cited by applicant]
US 20230409871A1 · Xu et al. · 2023 [cited by applicant]
US 20240095090A1 · Saito et al. · 2024 [cited by applicant]
US 20240205165A1 · Smith et al. · 2024 [cited by applicant]
US 20240220639A1 · Sahu et al. · 2024 [cited by applicant]
US 20240259879A1 · Ranganath · 2024 [cited by examiner]
US 20240303121A1 · White et al. · 2024 [cited by applicant]
US 20240303124A1 · White et al. · 2024 [cited by applicant]
US 20240303127A1 · White et al. · 2024 [cited by applicant]
US 20240303128A1 · White et al. · 2024 [cited by applicant]
US 20240303129A1 · White et al. · 2024 [cited by applicant]
US 20240303130A1 · White et al. · 2024 [cited by applicant]
US 20240303134A1 · White et al. · 2024 [cited by applicant]
US 20240305535A1 · White et al. · 2024 [cited by applicant]
Feng, Yihui, et al. “Scaling Large Production Clusters with Partitioned Synchronization.” Proceedings of the 2021 USENIX Annual Technical Conference (USENIX ATC '21), Jul. 14-16, 2021. https://www.usenix.org/conference/… [cited by applicant]
Xie, Junfei, et al. “M-PCM-OFFD: An effective output statistics estimation method for systems of high dimensional uncertainties subject to low-order parameter interactions.” Mathematics and Computers in Simulation, vol.… [cited by applicant]
Wiki contributors. “Erlang distribution.” Wikipedia, The Free Encyclopedia, Mar. 21, 2025, https://en.wikipedia.org/wiki/Erlang_distribution. Accessed Mar. 21, 2025. (6 pages). [cited by applicant]
Toczé, Klervie, et al. “Edge Workload Trace Gathering and Analysis for Benchmarking.” Proceedings of the 2022 IEEE 6th International Conference on Fog and Edge Computing (ICFEC), 2022, pp. 34-41. https://doi.org/10.1109… [cited by applicant]
Qiu, Haoran, et al. “FIRM: An Intelligent Fine-grained Resource Management Framework for SLO-Oriented Microservices.” Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2020,… [cited by applicant]
Wang et al. “The Cost of Cloud, a Trillion Dollar Paradox.” Andreessen Horowitz, May 27, 2021, https://a16z.com/the-cost-of-cloud-a-trillion-dollar-paradox/ (12 pages). [cited by applicant]
Notice of Allowance mailed Sep. 3, 2025 for U.S. Appl. No. 18/366,490, 20 pages. [cited by applicant]
Kolosov, Oleg, et al. “Benchmarking in the Dark: On the Absence of Comprehensive Edge Datasets.” Proceedings of the 2nd USENIX Workshop on Hot Topics in Edge Computing (HotEdge), 2020. https://www.usenix.org/conference/… [cited by applicant]
Wiki contributors. “Jensen-Shannon divergence.” Wikipedia, The Free Encyclopedia, Mar. 21, 2025, https://en.wikipedia.org/wiki/Jensen%E2%80%93Shannon_divergence Accessed Mar. 21, 2025. (6 pages). [cited by applicant]
Salem, Osman, Farid Naït-Abdesselam, and Ahmed Mehaoua. “Anomaly Detection in Network Traffic using Jensen-Shannon Divergence.” Proceedings of the IEEE International Conference on Communications (ICC), 2012, pp. 5200-52… [cited by applicant]
Soos, Gabor, Daniel Ficzere, and Pal Varga. “Towards Traffic Identification and Modeling for 5G Application Use-Cases.” Electronics, vol. 9, No. 4, 2020, p. 640. https://doi.org/10.3390/electronics9040640. (32 pages). [cited by applicant]
Sisworo. “On Holder Exponents.” Jurnal Matematika dan Sains (JMS), vol. 4, No. 3, 1999, pp. 244-259. https://www.researchgate.net/publication/309421576_On_Holder_Exponents. (3 https://www.researchgate.net/publication/30… [cited by applicant]
Liu, M., Wan, Y., Lin, Z., Lewis, F.L., Xie, J., Jalaian, B.A. (2021). Computational Intelligence in Uncertainty Quantification for Learning Control and Differential Games. In: Vamvoudakis, K.G., Wan, Y., Lewis, F.L., C… [cited by applicant]
Ghorbani, Amir, Yifan Wang, Yanzhi Xue, Massoud Pedram, and Paul Bogdan. “Prediction and Control of Bursty Cloud Workloads: A Fractal Framework.” University of Southern California, 2014. https://dx.doi.org/10.1145/26560… [cited by applicant]
Ali-Eldin, Ahmed, et al. “The Hidden Cost of the Edge: A Performance Comparison of Edge and Cloud Latencies.” Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis … [cited by applicant]
Tirmazi, Muhammad, et al. “Borg: the Next Generation.” Proceedings of the Fifteenth European Conference on Computer Systems (EuroSys '20), Apr. 27-30, 2020, Heraklion, Greece ACM, New York, NY, USA, 2020, pp. 1-14. http… [cited by applicant]
Non-Final Office Action, including List of Ref. Cited by Examiner and Considered by Examiner, dated Dec. 12, 2025, in U.S. Appl. No. 18/366,461 (22 pgs). [cited by applicant]
Response to Non-Final Office Action, filed Dec. 14, 2025, U.S. Appl. No. 18/366,461 (15 pgs). [cited by applicant]
Non-Final Office Action, including List of Ref. Cited by Examiner and Considered by Examiner, dated Jan. 23, 2026, in U.S. Appl. No. 18/366,507 (24 pgs). [cited by applicant]
Non-Final Office Action, including List of Ref. Cited by Examiner and Considered by Examiner, dated Jan. 23, 2026, in U.S. Appl. No. 18/366,520 (23 pgs). [cited by applicant]
Response to Non-Final Office Action, filed Jan. 25, 2026, U.S. Appl. No. 18/366,507 (18 pgs). [cited by applicant]
Response to Non-Final Office Action, filed Jan. 25, 2026, U.S. Appl. No. 18/366,520 (16 pgs). [cited by applicant]
Non-Final Office Action, including List of Ref. Cited by Examiner and Considered by Examiner, dated Jan. 28, 2026, in U.S. Appl. No. 18/355,351 (47 pgs). [cited by applicant]
Notice of Allowance (2nd) mailed Feb. 13, 2025 for U.S. Appl. No. 18/366,490, 10 pages. [cited by applicant]
Notice of Allowance mailed Feb. 13, 2026 for U.S. Appl. No. 18/366,549, 32 pages. [cited by applicant]
Notice of Allowance mailed Feb. 19, 2026 for U.S. Appl. No. 18/366,555, 52 pages. [cited by applicant]
Notice of Allowance mailed Feb. 3, 2026 for U.S. Appl. No. 18/366,461, 7 pages. [cited by applicant]
Response to Non-Final Office Action, filed Feb. 22, 2026, U.S. Appl. No. 18/355,351 (20 pgs). [cited by applicant]
Notice of Allowance, including References Considered by Examiner, mailed Mar. 13, 2026 for U.S. Appl. No. 18/366,507, 15 pages. [cited by applicant]
Notice of Allowance, including References Considered by Examiner, mailed Mar. 13, 2026 for U.S. Appl. No. 18/366,520, 20 pages. [cited by applicant]
Supplemental Notice of Allowance (3rd) mailed Mar. 10, 2026 for U.S. Appl. No. 18/366,461, 2 pages. [cited by applicant]