# US 2026/0089103 A1 · Technologies for congestion detection in wireless networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0089103 A1
- Document ID: US20260089103A1
- Status: Published application
- Kind: A1
- Application number: 19/111,764
- Filed: 2022-09-29
- Published: 2026-03-26
- Earliest claimed: 2022-09-23
- Assignees: Apple Inc.
- Applicants: Apple Inc.
- Inventors: Ralf Rossbach; Fangli Xu; Bobby Jose; Vijay Venkataraman; Srinivas Reddy Mudireddy; Ping-Heng Kuo; Haijing Hu
- Web page: https://patentgrep.com/patent/US20260089103A1

## CPC

- H04L 47/11: Identifying congestion
- H04L 47/20: Traffic policing
- H04L 47/283: in response to processing delays, e.g. caused by jitter or round trip time [RTT]
- H04W 28/0231: {based on communication conditions (dynamic wireless traffic scheduling definition based on channel quality criteria H04W72/54)}
- H04W 28/0247: {based on conditions of the access network or the infrastructure network (central resource management H04W28/16)}
- H04W 28/0289: {Congestion control (load shedding arrangements in network planning H04W16/08; performing reselection for handling the traffic H04W36/22; wireless traffic scheduling H04W72/12)}
- H04L 47/127: by using congestion prediction
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

The present application relates to devices and components including apparatus, systems, and methods for detecting congestion in wireless networks.

## Claims

### Claim at position 1

-23. (canceled)

### Claim 24

One or more non-transitory, computer-readable media having instructions that, when executed, cause processor circuitry to:
establish a connection state in which packets of a traffic flow are expected to be received from a device over a wireless interface;
detect a congestion event based the traffic flow; and
provide a congestion experienced (CE) indication within a layer 2 (L2) packet of the traffic flow based on detection of the congestion event.

### Claim 25 (depends on 24)

The one or more non-transitory, computer-readable media of claim 24, wherein to detect the congestion event the processor circuitry is to:
determine that a packet of the traffic flow is not received within an expected period of time.

### Claim 26 (depends on 25)

The one or more non-transitory, computer-readable media of claim 25, wherein the traffic flow is associated with a periodic traffic characteristic and the instructions, when executed, further cause the processor circuitry to:
determine a periodicity associated with the traffic flow based on the periodic traffic characteristic; and
determine the expected period of time based on the periodicity.

### Claim 27 (depends on 26)

The one or more non-transitory, computer-readable media of claim 26, wherein the expected period of time is an integer multiple of the periodicity.

### Claim 28 (depends on 26)

The one or more non-transitory, computer-readable media of claim 26, wherein the instructions, when executed, further cause the processor circuitry to:
set a timer or counter based on the periodicity; and
detect the congestion event based on a value of the timer or counter.

### Claim 29 (depends on 26)

The one or more non-transitory, computer-readable media of claim 26, wherein the periodic traffic characteristic is defined based on a configured grant or semi-persistent scheduling of the traffic flow.

### Claim 30 (depends on 25)

The one or more non-transitory, computer-readable media of claim 25, wherein the L2 packet is a first packet and the instructions, when executed, further cause the processor circuitry to:
cause transmission of a second packet to the device,
wherein the expected period of time is based on transmission of the second packet to the device.

### Claim 31 (depends on 24)

The one or more non-transitory, computer-readable media of claim 24, wherein the instructions, when executed, further cause the processor circuitry to:
determine an expected data rate associated with the traffic flow;
determine an actual data rate is less than the expected data rate by a first threshold; and
detect the congestion event based on determination the actual data rate is less than the expected data rate by the first threshold.

### Claim 32 (depends on 24)

The one or more non-transitory, computer-readable media of claim 24, wherein the instructions, when executed, further cause the processor circuitry to:
receive, at an access stratum layer, an indication of a traffic characteristic associated with the traffic flow; and
detect the congestion event based on the traffic characteristic.

### Claim 33 (depends on 24)

The one or more non-transitory, computer-readable media of claim 24, wherein the instructions, when executed, further cause the processor circuitry to:
detect the congestion event at a first layer;
inform a second layer of the congestion event; and
provide the CE indication with the second layer.

### Claim 34 (depends on 24)

The one or more non-transitory, computer-readable media of claim 24, wherein the instructions, when executed, further cause the processor circuitry to:
transmit the L2 packet from a first queue with a priority greater than other L2 packets in the first queue.

### Claim 35

A method comprising:
causing transmission of packets of a traffic flow to a device over a wireless interface;
detecting a congestion event based the traffic flow; and
setting one or more congestion experienced (CE) bits within a layer 2 (L2) packet of the traffic flow based on detecting the congestion event.

### Claim 36 (depends on 35)

The method of claim 35, further comprising:
detecting the congestion event based on a delay budget associated with the traffic flow.

### Claim 37 (depends on 36)

The method of claim 36, further comprising:
detecting the congestion event based on a determination that a transmission of a protocol data unit (PDU) or group of PDUs is not confirmed as successfully transmitted within a predetermined fraction of a packet delay budget, a PDU set delay budget, or a discard timer.

### Claim 38 (depends on 35)

The method of claim 35, further comprising:
comparing a round trip time (RTT) associated with the traffic flow to a predetermined threshold; and
detecting the congestion event based on comparing the RTT to the predetermined threshold.

### Claim 39 (depends on 35)

The method of claim 35, further comprising:
detecting the congestion event based on a number of missing acknowledgments associated with the traffic flow being greater than a predetermined threshold.

### Claim 40 (depends on 35)

The method of claim 35, further comprising:
detecting the congestion event based on a number of radio link control (RLC) or hybrid automatic repeat request (HARQ) retransmissions being greater than a predetermined threshold.

### Claim 41 (depends on 35)

The method of claim 35, further comprising:
detecting a buffer residency time associated with one or more packets of the traffic flow is greater than a predetermined threshold; and
detecting the congestion event based on detecting the buffer residency time is greater than the predetermined threshold.

### Claim 42 (depends on 35)

The method of claim 35, further comprising:
determining a radio quality metric is below a predetermined threshold; and
detecting the congestion event based on determining the radio quality metric is below the predetermined threshold.

### Claim 43 (depends on 35)

The method of claim 35, further comprising:
predicting a quality of a link for the traffic flow will be below a predetermined threshold; and
detecting the congestion event based on predicting the quality of the link will be below the predetermined threshold.
