-
公开(公告)号:US20190109787A1
公开(公告)日:2019-04-11
申请号:US16209699
申请日:2018-12-04
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
IPC: H04L12/747 , H04L12/823 , H04L12/707 , H04L12/873 , H04L12/801
Abstract: This application provides a method for transmitting data streams. The data streams include a first data stream whose encoded form is a fountain code. A first intermediate node receives an encoded packet sent by a source node or a second intermediate node, where the encoded packet is a packet obtained by encoding an original packet of the first data stream with a fountain code technology. The first intermediate node drops the encoded packet in case of usage of a first cache queue exceeds a threshold, where the first cache queue is a cache queue in the first intermediate node and is allocated to the first data stream.
-
公开(公告)号:US20230026626A1
公开(公告)日:2023-01-26
申请号:US17955698
申请日:2022-09-29
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Inventor: Rahul Arvind JADHAV , Qiangde XIE , Jing ZUO
IPC: H04L45/745 , H04L45/24 , H04L45/42
Abstract: This application discloses a route information storage method. The method is applied to a wireless mesh network, the wireless mesh network includes a first node, a second node, and at least two stations STAs, the first node is an upper-level node of the second node, the at least two STAs include a first STA and a second STA, and the first STA and the second STA are connected to the second node. In the method, the first node receives a routing request for access requested by the first STA, and if it is determined that a first route entry corresponding to the second STA already exists, the first node no longer generates a new route entry for the first STA, but reuses the first route entry.
-
公开(公告)号:US20200259748A1
公开(公告)日:2020-08-13
申请号:US16858920
申请日:2020-04-27
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Inventor: Tong LI , Ke XU , Jing ZUO , Fanzhao WANG , Kai ZHENG
IPC: H04L12/803 , H04L12/911 , H04L12/707 , H04L12/721
Abstract: A link detection technology. In a link detection method, when a target event occurs on paths, in a plurality of paths, whose quantity exceeds a preset quantity, whether the paths on which the target event occurs share a bottleneck link is detected, and congestion control is performed. It can be learned that in the technical solution provided in the embodiments of this application, the target event is a trigger, and shared bottleneck detection is performed after the quantity of the paths on which the target event occurs exceeds the preset quantity. This implements purposeful link detection, reduces system overheads, and brings a fast convergence speed.
-
-