IP Library Granted Patent US 12,647,321
Granted Patent B2
US 12,647,321 · App. 18/818,288 · Granted Jun 2, 2026

Hierarchical management policies for data queues

Inventors: Pedro Andres Forero (Bonita, CA); Dusan Radosevic (Poway, CA); John M. McInerney (La Mesa, CA)
Assignee: United States of America as represented by the Secretary of the Navy
H04L41/0894H04L41/0823H04L41/16
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,647,321
App. No.
18/818,288
Granted
Jun 2, 2026
Kind
B2
Abstract

A method for improving performance of a communications network comprising: using RL to develop a hierarchical policy framework to dynamically configure local flow-control and traffic-shaping policies in a multi-queue system, each queue having QoS and a traffic dynamic that differ from other queues; establishing first and second goals with a Queue System Management (QSM) policy for a BAM policy and a LFM policy respectively, wherein The BAM and LFM policies have a collection of BAM and LFM worker policies available to choose from; choosing, with the BAM policy, one of the BAM worker policies that best enable the BAM policy to achieve the first goal; choosing, with the LFM policy, one of the LFM worker policies for each queue that best enable the LFM policy to achieve the second goal; altering the first and second goals with the QSM policy dynamically according to a surrounding environment.

Claims (18)

1 . A method for improving performance of an intermittent, lossy communications network comprising:

using reinforcement learning to develop a hierarchical policy framework to dynamically configure local flow-control and traffic-shaping policies in a multi-queue system, wherein the multi-queue system comprises a plurality of queues, wherein each queue is configured to handle a corresponding data flow that has a quality of service (QoS) requirement and a traffic dynamic that differ from other queues in the multi-queue system;

establishing first and second goals with a Queue System Management (QSM) policy for a Bandwidth Allocation Management (BAM) policy and a Local Flow Management (LFM) policy respectively, wherein the BAM and LFM policies have a collection of predefined traffic shaping and congestion-control policies (hereinafter referred to as BAM and LFM worker policies) available to choose from, and wherein only policies at a bottom of the hierarchical policy framework interact directly with the QSM policy;

choosing, with the BAM policy, one of the BAM worker policies that best enable the BAM policy to achieve the first goal;

choosing, with the LFM policy, one of the LFM worker policies for each queue that best enable the LFM policy to achieve the second goal;

altering the first and second goals with the QSM policy dynamically according to a current state of the plurality of queues and a surrounding environment; and

wherein policies contained within the hierarchical policy framework operate at different levels of temporal resolution, with lower level policies operating at finer temporal resolutions than higher-level policies which operate at coarser temporal resolutions such that a given higher-level policy observes a coarse view of the current state that aligns with a temporal resolution at which the higher-level policy is expected to operate.

2 . The method of claim 1 , wherein individual instances of the LFM and the collection of LFM worker policies are deployed with each queue.

3 . The method of claim 2 , wherein the current state and the first and second goals are represented by respective vectors.

4 . The method of claim 3 , wherein the first goal is represented by a vector ğ:=ŭ⊙g, where ŭ is a vector that contains an average packet loss and a largest packet sojourn-time across the multi-queue system, ⊙ denotes a Hadamard product, and g defines a relative change in an average packet loss rate and the largest sojourn time that the QSM policy seeks to achieve.

5 . The method of claim 4 , wherein the second goal is represented by a vector G:=U⊙g1′ C , where C is a total number of queues in the multi-queue system, and U:=[u 1 , . . . , u C ]∈ , where is a set of real numbers.

6 . The method of claim 5 , wherein the BAM policy and the LFM policy have a reduced view of the current state when choosing the BAM worker policy and the LFM worker policy to achieve the first and second goals respectively.

7 . The method of claim 6 , wherein the BAM and LFM worker policies chosen during the choosing steps generate primitive actions that execute in a single time step.

8 . The method of claim 7 , wherein the step of using reinforcement learning to develop the hierarchical policy framework comprises;

