CN117240801A

CN117240801A - Data scheduling processing method, device, apparatus and storage medium

Info

Publication number: CN117240801A
Application number: CN202210648153.1A
Authority: CN
Inventors: 程志密; 宋雅琴
Original assignee: Datang Mobile Communications Equipment Co Ltd
Current assignee: Datang Mobile Communications Equipment Co Ltd
Priority date: 2022-06-08
Filing date: 2022-06-08
Publication date: 2023-12-15
Also published as: WO2023236832A1

Abstract

The embodiment of the application provides a data scheduling processing method, equipment, a device and a storage medium, wherein the method comprises the following steps: according to traffic information of forwarding equipment and service requirements of data streams, a periodic mapping relation or a sending queue of the data streams forwarded by the forwarding equipment is adjusted; updating message processing logic of the data stream with the changed periodic mapping relation or the sending queue according to the adjusted periodic mapping relation or the sending queue; and sending the updated message processing logic to the forwarding equipment. The transmission scheduling mechanism of the forwarding equipment for each data stream is dynamically adjusted according to the network traffic condition and the service requirements of the data stream, so that the network traffic change can be dynamically adapted, the bandwidth utilization rate is effectively improved, and differentiated services can be provided for different service requirements.

Description

Data scheduling processing method, device, apparatus and storage medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a data scheduling processing method, device, apparatus, and storage medium.

Background

The development of emerging services in the industrial internet, telemedicine, internet of vehicles, 5G vertical industries, etc., requires that the network be able to provide "on-time, accurate" data transmission quality of service (Quality of Service, qoS), i.e., deterministic quality of service, to meet the latency and jitter requirements of these services for data transmission.

Currently, deterministic internet protocol (Determinisitic Internet Protocol, DIP) technology can determine jitter of data transmission within 2 times of cycle length, and a data scheduling processing method of multi-deterministic network (Deterministic Networking, detNet) flows based on queue time slices can also determine jitter of data transmission within a fixed time of cycle length, and although the processing mode of a specified data flow in a sending network within the fixed time can ensure low time delay and jitter of specific traffic flow transmission, for the case that no data flow is sent in some queues or cycles or the current flow in the network is smaller, if data transmission still needs to be performed according to a cycle period subscribed in advance, the utilization rate of bandwidth resources is lower; however, in the case where there is no requirement for jitter in the data stream and the delay is desired to be as low as possible, the fixed-period forwarding method cannot provide differentiated services.

Disclosure of Invention

The embodiment of the application provides a data scheduling processing method, equipment, a device and a storage medium, which are used for improving the bandwidth utilization rate and meeting differentiated service requirements.

In a first aspect, an embodiment of the present application provides a data scheduling processing method, including:

According to traffic information of forwarding equipment and service requirements of data streams, a periodic mapping relation or a sending queue of the data streams forwarded by the forwarding equipment is adjusted;

updating message processing logic of the data stream with the changed periodic mapping relation or the sending queue according to the adjusted periodic mapping relation or the sending queue;

and sending the updated message processing logic to the forwarding equipment.

Optionally, the adjusting the cycle mapping relation or the sending queue of the data stream forwarded by the forwarding device according to the traffic information of the forwarding device and the service requirement of the data stream includes:

in the case that the data stream comprises a first type of data stream, maintaining the periodic mapping relation or the sending queue of the first type of data stream unchanged; and/or the number of the groups of groups,

when the data stream comprises a second class data stream, adjusting a periodic mapping relation or a sending queue of the second class data stream according to the flow information of the forwarding device;

the first type of data stream is a data stream with jitter requirement smaller than or equal to a set threshold, and the second type of data stream is other data streams except the first type of data stream.

Optionally, the adjusting the periodic mapping relation or the sending queue of the second class of data flows according to the traffic information of the forwarding device includes:

when the forwarding device has a period without data to be sent, adjusting a period mapping relation of a first target data stream in the second class of data streams to forward the first target data stream to the period without data to be sent;

and the sending period of the first target data stream before the period mapping relation is adjusted is positioned after the period of no data to be sent.

under the condition that the forwarding equipment has periods needing to be sent without data, reducing the number of the cycle periods of the forwarding equipment according to the number of the periods needing to be sent without data;

and adjusting the cycle mapping relation of the second class data stream according to the reduced cycle period number of the forwarding equipment.

When the forwarding device has a period with residual transmission resources, adjusting a period mapping relation of a second target data stream in the second class of data streams to forward the second target data stream to the period with residual transmission resources;

and the sending period of the second target data stream before the period mapping relation is adjusted is positioned after the period with the residual transmission resources.

Optionally, after the adjusting the period mapping relation of the second target data stream in the second class of data streams, in a case that the forwarding device has a period that no data needs to be sent, the method further includes:

reducing the number of cycle periods of the forwarding device according to the number of periods needing to be sent without data;

when the forwarding device has a queue without data to be sent, adjusting a sending queue of a third target data stream in the second class of data streams to forward the third target data stream to the queue without data to be sent in advance;

And the queue of the third target data flow before the transmission queue is adjusted is positioned behind the queue which does not need to be transmitted.

under the condition that the forwarding equipment has no queue to be transmitted, reducing the number of the queues of the forwarding equipment according to the number of the queues to be transmitted without data;

and adjusting the time slices corresponding to the transmission queues of the second class data stream according to the reduced number of the queues of the forwarding device.

adjusting a sending queue of a fourth target data stream in the second class of data streams under the condition that the forwarding device has a queue with residual transmission resources, so as to forward the fourth target data stream to the queue with residual transmission resources in advance;

and the fourth target data flow is positioned in a queue before the transmission queue is adjusted and is positioned behind the queue with the residual transmission resources.

Optionally, after the adjusting the transmission queue of the fourth target data flow in the second class of data flows, in a case that the forwarding device has a queue that does not have data to transmit, the method further includes:

