CN117692402A

CN117692402A - Packet message transmission method, network device and readable storage medium

Info

Publication number: CN117692402A
Application number: CN202211079174.2A
Authority: CN
Inventors: 刘爱华
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-09-05
Filing date: 2022-09-05
Publication date: 2024-03-12
Also published as: WO2024051367A1

Abstract

The application discloses a packet message transmission method, network equipment and a readable storage medium, which belong to the field of wireless communication, wherein the packet message transmission method is executed by first network equipment, and the method comprises the following steps: acquiring at least one packet message to be sent; and configuring the at least one packet message to the first packet virtual time slot frame for transmission.

Description

Packet message transmission method, network device and readable storage medium

Technical Field

The application belongs to the technical field of wireless communication, and particularly relates to a packet message transmission method, network equipment and a readable storage medium.

Background

The Packet network uses Packet messages (commonly called packets) as basic forwarding units, determines forwarding paths and forwarding service quality (Quality of Service, qos) based on information of message headers, and a conventional Packet forwarding Qos system generally adopts a differential service (DiffServ) mode to provide a limited degree of deterministic forwarding capability, especially for delay and jitter performance of forwarding, where the deterministic capability of Packet forwarding depends on traffic arrival characteristics (Traffic Arrival Specification) of bearer services, packet forwarding network forwarding Topology and constraints (Topology & constraints), and instant status of the Packet network, and there is often instant congestion and even Packet loss in the forwarding process. Thus, conventional packet forwarding is considered a Best-effort (Best-effort) forwarding mode and cannot provide deterministic latency and jitter forwarding.

Disclosure of Invention

The embodiment of the application provides a packet message transmission method, network equipment and a readable storage medium, which can solve the problem that the packet message forwarding of deterministic delay and jitter cannot be provided.

In a first aspect, a packet message transmission method is provided, which is executed by a first network device, and the method includes: acquiring at least one packet message to be sent; and configuring the at least one packet message to the first packet virtual time slot frame for transmission.

In a second aspect, a packet message transmission method is provided, which is executed by a third network device, and the method includes: receiving at least one packet message sent by first network equipment through a first packet virtual time slot frame; and transmitting the received at least one packet message in a packet service flow mode based on the arrival time of the at least one packet message.

In a third aspect, there is provided a network device comprising a processor and a memory storing a program or instructions executable on the processor, which when executed by the processor, performs the steps of the method as described in the first aspect, or performs the steps of the method as described in the second aspect.

Fourth, a readable storage medium is provided, on which a program or instructions is stored which, when executed by a processor, carries out the steps of the method according to the first aspect, or carries out the steps of the method according to the second aspect.

In a fifth aspect, there is provided a chip comprising a processor and a communication interface, the communication interface and the processor being coupled, the processor being for running a program or instructions, implementing the steps of the method as described in the first aspect, or implementing the steps of the method as described in the second aspect.

In a sixth aspect, there is provided a computer program/program product stored in a storage medium, the computer program/program product being executable by at least one processor to perform the steps of the method according to the first aspect or to perform the steps of the method according to the second aspect.

In this embodiment of the present application, after obtaining at least one packet to be sent, the first network device configures the at least one packet to be sent in a first packet virtual slot frame for sending. Because the packet message is sent through the first packet virtual time slot frame, and the sending time of the first packet virtual time slot frame can be determined, the time delay and jitter of the packet message can be determined, and deterministic transmission is provided for the packet message.

Drawings

Fig. 1 is a flow chart of a packet message transmission method according to an embodiment of the present application;

fig. 2 shows a schematic PVSF structure in an embodiment of the present application;

FIG. 3 is a schematic diagram illustrating the location of a slot overhead in an embodiment of the present application;

FIG. 4 is a diagram illustrating slot overhead information in an embodiment of the present application;

fig. 5 is a schematic diagram showing a position of PVSF indicating information in various packet messages according to an embodiment of the present application;

FIG. 6 is a schematic diagram of packet message buffering in an embodiment of the present application;

FIG. 7 is a schematic diagram illustrating scheduling of a slot queue according to an embodiment of the present application;

FIG. 8 is a schematic diagram illustrating scheduling of another slot queue in an embodiment of the present application;

fig. 9 shows a mapping diagram of a multi-service to a virtual slot unit in an embodiment of the present application;

fig. 10 is a flow chart illustrating another packet transmission method according to an embodiment of the present application;

FIG. 11 is a network schematic diagram of packet forwarding in an embodiment of the present application;

fig. 12 is a schematic diagram showing a structure of a packet virtual slot frame based on an IPv6 packet according to an embodiment of the present application;

FIG. 13 is a diagram showing overhead information location of a packet virtual slot frame based on an IPv6 packet message according to an embodiment of the present application;

Fig. 14 shows a schematic diagram of a slot queue based on an IPv6 packet according to an embodiment of the present application;

fig. 15 shows a schematic diagram of scheduling a slot queue based on an IPv6 packet according to an embodiment of the present application;

fig. 16 shows a multi-service scheduling schematic based on an IPv6 packet according to an embodiment of the present application;

fig. 17 is a schematic diagram of a packet virtual slot frame based on MPLS packet according to an embodiment of the present application;

FIG. 18 is a diagram showing overhead information locations of a packet virtual slot frame based on MPLS packet packets according to embodiments of the present application;

fig. 19 shows a fixed-length fragmentation diagram based on MPLS packet according to an embodiment of the present application;

fig. 20 shows a schematic diagram of packet forwarding based on MPLS in an embodiment of the present application;

fig. 21 shows a schematic structural diagram of a packet virtual slot frame based on a SRv packet according to an embodiment of the present application;

FIG. 22 is a diagram showing overhead information locations of a packet virtual slot frame based on a SRv packet according to an embodiment of the present application;

fig. 23 shows a schematic hardware structure of a network side device according to an embodiment of the present application.

Detailed Description

Technical solutions in the embodiments of the present application will be clearly described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application are within the scope of the protection of the present application.

The terms first, second and the like in the description and in the claims, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application are capable of operation in sequences other than those illustrated or otherwise described herein, and that the terms "first" and "second" are generally intended to be used in a generic sense and not to limit the number of objects, for example, the first object may be one or more. Furthermore, in the description and claims, "and/or" means at least one of the connected objects, and the character "/" generally means a relationship in which the associated object is an "or" before and after.

It is noted that the techniques described in embodiments of the present application are not limited to long term evolution (Long Term Evolution, LTE)/LTE evolution (LTE-Advanced, LTE-a) systems, but may also be used in other wireless communication systems, such as code division multiple access (Code Division Multiple Access, CDMA), time division multiple access (Time Division Multiple Access, TDMA), frequency division multiple access (Frequency Division Multiple Access, FDMA), orthogonal frequency division multiple access (Orthogonal Frequency Division Multiple Access, OFDMA), single carrier frequency division multiple access (Single-carrier Frequency Division Multiple Access, SC-FDMA), and other systems. The terms "system" and "network" in embodiments of the present application are often used interchangeably, and the techniques described may be used for both the above-mentioned systems and radio technologies, as well as other systems and radio technologies. The following description describes a New air interface (NR) system for purposes of example and uses NR terminology in much of the description that follows, but these techniques are also applicable to applications other than NR system applications, such as generation 6 (6) ^th Generation, 6G) communication system.

The packet message transmission scheme provided in the embodiments of the present application is described in detail below by means of some embodiments and application scenarios thereof with reference to the accompanying drawings.

Fig. 1 is a flow chart illustrating a packet message transmission method in an embodiment of the present application, and the method 100 may be performed by a first network device. In other words, the method may be performed by software or hardware installed on the first network device. As shown in fig. 1, the method may include the following steps.

S110, at least one grouping message to be sent is obtained.

