# US 2026/0173088 A1 · Method and apparatus for processing deterministic service

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

- Number: US 2026/0173088 A1
- Document ID: US20260173088A1
- Status: Published application
- Kind: A1
- Application number: 19/124,423
- Filed: 2023-10-18
- Published: 2026-06-18
- Earliest claimed: 2022-11-04
- Assignees: China Mobile Communication Co., Ltd Research Institute; China Mobile Communications Group Co., Ltd.
- Applicants: China Mobile Communication Co., Ltd Research Institute; China Mobile Communications Group Co., Ltd.
- Inventors: Peng LIU; Zongpeng DU; Zhiqiang LI
- Web page: https://patentgrep.com/patent/US20260173088A1

## CPC

- H04L 47/58: {Changing or combining different scheduling modes, e.g. multimode scheduling}
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L 47/10: Flow control; Congestion control
- H04L 47/50: Queue scheduling
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- 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

A method and apparatus for processing a deterministic service are provided, which relate to the field of communication technology. The method includes: determining a target forwarding path according to the deterministic service demand, wherein the target forwarding path includes at least two network nodes; in the case that the queuing scheduling mechanisms corresponding to the at least two network nodes are different, determining the target scheduling parameter corresponding to each of the at least two network nodes according to the queuing scheduling mechanism parameters corresponding to the routing nodes, wherein the target scheduling parameter includes a queuing identifier and a queuing parameter corresponding to the queuing identifier; or the target scheduling parameter includes a queuing identifier, and the queuing identifier is used to indicate the queuing scheduling mechanism corresponding to the network node; and sending the target scheduling parameters to a deterministic service forwarding unit.

## Claims

### Claim 1

A method for processing of a deterministic network service applied in it's control plane, the method comprising:
determining a target forwarding path according to a deterministic service demand, wherein the target forwarding path comprises at least two network devices;
when the at least two network devices use at least two different queuing scheduling mechanisms determining target scheduling parameters according to original queuing parameters of them, comprising a queuing identifier and it's corresponding queuing parameters, or comprising only the queuing identifier indicating the queuing mechanism of the network device;
sending the target scheduling parameter to a deterministic network data plane.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the queuing scheduling mechanisms comprise at least two scheduling mechanisms of a Time-Aware Shaper (TAS) scheduling mechanism, a Cycle Queuing Forwarding (CQF) scheduling mechanism, and a deadline time based scheduling mechanism.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the queuing scheduling mechanisms comprise a Time-Aware Shaper (TAS) scheduling mechanism and a Cycle Queuing Forwarding (CQF) scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the TAS gate list is used to indicate a time at which each network device sends a message; and
the determining the target scheduling parameters according to original queuing parameters of them comprises:
in the case that a queuing scheduling mechanism corresponding to a first network device is the TAS scheduling mechanism, determining, according to the TAS gate list and a first CQF delay, a time at which the first network device sends or receives a message; wherein in the target forwarding path, it reaches the first network device from a second network device via number N of third network devices, the second network device corresponds to the TAS scheduling mechanism, the third network device corresponds to the CQF scheduling mechanism, and the first CQF delay is determined according to the number N and the CQF period; and/or
in the case that a queuing scheduling mechanism corresponding to a fourth network device is the CQF scheduling mechanism, determining, according to a size relationship between the first delay and the CQF period, a CQF period corresponding to a time at which the fourth network device sends a message and/or a CQF period corresponding to a time at which the fourth network device receives a message;
wherein, in the target forwarding path, it reaches the fourth network device from a fifth network device via number M of sixth network devices, the fifth network device corresponds to the CQF scheduling mechanism, the sixth network device corresponds to the TAS scheduling mechanism, and the first delay is determined according to a time during which the message determined according to the TAS gate list is transmitted between the number M of sixth network devices.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the queuing scheduling mechanisms comprise a Cycle Queuing Forwarding (CQF) scheduling mechanism and a deadline time based scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device; and
the determining the target scheduling parameters according to original queuing parameters of them comprises:
in the case that a queuing scheduling mechanism corresponding to a seventh network device is the deadline time based scheduling mechanism, determining, according to a second CQF delay and an expected remaining time corresponding to the seventh network device, an actual remaining time corresponding to the seventh network device; wherein in the target forwarding path, it reaches the seventh network device from an eighth network device via number P of ninth network devices, the eighth network device corresponds to the deadline time based scheduling mechanism, the ninth network device corresponds to the CQF scheduling mechanism, and the second CQF delay is determined according to the number P and the CQF period; and/or
in the case that a queuing scheduling mechanism corresponding to a tenth network device is the CQF scheduling mechanism, determining, according to a size relationship between a ratio of a second delay to a CQF period and a preset threshold, a CQF period corresponding to a time at which the tenth network device sends a message and/or a CQF period corresponding to a time at which the tenth network device receives a message; wherein in the target forwarding path, it reaches the tenth network device from an eleventh network device via number Q of twelfth network devices, the tenth network device corresponds to the CQF scheduling mechanism, the eleventh network device corresponds to the deadline time based scheduling mechanism, and the second delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number Q of twelfth network devices.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the queuing scheduling mechanisms comprise a Time-Aware Shaper (TAS) scheduling mechanism and a deadline time based scheduling mechanism, and the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, and the TAS gate list is used to indicate a time at which each network device sends a message; the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device;
the determining the target scheduling parameters according to original queuing parameters of them comprises:
in the case that a queuing scheduling mechanism corresponding to a thirteenth network device is the TAS scheduling mechanism, determining, according to the TAS gate list and a third delay, a time at which the thirteenth network device sends or receives a message; wherein in the target forwarding path, it reaches the thirteenth network device from a fourteenth network device via number L of fifteenth network devices, the fifteenth network device corresponds to the TAS scheduling mechanism, the fourteenth network device corresponds to the deadline time based scheduling mechanism, and the third delay is determined according to a time during which the message is transmitted between the number L of fifteenth network devices; and/or
in the case that a queuing scheduling mechanism corresponding to the fifteenth network device is the deadline time based scheduling mechanism, determining, according to a fourth delay, an actual remaining time corresponding to the fifteenth network device; wherein in the target forwarding path, it reaches the fifteenth network device from a sixteenth network device via number S of sixteenth network devices, the sixteenth network device corresponds to the deadline time based scheduling mechanism, the sixteenth network device corresponds to the TAS scheduling mechanism, and the fourth delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number S of sixteenth network devices.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the sending the target scheduling parameter to the deterministic network data plane comprises:
encapsulating the target scheduling parameter using an Internet Protocol version 6(IPv6 ) extension header and/or a Differentiated Services Code Point (DSCP) field and sending the encapsulated target scheduling parameter to the deterministic network data plane; the target scheduling parameter is used by the network device to identify the target scheduling parameter and perform corresponding queuing scheduling processing.