reducing the number of queues of the forwarding equipment according to the number of queues which do not need to be sent;

Optionally, the updating the message processing logic of the data stream with the changed periodic mapping relation or the sending queue according to the adjusted periodic mapping relation or the sending queue includes:

according to the adjusted transmission queue, re-determining a queue configuration rule corresponding to the forwarding device and the effective time of the queue configuration rule;

and updating the message processing logic of the data flow with changed transmission queue according to the redetermined queue configuration rule corresponding to the forwarding equipment and the effective time of the queue configuration rule.

In a second aspect, an embodiment of the present application further provides a network control device, including a memory, a transceiver, and a processor:

A memory for storing a computer program; a transceiver for transceiving data under control of the processor; a processor for reading the computer program in the memory and performing the following operations:

and sending the updated message processing logic to the forwarding equipment.

Optionally, after the adjusting the period mapping relation of the second target data stream in the second class of data streams, in a case that the forwarding device has a period in which no data needs to be sent, the operations further include:

Optionally, after the adjusting the transmission queue of the fourth target data flow in the second class of data flows, in a case that the forwarding device has a queue that does not have data to transmit, the operations further include:

In a third aspect, an embodiment of the present application further provides a data scheduling processing apparatus, including:

the device comprises an adjusting unit, a forwarding device and a data flow management unit, wherein the adjusting unit is used for adjusting the periodic mapping relation or the sending queue of the data flow forwarded by the forwarding device according to the flow information of the forwarding device and the service requirement of the data flow;

the updating unit is used for updating the message processing logic of the data stream with the changed periodic mapping relation or the sending queue according to the adjusted periodic mapping relation or the sending queue;

and the sending unit is used for sending the updated message processing logic to the forwarding equipment.

In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium storing a computer program for causing a computer to execute the data scheduling processing method according to the first aspect described above.

In a fifth aspect, an embodiment of the present application further provides a communication device, where a computer program is stored, where the computer program is configured to cause the communication device to execute the data scheduling processing method according to the first aspect.

In a sixth aspect, an embodiment of the present application further provides a processor-readable storage medium, where a computer program is stored, where the computer program is configured to cause a processor to execute the data scheduling processing method according to the first aspect.

In a seventh aspect, an embodiment of the present application further provides a chip product, where a computer program is stored, where the computer program is configured to cause the chip product to execute the data scheduling processing method according to the first aspect.

According to the data scheduling processing method, the device, the apparatus and the storage medium, the transmission scheduling mechanism of the forwarding device for each data stream is dynamically adjusted according to the network traffic condition and the service requirements of the data stream, so that the method, the device and the storage medium can dynamically adapt to the network traffic change, effectively improve the bandwidth utilization rate and provide differentiated services for different service requirements.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the related art, the drawings that are required to be used in the embodiments or the related technical descriptions will be briefly described, and it is apparent that the drawings in the following descriptions are some embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort for those skilled in the art.

Fig. 1 is a flow chart of a data scheduling processing method according to an embodiment of the present application;

FIG. 2 is a schematic diagram of an implementation of a data scheduling method according to an embodiment of the present application;

FIG. 3 is a second embodiment of a data scheduling method according to the present application;

FIG. 4 is a third embodiment of a data scheduling method according to the present application;

FIG. 5 is a diagram illustrating a data scheduling method according to an embodiment of the present application;

FIG. 6 is a fifth embodiment of a data scheduling method according to the present application;

FIG. 7 is a sixth embodiment of a data scheduling method according to the present application;

FIG. 8 is a diagram of a data scheduling method according to an embodiment of the present application;

FIG. 9 is a schematic diagram of an implementation of a data scheduling method according to an embodiment of the present application;

fig. 10 is a schematic structural diagram of a network control device according to an embodiment of the present application;

fig. 11 is a schematic structural diagram of a data scheduling processing apparatus according to an embodiment of the present application.

Detailed Description

In the embodiment of the application, the term "and/or" describes the association relation of the association objects, which means that three relations can exist, for example, a and/or B can be expressed as follows: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.

The term "plurality" in embodiments of the present application means two or more, and other adjectives are similar.

The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments, but not all embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.

In order to facilitate a clearer understanding of the technical solutions of the embodiments of the present application, some technical contents related to the embodiments of the present application will be first described.

1. Deterministic QoS.

Deterministic QoS may provide "on-time, accurate" data transfer QoS, five typical deterministic QoS include: low latency (upper limit determination), low jitter (upper limit determination), low packet loss rate (upper limit determination), high bandwidth (upper and lower limit determination), high reliability (lower limit determination). Table 1 below shows the requirements for deterministic QoS for some industrial manufacturing scenarios.

TABLE 1 requirements for deterministic QoS for part of industrial manufacturing scenarios

2. DetNet network.

The DetNet network targets layer two bridging and layer three routing segment implementations to determine transmission paths that can provide worst case bounds of delay, packet loss, and jitter, techniques to control and reduce end-to-end latency. DetNet extends the technology developed by Time sensitive networks (Time-Sensitive Network, TSN) from the data link layer to routing. The QoS of the DetNet can be expressed in the following manner:

a. minimum and maximum end-to-end delays from source to destination, timely delivery, and bounded jitter (packet delay variation) resulting from these constraints.

b. Packet loss rates under various assumptions about the operational state of the nodes and links.

c. Upper bound for out-of-order packet delivery.

The DetNet function is implemented in two adjacent sublayers in the protocol stack: a DetNet service sublayer and a DetNet forwarding sublayer. The DetNet service sublayer provides DetNet services, such as service protection, for higher layers and applications in the protocol stack. The DetNet forwarding sublayer supports DetNet services in the underlying network, e.g., provides explicit routing and resource allocation for DetNet flows.