S112, configuring the at least one packet message to the first packet virtual time slot frame for transmission.

In this embodiment of the present application, the configuration of the at least one packet to the first packet virtual slot frame transmission may also be expressed as carrying the at least one packet to the first packet virtual slot frame transmission, or mapping the at least one packet to the first packet virtual slot frame transmission, or the like.

In the embodiment of the application, the Packet virtual time slot frame (Packet-based Virtual Slotted Frame, PVSF) is a frame structure with a time division multiplexing feature, and the Packet virtual time slot frame may be periodically transmitted in a certain manner.

In the embodiment of the application, the virtual frame structure with the time division multiplexing characteristic is defined in the packet message flow, and the packet message is transmitted through the packet virtual time slot frame, so that the deterministic forwarding capability under the packet architecture is realized, and the optimized deterministic forwarding delay and jitter performance are ensured.

In one possible implementation manner of the embodiment of the present application, the first packet virtual slot frame may include at least one packet virtual container that adopts a time division multiplexing structure, where the packet virtual container includes at least one virtual slot unit, and the virtual slot unit includes at least one minimum slot unit, and one minimum slot unit is used to carry one packet information unit of the at least one packet.

In the embodiment of the present application, the Packet virtual slot frame may be formed by Packet packets (i.e. Packet packets are carried in the Packet virtual slot frame) and have a time division multiplexing characteristic, that is, one or more PVSF frames repeatedly occur based on a nominal fixed time interval (nominal meaning that an ideal situation exists, and an allowable deviation exists in a practical situation compared with the ideal situation, for example, the nominal fixed time interval of the PVSF frame structure typically exists in the ethernet interface with a deviation of + -100 PPM. The PVSF frame includes Packet Virtual Containers (PVC) that can be flexibly defined, and PVC has the characteristic of a time division multiplexing structure, i.e., PVSF is formed by a specified time division multiplexing structure for carrying traffic with deterministic demands. The time division multiplexing structure of the PVC container may be a circularly nested hierarchical multiplexing structure, and the simplest scenario PVSF includes only one PVC, where PVC and PVSF may be substantially identical. The PVC may further comprise a virtual slot unit (Virtual Slotted Unit, VSU) that constitutes the PVC, the VSU being composed of one or more packet messages attributed to it (i.e., the VSU may carry one or more packet messages); a VSU contains one or more minimum slot units (Minimum Slotted Unit, MSU), which may be comprised of packet headers and payloads including slot overhead information. In the simplest scenario, a PVC includes only one VSU, where the PVC and VSU may be substantially identical; the most extreme scenario of a VSU contains only one packet information element. As shown in fig. 2, the packet virtual slot frame structure is formed by PVSF, PVC, and VSU together.

In this embodiment of the present application, the at least one packet acquired by the first network device may be at least one packet acquired by the first network device by sensing, by the first network device, a packet acquired from a packet service flow sent by the second network device, or a packet sent by another network device through a second packet virtual slot frame, which are described below with respect to the above various implementation manners respectively.

First network equipment perceives at least one packet message acquired by packet service accessed to first network equipment or at least one packet message acquired from packet service flow sent by second network equipment

In this implementation, the first network device may be used as a packet ingress node supporting PVSF, and the perceived or received packet packets of the packet traffic flow may be encapsulated into the PVSF and sent. For example, the first network device identifies the packet service flow sent by the second network device according to the network side interface NNI, or the first network device identifies the packet message through the service access PE service side interface UNI.

Based on the above-mentioned packet virtual slot frame structure, in one possible implementation manner, configuring the at least one packet to the first packet virtual slot frame in S120 includes: configuring the at least one packet message to a target virtual time slot unit corresponding to service related information of the at least one packet message for transmission, wherein the target virtual time slot unit is a virtual time slot unit of the first packet virtual time slot frame, and the service related information comprises at least one of the following: service type, service identification, service priority, service required bandwidth, time delay, jitter, and packet loss rate.

For example, in S110, when the first network device acquires at least one packet by sensing a packet service accessed to the first network device, then in S120, at least one packet may be mapped to a virtual slot unit corresponding to the service type according to at least one of a service type, a service identifier, a service priority, a bandwidth required by the service, and the like of the packet. For example, traffic 1 is fixedly mapped to vsuid=1. For another example, if the bandwidth required for the packet traffic is 50M, the packet may be mapped to a virtual slot unit having a size corresponding to the bandwidth, so as to avoid mapping the packet fragment to a different virtual slot unit, and increase the overhead information.

The mapping relationship between the packet and the virtual slot unit may be determined before S112. For example, the first network device may determine a mapping relationship between the packet and the virtual slot unit according to preset information, where the preset information may include at least one of the following: capability information of the first network device, requirements of a carried service and network environment.

For another example, the first network device serves as a boundary node supporting the PVSF network, in S110, receives a packet traffic stream sent by the second network device, acquires the at least one packet from the packet traffic stream, and then determines to map the at least one packet to the target virtual slot unit based on at least one of delay, jitter, and packet loss rate of the arriving packet. For example, according to the time delay and jitter of at least one packet message, determining how many packet messages need to be buffered for transmission, and then determining the corresponding target time slot unit according to the number of packet messages needing to be buffered.

In another possible implementation manner, in S112, the at least one packet may be configured to be sent in the first packet virtual slot frame in a dynamic configuration manner. In this possible implementation, configuring the at least one packet message to the first packet virtual slot frame transmission may include: and configuring the at least one packet message to a target virtual time slot unit of the first packet virtual time slot frame for transmission, wherein the target virtual time slot unit is the nearest available virtual time slot unit to be transmitted. For example, when at least one packet is acquired in S110, the first packet virtual slot frame is transmitting VSU1, and the following packets include VSU2 and VSU3, where the total number of maximum bytes allowed by VSU2 is 50M, the total number of maximum bytes allowed by VSU3 is 100M, if the packet to be transmitted is 30M, the most recently available slot unit is VSU2, and if the packet to be transmitted is 80M, the most recently available slot unit is VSU3. By this possible implementation, the delay of the packet message can be reduced.

In order for the receiving end to correctly receive the packet message, in one possible implementation, the first packet virtual slot frame may have frame overhead information that may include a frame structure indicator and a frame identifier, e.g., the frame structure indicator may include one or more of a frame start indicator, a frame end indicator, a frame continuation indicator, etc., the frame identifier being used to identify the first packet virtual slot frame. For example, in the case where every 2 PVSF frames constitute a multiframe cycle, the PVSF frame Identifier (ID) values may be 0 and 1.

In one or more possible implementations, configuring the at least one packet message to the first packet virtual slot frame transmission in S120 may include the steps of:

step 1, carrying the time slot overhead of the target virtual time slot unit at a preset position of the at least one packet message, wherein the time slot overhead comprises frame overhead information of the first packet virtual time slot frame, and the frame overhead information comprises: a frame structure indicator and a frame identifier;

and step 2, configuring at least one packet message carrying the time slot overhead in the target virtual time slot unit for transmission.

In the above possible implementation manner, as shown in fig. 3, the predetermined position may be a position that is convenient to identify, such as a header, a header of a payload area, or a tail of a payload area of a packet.

Optionally, the frame overhead information may further include at least one of: the service related information, maintenance diagnosis information, management information, indication information of the packet virtual container to which the target virtual time slot unit belongs, and indication information of the target virtual time slot unit of the at least one packet message.

The maintenance diagnosis information can provide overhead information such as path OAM diagnosis, protection switching, lossless adjustment and the like, and support performance measurement such as error code, time delay and the like of the transmission of the diagnosis virtual packet time slot frame, APS protocol transmission and lossless adjustment instruction transmission.

In an alternative implementation of this embodiment, the PVSF may have a start of frame indicator and an alternative end of frame indicator and an alternative frame overhead information. The PVC may have container time division multiplexed indication information and optionally container overhead information. The PVSF frame start indicator can be actively inserted into the indication message at the nominal time, and can also be carried in VSU overhead. The overhead information such as the PVC container indication information can be carried in the overhead message actively inserted, and can also be carried along with the packet message header of the home PVC. The VSU time slot indication information and other overhead information can be carried in the actively inserted message with overhead or carried along with the service VSU message.

In one possible implementation manner, configuring at least one packet message carrying the time slot overhead to be sent in the target virtual time slot unit may include: and adding the time slot overhead to the service data of one packet message in the at least one packet message to form a first message, and configuring the first message to a minimum time slot unit of the target virtual time slot unit for sending. That is, the MSU of the VSU bearer service may be a VSU packet formed by adding time slot overhead to the originally-bearer service.

In another possible implementation manner, configuring at least one packet message carrying the slot overhead to be sent in the target virtual slot unit may include: and configuring a second message formed by converting the service data of the at least one packet message according to a preset length into a minimum time slot unit of the target virtual time slot unit for transmission, wherein the preset length is not more than the data size which can be carried by the minimum time slot unit. That is, the MSU of the VSU bearer service may also be a message formed by converting a message of the original bearer service (for example, performing fragmentation and reassembly of a fixed-length packet information unit, filling idle information, or multi-service encapsulation aggregation).

In the embodiment of the present application, the slot overhead includes, but is not limited to, a start signal, an end signal of PVSF/PVC/VSU/MSU, related information of a bearer service (service identifier, type), related information of a container (container identifier, slot identifier in the container), maintenance diagnostic information (OAM), other auxiliary information, and the like, as shown in fig. 4. In order to improve the bearing efficiency, the above information can reduce unnecessary indication information through coding design, or reduce the carrying information of each packet message through a multi-frame overhead pattern similar to TDM.

For example, as shown in fig. 5, the slot overhead (which may also be referred to as PVSF indication information) may be defined in a media access control layer (Medium Access Control, MAC) header, trailer or other extension region for a packet L2 layer ethernet packet, and the location of one of the extension region, trailer, between an MPLS label stack, label stack and payload for a packet multiprotocol label switching (MPLS) packet. For packet messages of network layer IP, the slot overhead may be carried at one of the following locations: the IP header area, the hop-by-hop extension header (HBH) and the destination extension header (DOH) area and the extensible options (Opitons) area of the packet message. For Segment Routing (Segment Routing) packet messages, the slot overhead may carry a Routing list or an extended area of the Segment Routing; for packet L3 layer ethernet packet, the slot overhead may be in the IPv4/IPv6 frame header, frame trailer or other extension header (including HBH, DOH, SRH, etc.) and extension area; for packet L4 layer ethernet packet messages, the slot overhead may be placed in the transport layer or application layer encapsulation or other extended information area. To provide packaging efficiency, the above information may be embodied by way of compact encoding or compression encoding.

In one or more possible implementations, before the at least one packet is configured to be sent to the target virtual slot unit corresponding to the attribute information of the at least one packet, the method may further include: according to the preset information, at least one of the following is determined:

(1) The structure of the first grouping virtual time slot frame;

for example, based on the definition of the PVSF frame structure by the IPv6 packet, the PVSF frame structure is designed to be composed of 1 PVC, if PVSF multiplexing is not considered, an additional PVSF frame ID identifier may not be used, at this time, the PVC identifier may be combined with the PVSF identifier, each PVC defines 10 VSUs, each VSU supports packet transmission of a maximum of 1000 bytes, and the nominal time slot size of the VSU is 10us. The value of the ID range of the new service of the load determination is 16 bits, and the flexible distribution can be carried out according to the condition of the load service.

(2) And the mapping relation between the packet message and the virtual time slot unit of the first packet virtual time slot frame comprises the corresponding relation between service related information of the packet message and the virtual time slot unit. For example, the packet service 1 corresponds to the VSU1, i.e. the packet of the packet service 1 is fixedly mapped to the VSU 1.

(3) The transmission mode of the first packet virtual time slot frame includes: the number n of consecutively transmitted packet virtual slot frames, the interval between two sets of consecutively transmitted n packet virtual slot frames. For example, every 2 PVSF frames constitutes a multiframe cycle, with a 3ms interval between every 2 PVSF frames.

In one or more possible implementations of the foregoing, in a case where the first network device perceives that the packet service accessed to the first network device or receives the packet service flow sent by the second network device to obtain the at least one packet, optionally, in S120, configuring the at least one packet to be sent by the first packet virtual slot frame may include the following steps:

step 1, caching the at least one packet message into a time slot queue, wherein the structure of the time slot queue corresponds to the structure of the first packet virtual time slot frame;

and step 2, under the condition that the number of the packet messages cached in the time slot queue reaches a first threshold, acquiring the packet messages in the time slot queue, and configuring the acquired packet messages in the first packet virtual time slot frame for transmission.

In the above optional implementation manner, the first network device may buffer the acquired at least one packet into the slot queue until the number of packet packets buffered in the slot queue reaches a first threshold, acquire the packet from the slot queue, and configure the packet to be sent in a first packet virtual slot frame.

Optionally, the first threshold is determined according to a first delay and a first jitter, where the first delay is a maximum value of delays of the at least one packet, and the first jitter is a maximum value of jitters of the at least one packet. For example, when the first network device obtains the packet through receiving the packet service flow sent by the second network device, the number of packet to be buffered may be determined according to the maximum delay and the maximum jitter of the plurality of packet that arrive.

(II) receiving packet messages transmitted over a second packet virtual slot frame

In this implementation, the first network device acts as a forwarding node for the packet message, and schedules the packet message sent by the second packet virtual slot frame to be sent on the first packet virtual slot frame.

In one possible implementation manner, in S110, the obtaining at least one packet to be sent includes:

Step 1, receiving a frame start indicator of a second grouping virtual time slot frame or a first grouping message representing the frame head position of the second grouping virtual time slot frame;

in a specific application, the frame head position of the second packet virtual slot frame may be indicated by carrying a frame start indicator in the packet message, or may be indicated by the first packet message representing the frame head position of the second packet virtual slot frame.

Step 2, starting from the frame start indicator or the first packet message, caching the received packet message into an idle time slot queue until a preset condition is met, wherein the structure of the time slot queue corresponds to the structure of the second packet virtual time slot frame, and the preset condition comprises one of the following: receiving a correct end of frame indicator; the time slot queue is full; receiving a second packet intended to represent the frame header position of the new frame; a start of frame indicator of an expected new frame is received.

In the foregoing possible implementation manner, optionally, the received packet is discarded if the preset condition is not met within a predetermined time.

In this embodiment, since the packet message is sent through the second packet virtual slot frame and the arrival of the next packet virtual slot frame is expected, in one possible exploring manner, after receiving the frame start indicator of the second packet virtual slot frame or the first packet message representing the frame header position of the second packet virtual slot frame, the method may further include: and estimating a second arrival time of the frame head position of the next packet virtual time slot frame after the second packet virtual time slot frame according to the first arrival time of the frame head position of the second packet virtual time slot frame, and detecting a packet message of the frame head position of the next packet virtual time slot frame within a preset range of the second arrival time. The first arrival time may be a frame start indicator or an arrival time of the first packet. By the implementation manner, the first network device can detect the packet message of the frame head position of the next packet virtual time slot frame in the preset range of the second arrival time, so that the first network device can be prevented from always detecting whether the next packet virtual time slot frame arrives or not, and the energy consumption of the first network device is saved.

The PVSF is designed with a nominal arrival time, but the framing mechanism of the virtual frame at the arrival time of the PVSF frame start maintains the PVSF time-slotted structure in consideration of the natural frequency deviation or packet transmit-receive jitter existing in the packet network, so that the next packet virtual slot frame is detected within the preset range of the second arrival time in the above possible implementation.

In the foregoing possible implementation manner, optionally, after estimating the second arrival time of the frame header position of the next packet virtual slot frame after the second packet virtual slot frame, the method may further include: and determining that the next packet virtual time slot frame is abnormal under the condition that the packet message at the frame head position of the next packet virtual time slot frame is not detected within the preset range of the second arrival time or the packet message at the frame head position of the next packet virtual time slot frame is detected outside the preset range of the second arrival time. After determining that the next packet virtual slot frame is abnormal, the packet at the frame head position of the new packet virtual slot frame is detected again, and the detection process can be restarted.

In an embodiment of the present application, optionally, the slot queue may include: grouping virtual time slot frame queues; the slot queue further comprises one of: at least one grouping virtual container queue subordinate to the grouping virtual time slot frame queue and at least one virtual time slot unit queue subordinate to the grouping virtual container queue, wherein grouping messages borne by different grouping virtual containers are cached to the corresponding grouping virtual container queues, and grouping messages borne by different virtual time slot units are cached to the corresponding virtual time slot unit queues.

In the embodiment of the present application, the size of the slot queues may vary from a minimum queue depth to a maximum PVSF frame length (including the necessary tolerance isolation gap) depending on the specific implementation.

In one possible implementation, the buffering the received packet to the idle slot queue may include: and according to frame overhead information carried by the received packet message, caching the received packet message to a position corresponding to the frame overhead information in the time slot queue. Through the optional implementation manner, the first network device may determine a packet virtual container queue and a virtual time slot unit queue cached by each packet according to time slot overhead information of at least one packet.

For example, in the embodiment of the present application, the Slot Queue (SQ) receives (enqueues) a packet to support PVSF, when the node entry supporting PVSF functions recognizes that the packet to support PVSF arrives, the packet to support PVSF may be received from the frame start signal indication into an idle slot queue, until an end of frame signal (if any) is received, or the queue is full, or a new frame start signal arrives, as shown in fig. 6.

The SQ queue structure can be a queue or a logic queue structure (shared physical queue) with PVSF, PVC and VSU being independent respectively. If an independent PVC queue exists, the PVC queue is subordinate to PVSF, and different PVC grouping messages enter the PVC queue according to the container identification; likewise, if a VSU queue exists, packet messages for different VSUs enter the VSU queue according to their slot identifications, the VSU queue being subordinate to the PVC. If a logic queue structure is adopted, the PVC and the VSU share PVSF queue resources and are distinguished through identification information carried by the packet message. Different PVSF, PVC and VSU determine relative position according to the identification information of its frame structure, grouping message in the same VSU can confirm the enqueue order according to the tactics that presumes.

In one possible implementation, after receiving at least one packet through the second packet virtual slot frame, configuring the at least one packet to the first packet virtual slot frame transmission in S120 may include: and under the condition that the number of the packet messages cached in the time slot queue reaches a second threshold, scheduling the packet messages in the time slot queue to the first packet virtual time slot frame for sending.

Optionally, the second threshold is less than or equal to a preset value, where the preset value is a frame length of one of the first packet virtual slot frames or a maximum total number of bytes allowed by one of the first packet virtual slot frames.

In this embodiment of the present application, the first network device may set a suitable second threshold according to the performance of the packet network, for example, may be set in combination with jitter tolerance performance, and the second threshold may be set according to the time or equivalent indicator (such as the corresponding number of buffer frames or bytes) of the packet virtual slot frame reception. The second threshold may be generally set according to the system forwarding overhead, so as to minimize the forwarding delay caused by queue queuing.

Optionally, the phase difference between the first frame start position of the first packet virtual slot frame and the second frame start position of the second packet virtual slot frame is not greater than a preset threshold. That is, the nominal frame starting position of the outgoing direction of the PVSF dequeue node can be aligned with the phase of the incoming direction in a non-strict manner, and the phase difference between the outgoing direction and the incoming direction can be matched by adding a buffer.

In the embodiment of the application, the incoming direction and the outgoing direction are forwarded according to the packet virtual time slot frame structure, and the forwarding delay and the jitter have deterministic upper and lower bounds. The relative nominal frequency of the ingress and egress PVSF frame structures meets preset requirements (e.g., in the ethernet + -100ppm range), the relative nominal phase (the position of the PVSF frame header) does not strictly require synchronization, and the nominal phase deviation of ingress and egress may exceed the transmission time T of a 1/2 packet virtual slot frame _f 。

In one possible implementation, the scheduling the transmission of the packet in the slot queue to the first packet virtual slot frame may include: and dispatching the packet message to a second packet virtual container and/or a second packet time slot unit of the first packet virtual time slot frame according to a first packet virtual container and/or a first packet time slot unit to which the packet message belongs in the time slot queue, wherein the first packet virtual container and/or the first packet time slot unit has a switching relationship with the second packet virtual container and/or the second packet time slot unit. In this possible implementation manner, the first packet virtual slot frame and the second packet virtual slot frame may be scheduled according to a statically configured slot switching table, and the scheduling is performed according to PVSF/PVC/VSU frame structure information, for example, according to a PVC/VSU switching relationship of ingress PVSF and egress PVSF configured by a control plane, so as to implement a slotted scheduling from ingress PVC/VSU to occurrence PVC/VSU.

In another possible implementation manner, the scheduling the transmission of the packet in the slot queue to the first packet virtual slot frame includes: and dispatching the target packet messages in the time slot queues to the first packet virtual time slot frame for transmission according to the relative positions of different target packet messages in the second packet virtual time slot frame, wherein the relative positions of different target packet messages in the first packet virtual time slot frame are the same as the relative positions of different target packet messages in the second packet virtual time slot frame, and the destination addresses of different target packet messages are the same. That is, in this possible implementation, according to the relative order of the PVSF/PVC/VSU frame structure information deterministic packet packets, the scheduling still performs packet forwarding according to the packet header, and the packet forwarding may follow existing mechanisms, including MAC, MPLS, IP, SR, etc., and since the packet packets are already ordered according to the PVSF frame structure information at the time of enqueuing, the outgoing packets can also be sent according to the expected PVSF frame structure at the time of scheduling, as shown in fig. 7.

Optionally, the second packet virtual slot frame and the first packet virtual slot frame are aligned with the same synchronization reference, or there is a stable phase offset between the second packet virtual slot frame and the first packet virtual slot frame. That is, in the embodiment of the present application, the time slot scheduling does not strictly require strict synchronization of the incoming PVSF and the nominal phase of the existing PVSF, but can maintain a relatively stable mapping relationship between the incoming frame structure and the outgoing frame structure, and the method for maintaining the mapping relationship can be implemented by techniques such as clock synchronization, aligning the same synchronization reference, and maintaining a virtual clock with a relatively fixed offset. Deviations in the mapping are tolerated by the second threshold, and zero queuing delay scheduling can be achieved if phase synchronization is used.

Optionally, if the second packet virtual slot frame transmission rate is different from the first packet virtual slot frame, corresponding queue and scheduling rate adaptation processing may be performed while maintaining the same PVSF frame structure and the same number of packets or bytes contained in the frame structure.

In one possible implementation, there may be multiple PVSFs aggregated to the first network device, and thus, in this possible implementation, the scheduling the packet in the slot queue for transmission to the first packet virtual slot frame may include: and under the condition that the number of the packet messages cached in the time slot queues reaches a second threshold, dispatching the packet messages in the time slot queues to the first packet virtual time slot frame for transmission by adopting an interleaved round-robin dispatching mode, wherein the interleaved round-robin dispatching mode is to dispatch the first cache unit cached in each time slot queue in sequence, dispatch the next cache unit cached in each time slot queue in sequence until the cache units cached in each time slot queue are dispatched, and cache the packet message borne by one virtual time slot unit by one cache unit.

For example, if there are multiple PVSF aggregations, a PVSF/PVC/VSU interleaving mechanism based on the PVSF frame structure may be used to achieve smooth and low latency low jitter aggregation, as shown in fig. 8. Wherein, different service messages in the VSU can also further improve the delay and jitter performance of forwarding through similar packet general purpose processor shared scheduling (Packet Generalized Processor Sharing, PGPS), as shown in fig. 9. In addition, PVSF/PVC/VSU can also support the mode that the structure flow of the same time slot gathers to realize gathering.

When multiple services are simultaneously accessed to PVSF, different strategies of mapping the service access to PVSF frame structures can be configured, wherein the strategies comprise fixed virtual time slot mapping, namely different services are fixedly accessed to the VSU of the PVC of the appointed PVSF; or a periodic access mode of the random access VSU; packet mode access VSUs like PGPS are also included.

In the embodiment of the application, the Slot Queues (SQ) are enqueued and dequeued according to the PVSF message stream, and because the SQ operation object is a packet message of the PVSF, the outgoing transmission rate is greater than (incoming to multiple PVSF reception and then converging to multiple PVSF transmission) or equal to (incoming to 1 PVSF reception and then outgoing to 1 PVSF transmission) the incoming reception rate ensures that the slot queues are free from congestion. The forwarding of PVSF from ingress to egress is done by a slotted scheduling function.

Optionally, when the exit rate of sending the packet message in the slot queue to the first packet virtual slot frame is different from the entry rate of buffering the packet message to the slot queue, the size of each virtual slot unit of the first packet virtual slot frame is not completely the same as the size of the second packet virtual slot frame, the frame structure of the first packet virtual slot frame is the same as the frame structure of the second packet virtual slot frame, and the number of packet messages or the total number of bytes allowed by the first packet virtual slot frame is the same as the number of packet messages or the total number of bytes allowed by the second packet virtual slot frame. For example, if the egress rate of the slot queue is increased compared to the ingress rate, the virtual slot unit size of the first packet virtual slot frame may be correspondingly scaled down, and if the egress rate of the slot queue is decreased compared to the ingress rate, the virtual slot unit size of the first packet virtual slot frame may be correspondingly scaled up, but the frame structure of the first packet virtual slot frame is the same as the frame structure of the second packet virtual slot frame. Through the alternative implementation manner, the forwarding delay of the packet message can be reduced.

In the embodiment of the application, by defining a virtual frame structure with a time division multiplexing characteristic, designing a time slot queue supporting the virtual frame structure, introducing a time slot scheduling method, realizing deterministic forwarding capability under a packet architecture, and guaranteeing optimized deterministic forwarding delay and jitter performance.

In the embodiment of the application, the packet message is sent through the packet virtual time slot frame and is also sent according to the time sequence, so that the node which does not support the PVSF function can support the PVSF forwarding mechanism to pass through the common packet node according to the common packet message forwarding.

Therefore, the embodiment of the present application further provides another packet transmission method, which is executed by the third network device, fig. 10 is a schematic flow diagram of another packet transmission method provided in the embodiment of the present application, and as shown in fig. 10, the method 1000 mainly includes the following steps.

S1010, at least one packet message sent by the first network device through the first packet virtual time slot frame is received.

The first network device may configure at least one packet to be sent on the first packet virtual slot frame in the manner described in the method 100, and specific description in the method 100 may be referred to, which is not repeated herein.

S1020, based on the arrival time of the at least one packet message, the received at least one packet message is sent in a packet service flow mode.

The third network device may further perform packet transmission on the packet when transmitting the at least one packet in a packet service flow. For example, the third network device may obtain the destination address of each packet by parsing the header of each packet, and send the packet with the same destination address through the same packet service flow.

In order to reduce jitter, the third network device may further buffer the arriving packet until the buffered packet reaches a predetermined threshold, and then send the packet in a packet service flow manner.

For example, in fig. 11, the PVSF border node 1 and the PVSF border node 2 may use the first network device, the PVSF border node performs border encapsulation conversion on a packet with PVSF and then sends the packet, the packet arrives at a forwarding node (for example, the third network device) in the normal packet network, the third network device forwards the packet according to the normal packet, that is, forwards the packet with a packet traffic flow, and after the PVSF border node 2 receives the packet traffic flow, buffers the arriving packet, reconstructs a PVSF frame queue, and forwards the packet through a PVSF frame.

Because the packet forwarding header is adopted to extend, the extension content which cannot be identified by the common packet network can still support basic packet forwarding, for example, IPv6 forwards the unidentified extension header only according to the DA of IPv6, and only large time delay or jitter is introduced into the defined PVSF frame structure when traversing the common packet network, at this time, the function of reconstructing the PVSF frame queue needs to be added to the boundary PVSF node traversing the common packet network, and compared with PVSF frame entry processing, the function only increases the time of buffer waiting for eliminating the extra time delay or jitter brought by traversing the common packet network. A simple buffering mechanism requires adding additional buffer size for covering the worst latency or jitter of the packet network, e.g. the largest latency or jitter of the packet network is 200us, the PVSF border node "rebuild PVSF frame queue" will increase to a maximum of 200us buffer capacity. Factors such as congestion and packet loss which may exist in traversing the common packet network are not considered in the present embodiment, and may be solved by a technology of reliability enhancement.

In addition, for packet forwarding technologies such as MPLS, when a difference caused by traversing a normal packet network needs to be perceived, a certain "border encapsulation conversion" function needs to be performed on a border node transmitting side traversing the normal packet network, and similar to other border node forwarding functions of packet devices, a layer of packet header traversing the normal packet network can be encapsulated outside a PVSF extension packet header by simple processing of the encapsulation conversion function of a PVSF border node, and after traversing is completed, the added outer layer header is stripped, so that a subsequent PVSF forwarding function can be continued.

The technical solution provided in the embodiments of the present application is described below by means of a specific type of packet.

Implementing deterministic forwarding based on IPv6 variable length packet message

For IPv6 variable length packet messages, deterministic forwarding can be achieved by:

step 1, for a PVSF ingress node (i.e. a packet service aware node or a PVSF border node), for example, a PE node may first define a PVSF frame structure based on an IPv6 packet, and each 2 PVSF frames form a multiframe cycle, i.e. the PVSF frame ID under the IP subinterface (may be identified by an IP address) takes on values of 0 and 1. If PVSF multiplexing is not considered, additional PVSF frame ID identification can be omitted, at the moment, the PVC identification can be combined with the PVSF identification, 10 VSUs are defined by each PVC, each VSU supports packet message transmission of the longest 1000Byte, and the nominal time slot size of the VSU is 10us. The value of the new service ID range of the load is 16 bits, and the load can be flexibly allocated according to the condition of the load service, and the frame structure is schematically shown in figure 12.

Step 2: the PVSF entry node designs PVSF Overhead information (overheads) based on the IPv6 HBH extension header, including a PVSF start signal indicator 2bit (00 represents PVSF frame start, 10 and 01 represent frame continuation, 11 represents frame end); PVSF/PVC ID is expressed by 1bit, and 0 and 1 alternately circulate; the VSU ID is represented by 4 bits, the usable range is 0-9, the rest is invalid value, and 20 distinguishable VSUs can be obtained by combining PVSF/PVC ID; designing 16 bits to represent service IDs, wherein different services can be flexibly accessed to different VSU time slots; finally, there may be a CRC8 check on the PVSF overhead information, the overhead design of which is shown in fig. 13.

Step 3: and the PVSF entry node determines a virtual time slot unit mapped by the packet message according to the PVSF frame structure design. Assuming that the guaranteed bandwidth allocated to the IP subinterface where the PVSF is located is 10Gbps, the PVSF can support a total of 20 VSU units, and the nominal bandwidth of each VSU is 10 Gbps/(2×10) =500 Mbps. Deterministic traffic may request 1-20 VSU slot units, and the mapping relationship of traffic to slots may be static fixed, such as traffic 1 fixedly mapped to VSU id=1; it may also be a dynamic mapping, such as service 1 requesting 1 VSU unit, i.e. guaranteeing 1 VSU opportunity per PVSF to provide service 1, and dynamically allocating the most recently available VSU to carry the service when the traffic of service 1 arrives, and for simplicity, this embodiment assumes a static fixed mapping scheme. If PVSF is idle, the PE node can actively insert a positioning message carrying PVSF frame initiation information for maintaining a relatively stable phase relationship of PVSF. Also, when the PE node accesses the multi-service, the PE node provides the multi-service access according to PVSF time slot allocation and mapping algorithm.

Step 4: the PVSF forwarding node (i.e., the forwarding node supporting the PVSF function) designs FVSF slot queues and a slotted scheduling function based on the current packet queues and scheduling mechanism. The simplified design can design 2 PVSF time slot queues per IP sub-interface, and the maximum length of each queue is 1 PVSF frame to be buffered, namely, maximum 20 x 1000 Byte=160 kbit, and indexes capable of providing different VSUs in the queues can support message scheduling based on the VSU. When the node supporting the PVSF function receives the first packet carrying the PVSF frame start indication, the packet and the subsequent packets belonging to the same PVSF are put into the idle slot queue, as shown in fig. 14.

Step 5: the node supporting the PVSF function performs time slot scheduling on the message of the PVSF time slot queue, and the scheduling can be performed by adopting a statically configured time slot exchange table (i.e. the incoming time slot and the occurrence time slot are statically exchanged according to the VSU ID); routing forwarding scheduling based on IPv6 destination addresses can also be adopted; for simplicity, this embodiment takes statically configured slot-switching table scheduling as an example. The result of the scheduling is that the outgoing transmissions still maintain the PVSF frame structure, which also requires a maximum buffering of one PVSF frame length due to the statically configured slot exchange table, as shown in fig. 15.

Step 6: for a scenario where multiple PVSF frames may exist and multiple PVSF aggregation bandwidth capabilities are provided according to supported aggregation capabilities, in order to distinguish multiple PVSF frame signals that are aggregated, PVSF IDs need to be added to distinguish between different PVSF signals that are aggregated in the scenario where multiple PVSF frame aggregation is supported. By alternately scheduling the arriving VSU packet messages of the incoming multi-path PVSF queues according to the outgoing PVSF frame start signals, the effect of performing interleaved transmission according to the VSU packet messages when the multi-path PVSF frames are converged is achieved, as shown in fig. 16.

(II) implementing deterministic forwarding based on MPLS and fixed-length packet message

For MPLS and fixed length packet packets, deterministic forwarding can be achieved by:

step 1: the PVSF entry node (namely the sensing node of the packet service or the PVSF boundary node) defines a PVSF frame structure based on the MPLS packet message, and every 4 PVSF frames form a multi-frame cycle, namely the PVSF frame ID under the MPLS sub-interface takes a value of 0-3. The PVSF frame structure is designed to be composed of 4 PVC, the number of PVC in each PVSF frame is 0-1, 4 VSUs are defined for each PVC, and the number of the VSU is 0-3; each VSU supports packet messaging with 1 fixed 128Byte payload, the PVSF total packet bandwidth is allocated to a fixed 10Gbps, so each VSU will be guaranteed to represent a nominal fixed bandwidth of 10 Gbps/(4 x 4) =about 156Mbps by the PVSF frame structure described above, deterministic traffic may request resources from 1 to multiple VSU units, the size of the packet units within the stationary VSU illustrated in this embodiment exhibits simulated circuit-switched characteristics. The value of the new service ID range of the load is 16 bits, and the load can be flexibly allocated according to the condition of the load service, and the frame structure is schematically shown in figure 17.

Step 2: the PVSF entry node designs PVSF overhead information based on an MPLS Label (Label), including a PVSF start signal indicator 2bit (00 represents PVSF frame start, 10 and 01 represent frame continuation, 11 represents frame end); PVSF ID is expressed by 2 bits, and the value is 0-3; the PVC ID is represented by 2 bits, and the value is 0-3; VSU ID is expressed by 2 bits, the usable range is 0-3, and 64 distinguishable VSU units can be obtained by combining PVSF/PVC ID; in order to be compatible with the TTL field of the MPLS Label S indication information, 15 bits are designed to represent service IDs, different services can be flexibly accessed to different VSU time slots, and the overhead design is shown in figure 18.

Step 3: the PVSF entry node maps MPLS packet messages to virtual time slot units of PVSF frames according to PVSF frame structure design. It is assumed that the guaranteed bandwidth allocated to the IP subinterface where the PVSF is located is 10Gbps. PVSF can support a total of 64 VSU units, each VSU having a nominal bandwidth of 10 Gbps/(4 x 4) =156 Mbps, and considering typical MPLS encapsulation overhead, a fixed 128Byte payload would increase by about 32Byte MPLS encapsulation header with an encapsulation efficiency of 80% and an effective access payload per VSU of about 125Mbps. Deterministic traffic may request 1-64 VSU slot units, and the mapping relationship of traffic to slots may be static fixed, such as traffic 1 fixedly mapped to VSU id=1; it may also be a dynamic mapping, such as service 1 requesting 1 VSU unit, i.e. guaranteeing 1 VSU opportunity per PVSF to provide service 1, and dynamically allocating the most recently available VSU to carry the service when the traffic of service 1 arrives, and for simplicity, this embodiment assumes a static fixed mapping scheme. If PVSF is idle, the PE node can actively insert a positioning message carrying PVSF frame initiation information for maintaining a relatively stable phase relationship of PVSF. Also, when the PE node accesses the multi-service, the PE node provides the multi-service access according to PVSF time slot allocation and mapping algorithm.

Step 4: the PE node adds the fragmentation and reassembly process of the variable-length MAC/IP service mapped to the fixed-length VSU packet unit by adopting the design of the fixed payload size, namely the fixed VSU packet unit, and the fragmentation and reassembly scheme can follow the fixed-length cell fragmentation and reassembly process. The different process is that the PVSF frame overhead information is still maintained after the fragmentation of the fixed length cells, as shown in fig. 19.

Step 5: the PVSF forwarding node (i.e. the forwarding node supporting the PVSF function) designs PVSF slot queues and a slotted scheduling function based on the current packet queues and scheduling mechanism. The simplified design can design 2 PVSF time slot queues per MPLS sub-interface, and the maximum length of each queue is 1 PVSF frame to be buffered, namely, the maximum length is 64 x 160 Byte=80 kbit, and indexes capable of providing different VSUs in the queues can support message scheduling based on the VSUs. When the node supporting the PVSF function receives the first packet carrying the PVSF frame start indication, the packet and the subsequent packets belonging to the same PVSF are put into an idle time slot queue.

Step 6: the node supporting the PVSF function performs time slot scheduling on the message of the PVSF time slot queue, and the scheduling can be performed by adopting a statically configured time slot exchange table (i.e. the incoming time slot and the occurrence time slot are statically exchanged according to the VSU ID); routing forwarding scheduling based on IPv6 destination addresses can also be adopted; for simplicity, this embodiment takes statically configured MPLS label switching scheduling as an example. The result of the scheduling is that the outgoing transmissions still maintain the PVSF frame structure, which also requires a maximum buffering of one PVSF frame length due to the statically configured slot exchange table, as shown in fig. 20.

And (III) realizing deterministic forwarding based on the SRv6 packet message.

For SRv packet messages, deterministic forwarding can be achieved by:

step 1: the PVSF ingress node (i.e. the sensing node of the packet service or the PVSF boundary node) defines the PVSF frame structure based on the SRv packet message, taking the simplest scenario as an example, every 1 PVSF single frame cycle, i.e. the PVSF frame ID under the SRv sub-interface is fixed to 0 or can be omitted from being carried explicitly. The PVSF frame structure is designed to be composed of 1 PVC, if PVSF multiplexing is not considered, an additional PVSF frame ID mark can be omitted, the PVC mark is fixed to be 0 at the moment or explicit carrying can be omitted, each PVC defines 2 VSUs, each VSU supports packet message transmission of 2000Byte at maximum, and the nominal time slot size of the VSU is 20us. The value of the new service ID range of the load is 16 bits, and the load can be flexibly allocated according to the condition of the load service, and the frame structure is schematically shown in figure 21.

Step 2: the PVSF entry node designs PVSF overhead information based on SRv SID, including PVSF start signal indicator 2bit (00 for PVSF frame start, 10 and 01 for frame continuation, 11 for frame end); the PVSF/PVC ID is omitted in this embodiment; the VSU ID is represented by 1bit, and the usable range is 0-1, so that the embodiment has only 2 distinguishable VSUs, and the characteristic of large bandwidth is reflected; the overhead design is shown in fig. 22.

Step 3: the PVSF entry node maps the packet message to the virtual slot unit according to the PVSF frame structure design. Assuming that the guaranteed bandwidth allocated to the SRv subinterface where the PVSF is located is 10Gbps, the PVSF can support a total of 2 VSU units, and the nominal bandwidth of each VSU is 10 Gbps/2=5 Gbps. To take advantage of the large bandwidth characteristics, a VSU nominal slot length of 20us is designed for controlling the delay and jitter upper and lower bounds of forwarding, each VSU can carry a nominal 25000Byte, especially for high burst but still requiring deterministic traffic with bounded delay and jitter.

Step 4: the PVSF forwarding node (i.e., the forwarding node supporting the PVSF function) designs FVSF slot queues and a slotted scheduling function based on the current packet queues and scheduling mechanism. The simplified design can design 2 PVSF slot queues per IP subinterface, and each queue maximum length is 1 PVSF frame buffered, i.e. maximum 2×25000 byte=400 kbit.

Step 5: to take advantage of SRv in the source node specifying a forwarding path over the SRH, the PVSF forwarding node may carry end-to-end slotted scheduling information for delivery in SID overhead information of the SRH, such as the overhead format of fig. 22. Assuming that the SRv node supporting the PVSF Function adopts SRv6 programmable forwarding mode, a new SRv6 programmable Function can be extended, which is a Function of performing slotted dispatch forwarding for simple differentiation, to be a PVSF Function. Firstly, a control plane locally forms a PVSF time slot scheduling forwarding table, namely an incoming VSU time slot and a scheduling forwarding relation of the VSU time slot, and then searches out PVSF VSU information to complete time slot forwarding according to PVSF VSU time slot information carried in a DA received currently; meanwhile, the SID required to be processed by the next hop SRv PVSF node is acquired from the SRH and updated to be a new DA, and SRv of programmable forwarding processing is completed.

The embodiment of the present application further provides a network device, including a processor and a communication interface, where the processor is configured to implement the packet message transmission method 100 or the packet message transmission method 1000, and the communication interface is configured to perform communication with an external device. The network device embodiment corresponds to the network device method embodiment, and each implementation process and implementation manner of the method embodiment can be applied to the network side device embodiment, and the same technical effects can be achieved.

Specifically, the embodiment of the application also provides network side equipment. As shown in fig. 23, the network side device 2300 includes: a processor 2301, a network interface 2302 and a memory 2303. The network interface 2302 is, for example, a common public radio interface (common public radio interface, CPRI).

Specifically, the network side device 2300 of the embodiment of the present invention further includes: instructions or programs stored in the memory 2303 and capable of running on the processor 2301, the processor 2301 invokes the instructions or programs in the memory 2303 to perform the packet message transmission method described above, and achieve the same technical effects, so repetition is avoided and therefore will not be described herein.

The embodiment of the present application further provides a readable storage medium, where a program or an instruction is stored on the readable storage medium, and when the program or the instruction is executed by a processor, the program or the instruction realizes each process of the packet message transmission method embodiment, and the same technical effect can be achieved, so that repetition is avoided, and no detailed description is given here.

Wherein the processor is a processor in the terminal described in the above embodiment. The readable storage medium includes computer readable storage medium such as computer readable memory ROM, random access memory RAM, magnetic or optical disk, etc.

The embodiment of the application further provides a chip, the chip includes a processor and a communication interface, the communication interface is coupled with the processor, and the processor is configured to run a program or an instruction, implement each process of the packet message transmission method embodiment, and achieve the same technical effect, so that repetition is avoided, and no further description is provided here.

It should be understood that the chips referred to in the embodiments of the present application may also be referred to as system-on-chip chips, or the like.

The embodiments of the present application further provide a computer program/program product, where the computer program/program product is stored in a storage medium, and the computer program/program product is executed by at least one processor to implement each process of the above packet message transmission method embodiment, and achieve the same technical effects, so that repetition is avoided, and details are not repeated herein.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. Furthermore, it should be noted that the scope of the methods and apparatus in the embodiments of the present application is not limited to performing the functions in the order shown or discussed, but may also include performing the functions in a substantially simultaneous manner or in an opposite order depending on the functions involved, e.g., the described methods may be performed in an order different from that described, and various steps may also be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solutions of the present application may be embodied essentially or in a part contributing to the prior art in the form of a computer software product stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk), comprising several instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method described in the embodiments of the present application.