### Claim 7

A method for processing of a deterministic service, applied to a deterministic network data plane, the method comprising:
obtaining a target scheduling parameter corresponding to each network device in a target forwarding path, wherein the target forwarding path comprises at least two network devices, and the queuing scheduling mechanisms corresponding to the at least two network nodes are different, the target scheduling parameter is determined according to the queuing scheduling mechanism parameters corresponding to the at least two network devices, wherein the target scheduling parameter comprises a queuing identifier and a queuing parameter corresponding to the queuing identifier; or the target scheduling parameter comprises a queuing identifier, and the queuing identifier is used to indicate the queuing scheduling mechanism corresponding to the network device;
controlling each of the network devices to forward a message according to the target scheduling parameter.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the queuing scheduling mechanisms corresponding to the at least two network nodes comprise a Time-Aware Shaper (TAS) scheduling mechanism and a Cycle Queuing Forwarding (CQF) scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the TAS gate list is used to indicate a time at which each network device sends a message; and
the obtaining the target scheduling parameter corresponding to each network device in the target forwarding path comprises:
in the case that a target scheduling parameter of a fourth network device comprises a queuing identifier, and the queuing identifier indicates that a scheduling mechanism corresponding to the fourth network device is the CQF scheduling mechanism, determining, according to a size relationship between a first delay and a CQF period, a CQF period corresponding to a time at which the fourth network device sends a message and/or a CQF period corresponding to a time at which the fourth network device receives a message; wherein, in the target forwarding path, it reaches the fourth network device from a fifth network device via number M of sixth network devices, the fifth network device corresponds to the CQF scheduling mechanism, the sixth network device corresponds to the TAS scheduling mechanism, and the first delay is determined according to a time during which the message determined according to the TAS gate list is transmitted between the number M of sixth network devices.

### Claim 9 (depends on 7)