Based on QoS requirement of DetNet, a data scheduling processing method of multi-deterministic DetNet flow based on queue time slice is provided, the method is based on factors such as attribute of deterministic flow, network state, etc., different deterministic flows are put into proper queues, no relation with the queues in the upstream of deterministic flow, the main flow includes:

(1) The network determines the unit time slices of the cycle period divided by the forwarding device.

(2) The network determines the number of queues supported by each forwarding device port based on topology, such as based on the location of the user plane forwarding device.

(3) Determining the cycle period of each forwarding equipment port according to the number of queues supported by each forwarding equipment port, namely the actual number of queues;

(4) The network generates a queue configuration rule based on the information, including the number of queues, each queue attribute, and designating a time slice within one cycle for each queue supported by each forwarding device port. Wherein the queue attribute is such as maximum rate, minimum rate, priority of the queue, belonging time slice in one cycle, etc.

(5) The network issues unit time slices dividing the cycle period, the cycle period and the queue configuration rule to the user plane forwarding equipment.

(6) The network selects a path based on the service requirement and the queue attribute, and distributes the queue corresponding to the forwarding equipment on the path for the service flow to generate message processing logic.

(7) The user plane transmitting device only transmits the received data message in the time slice corresponding to the queue, and caches other time slices in the periodic cycle.

The method has the advantages that: each hop is a queue mapping based on network conditions, queue attributes, and the data itself. The number of queues of the forwarding device may be set based on the location of the forwarding device, and for different data flows, even if paths are the same, the data flows may be in different queues of the same forwarding device, and in addition, even if two different data flows exist, a current node (i.e., the forwarding device) is in the same queue, and a common next hop may not be in the same queue. The number of the queues of the forwarding ports of each forwarding device is different, so that the delay and the jitter of the scene are ensured more than those of the unified number of the queues, and clock synchronization is not needed.

3. DIP technology.

On the basis of traditional IP statistical multiplexing, DIP introduces the idea of periodic forwarding outside a 'best effort' service mode, reduces micro-bursts by controlling the forwarding time of each data packet at each hop, provides end-to-end deterministic service capability at a network layer, ensures low deterministic time delay and jitter of specific service flow transmission, and thereby meets numerous applications with severe requirements on network service quality guarantee, such as intelligent manufacturing, telemedicine, automatic driving and the like in the future. The main flow comprises the following steps:

(1) Deterministic requirements.

The data sender describes the deterministic demand through a user network interface (User Networks interface, UNI).

(2) Admission control and edge shaping.

An ingress Edge node Edge router (PE) records the resource reservation status of each flow and decides whether a deterministic flow is allowed to enter the network for deterministic forwarding based on the flow information. The packets that are allowed to enter the network for deterministic forwarding are then partitioned into periods (i.e., period identifications are assigned). And (3) shaping the messages with the irregular arrival time to different periods divided by time T through edge shaping, so as to avoid uncertainty of time delay caused by micro burst.

(3) And (5) period mapping.

And the core node backbone router (P) or the export PE equipment completes forwarding of the message within a required period according to the period information carried by the message header and the period mapping.

The construction of the periodic mapping relation can be configured by a centralized controller, and can also be obtained by learning in a self-adaptive mode.

The cycle mapping relation constrains the data packet forwarding behavior between two-hop devices, and the data packet needs to be sent only in a specified cycle, thereby ensuring the delay certainty of single-hop data transmission. And the time delay certainty from end to end is ensured through cycle constraint forwarding hop by hop from the source node to the target node.

(4) Explicit path planning and resource reservation.

Based on a distributed routing algorithm or a centralized path calculation, a transmission path is planned for the data stream to match the time delay requirement of the service, and necessary along-path deterministic resource reservation is supported.

In order to do the above cycle mapping mechanism, the technical requirements of DIP are:

(1) the network device needs to divide the time into equal-length periods, and the periods of different devices can start from different times and end at different times, so that the data packets are queued and forwarded according to the periods. That is, a message designated to be sent from a sending node in the same period is scheduled to be forwarded in the next hop in the designated same period by a receiving node.

(2) For a message in a certain period, the time difference of the sending period on the head node and the tail node should be kept stable, that is, the period number difference value is kept fixed, but the exact time when a specific message is sent in the period may not be fixed.

Whether the DetNet or DIP technology is used, the jitter of data transmission is determined to be within a fixed multiple period length by sending the specified data stream in the network within a fixed time (queue or period), however, such a data scheduling processing manner may cause low utilization of bandwidth resources, because even if there are no data streams to be sent in some queues or periods or the current traffic in the network is small, data transmission needs to be performed according to a cycle period ordered in advance, and in the case that the jitter is not required by the data stream and the time delay is desired to be as low as possible, such a forwarding manner of the fixed period cannot provide differentiated services.

In view of the above problems, embodiments of the present application provide a solution to dynamically adjust a data scheduling mechanism of a forwarding device based on traffic and service requirements in a network, thereby improving bandwidth utilization and providing differentiated services for different service requirements.

Fig. 1 is a flow chart of a data scheduling processing method according to an embodiment of the present application, as shown in fig. 1, the method includes the following steps:

and 100, according to the traffic information of the forwarding device and the service requirement of the data stream, adjusting the periodic mapping relation or the sending queue of the data stream forwarded by the forwarding device.

Step 101, according to the adjusted periodic mapping relation or the transmission queue, the message processing logic of the data stream with the changed periodic mapping relation or the transmission queue is updated.

Step 102, the updated message processing logic is sent to the forwarding device.

Specifically, the execution body of the method may be a device or apparatus in the network that is responsible for the transmission scheduling processing of the data stream, such as a network control function of a network control layer, or other network control devices, and for convenience of discussion, the network control function is taken as an execution body for illustration.