The embodiments of the present application have been described above with reference to the accompanying drawings, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those of ordinary skill in the art without departing from the spirit of the present application and the scope of the claims, which are also within the protection of the present application.

Claims

1. A method of packet messaging performed by a first network device, the method comprising:

acquiring at least one packet message to be sent;

and configuring the at least one packet message to the first packet virtual time slot frame for transmission.

2. The method of claim 1, wherein the first packet virtual slot frame comprises at least one packet virtual container in a time division multiplexed structure, the packet virtual container comprising at least one virtual slot unit, the virtual slot unit comprising at least one minimum slot unit, one of the minimum slot units being configured to carry one packet information unit of the at least one packet message.

3. The method of claim 2, wherein configuring the at least one packet message to a first packet virtual slot frame transmission comprises:

configuring the at least one packet message to a target virtual time slot unit corresponding to service related information of the at least one packet message for transmission, wherein the target virtual time slot unit is a virtual time slot unit of the first packet virtual time slot frame, and the service related information comprises at least one of the following: service type, service identification, service priority, service required bandwidth, time delay, jitter, and packet loss rate.

4. The method of claim 2, wherein configuring the at least one packet message to a first packet virtual slot frame transmission comprises:

and configuring the at least one packet message to a target virtual time slot unit of the first packet virtual time slot frame for transmission, wherein the target virtual time slot unit is the nearest available virtual time slot unit to be transmitted.