The method according to claim 7, wherein the queuing scheduling mechanisms corresponding to the at least two network nodes comprise a Cycle Queuing Forwarding (CQF) scheduling mechanism and a deadline time based scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device; and
the obtaining the target scheduling parameter corresponding to each network device in the target forwarding path comprises:
in the case that a target scheduling parameter corresponding to a seventh network device comprises a queuing identifier, and the queuing identifier indicates that a queuing scheduling mechanism corresponding to the seventh network device is the deadline time based scheduling mechanism, determining, according to a second CQF delay and an expected remaining time corresponding to the seventh network device, an actual remaining time corresponding to the seventh network device; wherein in the target forwarding path, it reaches the seventh network device from an eighth network device via number P of ninth network devices, the eighth network device corresponds to the deadline deadline time based scheduling mechanism, the ninth network device corresponds to the CQF scheduling mechanism, and the second CQF delay is determined according to the number P and the CQF period; and/or
in the case that the target scheduling parameter corresponding to a tenth network device comprises a queuing identifier, and the queuing identifier indicates that the queuing scheduling mechanism corresponding to a tenth network device is a CQF scheduling mechanism, determining, according to a size relationship between a ratio of a second delay to a CQF period and a preset threshold, a CQF period corresponding to a time at which the tenth network device sends a message and/or a CQF period corresponding to a time at which the tenth network device receives a message; wherein in the target forwarding path, it reaches the tenth network device from an eleventh network device via number Q of twelfth network devices, the tenth network device corresponds to the CQF scheduling mechanism, the eleventh network device corresponds to the deadline time based scheduling mechanism, and the second delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number Q of twelfth network devices.

### Claim 10 (depends on 7)

The method according to claim 7, wherein the queuing scheduling mechanisms corresponding to the at least two network nodes comprise a Time-Aware Shaper (TAS) scheduling mechanism and a deadline time based scheduling mechanism, and the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, and the TAS gate list is used to indicate a time at which each network device sends a message; the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device;
the obtaining the target scheduling parameter corresponding to each network device in the target forwarding path comprises:
in the case that a target scheduling parameter of a fifteenth network device comprises a queuing identifier, and the queuing identifier indicates that a queuing scheduling mechanism corresponding to the fifteenth network device is the deadline time based scheduling mechanism, determining, according to a fourth delay, an actual remaining time corresponding to the fifteenth network device; wherein in the target forwarding path, it reaches the fifteenth network device from a sixteenth network device via number S of sixteenth network devices, the sixteenth network device corresponds to the based deadline time based scheduling mechanism, the sixteenth network device corresponds to the TAS scheduling mechanism, and the fourth delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number S of sixteenth network devices.

### Claim at position 11

11-14. (canceled)

### Claim 15

A deterministic service processing apparatus, comprising: a transceiver, a processor, a memory, and a program or instruction stored in the memory and executable on the processor; wherein, the processor is configured to execute the program or the instruction to implement a method for processing of a deterministic network service applied in it's control plane, comprising:
determining a target forwarding path according to a deterministic service demand, wherein the target forwarding path comprises at least two network devices;
when the at least two network devices use at least two different queuing scheduling mechanisms, determining target scheduling parameters according to original queuing parameters of them, comprising a queuing identifier and it's corresponding queuing parameters, or comprising only the queuing identifier indicating the queuing mechanism of the network device;
sending the target scheduling parameter to a deterministic network data plane.

### Claim 16

(canceled)

### Claim 17 (depends on 7)

A deterministic service processing apparatus, comprising: a transceiver, a processor, a memory, and a program or instruction stored in the memory and executable on the processor; wherein, the processor is configured to execute the program or the instruction to implement the steps of the method according to claim 7.

### Claim 18 (depends on 15)

The deterministic service processing apparatus according to claim 15, wherein the queuing scheduling mechanisms comprise at least two scheduling mechanisms of a Time-Aware Shaper (TAS) scheduling mechanism, a Cycle Queuing Forwarding (CQF) scheduling mechanism, and a deadline time based scheduling mechanism.

### Claim 19 (depends on 15)