In the embodiment of the present application, in order to improve the bandwidth utilization and meet the differentiated service requirement, the network control function may dynamically adjust the cycle mapping relationship of the data flows forwarded by each forwarding device (i.e. to characterize in which transmission cycle a certain data flow forwarded by a previous hop in a certain transmission cycle should be forwarded by a next hop) or the transmission queue (i.e. in which queue the data flow is placed for transmission) based on the collected or stored traffic information of each forwarding device and the service requirement of the data flow in the network.

For example, according to the data stream transmission scheduling scheme (such as DIP technology) based on the period mapping mechanism, the period mapping relation of the data stream used by the forwarding device for forwarding the data stream can be dynamically adjusted, for example, according to the network traffic situation, the transmission period of some deterministic data stream is advanced, so as to reduce the data transmission delay.

For example, based on a queue time slice data stream transmission scheduling scheme (such as DetNet described above), the transmission queues of data streams used by a forwarding device to forward the data streams may be dynamically adjusted, for example, according to network traffic conditions, the transmission queues of certain deterministic data streams are sent in advance, or certain deterministic data streams are placed in the earlier-sent queues, so as to reduce data transmission delay.

The forwarding device may refer to a device or a node in the network that is responsible for forwarding the data packet, and may also be referred to as a user plane forwarding device, a forwarding node, or the like.

The traffic information of the forwarding device may include traffic conditions of the forwarding device at different times, usage conditions of bandwidth of the forwarding device in each unit time slice or each period, and the like.

The traffic demands of the data stream may include delays in transmission of the data stream, jitter, reliability, transmission rate requirements, etc.

After the network control function determines to adjust the cycle mapping relation or the sending queue of the data stream, the message processing logic of the data stream with the changed cycle mapping relation or the sending queue can be updated according to the adjusted cycle mapping relation or the sending queue, namely the message processing logic of the corresponding data message is regenerated.

Optionally, updating the message processing logic of the data stream with the changed period mapping relation or the sending queue according to the adjusted period mapping relation or the sending queue may include:

according to the adjusted transmission queue, re-determining a queue configuration rule corresponding to the forwarding equipment and the effective time of the queue configuration rule;

And updating the message processing logic of the data stream with the changed transmission queue according to the queue configuration rule corresponding to the redetermined forwarding equipment and the effective time of the queue configuration rule.

Specifically, in the case that the cycle mapping relationship of the data flow is adjusted, the network control function may optionally further include message processing logic that generates a corresponding data message according to the new cycle mapping relationship and according to the number of cycle periods of the involved forwarding device. In the case of adjusting the transmission queue of the data flow, the network control function may regenerate the queue configuration rule and the time when the queue configuration rule is effective according to the number of queues of the related forwarding device, the time slices corresponding to the queues, and the like, and then regenerate the message processing logic and the time when the message processing logic of the data message needing to change the transmission queue is effective based on the new queue configuration rule and the time when the queue configuration rule is effective.

Then, the network control function may send the updated message processing logic (including the time when the message processing logic takes effect) of each data flow to the forwarding device related to each data flow, so that after each forwarding device receives the new message processing logic, update configuration may be performed, and when the corresponding data message is received later, forwarding of the data message is performed according to the new message processing logic.

According to the data scheduling processing method provided by the embodiment of the application, the transmission scheduling mechanism of the forwarding equipment for each data stream is dynamically adjusted according to the network traffic condition and the service requirements of the data stream, so that the data scheduling processing method can dynamically adapt to the network traffic change, effectively improve the bandwidth utilization rate and provide differentiated services for different service requirements.

The embodiments of the present application are illustratively described with respect to deterministic data flows, but should not be construed as limiting the technical solutions of the embodiments of the present application.

Optionally, adjusting a periodic mapping relation or a sending queue of the data stream forwarded by the forwarding device according to traffic information of the forwarding device and service requirements of the data stream, including:

under the condition that the data stream comprises the first type of data stream, maintaining the periodic mapping relation or the sending queue of the first type of data stream unchanged; and/or the number of the groups of groups,

when the data stream comprises the second class data stream, adjusting the periodic mapping relation or the sending queue of the second class data stream according to the flow information of the forwarding equipment;

Specifically, in order to meet the jitter requirement of the data stream with strict jitter requirement, in the embodiment of the present application, a threshold of jitter requirement may be set, and for the first type of data stream with jitter requirement less than or equal to the set threshold, the first type of data stream may be considered as the data stream with strict jitter requirement, and the network control function may keep the periodic mapping relation or the transmission queue of the data streams unchanged.

For other deterministic data flows, such as deterministic data flows with low latency requirements, the network control function may adjust the periodic mapping relationship or transmit queues of the data flows according to the traffic information of the forwarding device, for example, the data flows may be transmitted in advance.

Examples 1 and 2 are illustrated below.

Example 1: dynamic data scheduling scheme based on periodic mapping mechanism.

Fig. 2 is one of implementation schematic diagrams of a data scheduling processing method provided in the embodiment of the present application, as shown in fig. 2, where part (a) in the diagram represents a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and a straight arrow points to a data stream sent by an upstream node in a certain period and forwarded in a next hop in a certain period of a downstream node, for example, a data stream sent by a node a in a T1 period, and a node B forwards in a T2 period after receiving the data stream; the node A transmits the data stream in the T2 period, and the node B transmits the data stream in the T3 period after receiving the data stream; the data stream sent by the node C in the T2 period is forwarded in the T3 period after the node B receives the data stream, which will not be described in detail in the following embodiments.