5. The method according to claim 3 or 4, wherein configuring the at least one packet message to a first packet virtual slot frame transmission comprises:

carrying the time slot overhead of the target virtual time slot unit at a preset position of the at least one packet message, wherein the time slot overhead comprises frame overhead information of the first packet virtual time slot frame, and the frame overhead information comprises: a frame structure indicator and a frame identifier;

and configuring at least one packet message carrying the time slot overhead in the target virtual time slot unit for transmission.

6. The method of claim 5, wherein the frame overhead information further comprises at least one of: the service related information, maintenance diagnosis information, management information, indication information of the packet virtual container to which the target virtual time slot unit belongs, and indication information of the target virtual time slot unit of the at least one packet message.

7. The method of claim 5, wherein configuring at least one packet message carrying the slot overhead to be transmitted in the target virtual slot unit comprises:

a first message formed after the time slot expenditure is added in the service data of one packet message in the at least one packet message is configured to be sent in a minimum time slot unit of the target virtual time slot unit; or,

and configuring a second message formed by converting the service data of the at least one packet message according to a preset length into a minimum time slot unit of the target virtual time slot unit for transmission, wherein the preset length is not more than the data size which can be carried by the minimum time slot unit.

8. The method of claim 3, wherein prior to transmitting the at least one packet message to a target virtual slot unit corresponding to attribute information of the at least one packet message, the method further comprises:

