Service transmission method and device, and storage medium

Abstract

The invention provides a service transmission method and device and a storage medium. The service transmission method applied to first communication equipment comprises the following steps: determining an access time slot arrangement list corresponding to each access time slot according to a basic time slot mapping relation between two adjacent nodes and an exit time slot occupation condition of each node; determining an actual time slot arrangement offset corresponding to the access time slot arrangement list; and under the condition that the actual time slot arrangement offset is smaller than the pre-configured maximum time slot arrangement offset, issuing the actual time slot arrangement offset and the maximum time slot arrangement offset corresponding to the access time slot arrangement list to second communication equipment.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a service transmission method, device and storage medium. Background Art

[0002] In the implementation of the forwarding plane of Large-scale Deterministic Network (LDN), LDN has two encapsulation formats, namely switch (SWAP) and stack (STACK) modes.

[0003] In SWAP mode, the time slot mapping relationship of each type of service in the node is relatively fixed and has nothing to do with the specific service. The control plane does not support flexible time slot scheduling for services, which can easily lead to resource conflicts at the aggregation node, resulting in scheduling failures, affecting bandwidth utilization and service access and carrying efficiency. In STACK mode, two access time slots can be allocated to a service flow at the head node, but the presence of an aggregation node in the middle of the network causes time slot conflicts, which causes a deviation in the time slots between the end-to-end time slots of the two time slot scheduling lists. In order to avoid time slot deviations, time slots can be re-arranged starting from the access time slot. However, this method will not only lead to a significant decrease in scheduling efficiency when the network scale and traffic are complex, but also easily cause various problems such as aggregation point time slot scheduling failure and low resource utilization. Summary of the invention

[0004] In view of this, the embodiments of the present application provide a service transmission method, device and storage medium, which can support network-side nodes to flexibly arrange time slots while ensuring end-to-end deterministic scheduling.

[0005] The embodiment of the present application provides a service transmission method, which is applied to a first communication device, including:

[0006] Determine an access time slot arrangement list corresponding to each access time slot according to a basic time slot mapping relationship between two adjacent nodes and an egress time slot occupancy condition of each node;

[0007] Determining an actual time slot scheduling offset corresponding to the access time slot scheduling list;

[0008] In a case where the actual time slot scheduling offset is less than the pre-configured maximum time slot scheduling offset, the actual time slot scheduling offset and the maximum time slot scheduling offset corresponding to the access time slot scheduling list are sent to the second communication device.

[0009] The embodiment of the present application provides a service transmission method, which is applied to a second communication device, including:

[0010] receiving an actual time slot scheduling offset and a maximum time slot scheduling offset corresponding to an access time slot sent by a first communication device;

[0011] The actual time slot scheduling offset and the maximum time slot scheduling offset are encapsulated into a corresponding service message.

[0012] The embodiment of the present application provides a service transmission method, which is applied to a third communication device, including:

[0013] Receive a service message sent by a second communication device; wherein the service message carries at least a maximum time slot scheduling offset and an actual time slot scheduling offset corresponding to each access time slot;

[0014] Determine a target scheduling timestamp according to the initial scheduling timestamp of the service message, the maximum timeslot scheduling offset and the actual timeslot scheduling offset;

[0015] Inserting the service message into the corresponding scheduling queue according to the target scheduling timestamp;

[0016] When the system time reaches the target scheduling timestamp, the service message in the scheduling queue is sent.

[0017] An embodiment of the present application provides a communication device, including: a memory, and one or more processors;

[0018] The memory is configured to store one or more programs;

[0019] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any of the above embodiments.

[0020] An embodiment of the present application provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the method described in any of the above embodiments is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 It is a schematic diagram of time slot arrangement of nodes through which a business flow passes provided by the prior art;

[0022] Figure 2 It is a flow chart of a service transmission method provided by an embodiment of the present application;

[0023] Figure 3 This is a schematic diagram of the configuration of a maximum time slot scheduling offset provided in an embodiment of the present application;

[0024] Figure 4 is a flow chart of another service transmission method provided in an embodiment of the present application;

[0025] Figure 5 is a flow chart of another service transmission method provided in an embodiment of the present application;

[0026] Figure 6 This is a schematic diagram of scheduling a service message provided in an embodiment of the present application;

[0027] Figure 7 This is a schematic diagram of a transmission of a service message provided in an embodiment of the present application;

[0028] Figure 8 This is a schematic diagram of time slot arrangement of nodes through which a service flow passes, provided in an embodiment of the present application;

[0029] Fig. 9 It is a transmission schematic diagram of an actual time slot scheduling offset and a maximum time slot scheduling offset provided in an embodiment of the present application;

[0030] Fig.10 It is a schematic diagram of an implementation of encapsulating a maximum time slot scheduling offset and an actual time slot scheduling offset in SRv6 format provided by an embodiment of the present application;

[0031] Fig.11 It is a schematic diagram of an implementation of encapsulating a maximum time slot scheduling offset and an actual time slot scheduling offset in SPL format provided by an embodiment of the present application;

[0032] Fig.12 This is another schematic diagram of transmission of a service message provided in an embodiment of the present application;

[0033] Fig.13 It is a structural block diagram of a service transmission device provided in an embodiment of the present application;

[0034] Fig.14 is a structural block diagram of another service transmission device provided in an embodiment of the present application;

[0035] Fig.15 It is a structural block diagram of another service transmission device provided in an embodiment of the present application;

[0036] Fig.16 It is a structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0037] The following will describe the embodiments of the present application in conjunction with the accompanying drawings. The following will describe the present application in conjunction with the accompanying drawings of the embodiments, and the examples cited are only used to explain the present application and are not used to limit the scope of the present application.

[0038] In SWAP mode, the message carries the export time slot label of the upstream node. The downstream node performs label mapping based on the time slot mapping relationship obtained by periodic self-learning, thereby obtaining the export time slot label of the downstream node and performing deterministic forwarding. In SWAP mode, the time slot mapping relationship of each type of service in the node is relatively fixed and has nothing to do with the specific service. The control plane does not support flexible time slot scheduling for services, which is prone to cause resource conflicts at the aggregation node, resulting in scheduling failures, affecting bandwidth utilization and service access and carrying efficiency.

