-
Patent Agency Ranking
公开(公告)号：US20150304124A1
公开(公告)日：2015-10-22
申请号：US14395831
申请日：2013-08-19
Applicant: ZTE CORPORATION
IPC: H04L12/18 , H04L29/08 , H04L12/801
CPC classification number: H04L12/1881 , H04L47/15 , H04L67/2852
Abstract: A message processing method and device, the method comprises: allocating a node to an input message in a cache space for saving the message, and taking the location corresponding to the cache space as index information of a descriptor of the message; and extracting the descriptor information of the message; framing and saving the descriptor information and node information of the message in a node linked list. The abovementioned solution can achieve uniform memory of unicast and multicast messages, and the descriptor linked list corresponds to the packet entity caching resource, thereby significantly reducing the overheads for managing the unicast and multicast messages, so as to improve the node aggregation capability.
Abstract translation: 一种消息处理方法和装置，所述方法包括：将节点分配到高速缓存空间中的输入消息以保存所述消息，并且将与所述高速缓存空间相对应的位置作为所述消息的描述符的索引信息; 并提取消息的描述符信息; 在节点链表中构建和保存消息的描述符信息和节点信息。 上述解决方案可以实现单播和多播消息的均匀存储，并且描述符链表对应于分组实体缓存资源，从而显着减少用于管理单播和组播消息的开销，从而提高节点聚合能力。
-
公开(公告)号：US09584332B2
公开(公告)日：2017-02-28
申请号：US14395831
申请日：2013-08-19
Applicant: ZTE CORPORATION
IPC: H04L12/18 , H04L12/801 , H04L29/08
CPC classification number: H04L12/1881 , H04L47/15 , H04L67/2852
Abstract: A message processing method and device, the method comprises: allocating a node to an input message in a cache space for saving the message, and taking the location corresponding to the cache space as index information of a descriptor of the message; and extracting the descriptor information of the message; framing and saving the descriptor information and node information of the message in a node linked list. The abovementioned solution can achieve uniform memory of unicast and multicast messages, and the descriptor linked list corresponds to the packet entity caching resource, thereby significantly reducing the overheads for managing the unicast and multicast messages, so as to improve the node aggregation capability.
Abstract translation: 一种消息处理方法和装置，所述方法包括：将节点分配到高速缓存空间中的输入消息以保存所述消息，并且将与所述高速缓存空间相对应的位置作为所述消息的描述符的索引信息; 并提取消息的描述符信息; 在节点链表中构建和保存消息的描述符信息和节点信息。 上述解决方案可以实现单播和多播消息的均匀存储，并且描述符链表对应于分组实体缓存资源，从而显着减少用于管理单播和组播消息的开销，从而提高节点聚合能力。
-
公开(公告)号：US11062604B2
公开(公告)日：2021-07-13
申请号：US16652376
申请日：2018-06-12
Applicant: ZTE CORPORATION
Inventor： Hailei Kang , Wei Huang , Guohua Wei
Abstract: Disclosed are a vehicle warning method and apparatus. The method includes: acquiring real-time information of a vehicle, and determining that an anomaly happens to the vehicle; and sending anomaly information of the vehicle to a nearby terminal by means of short-range wireless communication. In the embodiments of the present disclosure, the short-range wireless communication is adopted, which is convenient and fast, has low costs, is easy to be popularized, and does not depend on 3G/4G or GPS.
-
公开(公告)号：US10511601B2
公开(公告)日：2019-12-17
申请号：US15510311
申请日：2014-11-13
Applicant: ZTE Corporation
Inventor： Wei Huang , Haifei Wang , Weiwei Hao
Abstract: A security control method for a social network user, a social application device and a terminal are provided. The method includes: when information is exchanged between users, a local-end social application acquires the security control authority of a local-end user set by an opposite-end user, and the local-end social application controls, according to the security control authority of the local-end user, the copying operation and the screen capturing operation of the local-end user on the information exchanged.
-
公开(公告)号：US09288154B2
公开(公告)日：2016-03-15
申请号：US14061824
申请日：2013-10-24
Applicant: ZTE CORPORATION
Inventor： Yi Yang , Wei Huang , Mingshi Sun
IPC: H04L12/863
CPC classification number: H04L47/6225 , H04L47/623 , H04L47/6295
Abstract: A queue scheduling method and apparatus is disclosed in the embodiments of the present invention, the method comprises: one or more queues are indexed by using a first circulation link list; one or more queues are accessed respectively by using the front pointer of the first circulation link list, and the value acquired from subtracting a value of a unit to be scheduled at the head of the queue from a weight middle value of each queue is treated as the residual weight middle value of the queue; when the weight middle value of one queue in the first circulation link list is less than the unit to be scheduled at the head of the queue, the queue is deleted from the first circulation link list and the weight middle value is updated with the sum of a set weight value and the residual weight middle value of the queue; the queue deleted from the first circulation link list is linked with a second circulation link list. The present invention enables the scheduling to support any number of queues, and supports the expansion of the number of queues under the circumstances that the hardware implementation logic core is not changed.
-
-
-
-
Search Results
5
records
(took 0.012 seconds)