according to the preset information, at least one of the following is determined:

the structure of the first grouping virtual time slot frame;

the mapping relation between the grouping message and the virtual time slot unit of the first grouping virtual time slot frame comprises the corresponding relation between the service related information of the grouping message and the virtual time slot unit;

The transmission mode of the first packet virtual time slot frame includes: the number n of the continuously transmitted grouping virtual time slot frames and the interval between two groups of the continuously transmitted n grouping virtual time slot frames;

wherein the preset information includes at least one of: capability information of the first network device, requirements of a carried service and network environment.

9. The method according to claim 3 or 4, wherein the obtaining at least one packet to be sent comprises:

sensing the at least one packet message of packet traffic accessing the first network device; or,

and receiving a packet service flow sent by the second network equipment, and acquiring the at least one packet message from the packet service flow.

10. The method of claim 9, wherein configuring the at least one packet message to a first packet virtual slot frame transmission comprises:

caching the at least one packet message into a time slot queue, wherein the structure of the time slot queue corresponds to the structure of the first packet virtual time slot frame;

and under the condition that the number of the packet messages cached in the time slot queue reaches a first threshold, acquiring the packet messages in the time slot queue, and configuring the acquired packet messages in the first packet virtual time slot frame for transmission.

11. The method of claim 10, wherein the first threshold is determined based on a first delay and a first jitter, wherein the first delay is a maximum of delays of the at least one packet and the first jitter is a maximum of jitters of the at least one packet.