[0039] In order to improve the flexibility of control plane orchestration, the forwarding plane supports the STACK encapsulation format. For the STACK encapsulation format, the message carries the egress time slot label of each hop on the path, and each node only needs to perform forwarding scheduling based on the label value carried by the message. The STACK mode allows the service flow to encapsulate different time slot lists per hop at the head node, which greatly improves flexibility.

[0040] However, there are still problems with the hop-by-hop timeslot scheduling based on STACK encapsulation. Figure 1 It is a schematic diagram of the time slot arrangement of the nodes through which a business flow passes provided by the prior art, such as Figure 1 As shown in the figure, it is assumed that the period of a deterministic service flow1 is 40us, there is one message per service period, the basic time slot of the forwarding plane is T=10us, and the physical period is 80us. At this time, it is assumed that two access time slots {0,3} are allocated to the service flow at the head node. The controller arranges the time slots of 0 and 3 hop by hop respectively. Due to the presence of convergence conflict nodes in the middle of the network, the basic time slot mapping relationship of each hop obtained by the two arrangements may not be exactly the same. For example, the mapping relationship of the A->B node is 0->2 and 3->6, which differs by 1 time slot. There may be deviations in the end-to-end calculation, so it is impossible to ensure that the jitter is within 2T. In this example, the end-to-end deviation of the two time slot lists is 2.

[0041] In order to make the two time slot lists end-to-end symmetrical, the head node can tentatively adjust the access time slot {0,3} to {1,4}, {2,5}, {3,6}, {0,4}... and then rearrange it. However, when the network scale and traffic are complex, this method will not only lead to a significant decrease in the orchestration efficiency, but also easily cause various problems such as aggregation point time slot orchestration failure and low resource utilization.

[0042] In view of this, an embodiment of the present application provides a service transmission method, which is based on flexible time slot scheduling and forwarding plane enhanced adjustment scheme, so that it can support network side nodes to flexibly schedule time slots while ensuring end-to-end deterministic scheduling. This embodiment ensures end-to-end deterministic jitter while improving the flexibility of time slot scheduling in the hop-by-hop path. When a service flow has multiple access time slots at the head node, the control plane calculates the corresponding access time slot scheduling list for each access time slot. During the calculation process, a certain deviation is allowed for the time slots in the access time slot scheduling list, and the forwarding plane function is enhanced to ensure end-to-end determinism.

[0043] It should be noted that, during the time slot scheduling process, the allowed deviation of the time slots in the access time slot scheduling list is not unlimited, and the user is allowed to transmit the maximum allowed time slot scheduling offset to the control plane.

[0044] In one embodiment, Figure 2 1 is a flow chart of a service transmission method provided by an embodiment of the present application. This embodiment is applied to the case where time slots are flexibly arranged. This embodiment can be executed by a first communication device. For example, the first communication device can be a controller in a control plane, and the second communication device can be a head node in a forwarding plane. Figure 2 As shown, this embodiment includes: S110-S130.

[0045] S110: Determine an access time slot arrangement list corresponding to each access time slot according to a basic time slot mapping relationship between two adjacent nodes and an egress time slot occupancy status of each node.

[0046] The basic time slot mapping relationship is used to characterize the time slot value required to be separated between the basic egress time slots corresponding to two adjacent nodes. In one example, the basic time slot mapping relationship can be self-learned by the forwarding plane and reported to the control plane, or can be directly configured by the user, or a default value can be directly configured, or read from a configuration file, and there is no limitation on this. Figure 3 Schematic diagram of the configuration of the maximum time slot scheduling offset provided by the embodiment of the present application. Figure 3 As shown, the control plane can obtain the maximum time slot scheduling offset directly from the forwarding plane, or it can be configured by the user or read from a configuration file.

[0047] For example, the basic time slot mapping relationship between two adjacent nodes A and B is 0 and 3, that is, the exit time slots corresponding to nodes A and B need to be separated by 3 time slots. For example, the basic exit time slot of node A is time slot 3, and the basic exit time slot of node B should be time slot 6. In one example, the exit time slot occupancy is used to characterize whether each time slot is occupied by other business flows at the exit of each node; the access time slot scheduling list refers to the actual exit time slot corresponding to each node from the head node to the tail node. It can be understood that the number of time slots included in the access time slot scheduling list is equal to the total number of nodes included in the hop-by-hop path corresponding to a business flow. Among them, the hop-by-hop path refers to all the nodes that a business flow needs to pass through. For example, the total number of nodes included in the hop-by-hop path corresponding to a business flow is 4, and the number of time slots included in the corresponding access time slot scheduling list is 4. In one example, a business flow can be allocated multiple access time slots, and accordingly, a business flow can correspond to multiple access time slot scheduling lists. In one example, when the exit time slot determined according to the basic time slot mapping relationship between two adjacent nodes and the access time slot corresponding to the head node in the service flow is occupied by other service flows, it is necessary to continue to detect whether the next time slot is occupied until an unoccupied time slot is found as the corresponding exit time slot.

[0048] S120: Determine an actual time slot scheduling offset corresponding to the access time slot scheduling list.

[0049] Among them, the actual time slot scheduling offset is used to characterize the total number of time slots offset from the basic exit time slot of all nodes that a business flow needs to pass through. In the actual operation process, the exit time slot of the node adjacent to the head node is determined according to the basic time slot mapping relationship and one of the access time slots corresponding to the head node in the business flow. However, the exit time slot may be occupied by other business flows. At this time, it is necessary to continue to explore the occupancy of the next time slot. If it is not occupied, the next time slot is used as the exit time slot of the node adjacent to the head node. At this time, the exit time slot of the adjacent node is offset by one time slot from the basic exit time slot. By analogy, the time slot offset corresponding to each node in the business flow is determined, and the actual time slot scheduling offset corresponding to the access time slot in the business flow is obtained, that is, the actual time slot scheduling offset of the access time slot scheduling list corresponding to the access time slot.

