公开(公告)号：US12278768B2

公开(公告)日：2025-04-15

申请号：US17703472

申请日：2022-03-24

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Qiwen Zhong ,  Chunsheng Yang ,  Zhigang Zhu

IPC: H04L47/22 ,  H04L5/00 ,  H04L5/22 ,  H04L47/62 ,  H04L47/72

Abstract: This application discloses example service processing methods and apparatuses. One example method includes obtaining a quantity of transmission windows corresponding to each of n services within a unit time period or in a unit data frame, wherein the unit time period or the unit data frame comprises m transmission windows, a total quantity of transmission windows corresponding to the n services is not greater than m, and both m and n are integers greater than 1. Corresponding transmission windows from the m transmission windows can then be allocated to each service based on the quantity of transmission windows corresponding to each of the n services. Based on the transmission windows corresponding to each service, service data of then services can then be multiplexed into multiplexed data transmitted in one channel. The multiplexed data can then be sent.

公开(公告)号：US20250048345A1

公开(公告)日：2025-02-06

申请号：US18924571

申请日：2024-10-23

Applicant: Huawei Technologies Co., Ltd.

Inventor： Chunsheng Yang ,  Qiwen Zhong ,  Renlei Wang

IPC: H04W72/0446 ,  H04W4/40

Abstract: Methods, systems, and devices are provided, including obtaining a first total quantity of slots and a first quantity of slots required by a first service, determining a first palindromic sequence based on the first total quantity, the first palindromic sequence including a plurality of first bases with a same quantity as the first total quantity, and each first basis type in the plurality of first bases indicating a quantity of slots of a first basis, and allocating a slot to the first service based on the first quantity, where the first quantity is a sum of a plurality of products, the plurality of products is determined by, for each first basis of the first bases, multiplying the first basis with a corresponding first basis coefficient, each first basis coefficient being used to determine a quantity of slots, of the corresponding first basis, to be occupied by the first service.

公开(公告)号：US20230171024A1

公开(公告)日：2023-06-01

申请号：US18161605

申请日：2023-01-30

Applicant: Huawei Technologies Co., Ltd.

Inventor： Desheng Sun ,  Li Ding ,  Chunsheng Yang

IPC: H04L1/00 ,  H04L1/1867

CPC classification number: H04L1/0041 ,  H04L1/1874 ,  H04L1/0045

Abstract: A bit block sending method includes generating at least one first bit block, where the at least one first bit block is used to feed back whether at least one first packet is correctly received, the at least one first bit block further includes a first sequence field, and the first sequence field is used to carry first sequence information of the at least one first packet, and sending the at least one first bit block.

公开(公告)号：US12133199B2

公开(公告)日：2024-10-29

申请号：US17669423

申请日：2022-02-11

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Qiwen Zhong ,  Zhigang Zhu ,  Chunsheng Yang

IPC: H04W72/02 ,  H04L5/00 ,  H04W28/26 ,  H04W72/0446

CPC classification number: H04W72/02 ,  H04L5/0044 ,  H04W28/26 ,  H04W72/0446

Abstract: A method and an apparatus for transmitting service data are disclosed. In technical solutions of the present disclosure, when an exclusive service does not completely occupy a bandwidth resource allocated to the exclusive service, data transmission of at least two candidate services on an actually unused bandwidth is supported. In this way, a waste of bandwidth resources can be reduced and network utilization can be improved.

公开(公告)号：US20220217091A1

公开(公告)日：2022-07-07

申请号：US17703472

申请日：2022-03-24

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Qiwen Zhong ,  Chunsheng Yang ,  Zhigang Zhu

IPC: H04L47/22 ,  H04L47/62 ,  H04L47/72 ,  H04L5/22 ,  H04L5/00

Abstract: This application discloses example service processing methods and apparatuses. One example method includes obtaining a quantity of transmission windows corresponding to each of n services within a unit time period or in a unit data frame, wherein the unit time period or the unit data frame comprises m transmission windows, a total quantity of transmission windows corresponding to the n services is not greater than m, and both m and n are integers greater than 1. Corresponding transmission windows from the m transmission windows can then be allocated to each service based on the quantity of transmission windows corresponding to each of the n services. Based on the transmission windows corresponding to each service, service data of then services can then be multiplexed into multiplexed data transmitted in one channel. The multiplexed data can then be sent.