12. The method according to claim 2, wherein the obtaining at least one packet to be sent comprises:

receiving a frame start indicator of a second packet virtual slot frame or a first packet message representing a frame header position of the second packet virtual slot frame;

starting from the frame start indicator or the first packet message, caching the received packet message into an idle time slot queue until a preset condition is met, wherein the preset condition comprises one of the following: receiving a correct end of frame indicator; the time slot queue is full; receiving a second packet intended to represent the frame header position of the new frame; receiving a start of frame indicator of an expected new frame; the structure of the slot queue corresponds to the structure of the second packet virtual slot frame.

13. The method of claim 12, wherein after receiving the frame start indicator of the second packet virtual slot frame or the first packet message representing the frame header position of the second packet virtual slot frame, the method further comprises:

And estimating a second arrival time of the frame head position of the next packet virtual time slot frame after the second packet virtual time slot frame according to the first arrival time of the frame head position of the second packet virtual time slot frame, and detecting a packet message of the frame head position of the next packet virtual time slot frame within a preset range of the second arrival time.

14. The method of claim 13, wherein after estimating the second arrival time of the frame header position of the next packet virtual slot frame after the second packet virtual slot frame, the method further comprises:

and determining that the next packet virtual time slot frame is abnormal under the condition that the packet message at the frame head position of the next packet virtual time slot frame is not detected within the preset range of the second arrival time or the packet message at the frame head position of the next packet virtual time slot frame is detected outside the preset range of the second arrival time.