[0050] S130: When the actual time slot scheduling offset is less than the pre-configured maximum time slot scheduling offset, the actual time slot scheduling offset and the maximum time slot scheduling offset corresponding to the access time slot scheduling list are sent to the second communication device.

[0051] Among them, the maximum time slot scheduling offset refers to the upper limit value of the actual time slot scheduling offset, that is, when the actual time slot scheduling offset is less than the maximum time slot scheduling offset, each time slot in the access time slot scheduling list is successfully scheduled, and then the first communication device sends the actual time slot scheduling offset corresponding to each access time slot and the pre-configured maximum time slot scheduling offset to the second communication device. Of course, when the actual time slot scheduling offset is greater than the maximum time slot scheduling offset, it is necessary to re-slot each node in the service flow. For example, the access time slot of the head node in the service flow can be adjusted so that the actual time slot scheduling offset corresponding to the access time slot scheduling list is within the maximum time slot scheduling offset, thereby improving the time slot scheduling flexibility of each node in the hop-by-hop path corresponding to the service flow while ensuring end-to-end deterministic jitter.

[0052] In one embodiment, determining the actual time slot scheduling offset corresponding to the access time slot scheduling list includes: determining the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list. Determining the time slot difference between two adjacent time slots in the access time slot scheduling list and the time slot difference between two corresponding adjacent time slots in the basic mapping time slot list, and then obtaining the corresponding time slot offset according to the difference between the two time slot differences, and then adding the time slot offsets of all nodes to obtain the corresponding actual time slot scheduling offset. For example, assuming that the hop-by-hop path corresponding to a service flow is node A, node B, node C and node D, and node A is the head node of the service flow, the access time slots include time slot 0 and time slot 3, the basic time slot mapping relationship between node A and node B is 0 and 3, the basic time slot mapping relationship between node B and node C is 0 and 4, and the basic time slot mapping relationship between node C and node D is 0 and 2, then the basic mapping time slot list corresponding to access time slot 0 is {0,3,7,1}, and, the access time slot scheduling list corresponding to an access time slot 0 of the head node A is {0,3,7,1}, then the corresponding actual time slot scheduling offset is 0; for another example, assuming that the access time slot scheduling list corresponding to an access time slot 3 of the head node is {3,7,4,6}, then the actual time slot scheduling offset corresponding to it and the basic mapping time slot list is 2.

[0053] In one embodiment, determining the actual time slot scheduling offset corresponding to the access time slot scheduling list includes: determining the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list. Determining the time slot difference between two adjacent time slots in the access time slot scheduling list and the time slot difference between two corresponding adjacent time slots in another access time slot scheduling list, respectively, and then obtaining the corresponding time slot offset according to the difference between the two time slot differences, and then adding the time slot offsets of all nodes to obtain the corresponding actual scheduling offset. For example, assuming that the hop-by-hop path corresponding to a service flow is node A, node B, node C and node D, and node A is the head node of the service flow, the access time slots include time slot 0 and time slot 3, the basic time slot mapping relationship between node A and node B is 0 and 3, the basic time slot mapping relationship between node B and node C is 0 and 4, and the basic time slot mapping relationship between node C and node D is 0 and 2. Then, the access time slot scheduling list corresponding to an access time slot 0 of the head node A is {0,3,7,1}, and the access time slot scheduling list corresponding to another access time slot 3 of the head node is {3,7,4,6}, and the corresponding actual scheduling offset is 2.

[0054] In one embodiment, the maximum time slot scheduling offset includes: the time slot deviation upper limit between the access time slot scheduling list and the basic mapping time slot list; the time slot deviation upper limit between the two access time slot scheduling lists. In one example, when the maximum time slot scheduling offset is used to represent the time slot deviation upper limit between the access time slot scheduling list and the basic mapping time slot scheduling list, each access time slot is scheduled hop by hop. In the process of scheduling each hop time slot, the time slot offset of each hop is compared with the basic time slot mapping relationship to obtain the time slot offset of each hop, and then the time slot offset of each hop is accumulated to obtain the actual time slot scheduling offset corresponding to the access time slot scheduling list; if the actual time slot scheduling offset exceeds the maximum time slot scheduling offset during the scheduling process, the time slot scheduling fails. In one example, when the maximum time slot scheduling offset is used to represent the time slot deviation upper limit between the two access time slot scheduling lists, each access time slot scheduling list is calculated, and the time slot offset between the access time slot scheduling list and the basic mapping time slot list is recorded. After obtaining the time slot offsets of multiple access time slot scheduling lists relative to the basic mapping time slot list, the time slot offsets are compared, and the access time slot scheduling list with the smallest time slot offset is selected as the basic mapping time slot list, and the time slot offset of the basic mapping time slot list is subtracted from the time slot offsets of other access time slot scheduling lists, and then the time slot offset of the basic mapping time slot list is set to 0; if there is an access time slot scheduling list whose time slot offset exceeds the maximum time slot scheduling offset, the time slot scheduling fails.

[0055] In one embodiment, the maximum time slot scheduling offset is determined by at least one of the following parameters: the capacity of the buffer queue in the forwarding plane; the buffer capacity of the regulator and the port bandwidth; the network load; the service characteristics; the network scale. In one example, the maximum time slot scheduling offset is related to the buffer queue capacity arranged by the forwarding plane, and can also be related to the buffer capacity of the regulator and the port bandwidth, and there is a linear relationship between the two. In one example, when the maximum time slot scheduling offset is related to the network load, if the network load is low and the convergence conflict is less, the maximum time slot scheduling offset can be set to a smaller value; if the network load is high, due to the convergence conflict, the maximum time slot scheduling offset can be set to a larger value. In one example, when the maximum time slot scheduling offset is related to the service characteristics, if the number of access time slots corresponding to the head node is large, the maximum time slot scheduling offset can be set to a larger value; if the head node has only one access time slot, the maximum time slot scheduling offset can be set to 0. In one example, the maximum time slot scheduling offset is positively correlated with the network scale, and is also positively correlated with the number of convergence nodes in the network.