using a hierarchical reinforcement learning (HRL) agent to observe the current state, wherein the HRL agent receives a reward or penalty depending on the current state;

updating the first and second goals based on the reward or penalty; and

observing the current state after the first and second goals have been updated.

9 . The method of claim 8 , wherein the step of using reinforcement learning comprises using a Markov Decision Process (MDP) model to describe an evolution of the BAM, LFM, BAM worker, and LFM worker policies in response to the current state.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 30, 2024
From: FORERO, PEDRO ANDRES; RADOSEVIC, DUSAN; MCINERNEY, JOHN M.
To: UNITED STATES OF AMERICA AS REPRESENTED BY THE SECRETARY OF THE NAVY
Reel/Frame 068452/0073 →
Continuity (1)
Related Publication 20260067164A1 · Mar 5, 2026
References Cited (38)
US 6496516B1 · Dabecki · 2002 [cited by examiner]
US 7606154B1 · Lee · 2009 [cited by examiner]
US 7668177B1 · Trapp · 2010 [cited by examiner]
US 7773504B2 · Chew · 2010 [cited by examiner]
US 8443444B2 · Wang · 2013 [cited by examiner]
US 10728097B1 · Chin · 2020 [cited by examiner]
US 10873533B1 · Ismailsheriff · 2020 [cited by examiner]
US 12401595B2 · Forero · 2025 [cited by examiner]
US 20020075803A1 · Zaharychuk · 2002 [cited by examiner]
US 20040136379A1 · Liao · 2004 [cited by examiner]
US 20040264500A1 · Bansal · 2004 [cited by examiner]
US 20050102297A1 · Lloyd · 2005 [cited by examiner]
US 20070282986A1 · Childress · 2007 [cited by examiner]
US 20120002544A1 · Kokku · 2012 [cited by examiner]
US 20140096188A1 · Mont · 2014 [cited by examiner]
US 20180091431A1 · Burbridge · 2018 [cited by examiner]
US 20180300174A1 · Karanasos · 2018 [cited by examiner]
US 20190020572A1 · Hu · 2019 [cited by examiner]
US 20190044882A1 · Poorchandran · 2019 [cited by examiner]
US 20200412659A1 · Arditti Ilitzky · 2020 [cited by examiner]
US 20210092068A1 · Ismailsheriff · 2021 [cited by examiner]
US 20210112006A1 · Francini · 2021 [cited by examiner]
US 20210187733A1 · Lee · 2021 [cited by examiner]
US 20220179888A1 · Wang · 2022 [cited by examiner]
US 20220327198A1 · Simpson · 2022 [cited by examiner]
US 20230003826A1 · Parker · 2023 [cited by examiner]
US 20230148158A1 · Bandarupalli · 2023 [cited by examiner]
US 20230155960A1 · Lee · 2023 [cited by examiner]
US 20230319163A1 · Forero · 2023 [cited by examiner]
US 20240388541A1 · Tourrilhes · 2024 [cited by examiner]
US 20250016105A1 · Forero · 2025 [cited by examiner]
US 20250168084A1 · Pham · 2025 [cited by examiner]
US 20250219951A1 · Gupta · 2025 [cited by examiner]
US 20250286824A1 · Zhou · 2025 [cited by examiner]
US 20250292091A1 · Smith · 2025 [cited by examiner]
US 20250338163A1 · Mamidwar · 2025 [cited by examiner]
Kok-Lim Alvin Yau 1, (Senior Member, IEEE), Aqeel Raza SYED2, Wahidah HASHIM3 , (Member, IEEE), Junaid Qadir 4, (Senior Member, IEEE), Celimuge Wu 5, (Member, IEEE), and Najmul Hassan, Maritime Networking: Bringing Inte… [cited by examiner]
Pedro A. Forero, P. Zhang, and D. Radosevic; Active Queue-Management Policies for Undersea Networking via Deep Reinforcement Learning; OCEANS 2021: San Diego—Porto, San Diego, CA, USA, 2021, pp. 1-8, doi: 10.23919/OCEAN… [cited by applicant]