15. The method of claim 13, wherein the slot queue comprises: grouping virtual time slot frame queues; the slot queue further comprises one of: at least one grouping virtual container queue subordinate to the grouping virtual time slot frame queue and at least one virtual time slot unit queue subordinate to the grouping virtual container queue, wherein grouping messages borne by different grouping virtual containers are cached to the corresponding grouping virtual container queues, and grouping messages borne by different virtual time slot units are cached to the corresponding virtual time slot unit queues.

16. The method of claim 12, wherein buffering the received packet message to an idle slot queue comprises:

and according to frame overhead information carried by the received packet message, caching the received packet message to a position corresponding to the frame overhead information in the time slot queue.

17. The method of claim 12, wherein configuring the at least one packet message to a first packet virtual slot frame transmission comprises:

and under the condition that the number of the packet messages cached in the time slot queue reaches a second threshold, scheduling the packet messages in the time slot queue to the first packet virtual time slot frame for sending.

18. The method of claim 17, wherein the second threshold is less than or equal to a preset value that is one of a frame length of the first packet virtual slot frame or a maximum total number of bytes allowed for the first packet virtual slot frame.

19. The method of claim 17, wherein a phase difference between a first frame start position of the first packet virtual slot frame and a second frame start position of the second packet virtual slot frame is not greater than a preset threshold.