[0056] In one embodiment, the service transmission method applied to the first communication device further includes: sending the end-to-end hop-by-hop path corresponding to the access time slot scheduling list to the second communication device. The end-to-end hop-by-hop path refers to the path composed of all nodes that the service flow needs to pass through, which can also be referred to as the hop-by-hop path. After the first communication device completes the time slot scheduling of each access time slot, while sending the scheduling result to the second communication device, it is also necessary to send the maximum time slot scheduling offset, the actual time slot scheduling offset, and the end-to-end hop-by-hop path to the second communication device.

[0057] In one embodiment, the number of access time slot scheduling lists is the same as the number of access time slots allocated to the second communication device. One or more access time slots may be allocated to the second communication device by the first communication device, and the number of access time slot scheduling lists is the same as the number of access time slots allocated to the second communication device. For example, if the first communication device allocates 2 access time slots to the second communication device, the corresponding access time slot scheduling lists are 2.

[0058] In one embodiment, the encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane. After the second communication device receives the service message, the first communication device allocates the access time slot of the head node to the service message, and encapsulates the actual time slot scheduling offset, the maximum time slot scheduling offset, the access time slot scheduling list, and the hop-by-hop path information in the service message. The encapsulation format of the data plane is not limited, and the encapsulation format corresponding to the service message may include but is not limited to one of the following: IPv4, IPv6, MPLS, SR or SRv6.

[0059] In one embodiment, Figure 4 1 is a flow chart of another service transmission method provided by an embodiment of the present application. This embodiment is applied to the case where time slots are flexibly arranged. This embodiment can be executed by a second communication device. For example, the second communication device can be a head node in a forwarding plane. Figure 4 As shown, this embodiment includes: S210-S220.

[0060] S210: Receive an actual time slot scheduling offset and a maximum time slot scheduling offset corresponding to an access time slot sent by a first communication device.

[0061] After the first communication device completes the time slot scheduling of each access time slot, the actual time slot scheduling offset corresponding to each access time slot scheduling list is obtained, and then the actual time slot scheduling offset corresponding to each access time slot scheduling list and the pre-configured maximum time slot scheduling offset are sent to the second communication device.

[0062] S220: Encapsulate the actual time slot scheduling offset and the maximum time slot scheduling offset into a corresponding service message.

[0063] The second communication device encapsulates the actual time slot scheduling offset and the maximum time slot scheduling offset to obtain a corresponding service message, and sends the service message to the third communication device, so that the third communication device performs message scheduling according to the actual time slot scheduling offset and the maximum time slot scheduling offset.

[0064] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list.

[0065] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list.

[0066] In one embodiment, the maximum time slot scheduling offset includes: an upper limit value of the time slot deviation between the access time slot scheduling list and the basic mapping time slot list; and an upper limit value of the time slot deviation between two access time slot scheduling lists.

[0067] In one embodiment, the maximum time slot scheduling offset is determined by at least one of the following parameters: buffer queue capacity in the forwarding plane; regulator buffer capacity and port bandwidth; network load; service characteristics; network scale.

[0068] In one embodiment, the service transmission method applied to the second communication device further includes: receiving an end-to-end hop-by-hop path corresponding to the access time slot scheduling list sent by the first communication device.

[0069] In one embodiment, the number of the access slot schedule list is the same as the number of access slots allocated to the second communication device.

[0070] In one embodiment, the encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane.

[0071] It should be noted that for the explanation of parameters such as the actual time slot scheduling offset, the access time slot scheduling list, the maximum time slot scheduling offset, etc. in the service transmission method applied to the second communication device, please refer to the description of the corresponding parameters in the above-mentioned service transmission method applied to the first communication device, and will not be repeated here.

[0072] In one embodiment, Figure 5 1 is a flow chart of another service transmission method provided by an embodiment of the present application. This embodiment is applied to the case where time slots are flexibly arranged. This embodiment can be executed by a third communication device. For example, the third communication device can be an end node in the forwarding plane. Figure 5 As shown, this embodiment includes: S310-S340.

[0073] S310. Receive a service message sent by a second communication device; wherein the service message carries at least a maximum time slot scheduling offset and an actual time slot scheduling offset corresponding to each access time slot.

[0074] After the third communication device receives the service message, it is necessary to recover the path time slot scheduling deviation and eliminate the path time slot scheduling deviation between the access time slot scheduling lists. A regulator first-in-first-out (Push In First Out, PIFO) queue can be added after the cyclic queue, and the PIFO queue allows the service message to be inserted into any position of the queue according to certain rules. When the third communication device schedules the service message from the cyclic queue, it does not need to send the service message to the transmission line, but directly inserts the service message into the PIFO queue.

[0075] S320: Determine a target scheduling timestamp according to an initial scheduling timestamp, a maximum timeslot scheduling offset, and an actual timeslot scheduling offset of the service message.

[0076] The initial scheduling timestamp refers to the timestamp of scheduling the service message from the periodic cyclic queue; the target scheduling timestamp refers to the time when the service message is expected to be actually sent. When the third communication device schedules the service message from the periodic cyclic queue, the local timestamp of the current node is recorded as the initial scheduling timestamp, and then the maximum time slot scheduling offset and the actual time slot scheduling offset carried in the service message are extracted, and the target scheduling timestamp is calculated based on the initial scheduling timestamp, the maximum time slot scheduling offset and the actual time slot scheduling offset.

[0077] S330. Insert the service message into the corresponding scheduling queue according to the target scheduling timestamp.

[0078] The scheduling queue refers to the PIFO queue. The third communication device inserts the service message into the PIFO queue according to the target scheduling timestamp. Each service message in the PIFO queue is associated with a corresponding target scheduling timestamp. The closer the service message is to the head of the PIFO queue, the earlier the target scheduling timestamp is; the closer the service message is to the tail of the PIFO queue, the later the target scheduling timestamp is.

[0079] S340: When the system time reaches the target scheduling timestamp, the service message in the scheduling queue is sent.

