IP Library › Granted Patent US 12,155,578
Granted Patent B2
US 12,155,578 · App. 18/258,904 · Granted Nov 26, 2024

Packet forwarding method, electronic device, and storage medium

Inventors: Xiangyang Zhu (Shenzhen, CN); Jinghai Yu (Shenzhen, CN)
Assignee: ZTE CORPORATION
H04L47/6225H04L47/17H04L47/2483
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,155,578
App. No.
18/258,904
Granted
Nov 26, 2024
Kind
B2
Abstract

A packet forwarding method, an electronic device, and a storage medium are disclosed. The method may include: determining a flow identifier of the service flow; determining a basic time slot number of a first packet in the service flow according to the flow identifier; determining a time slot offset of the first node for the service flow according to the flow identifier; and determining an enqueue slot number of the first packet according to the basic time slot number and the time slot offset.

Claims (44)

1. A method for packet forwarding, which is applied to a first node through which a forwarding path of a service flow passes, the method comprising,

determining a flow identifier of the service flow;

determining a basic time slot number of a first packet in the service flow according to the flow identifier;

determining a time slot offset of the first node for the service flow according to the flow identifier; and

determining an enqueue slot number of the first packet according to the basic time slot number and the time slot offset;

wherein determining the time slot offset of the first node for the service flow according to the flow identifier comprises,

looking up a time slot interval and a quantity of time slots corresponding to the flow identifier from the preset list of cyclic scheduling parameters, according to the flow identifier;

acquiring a delay reference value of the first node, and determining a delay interval according to the delay reference value and the time slot interval;

acquiring a slot number of a currently scheduled slot by the first node; and

determining the time slot offset according to the basic time slot number, the slot number of the currently scheduled slot, the delay interval and the quantity of time slots.

2. The method according to claim 1 , wherein determining the basic time slot number of the first packet in the service flow according to the flow identifier comprises,

looking up a mapping rule corresponding to the flow identifier from a preset list of cyclic scheduling parameters according to the flow identifier, wherein the mapping rule comprises information for indicating a key field for mapping;

determining a value of the key field from the packet header of the first packet according to the information for indicating the key field; and

determining the basic time slot number mapped to the value of the key field according to the mapping rule.

3. The method according to claim 1 , wherein determining the time slot offset of the first node for the service flow according to the flow identifier comprises,

looking up the time slot offset corresponding to the flow identifier from the preset list of cyclic scheduling parameters, according to the flow identifier.

4. The method according to claim 1 , wherein after determining the time slot offset according to the basic time slot number, the slot number of the currently scheduled slot, the delay interval and the quantity of time slots, the method further comprises,

recording the time slot offset in the preset list of cyclic scheduling parameters.

5. The method according to claim 2 , wherein the list of cyclic scheduling parameters is preset in each node through which the forwarding path of the service flow passes, and the list of cyclic scheduling parameters is utilized to direct each node to perform cyclic round-robin scheduling.

6. The method according to claim 1 , further comprising,

sending the first packet to a next hop node, in response to the round-robin scheduling proceeding to the first packet with the enqueue slot number.

7. The method according to claim 1 , wherein determining the flow identifier of the service flow comprises,

identifying a type of the service flow received;

determining a field where the flow identifier is located, according to the type of the service flow; and

extracting the flow identifier from a packet header of the service flow according to the field where the flow identifier is located.

8. A first node, which is a node through which a forwarding path of a service flow passes, the node comprising,

a processor;

a first determining module, which is configured to determine a flow identifier of the service flow;

a second determining module, which is configured to determine a basic time slot number of a first packet in the service flow according to the flow identifier;

a third determining module, which is configured to determine a time slot offset of the first node for the service flow according to the flow identifier; and

a fourth determining module, which is configured to determine an enqueue slot number of the first packet according to the basic time slot number and the slot offset;

wherein determining the time slot offset of the first node for the service flow according to the flow identifier comprises,

looking up a time slot interval and a quantity of time slots corresponding to the flow identifier from the preset list of cyclic scheduling parameters, according to the flow identifier;

acquiring a delay reference value of the first node, and determining a delay interval according to the delay reference value and the time slot interval;

acquiring a slot number of a currently scheduled slot by the first node; and

determining the time slot offset according to the basic time slot number, the slot number of the currently scheduled slot, the delay interval and the quantity of time slots.

9. An electronic device, comprising a memory, a processor and a computer program stored in the memory and executable by the processor which, when executed by the processor causes the processor to carry out the method of claim 1 .

10. A computer readable storage medium storing a computer program, which when executed by a processor, causes the processor to carry out the method of claim 1 .

11. The method according to claim 3 , wherein the list of cyclic scheduling parameters is preset in each node through which the forwarding path of the service flow passes, and

the list of cyclic scheduling parameters is utilized to directed direct each node to perform cyclic round-robin scheduling.

12. The method according to claim 1 , wherein the list of cyclic scheduling parameters is preset in each node through which the forwarding path of the service flow passes, and

the list of cyclic scheduling parameters is utilized to directed direct each node to perform cyclic round-robin scheduling.

13. The method according to claim 4 , wherein the list of cyclic scheduling parameters is preset in each node through which the forwarding path of the service flow passes, and

the list of cyclic scheduling parameters is utilized to directed direct each node to perform cyclic round-robin scheduling.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2023
From: ZHU, XIANGYANG; YU, JINGHAI
To: ZTE CORPORATION
Reel/Frame 064030/0665 →
Priority Claims (1)
CN 202110235437.3 · Mar 3, 2021 · national
Continuity (1)
Related Publication 20240048502A1 · Feb 8, 2024