The deterministic service processing apparatus according to claim 15, wherein the queuing scheduling mechanisms comprise a Time-Aware Shaper (TAS) scheduling mechanism and a Cycle Queuing Forwarding (CQF) scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the TAS gate list is used to indicate a time at which each network device sends a message; and
the determining the target scheduling parameters according to original queuing parameters of them comprises:
in the case that a queuing scheduling mechanism corresponding to a first network device is the TAS scheduling mechanism, determining, according to the TAS gate list and a first CQF delay, a time at which the first network device sends or receives a message; wherein in the target forwarding path, it reaches the first network device from a second network device via number N of third network devices, the second network device corresponds to the TAS scheduling mechanism, the third network device corresponds to the CQF scheduling mechanism, and the first CQF delay is determined according to the number N and the CQF period; and/or
in the case that a queuing scheduling mechanism corresponding to a fourth network device is the CQF scheduling mechanism, determining, according to a size relationship between the first delay and the CQF period, a CQF period corresponding to a time at which the fourth network device sends a message and/or a CQF period corresponding to a time at which the fourth network device receives a message; wherein, in the target forwarding path, it reaches the fourth network device from a fifth network device via number M of sixth network devices, the fifth network device corresponds to the CQF scheduling mechanism, the sixth network device corresponds to the TAS scheduling mechanism, and the first delay is determined according to a time during which the message determined according to the TAS gate list is transmitted between the number M of sixth network devices.

### Claim 20 (depends on 15)

The deterministic service processing apparatus according to claim 15, wherein the queuing scheduling mechanisms comprise a Cycle Queuing Forwarding (CQF) scheduling mechanism and a deadline time based scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device; and
the determining the target scheduling parameters according to original queuing parameters of them comprises:
in the case that a queuing scheduling mechanism corresponding to a seventh network device is the deadline time based scheduling mechanism, determining, according to a second CQF delay and an expected remaining time corresponding to the seventh network device, an actual remaining time corresponding to the seventh network device; wherein in the target forwarding path, it reaches the seventh network device from an eighth network device via number P of ninth network devices, the eighth network device corresponds to the deadline time based scheduling mechanism, the ninth network device corresponds to the CQF scheduling mechanism, and the second CQF delay is determined according to the number P and the CQF period; and/or
in the case that a queuing scheduling mechanism corresponding to a tenth network device is the CQF scheduling mechanism, determining, according to a size relationship between a ratio of a second delay to a CQF period and a preset threshold, a CQF period corresponding to a time at which the tenth network device sends a message and/or a CQF period corresponding to a time at which the tenth network device receives a message; wherein in the target forwarding path, it reaches the tenth network device from an eleventh network device via number Q of twelfth network devices, the tenth network device corresponds to the CQF scheduling mechanism, the eleventh network device corresponds to the deadline time based scheduling mechanism, and the second delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number Q of twelfth network devices.

### Claim 21 (depends on 15)

The deterministic service processing apparatus according to claim 15, wherein the queuing scheduling mechanisms comprise a Time-Aware Shaper (TAS) scheduling mechanism and a deadline time based scheduling mechanism, and the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, and the TAS gate list is used to indicate a time at which each network device sends a message; the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device;
the determining the target scheduling parameters according to original queuing parameters of them comprises:
in the case that a queuing scheduling mechanism corresponding to a thirteenth network device is the TAS scheduling mechanism, determining, according to the TAS gate list and a third delay, a time at which the thirteenth network device sends or receives a message; wherein in the target forwarding path, it reaches the thirteenth network device from a fourteenth network device via number L of fifteenth network devices, the fifteenth network device corresponds to the TAS scheduling mechanism, the fourteenth network device corresponds to the deadline time based scheduling mechanism, and the third delay is determined according to a time during which the message is transmitted between the number L of fifteenth network devices; and/or
in the case that a queuing scheduling mechanism corresponding to the fifteenth network device is the deadline time based scheduling mechanism, determining, according to a fourth delay, an actual remaining time corresponding to the fifteenth network device; wherein in the target forwarding path, it reaches the fifteenth network device from a sixteenth network device via number S of sixteenth network devices, the sixteenth network device corresponds to the deadline time based scheduling mechanism, the sixteenth network device corresponds to the TAS scheduling mechanism, and the fourth delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number S of sixteenth network devices.

### Claim 22 (depends on 15)

The deterministic service processing apparatus according to claim 15, wherein the sending the target scheduling parameter to the deterministic network data plane comprises:
encapsulating the target scheduling parameter using an Internet Protocol version 6(IPv6 ) extension header and/or a Differentiated Services Code Point (DSCP) field and sending the encapsulated target scheduling parameter to the deterministic network data plane; the target scheduling parameter is used by the network device to identify the target scheduling parameter and perform corresponding queuing scheduling processing.