[0080] When the service message reaches the head of the PIFO queue, the relationship between the system time and the target scheduling timestamp is determined. If the system time reaches the target scheduling timestamp or exceeds the target scheduling timestamp, the service message is allowed to be scheduled from the scheduling queue and sent out from the port of the tail node.

[0081] In one embodiment, the target scheduling timestamp is determined according to the initial scheduling timestamp, the maximum time slot scheduling offset and the actual time slot scheduling offset of the service message, including: determining the difference between the maximum time slot scheduling offset and the actual time slot scheduling offset to obtain the corresponding time slot scheduling offset difference; determining the target scheduling timestamp according to the initial scheduling timestamp and the time slot scheduling offset difference of the service message. The time slot scheduling offset difference refers to the difference between the maximum time slot scheduling offset and the actual time slot scheduling offset, and the time slot scheduling offset difference is a positive number. The time slot scheduling offset is added to the initial scheduling timestamp of the service message to obtain the corresponding target scheduling timestamp.

[0082] In one example, Figure 6 This is a schematic diagram of a scheduling of a service message provided in an embodiment of the present application. In the embodiment, the scheduling process of the service message is described by taking the initial scheduling timestamp of the service message as timestamp, the maximum time slot scheduling offset as maxPCO, the actual time slot scheduling offset as PCO, the target scheduling timestamp as targetTimeStamp, and the scheduling queue as a PIFO queue as an example. Figure 6 As shown, when the system time reaches timestamp+(maxPCO-PCO), the service message is sent from the regulator PIFO queue.

[0083] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list.

[0084] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list.

[0085] In one embodiment, the maximum time slot scheduling offset includes: an upper limit value of the time slot deviation between the access time slot scheduling list and the basic mapping time slot list; and an upper limit value of the time slot deviation between two access time slot scheduling lists.

[0086] In one embodiment, the maximum time slot scheduling offset is determined by at least one of the following parameters: buffer queue capacity in the forwarding plane; regulator buffer capacity and port bandwidth; network load; service characteristics; network scale.

[0087] In one embodiment, the number of the access slot schedule list is the same as the number of access slots allocated to the second communication device.

[0088] In one embodiment, the encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane.

[0089] It should be noted that for the explanation of parameters such as the actual time slot scheduling offset and the maximum time slot scheduling offset in the service transmission method applied to the third communication device, please refer to the description of the corresponding parameters in the service transmission method applied to the first communication device mentioned above, and will not be repeated here.

[0090] In one example, Figure 7 This is a transmission diagram of a service message provided by an embodiment of the present application. In this embodiment, the first communication device is used as the controller of the control plane, the second communication device is used as the head node, the third communication device is used as the tail node, the initial scheduling timestamp is timestamp, the maximum time slot scheduling offset is recorded as maxPCO, the actual time slot scheduling offset is recorded as PCO, the target scheduling timestamp is targetTimeStamp, and the scheduling queue is a PIFO queue as an example to illustrate the transmission process of the service message in the forwarding plane. Figure 7 As shown in the figure, the transmission process of the service message includes the following steps:

[0091] S410, determine whether it is a head node, if so, execute S420; if not, execute S440.

[0092] S420: Receive maxPCO and PCO corresponding to an access timeslot scheduling list sent by the controller.

[0093] S430 , encapsulate maxPCO and PCO into corresponding service messages.

[0094] S440: Schedule the service message from the periodic cycle queue and record the timestamp.

[0095] S450: Extract maxPCO and PCO carried in the service message.

[0096] S460. Obtain targetTimeStamp according to timestamp, maxPCO and PCO.

[0097] S470 . Insert the service message into the PIFO queue according to the targetTimeStamp.

[0098] S480: If the system time is greater than or equal to targetTimeStamp, schedule and send the service message from the PIFO queue.

[0099] The actual time slot scheduling offset corresponding to the access time slot scheduling list in the network is PCO. At the tail node, the service message is actively delayed by the difference between maxPCO and PCO. The total backward offset time of all service messages is PCO+(maxPCO-PCO)=maxPCO, thereby ensuring end-to-end jitter determinism.

[0100] In an example, this embodiment illustrates that by allowing configuration of the actual time slot scheduling offset corresponding to the end-to-end access time scheduling list, the flexibility and success rate of hop-by-hop time slot scheduling are improved. The maximum time slot scheduling offset maxPCO of the pre-configured control plane is 3, indicating the upper limit of the deviation from the basic mapping time slot list, or the upper limit of the deviation from the access time slot scheduling list.

[0101] Figure 8 Schematic diagram of time slot arrangement of nodes through which a service flow passes provided in an embodiment of the present application, such as Figure 8 As shown, assuming that the port physical period T = 10us & N = 8, the time slot number is 0 to 7, Figure 8 The "3,7" marked at node B indicates that among the 7 time slots 0 to 7, time slots 0, 1, 2, 4, 5, and 6 are occupied, while time slots 3 and 7 are idle. Assume that due to the configuration of flow2 and flow3, some time slots at the B node egress and the C node egress are already in use. It is known that the basic time slot mapping relationship of the A egress -> B egress is 0->3, the basic time slot mapping relationship of the B egress -> C egress is 0->4, and the basic time slot mapping relationship of the C egress -> D egress is 0->2.

[0102] The controller receives a time slot scheduling request for service flow flow1, which is accessed from node A and sent from node D. The service cycle of flow1 is 40us. Since the egress time slot of node A is idle, the control plane allocates two head node access time slots 0 and 3 for flow1, as shown in the small box at the egress of node A. First, the head node access time slot 0 is end-to-end scheduled, and the access time slot scheduling list is {0,3,7,1}. Then, the head node access time slot 3 is hop-by-hop scheduled. The egress time slot 6 of node B is occupied, and the next time slot 7 is explored backward and found to be available. At the egress of node C, time slot 3 is found to be occupied, and the next time slot 4 is explored backward, and finally the access time slot scheduling list is {3,7,4,6}.