20. The method of claim 17, wherein said scheduling the transmission of packet messages in the slot queue to the first packet virtual slot frame comprises:

dispatching the packet message to a second packet virtual container and/or a second packet time slot unit of the first packet virtual time slot frame according to a first packet virtual container and/or a first packet time slot unit to which the packet message belongs in the time slot queue, wherein the first packet virtual container and/or the first packet time slot unit has a switching relationship with the second packet virtual container and/or the second packet time slot unit; or,

and dispatching the target packet messages in the time slot queues to the first packet virtual time slot frame for transmission according to the relative positions of different target packet messages in the second packet virtual time slot frame, wherein the relative positions of different target packet messages in the first packet virtual time slot frame are the same as the relative positions of different target packet messages in the second packet virtual time slot frame, and the destination addresses of different target packet messages are the same.

21. The method of claim 17, wherein the second packet virtual slot frame and the first packet virtual slot frame are aligned with a same synchronization reference or there is a stable phase offset between the second packet virtual slot frame and the first packet virtual slot frame.

22. The method of claim 17, wherein said scheduling the transmission of packet messages in the slot queue to the first packet virtual slot frame comprises:

and under the condition that the number of the packet messages cached in the time slot queues reaches a second threshold, dispatching the packet messages in the time slot queues to the first packet virtual time slot frame for transmission by adopting an interleaved round-robin dispatching mode, wherein the interleaved round-robin dispatching mode is to dispatch the first cache unit cached in each time slot queue in sequence, dispatch the next cache unit cached in each time slot queue in sequence until the cache units cached in each time slot queue are dispatched, and cache the packet message borne by one virtual time slot unit by one cache unit.

23. The method of claim 17, wherein in the case where the egress rate of the packet packets in the slot queue to the first packet virtual slot frame is scheduled to be different from the ingress rate of the buffered packet packets to the slot queue, the size of each virtual slot unit of the first packet virtual slot frame is not exactly the same as the size of the second packet virtual slot frame, and the frame structure of the first packet virtual slot frame is the same as the frame structure of the second packet virtual slot frame, and the number of packet packets or the total number of bytes allowed by the first packet virtual slot frame is the same as the number of packet packets or the total number of bytes allowed by the second packet virtual slot frame.

24. A method of packet messaging performed by a third network device, the method comprising:

receiving at least one packet message sent by first network equipment through a first packet virtual time slot frame;

and transmitting the received at least one packet message in a packet service flow mode based on the arrival time of the at least one packet message.

25. A network device comprising a processor and a memory storing a program or instructions executable on the processor, which when executed by the processor, implement the steps of the packet messaging method of any of claims 1 to 24.

26. A readable storage medium, wherein a program or instructions is stored on the readable storage medium, which when executed by a processor, implements the steps of the packet messaging method of any of claims 1 to 24.