### Claim 23 (depends on 17)

The deterministic service processing apparatus according to claim 17, wherein the queuing scheduling mechanisms corresponding to the at least two network nodes comprise a Time-Aware Shaper (TAS) scheduling mechanism and a Cycle Queuing Forwarding (CQF) scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the TAS gate list is used to indicate a time at which each network device sends a message; and
the obtaining the target scheduling parameter corresponding to each network device in the target forwarding path comprises:
in the case that a target scheduling parameter of a fourth network device comprises a queuing identifier, and the queuing identifier indicates that a scheduling mechanism corresponding to the fourth network device is the CQF scheduling mechanism, determining, according to a size relationship between a first delay and a CQF period, a CQF period corresponding to a time at which the fourth network device sends a message and/or a CQF period corresponding to a time at which the fourth network device receives a message; wherein, in the target forwarding path, it reaches the fourth network device from a fifth network device via number M of sixth network devices, the fifth network device corresponds to the CQF scheduling mechanism, the sixth network device corresponds to the TAS scheduling mechanism, and the first delay is determined according to a time during which the message determined according to the TAS gate list is transmitted between the number M of sixth network devices.

### Claim 24 (depends on 17)

The deterministic service processing apparatus according to claim 17, wherein the queuing scheduling mechanisms corresponding to the at least two network nodes comprise a Cycle Queuing Forwarding (CQF) scheduling mechanism and a deadline time based scheduling mechanism, the queuing scheduling mechanism parameter corresponding to the CQF scheduling mechanism comprises a CQF period, and the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device; and
the obtaining the target scheduling parameter corresponding to each network device in the target forwarding path comprises:
in the case that a target scheduling parameter corresponding to a seventh network device comprises a queuing identifier, and the queuing identifier indicates that a queuing scheduling mechanism corresponding to the seventh network device is the deadline time based scheduling mechanism, determining, according to a second CQF delay and an expected remaining time corresponding to the seventh network device, an actual remaining time corresponding to the seventh network device; wherein in the target forwarding path, it reaches the seventh network device from an eighth network device via number P of ninth network devices, the eighth network device corresponds to the deadline time based scheduling mechanism, the ninth network device corresponds to the CQF scheduling mechanism, and the second CQF delay is determined according to the number P and the CQF period; and/or
in the case that the target scheduling parameter corresponding to a tenth network device comprises a queuing identifier, and the queuing identifier indicates that the queuing scheduling mechanism corresponding to a tenth network device is a CQF scheduling mechanism, determining, according to a size relationship between a ratio of a second delay to a CQF period and a preset threshold, a CQF period corresponding to a time at which the tenth network device sends a message and/or a CQF period corresponding to a time at which the tenth network device receives a message; wherein in the target forwarding path, it reaches the tenth network device from an eleventh network device via number Q of twelfth network devices, the tenth network device corresponds to the CQF scheduling mechanism, the eleventh network device corresponds to the deadline time based scheduling mechanism, and the second delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number Q of twelfth network devices.

### Claim 25 (depends on 17)

The deterministic service processing apparatus according to claim 17, wherein the queuing scheduling mechanisms corresponding to the at least two network nodes comprise a Time-Aware Shaper (TAS) scheduling mechanism and a deadline time based scheduling mechanism, and the queuing scheduling mechanism parameter corresponding to the TAS scheduling mechanism comprises a TAS gate list, and the TAS gate list is used to indicate a time at which each network device sends a message; the queuing scheduling mechanism parameter corresponding to the deadline time based scheduling mechanism comprises an expected remaining time of each network device;
the obtaining the target scheduling parameter corresponding to each network device in the target forwarding path comprises:
in the case that a target scheduling parameter of a fifteenth network device comprises a queuing identifier, and the queuing identifier indicates that a queuing scheduling mechanism corresponding to the fifteenth network device is the deadline time based scheduling mechanism, determining, according to a fourth delay, an actual remaining time corresponding to the fifteenth network device; wherein in the target forwarding path, it reaches the fifteenth network device from a sixteenth network device via number S of sixteenth network devices, the sixteenth network device corresponds to the deadline time based scheduling mechanism, the sixteenth network device corresponds to the TAS scheduling mechanism, and the fourth delay is determined according to a time during which the message determined by the TAS gate list is transmitted between the number S of sixteenth network devices.