[0103] The basic mapping time slot list is {0,3,7,1}, and the access time slot scheduling list of the head node access time slot 0 is {0,3,7,1}. It can be seen that the actual time slot scheduling offset PCO corresponding to the access time slot scheduling list is 0. The access time slot scheduling list of the head node 3 is {3,7,4,6}, and the actual time slot scheduling offset between the basic mapping time slot list or the access time slot scheduling list of the head node time slot 0 is PCO = +2. Under the two maxPCO deviation definition methods, if the PCO value is within the range of [0,maxPCO], the path calculation is successful.

[0104] If flexible scheduling based on maxPCO configuration is not allowed, even if the head node changes access slot 3 to slot 4, so that node B can schedule slot 7 successfully, node C still cannot obtain available slot 3, and scheduling will fail. It can be seen that allowing flexible scheduling within the maxPCO range improves the success rate of scheduling at node C.

[0105] In one example, Fig. 9 FIG. 1 is a transmission diagram of an actual time slot scheduling offset and a maximum time slot scheduling offset provided by an embodiment of the present application. Fig. 9 As shown, the control surface will be Figure 8 The scheduling result shown is sent to node A. The hop-by-hop path is node A, node B, node C, and node D in order; the maximum time slot scheduling offset maxPCO is 3; the access time slot scheduling list of access time slot 0 is {0,3,7,1}, and the actual time slot scheduling offset PCO is 0; the access time slot scheduling list of access time slot 3 is {3,7,4,6}, and the actual time slot scheduling offset PCO is 2.

[0106] In an embodiment, the actual time slot scheduling offset, the maximum time slot scheduling offset, the access time slot scheduling list and the hop-by-hop path can be defined based on a YANG file, that is, the southbound interface can be defined based on a YANG file. Wherein, the southbound interface can also send down the maximum time slot scheduling offset and the actual time slot scheduling offset corresponding to the access time slot scheduling list while sending down the hop-by-hop path and the access time slot scheduling list. Wherein, the hop-by-hop path can be a string type, and the maximum time slot scheduling offset, the access time slot scheduling list and the actual time slot scheduling offset can be a data type, such as uint8.

[0107] In an example, this embodiment illustrates an implementation method in which the forwarding plane carries PCO and maxPCO related information by encapsulation, thereby ensuring the end-to-end jitter determinism through an enhanced scheduling mechanism.

[0108] The head node extends the service message to carry maxPCO and PCO information. The specific extension method is related to the data plane message format. For example, Fig.101 is a schematic diagram of an implementation of encapsulating the maximum time slot scheduling offset and the actual time slot scheduling offset in SRv6 format provided by an embodiment of the present application. Fig.10 As shown in the figure, the SRv6 encapsulation format is used on the data plane, and there are multiple extension methods. A separate SID can be defined to carry the above information, or it can be extended and carried in the existing Hop-by-Hop header. Among them, maxPCO and PCO each occupy 4 bytes.

[0109] For another example, when the data plane uses MPLS encapsulation, there are many extension methods, such as based on the synonymous flow label (SFL) technology, based on the special purpose label (SPL) or the extended SPL indication to carry a special label. For another example, the Path Segment label of the SR-MPLS message can be used to carry the above information. For example, Fig.11 FIG. 1 is a schematic diagram of an implementation of encapsulating the maximum time slot scheduling offset and the actual time slot scheduling offset in SPL format provided by an embodiment of the present application. Fig.11 As shown, a typical example of using SPL to define the packaging format is as follows Fig.11 shown.

[0110] As Figure 8 Taking the illustrated embodiment as an example, the transmission process of the service message is described. Fig.12 This is another transmission diagram of a service message provided in an embodiment of the present application. The head node has two access time slots. The access time slot arrangement list corresponding to the first access time slot is {0,3,7,1}&PCO=0, and the access time slot arrangement list corresponding to the second access time slot is {3,7,4,6}&PCO=2, maxPCO=3. Assuming that two messages P1 of the service flow access time slot 0 at the head node and P2 access time slot 3, they will be sent out from time slot 1 and time slot 6 at the tail node respectively, and the access time difference at the head node is 30us. Fig.12 As shown, jitter recovery is performed through the PIFO queue.

[0111] If the timestamp of the P1 message when it is sent from the queue is t1, and the timestamp of the P2 message when it is sent from the queue is t2, since the circular queues are called out from time slots 1 and 6 respectively, the interval between the two timestamps t1 and t2 needs to be 4T. After the timestamp of the P1 message is adjusted to t1+maxPCO-PCO, the target scheduling timestamp is t1+30us; similarly, the target scheduling timestamp of P2 is t2+10us. P1 and P2 are inserted into the PIFO queue according to the initial scheduling timestamp. When the system time reaches t1+30us, the message P1 is sent; similarly, when the system time is t2+10us, the message is sent. The interval between the scheduling timestamps of the two messages is reduced to 2T, and the access time difference of the two service messages at the head node is the same (the difference between 0 and 3 is 2T), thus ensuring jitter determinism.

[0112] In one embodiment, Fig.13 1 is a structural block diagram of a service transmission device provided in an embodiment of the present application. This embodiment is applied to a first communication device. Fig.13 As shown, the service transmission device in this embodiment includes: a first determination module 510 , a second determination module 520 and a transmission module 530 .

[0113] The first determination module 510 is configured to determine the access time slot arrangement list corresponding to each access time slot according to the basic time slot mapping relationship between two adjacent nodes and the exit time slot occupancy of each node.

[0114] The second determining module 520 is configured to determine an actual time slot scheduling offset corresponding to the access time slot scheduling list.

[0115] The transmission module 530 is configured to send the actual time slot scheduling offset and the maximum time slot scheduling offset corresponding to the access time slot scheduling list to the second communication device when the actual time slot scheduling offset is less than the pre-configured maximum time slot scheduling offset.

[0116] In one embodiment, the second determining module 520 is further configured to determine a corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list.

[0117] In one embodiment, the second determining module 520 is further configured to determine a corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list.

