公开(公告)号：US20220386406A1

公开(公告)日：2022-12-01

申请号：US17773695

申请日：2020-10-22

Applicant: ZTE CORPORATION

Inventor： Juntao WANG ,  Gaopeng DU ,  Min YANG ,  Pengzhou YAN ,  Yi YANG

IPC: H04W76/27 ,  H04W36/00 ,  H04W76/15

Abstract: The present application provides an intersecting procedure processing method, an intersecting procedure processing device, an apparatus and a storage medium. The method, applied to a master node, includes: receiving a secondary node procedure message sent by a secondary node; and determining a service processing procedure according to a scenario of a master node service, a scenario of the secondary node procedure and a preset priority of service scenarios, a handover scenario of the secondary node procedure is determined by the secondary node procedure message.

公开(公告)号：US20150207747A1

公开(公告)日：2015-07-23

申请号：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.

Abstract translation: 在本发明的实施例中公开了一种队列调度方法和装置，所述方法包括：通过使用第一循环链路列表对一个或多个队列进行索引; 通过使用第一循环链接列表的前指针分别访问一个或多个队列，并且从每个队列的权重中间值中减去在队列的头部被调度的单元的值所获得的值被视为 队列的剩余重量中间值; 当第一循环链路列表中的一个队列的权重中间值小于在队列头部要调度的单元时，从第一循环链路列表中删除该队列，并且将权重中间值更新为 队列的设定权重值和剩余权重中间值; 从第一循环链接列表中删除的队列与第二循环链接列表相关联。 本发明使调度能够支持任意数量的队列，并且在硬件实现逻辑核心不改变的情况下支持扩展队列数量。