The part (b) in the figure shows the data processing condition at the time T2, which can be understood as an adjusted data scheduling scheme, and as shown in the figure, in order to meet the jitter requirement of data streams with strict jitter requirements (such as data streams sent by the node a in the period of T2'), the period mapping relation of the data streams can be kept unchanged. For deterministic data flows sent from other upstream nodes, such as data flows with low delay requirements sent by node C in the T2' period, the period mapping relationship of the data messages corresponding to the data flows can be adjusted at node B, so that the data flow which should be sent in the T3' period is sent in advance to the T2' period.

It should be noted that, the period mapping mechanism described in each embodiment of the present application may be a mapping mechanism in which a matching item is an ingress port and a data packet, and an action is sent when the matching item is placed in a certain period, and the period mapping relationship of one data stream is adjusted, so that the period mapping relationship of other data streams sent in the same period in the same upstream node is not changed.

Example 2: dynamic data scheduling scheme based on queue time slices.

The queue time slice based data scheduling scheme is based on deterministic attributes, different deterministic data streams are put into proper queues, the data streams are not related to the queues in the upstream, each queue corresponds to one time slice, and forwarding of messages in the queues is scheduled based on the time slice in which the queues are located.

Fig. 3 is a second implementation schematic diagram of the data scheduling processing method according to the embodiment of the present application, as shown in fig. 3, where part (a) in the diagram represents a data processing situation at time t1, which can be understood as a data scheduling scheme before adjustment, and a straight arrow points to a queue indicating that a data stream sent by an upstream node in a certain queue is forwarded in a next hop in a certain queue of a downstream node, which is similar to the straight arrow points described in embodiment 1, and will not be repeated herein.

The part (b) in the figure shows the data processing condition at the time T2, which can be understood as an adjusted data scheduling scheme, and as shown in the figure, in order to meet the jitter requirement of data streams with strict jitter requirements (such as data streams sent by the node a in the T2' queue), the queue of the data streams and the time slice relationship corresponding to the queue can be kept unchanged. For deterministic data flows sent from other upstream nodes, such as a partial data flow with low latency requirement sent by node C in the T2' queue, the queue of the data packet corresponding to the data flow may be adjusted at node B, and the data flow that should be sent in the T3' queue may be placed in the T2' queue for sending.

Optionally, adjusting the periodic mapping relation or the sending queue of the second class of data flows according to the traffic information of the forwarding device includes:

Under the condition that the forwarding equipment has a period without data to be sent, the period mapping relation of the first target data stream in the second class of data stream is adjusted so as to forward the first target data stream to the period without data to be sent;

the first target data stream is located after a period in which no data needs to be transmitted, in a transmission period before the period map is adjusted.

Specifically, for the second class of data flows, if no data needs to be sent in a certain period or some periods of the forwarding device, the network control function may adjust, at the forwarding device, the period mapping relationship of the data flows that should be forwarded after the periods of no data needs to be sent, and advance the data flows to the periods of no data needs to be sent for forwarding.

For example, assuming that the node B does not have data to transmit in the T2 'period, the data stream that the node C should transmit in the T2' period should be originally forwarded in the T3 'period at the node B, since the node B does not have data to transmit in the T2' period, the period mapping relationship of the data packet corresponding to the data stream can be adjusted at the node B, so that the data stream that should be originally transmitted in the T3 'period is forwarded in advance to the T2' period.

under the condition that the forwarding equipment has periods needing to be sent without data, the number of the cycle periods of the forwarding equipment is reduced according to the number of the periods needing to be sent without data;

and adjusting the cycle mapping relation of the second class data stream according to the number of the cycle cycles of the reduced forwarding equipment.

Specifically, in one embodiment, if no data needs to be sent in a certain period or some periods of the forwarding device, the network control function may reduce the number of cycle periods of the forwarding device according to the number of periods that no data needs to be sent, where the number of cycle periods may be understood as the number of periods included in one cycle.

For example, assuming that there are n periods in which no data needs to be transmitted by the forwarding device, the number of original cycle periods of the forwarding device is L (i.e., one cycle includes L periods), the number of cycle periods corresponding to the forwarding device may be adjusted from L to L-n.

After the number of the cycle periods of the forwarding device is reduced, the network control function can correspondingly adjust the cycle mapping relation of the second class data stream in the network at the forwarding device according to the reduced number of the cycle periods of the forwarding device. It will be appreciated that as the number of cycles of the forwarding device is reduced, the transmission period of the data stream that should have been forwarded after the period in which no data needs to be transmitted can be correspondingly advanced.

In this scenario, if the number of cycle periods needs to be recovered and increased later, the number of cycle periods can be adjusted and increased as required, so long as the number of cycle periods does not exceed the initial number of cycle periods.

Fig. 4 is a third implementation schematic diagram of the data scheduling processing method provided in the embodiment of the present application, as shown in fig. 4, where (a) part of the diagram indicates a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and (B) part of the diagram indicates a data processing situation at time T2, which may be understood as a data scheduling scheme after adjustment, as shown in the diagram, when there is no data to be transmitted by the node B in the period T2', the number of cycle periods of the node B may be reduced, from 3 periods to 2 periods, and accordingly, the period mapping relation of the data stream transmitted by the node a is also adjusted, and the data stream transmitted by the node a should be originally forwarded in the period T3' and is forwarded in advance to the period T2 '.

under the condition that the forwarding equipment has the period with the residual transmission resources, the period mapping relation of the second target data stream in the second class data stream is adjusted so as to forward the second target data stream in advance to the period with the residual transmission resources;

The second target data stream has a transmission period before the period mapping relation is adjusted, and is located after the period in which the remaining transmission resources exist.

Specifically, in one embodiment, for the second class of data flows, if there are remaining transmission resources in a certain period or some periods of the forwarding device, the network control function may adjust, at the forwarding device, the period mapping relationship of the data flows that should be forwarded after the periods with remaining transmission resources, advance the data flows to the periods with remaining transmission resources for forwarding, that is, aggregate and send the data flows with the original data flows in the periods with remaining transmission resources.

Fig. 5 is a schematic implementation diagram of the data scheduling processing method provided by the embodiment of the present application, as shown in fig. 5, where (a) part of the diagram represents a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and (B) part of the diagram represents a data processing situation at time T2, which may be understood as a data scheduling scheme after adjustment, as shown in the diagram, at time T2, a node B has a remaining transmission resource in a period T2', a data stream sent by a node C in a period T2' should be originally forwarded at a period T3', and because a node B has a remaining transmission resource in a period T2', a period mapping relationship of a data packet corresponding to the data stream may be adjusted at a node B, so that the data stream originally supposed to be sent in a period T3 'is forwarded in advance to a period T2'.

Optionally, after adjusting the period mapping relation of the second target data stream in the second class of data streams, in a case that the forwarding device has a period in which no data needs to be sent, the method further includes:

according to the number of periods needing to be sent without data, the number of the circulation periods of the forwarding equipment is reduced;

Specifically, in one embodiment, if the forwarding device does not need to send data within a certain period or a certain periods after the period mapping relation of the second target data stream is adjusted, the network control function may reduce the number of cycle periods of the forwarding device according to the number of periods that do not need to send data.

Fig. 6 is a fifth implementation schematic diagram of a data scheduling processing method according to an embodiment of the present application, as shown in fig. 6, where (a) part of the diagram indicates a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and (B) part of the diagram indicates a data processing situation at time T2, which may be understood as a data scheduling scheme after adjustment, as shown in the diagram, a period mapping relationship between data streams sent by a node a and a node C is adjusted at a node B at time T2, and data streams sent by the node a and the node C should be forwarded in a period T3', and forwarded in advance to a period T2', so that the node B does not need to send in a period T3', and the number of cycle periods of the node B may be reduced from 3 periods to 2 periods.

It should be noted that, the schemes for adjusting the period mapping relationship of the second class of data flows provided in the foregoing embodiments may be combined arbitrarily, for example, when there is a period in which no data needs to be sent by the forwarding device, and/or when there is a period in which remaining transmission resources exist, the forwarding device may adjust the period mapping relationship of the data flows based on any one of the schemes, or may adjust the period mapping relationship of the data flows based on a combination of the schemes, for example, may forward a portion of the data flows in advance to a period in which no data needs to be sent, and forward a portion of the data flows in advance to a period in which remaining transmission resources exist; or part of the data flow can be forwarded in advance until no period needs to be sent, and then the number of the cycle periods of forwarding equipment is reduced according to the number of the remained periods needing to be sent without data; or part of the data flow can be forwarded in advance until the period with the residual transmission resources exists, and then the number of the cycle periods of forwarding equipment can be reduced according to the number of the existing periods needing to be sent without data, and the like. It is to be understood that these are merely exemplary and not exhaustive of the combinations of aspects.

when the forwarding device has a queue without data to be transmitted, adjusting a transmission queue of a third target data stream in the second class of data streams to advance the third target data stream to the queue without data to be transmitted for forwarding;

the third target data stream is located in the queue before the transmission queue is adjusted and is located behind the queue without data to be transmitted.

Specifically, for the second class of data flows, if no data needs to be sent in one or more queues of the forwarding device, the network control function may adjust, at the forwarding device, the sending queues of the data flows that should be forwarded after the queues that do not need to be sent, and advance the data flows to the queues that do not need to be sent for forwarding.

For example, assuming that node B has no data to send in the T2' queue, the part of the data stream that node C sends to node B should be forwarded at node B in the T3' queue (assuming that the time slice corresponding to the T3' queue is before the time slice corresponding to the T2' queue), since node B has no data to send in the T2' queue, the sending queue of this data stream may be adjusted at node B, so that the data stream that should be sent at the T3' queue is forwarded in advance to the T2' queue.

and adjusting the time slices corresponding to the transmission queues of the second class data stream according to the reduced number of the queues of the forwarding equipment.

Specifically, in one embodiment, if there is no data to be sent in a certain queue or a certain queues of the forwarding device, the network control function may reduce the number of queues of the forwarding device according to the number of queues that are not data to be sent.

For example, assuming that there are n queues of a forwarding device that have an original number of queues L, the number of queues corresponding to the forwarding device may be adjusted from L to L-n.

After the number of queues of the forwarding device is reduced, the network control function can correspondingly adjust the sending queue of the second class data stream in the network at the forwarding device according to the reduced number of queues of the forwarding device. It will be appreciated that, as the number of queues of the forwarding device decreases, the time slice corresponding to the transmit queue of the data stream that should be forwarded after the queue that does not have data to be transmitted can be correspondingly advanced.

In this scenario, if the number of queues needs to be restored and increased later, the number of queues can be adjusted and increased according to the needs, so long as the number of queues does not exceed the initial number of queues.

Fig. 7 is a sixth implementation schematic diagram of the data scheduling processing method according to the embodiment of the present application, as shown in fig. 7, where (a) part of the diagram represents a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and (b) part of the diagram represents a data processing situation at time T2, which may be understood as a data scheduling scheme after adjustment, and as shown in the diagram, data flows in a T4 'queue are advanced to a T3' queue at time T2. Meanwhile, as the node B does not have data to be sent in the T2' queue, the number of the queues of the node B can be reduced, 4 queues are changed into 3 queues, correspondingly, the time slices corresponding to the original T2' queue are adjusted to be time slices corresponding to the T3' queue, the time slices corresponding to the original T3' queue are adjusted to be time slices corresponding to the T4' queue, and the time slices corresponding to the latter queues are all advanced by one time slice.

Under the condition that the forwarding equipment has a queue with residual transmission resources, adjusting a sending queue of a fourth target data stream in the second class of data streams to advance the fourth target data stream to the queue with residual transmission resources for forwarding;

the fourth target data stream is located in the queue before the transmit queue is adjusted and is located after the queue with the remaining transmission resources.

Specifically, for the second class of data flows, if there are remaining transmission resources in one or some queues of the forwarding device, the network control function may adjust, at the forwarding device, a transmission queue of data flows that should be forwarded after the queues with remaining transmission resources, advance the data flows to the queues with remaining transmission resources for forwarding, that is, aggregate and send the data flows with the original data flows in the queues with remaining transmission resources.

Fig. 8 is a seventh implementation schematic diagram of a data scheduling processing method according to an embodiment of the present application, as shown in fig. 8, where (a) part of the diagram represents a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and (B) part of the diagram represents a data processing situation at time T2, which may be understood as a data scheduling scheme after adjustment, as shown in the diagram, at time T2, a node B has a remaining transmission resource in a T2' queue, a part of a data stream sent by a node C to the node B should be originally forwarded at a T3' queue, and because the node B has a remaining transmission resource in the T2' queue, a sending queue of the data stream may be adjusted at the node B, so that the data stream originally supposed to be sent at the T3' queue may be forwarded in advance to the T2' queue.

Optionally, after adjusting the transmission queue of the fourth target data flow in the second class of data flows, in a case that the forwarding device has a queue that does not have data to transmit, the method further includes:

reducing the number of queues of forwarding equipment according to the number of queues which do not need to be sent;

Specifically, in one embodiment, if after the transmission queue of the fourth target data flow is adjusted, the forwarding device has a certain queue or a certain queues without data to be transmitted, the network control function may reduce the number of queues of the forwarding device according to the number of queues without data to be transmitted.

Fig. 9 is a schematic diagram of implementation of the data scheduling processing method according to the embodiment of the present application, as shown in fig. 9, where (a) part of the diagram indicates a data processing situation at time T1, which may be understood as a data scheduling scheme before adjustment, and (B) part of the diagram indicates a data processing situation at time T2, which may be understood as a data scheduling scheme after adjustment, as shown in the diagram, at time T2, a transmission queue of a part of data streams transmitted by node a and node C is adjusted at node B, and a part of data streams transmitted by node a and node C to node B should be forwarded in a T3' queue before forwarding in advance to a T2' queue, thereby causing node B to have no data to be transmitted in the T3' queue, and reducing the number of queues of node B from 3 queues to 2 queues.

It should be noted that, the schemes for adjusting the transmission queues of the second class of data flows provided in the foregoing embodiments may be combined arbitrarily, for example, when there is a queue without data to be transmitted in the forwarding device, and/or when there is a queue with remaining transmission resources, the forwarding device may adjust the transmission queue of the data flow based on any one of the schemes, or may adjust the transmission queue of the data flow based on a combination of the schemes, for example, may forward a part of the data flow to the queue without data to be transmitted in advance, and forward a part of the data flow to the queue with remaining transmission resources in advance; or part of data flow can be forwarded to the queue which does not need to be sent, and then the number of the queues of forwarding equipment is reduced according to the number of the remaining queues which do not need to be sent; or a part of data flow can be forwarded to the queue with the residual transmission resources, and then the number of the queues of forwarding equipment can be reduced according to the number of the existing queues without data to be sent. It is to be understood that these are merely exemplary and not exhaustive of the combinations of aspects.

The method and the device provided by the embodiments of the present application are based on the same application conception, and because the principles of solving the problems by the method and the device are similar, the implementation of the device and the method can be referred to each other, and the repetition is not repeated.

Fig. 10 is a schematic structural diagram of a network control device according to an embodiment of the present application, and as shown in fig. 10, the network control device includes a memory 1020, a transceiver 1010 and a processor 1000; wherein the processor 1000 and the memory 1020 may also be physically separate.

A memory 1020 for storing a computer program; a transceiver 1010 for transceiving data under the control of the processor 1000.

In particular, the transceiver 1010 is used to receive and transmit data under the control of the processor 1000.

Wherein in fig. 10, a bus architecture may comprise any number of interconnected buses and bridges, and in particular one or more processors represented by the processor 1000 and various circuits of the memory, represented by the memory 1020, are chained together. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., all as are well known in the art and, therefore, will not be described further herein. The bus interface provides an interface. The transceiver 1010 may be a number of elements, i.e., including a transmitter and a receiver, providing a means for communicating with various other apparatus over transmission media, including wireless channels, wired channels, optical cables, and the like.

The processor 1000 is responsible for managing the bus architecture and general processing, and the memory 1020 may store data used by the processor 1000 in performing operations.

Processor 1000 may be a central processing unit (Central Processing Unit, CPU), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a Field programmable gate array (Field-Programmable Gate Array, FPGA) or a complex programmable logic device (Complex Programmable Logic Device, CPLD), or the processor may employ a multi-core architecture.

Processor 1000 is operable to perform any of the methods provided by embodiments of the present application in accordance with the obtained executable instructions by invoking a computer program stored in memory 1020, for example: according to the traffic information of the forwarding device and the service requirement of the data stream, the periodic mapping relation or the sending queue of the data stream forwarded by the forwarding device is adjusted; updating message processing logic of the data stream with changed periodic mapping relation or sending queue according to the adjusted periodic mapping relation or sending queue; and sending the updated message processing logic to the forwarding equipment.

Optionally, updating the message processing logic of the data stream with the changed period mapping relation or the sending queue according to the adjusted period mapping relation or the sending queue, including:

It should be noted that, the network control device provided in the embodiment of the present application can implement all the method steps implemented in the embodiment of the method and achieve the same technical effects, and the same parts and beneficial effects as those of the embodiment of the method in the embodiment are not described in detail herein.

Fig. 11 is a schematic structural diagram of a data scheduling processing apparatus according to an embodiment of the present application, as shown in fig. 11, where the apparatus includes:

an adjusting unit 1100, configured to adjust a periodic mapping relationship or a transmit queue of a data stream forwarded by the forwarding device according to traffic information of the forwarding device and a service requirement of the data stream;

an updating unit 1110, configured to update, according to the adjusted periodic mapping relationship or the sending queue, a message processing logic of a data stream in which the periodic mapping relationship or the sending queue is changed;

and a sending unit 1120, configured to send the updated message processing logic to the forwarding device.

Optionally, after adjusting the period mapping relationship of the second target data stream in the second class data stream, in a case that the forwarding device has a period in which no data needs to be sent, the adjusting unit 1100 is further configured to:

Optionally, after adjusting the transmission queue of the fourth target data stream in the second class of data streams, in a case that the forwarding device has a queue that no data needs to be transmitted, the adjusting unit 1100 is further configured to:

It should be noted that, in the embodiment of the present application, the division of the units is schematic, which is merely a logic function division, and other division manners may be implemented in actual practice. In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a processor-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

It should be noted that, the above device provided in the embodiment of the present application can implement all the method steps implemented in the method embodiment and achieve the same technical effects, and detailed descriptions of the same parts and beneficial effects as those in the method embodiment in this embodiment are omitted.

In another aspect, an embodiment of the present application further provides a computer readable storage medium storing a computer program for causing a computer to execute the data scheduling processing method provided in each of the above embodiments.

It should be noted that, the computer readable storage medium provided in the embodiment of the present application can implement all the method steps implemented in the above method embodiment and achieve the same technical effects, and detailed descriptions of the same parts and beneficial effects as those in the method embodiment in this embodiment are omitted.

The computer-readable storage medium can be any available medium or data storage device that can be accessed by a computer, including, but not limited to, magnetic storage (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical storage (e.g., CD, DVD, BD, HVD, etc.), and semiconductor storage (e.g., ROM, EPROM, EEPROM, nonvolatile storage (NAND FLASH), solid State Disk (SSD)), etc.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-executable instructions. These computer-executable instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the processor-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These processor-executable instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit or scope of the application. Thus, it is intended that the present application also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims

1. A data scheduling processing method, characterized by comprising:

and sending the updated message processing logic to the forwarding equipment.

2. The method for scheduling data according to claim 1, wherein adjusting the periodic mapping relationship or the transmit queue of the data flow forwarded by the forwarding device according to the traffic information of the forwarding device and the traffic demand of the data flow comprises:

3. The method for scheduling data according to claim 2, wherein said adjusting the cycle mapping relation or the transmit queue of the second class of data flows according to the traffic information of the forwarding device comprises:

4. The method for scheduling data according to claim 2, wherein said adjusting the cycle mapping relation or the transmit queue of the second class of data flows according to the traffic information of the forwarding device comprises:

5. The method for scheduling data according to claim 2, wherein said adjusting the cycle mapping relation or the transmit queue of the second class of data flows according to the traffic information of the forwarding device comprises:

6. The method for scheduling data according to claim 5, wherein after said adjusting the cycle mapping relation of the second target data stream in the second class data stream, in a case that the forwarding device has a cycle in which no data needs to be transmitted, the method further comprises:

7. The method for scheduling data according to claim 2, wherein said adjusting the cycle mapping relation or the transmit queue of the second class of data flows according to the traffic information of the forwarding device comprises:

8. The method for scheduling data according to claim 2, wherein said adjusting the cycle mapping relation or the transmit queue of the second class of data flows according to the traffic information of the forwarding device comprises:

9. The method for scheduling data according to claim 2, wherein said adjusting the cycle mapping relation or the transmit queue of the second class of data flows according to the traffic information of the forwarding device comprises:

10. The method according to claim 9, wherein after said adjusting the transmission queue of the fourth target data flow in the second class of data flows, in the case that the forwarding device has a queue that does not have a data to transmit, the method further comprises:

11. The method of claim 1, wherein updating the message processing logic of the data stream with the modified periodic mapping relationship or the modified transmission queue according to the modified periodic mapping relationship or the modified transmission queue comprises:

12. A network control device, comprising a memory, a transceiver, and a processor:

And sending the updated message processing logic to the forwarding equipment.

13. The network control device according to claim 12, wherein the adjusting the periodic mapping relation or the transmission queue of the data flow forwarded by the forwarding device according to the traffic information of the forwarding device and the traffic demand of the data flow comprises:

14. The network control device according to claim 13, wherein the adjusting the periodic mapping relation or the transmission queue of the second class of data flows according to the traffic information of the forwarding device comprises:

15. The network control device according to claim 13, wherein the adjusting the periodic mapping relation or the transmission queue of the second class of data flows according to the traffic information of the forwarding device comprises:

16. The network control device according to claim 13, wherein the adjusting the periodic mapping relation or the transmission queue of the second class of data flows according to the traffic information of the forwarding device comprises:

17. The network control device of claim 16, wherein after said adjusting the period mapping relationship of the second target data stream in the second class of data streams, in a case where the forwarding device has a period in which no data needs to be transmitted, the operations further comprise:

18. The network control device according to claim 13, wherein the adjusting the periodic mapping relation or the transmission queue of the second class of data flows according to the traffic information of the forwarding device comprises:

19. The network control device according to claim 13, wherein the adjusting the periodic mapping relation or the transmission queue of the second class of data flows according to the traffic information of the forwarding device comprises:

20. The network control device according to claim 13, wherein the adjusting the periodic mapping relation or the transmission queue of the second class of data flows according to the traffic information of the forwarding device comprises:

21. The network control device of claim 20, wherein after said adjusting the transmit queue of the fourth target data stream in the second class of data streams, in the event that no queue exists for the forwarding device to transmit, the operations further comprise:

22. A data scheduling processing apparatus, comprising:

23. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program for causing a computer to execute the method of any one of claims 1 to 11.