[0118] In one embodiment, the maximum time slot scheduling offset includes: an upper limit value of the time slot deviation between the access time slot scheduling list and the basic mapping time slot list; and an upper limit value of the time slot deviation between two access time slot scheduling lists.

[0119] In one embodiment, the maximum time slot scheduling offset is determined by at least one of the following parameters: buffer queue capacity in the forwarding plane; regulator buffer capacity and port bandwidth; network load; service characteristics; network scale.

[0120] In one embodiment, the service transmission device applied to the first communication device further includes:

[0121] The transmission module 530 is further configured to send the end-to-end hop-by-hop path corresponding to the access time slot scheduling list to the second communication device.

[0122] In one embodiment, the number of the access slot schedule list is the same as the number of access slots allocated to the second communication device.

[0123] In one embodiment, the encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane.

[0124] The service transmission device provided in this embodiment is configured to implement Figure 2 The service transmission method applied to the first communication device in the illustrated embodiment and the service transmission device provided in this embodiment have similar implementation principles and technical effects, which will not be described in detail here.

[0125] In one embodiment, Fig.14 1 is a structural block diagram of another service transmission device provided in an embodiment of the present application. This embodiment is applied to a second communication device. Fig.14 As shown, the service transmission device in this embodiment includes: a receiver 610 and an encapsulation module 620.

[0126] The receiver 610 is configured to receive an actual time slot scheduling offset and a maximum time slot scheduling offset corresponding to an access time slot sent by a first communication device;

[0127] The encapsulation module 620 is configured to encapsulate the actual time slot scheduling offset and the maximum time slot scheduling offset into the corresponding service message.

[0128] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list.

[0129] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list.

[0130] In one embodiment, the maximum time slot scheduling offset includes: an upper limit value of the time slot deviation between the access time slot scheduling list and the basic mapping time slot list; and an upper limit value of the time slot deviation between two access time slot scheduling lists.

[0131] In one embodiment, the maximum time slot scheduling offset is determined by at least one of the following parameters: buffer queue capacity in the forwarding plane; regulator buffer capacity and port bandwidth; network load; service characteristics; network scale.

[0132] In one embodiment, the service transmission apparatus applied to the second communication device further includes: a receiver 610 configured to receive an end-to-end hop-by-hop path corresponding to the access time slot scheduling list sent by the first communication device.

[0133] In one embodiment, the number of the access slot schedule list is the same as the number of access slots allocated to the second communication device.

[0134] In one embodiment, the encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane.

[0135] The service transmission device provided in this embodiment is configured to implement Figure 4 The service transmission method applied to the second communication device in the illustrated embodiment is similar to the implementation principle and technical effect of the service transmission device provided in this embodiment, and will not be described in detail here.

[0136] In one embodiment, Fig.15 1 is a structural block diagram of another service transmission device provided in an embodiment of the present application. This embodiment is applied to a second communication device. Fig.15 As shown, the service transmission device in this embodiment includes: a receiver 710 , a first determination module 720 , an insertion module 730 and a transmission module 740 .

[0137] The receiver 710 is configured to receive a service message sent by the second communication device; wherein the service message carries at least a maximum time slot scheduling offset and an actual time slot scheduling offset corresponding to each access time slot;

[0138] A first determination module 720 is configured to determine a target scheduling timestamp according to an initial scheduling timestamp, a maximum timeslot scheduling offset, and an actual timeslot scheduling offset of a service message;

[0139] Insertion module 730, configured to insert the service message into the corresponding scheduling queue according to the target scheduling timestamp;

[0140] The transmission module 740 is configured to send the service message in the scheduling queue when the system time reaches the target scheduling timestamp.

[0141] In one embodiment, the first determining module 720 includes:

[0142] A first determining unit is configured to determine a difference between a maximum time slot scheduling offset and an actual time slot scheduling offset to obtain a corresponding time slot scheduling offset difference;

[0143] The second determining unit is configured to determine a target scheduling timestamp according to an initial scheduling timestamp of the service message and a difference between the timeslot scheduling offset.

[0144] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list.

[0145] In one embodiment, the first communication device determines the corresponding actual scheduling offset according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list.

[0146] In one embodiment, the maximum time slot scheduling offset includes: an upper limit value of the time slot deviation between the access time slot scheduling list and the basic mapping time slot list; and an upper limit value of the time slot deviation between two access time slot scheduling lists.

[0147] In one embodiment, the maximum time slot scheduling offset is determined by at least one of the following parameters: buffer queue capacity in the forwarding plane; regulator buffer capacity and port bandwidth; network load; service characteristics; network scale.

[0148] In one embodiment, the number of the access slot schedule list is the same as the number of access slots allocated to the second communication device.

[0149] In one embodiment, the encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane.

[0150] The service transmission device provided in this embodiment is configured to implement Figure 5 The service transmission method applied to the third communication device in the illustrated embodiment is similar to the implementation principle and technical effect of the service transmission device provided in this embodiment, and will not be described in detail here.

[0151] In one embodiment, Fig.16 Schematic diagram of a communication device provided in an embodiment of the present application. Fig.16As shown, the device provided by the present application includes: a processor 810, a memory 820 and a communication module 830. The number of processors 810 in the device can be one or more. Fig.16 In the example, a processor 810 is used. The number of memories 820 in the device may be one or more. Fig.16 A memory 820 is taken as an example. The processor 810, the memory 820 and the communication module 830 of the device can be connected via a bus or other means. Fig.16 In the embodiment, the device may be a first communication device, a second communication device or a third communication device.

[0152] The memory 820, as a computer-readable storage medium, may be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the device of any embodiment of the present application (e.g., the first determination module 510, the second determination module 520, and the transmission module 530 in the service transmission device). The memory 820 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the device, etc. In addition, the memory 820 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 820 may further include a memory remotely arranged relative to the processor 810, and these remote memories may be connected to the device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0153] In the case where the communication device is a first communication device, the device provided above can be configured to execute the service transmission method applied to the first communication device provided in any of the above embodiments, and have corresponding functions and effects.

[0154] In the case where the communication device is a second communication device, the device provided above can be configured to execute the service transmission method applied to the second communication device provided in any of the above embodiments, and have corresponding functions and effects.

[0155] In the case where the communication device is a third communication device, the device provided above can be configured to execute the service transmission method applied to the third communication device provided in any of the above embodiments, and have corresponding functions and effects.

[0156] An embodiment of the present application also provides a storage medium containing computer executable instructions, which, when executed by a computer processor, are used to execute a service transmission method applied to a first communication device, the method comprising: determining an access time slot scheduling list corresponding to each access time slot based on a basic time slot mapping relationship between two adjacent nodes and an exit time slot occupancy status of each node; determining an actual time slot scheduling offset corresponding to the access time slot scheduling list; and when the actual time slot scheduling offset is less than a pre-configured maximum time slot scheduling offset, sending the actual time slot scheduling offset and the maximum time slot scheduling offset corresponding to the access time slot scheduling list to a second communication device.

[0157] An embodiment of the present application also provides a storage medium containing computer executable instructions, which, when executed by a computer processor, are used to execute a service transmission method applied to a second communication device, the method comprising: receiving an actual time slot scheduling offset and a maximum time slot scheduling offset corresponding to an access time slot sent by a first communication device; and encapsulating the actual time slot scheduling offset and the maximum time slot scheduling offset into a corresponding service message.

[0158] An embodiment of the present application also provides a storage medium containing computer executable instructions, which, when executed by a computer processor, are used to execute a service transmission method applied to a third communication device, the method comprising: receiving a service message sent by a second communication device; wherein the service message carries at least a maximum time slot scheduling offset and an actual time slot scheduling offset corresponding to each access time slot; determining a target scheduling timestamp according to an initial scheduling timestamp, a maximum time slot scheduling offset and an actual time slot scheduling offset of the service message; inserting the service message into a corresponding scheduling queue according to the target scheduling timestamp; and sending the service message in the scheduling queue when the system time reaches the target scheduling timestamp.

[0159] It will be appreciated by those skilled in the art that the term user equipment encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a car-mounted mobile station.

[0160] In general, various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, microprocessor or other computing device, although the present application is not limited thereto.

[0161] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0162] The block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. A computer program may be stored on a memory. The memory may have any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs (DVD) or compact disks (CD)), etc. Computer-readable media may include non-transient storage media. A data processor may be any type suitable for the local technical environment, such as but not limited to a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FGPAs) and a processor based on a multi-core processor architecture.

[0163] The above are only preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A service transmission method, characterized in that: Applied to a first communication device, comprising: Determine an access time slot arrangement list corresponding to each access time slot according to a basic time slot mapping relationship between two adjacent nodes and an egress time slot occupancy condition of each node; Determining an actual time slot scheduling offset corresponding to the access time slot scheduling list; In a case where the actual time slot scheduling offset is less than the pre-configured maximum time slot scheduling offset, the actual time slot scheduling offset and the maximum time slot scheduling offset corresponding to the access time slot scheduling list are sent to the second communication device.

2. The method according to claim 1, characterized in that Determining an actual time slot scheduling offset corresponding to the access time slot scheduling list includes: The corresponding actual scheduling offset is determined according to each time slot in the access time slot scheduling list and each time slot in the basic mapping time slot list.

3. The method according to claim 1, characterized in that: Determining an actual time slot scheduling offset corresponding to the access time slot scheduling list includes: The corresponding actual scheduling offset is determined according to each time slot in the access time slot scheduling list and each time slot in another access time slot scheduling list.

4. The method according to claim 1, characterized in that: The maximum time slot scheduling offset includes: an upper limit value of the time slot deviation between the access time slot scheduling list and the basic mapping time slot list; and an upper limit value of the time slot deviation between two access time slot scheduling lists.

5. The method according to claim 1, characterized in that The maximum time slot scheduling offset is determined by at least one of the following parameters: buffer queue capacity in the forwarding plane; regulator buffer capacity and port bandwidth; network load; service characteristics; network scale.

6. The method according to claim 1, characterized in that Also includes: The end-to-end hop-by-hop path corresponding to the access time slot scheduling list is sent to the second communication device.

7. The method according to claim 1, characterized in that The number of the access time slot arrangement list is the same as the number of access time slots allocated to the second communication device.

8. The method according to claim 1, characterized in that The encapsulated message corresponding to the actual time slot scheduling offset and the maximum time slot scheduling offset includes at least one of the following: Internet Protocol IPv4; IPv6; Multi-Protocol Label Switching MPLS; Segment Routing SR; Segment Routing SRv6 based on IPv6 forwarding plane.

9. A service transmission method, characterized in that: Applied to a second communication device, comprising: receiving an actual time slot scheduling offset and a maximum time slot scheduling offset corresponding to an access time slot sent by a first communication device; The actual time slot scheduling offset and the maximum time slot scheduling offset are encapsulated into a corresponding service message.

10. A service transmission method, characterized in that: Applicable to a third communication device, comprising: Receive a service message sent by a second communication device; wherein the service message carries at least a maximum time slot scheduling offset and an actual time slot scheduling offset corresponding to each access time slot; Determine a target scheduling timestamp according to the initial scheduling timestamp of the service message, the maximum timeslot scheduling offset and the actual timeslot scheduling offset; Inserting the service message into the corresponding scheduling queue according to the target scheduling timestamp; When the system time reaches the target scheduling timestamp, the service message in the scheduling queue is sent.

11. The method according to claim 10, characterized in that The determining the target scheduling timestamp according to the initial scheduling timestamp of the service message, the maximum timeslot scheduling offset and the actual timeslot scheduling offset comprises: Determine a difference between the maximum time slot scheduling offset and the actual time slot scheduling offset to obtain a corresponding time slot scheduling offset difference; The target scheduling timestamp is determined according to the difference between the initial scheduling timestamp of the service message and the timeslot scheduling offset.

12. A communication device, characterized in that: include: memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any one of claims 1-8, 9 or 10-11.

13. A storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 8, 9 or 10 to 11 is implemented.

Images