Deterministic forwarding scheduling method for DMR service

Abstract

The invention relates to a DMR service-oriented deterministic forwarding scheduling method. The method comprises the following steps of: acquiring a plurality of DMR service data packets in a message queue in real time; determining a service scheduling period by using a plurality of transmission periods corresponding to the plurality of DMR service data packets; determining a first scheduling moment of each DMR service data packet in the service scheduling period, the first scheduling moment being a scheduling moment of each DMR service data packet relative to the zero moment; generating a service scheduling periodic table based on the first scheduling moment; and transmitting the plurality of DMR service data packets one by one based on the service scheduling periodic table. According to the method, services can be sent one by one according to the service scheduling periodic table when a high quantity of burst data enters the network, and peak shifting forwarding of the services is achieved.

Description

Technical Field

[0001] The invention belongs to the technical field of service scheduling management, and in particular relates to a deterministic forwarding scheduling method for DMR services. Background Art

[0002] Business scheduling is usually completed jointly by the client and the server. The server sends a business scheduling instruction to the client. After the client receives the business scheduling instruction, it executes the business according to the content of the business scheduling instruction.

[0003] However, in a digital mobile radio (DMR) communication system using IP interconnection, a large amount of burst data enters the network, resulting in long service queues at certain nodes, leading to high delays. Summary of the invention

[0004] In order to solve the above problems existing in the prior art, the present invention provides a deterministic forwarding scheduling method for DMR services. The technical problem to be solved by the present invention is achieved through the following technical solutions:

[0005] The present invention provides a deterministic forwarding scheduling method for DMR services, comprising: acquiring multiple DMR service data packets in a message queue in real time; determining a service scheduling cycle by using multiple transmission cycles corresponding to the multiple DMR service data packets; determining a first scheduling moment of each DMR service data packet within the service scheduling cycle, wherein the first scheduling moment refers to a scheduling moment of each DMR service data packet relative to time zero; generating a service scheduling period table based on the first scheduling moment; and transmitting the multiple DMR service data packets one by one based on the service scheduling period table.

[0006] In some embodiments, the transmission link of each DMR service data packet includes Q nodes, each node corresponds to a starting transmission time, and Q is a positive integer greater than 1; determining the first scheduling time of each DMR service data packet within the service scheduling period includes: within the service scheduling period, based on the Q starting transmission times corresponding to each DMR service data packet, performing multiple random sorting on the multiple DMR service data packets to obtain multiple permutations and combinations; wherein each permutation and combination corresponds to a transmission offset, and the transmission offset refers to the transmission offset of the last DMR service data packet in each permutation and combination relative to the zero time; determining the minimum value of the transmission offsets corresponding to the multiple permutations and combinations; obtaining the transmission time corresponding to each DMR service data packet in the permutation and combination corresponding to the minimum value, and using the transmission time corresponding to each DMR service data packet as the first scheduling time of each DMR service data packet.

[0007] In some embodiments, within the service scheduling period, a node sends J DMR service data packets one by one, where J is a positive integer greater than 1; at the qth node among the Q nodes, the qth starting transmission time corresponding to the J DMR service data packets is calculated by: within the service scheduling period, obtaining the transmission rate and preset protection delay corresponding to the qth node among the Q nodes, 1≤q≤Q; using the data frame length corresponding to the jth DMR service data packet, divided by the transmission rate at the qth node, to obtain the qth occupation time corresponding to the jth DMR service data packet. slot, 1≤j≤J; using the qth occupied time slot corresponding to the jth DMR service data packet as the qth starting transmission time of the j+1th DMR service data packet; continuing to use the qth starting transmission time of the j+1th DMR service data packet, the data frame length and the preset protection delay to determine the qth occupied time slot of the j+1th DMR service data packet, and using the qth occupied time slot of the j+1th DMR service data packet as the qth starting transmission time of the j+2th DMR service data packet, until the qth starting transmission time corresponding to the Jth DMR service data packet is obtained.

[0008] In some embodiments, the method further includes: when the value of q is greater than 1, at the qth node among the Q nodes, the qth starting transmission time of the 1st DMR service data packet is obtained by adding the q-1th starting transmission time of the 1st DMR service data packet and the q-1th occupied time slot.

[0009] In some embodiments, the method further includes: when the value of q is 1, at the first node among the Q nodes, the first starting transmission time of the first DMR service data packet is time zero.

[0010] In some embodiments, determining the service scheduling period by using the multiple transmission periods corresponding to the multiple DMR service data packets includes: obtaining the least common multiple of the multiple transmission periods corresponding to the multiple DMR service data packets to obtain the service scheduling period.

[0011] In some embodiments, the method further includes: performing a greatest common divisor process on a plurality of transmission periods corresponding to the plurality of DMR service data packets to obtain a minimum transmission period corresponding to the plurality of DMR service data packets.

[0012] In some embodiments, each DMR service data packet includes: a source node ID, a destination node ID, multiple transmission node IDs, a data frame length, multiple node sending times, and multiple node receiving times.

[0013] In some embodiments, transmitting the multiple DMR service data packets one by one based on the service scheduling periodic table includes: sorting the multiple DMR service data packets in the message queue based on the service scheduling periodic table to obtain an optimized message queue; and transmitting the multiple DMR service data packets one by one according to the optimized message queue.

[0014] Compared with the prior art, the present invention has the following beneficial effects:

[0015] In view of the problem that a large number of burst data enters the network in the existing DMR communication system, a long service queue phenomenon occurs at some nodes, resulting in high latency. The present invention provides a deterministic forwarding scheduling method for DMR services. The method obtains multiple DMR service data packets in a message queue in real time, determines the service scheduling cycle by using the transmission cycles of multiple DMR service data packets, and determines the first scheduling time of each DMR service data packet that meets the constraint conditions, and then uses the first scheduling time of each DMR service data packet to generate a service scheduling cycle table; and then uses the service scheduling cycle table to send each DMR service data packet one by one. Through the deterministic forwarding scheduling method provided by the present invention, when a large number of burst data enters the network, services can be sent one by one according to the service scheduling cycle table, so as to realize staggered forwarding of services, prevent transmission congestion, reduce network jitter, and improve the stability and reliability of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 It is a flow chart of a deterministic forwarding scheduling method for DMR services provided by an embodiment of the present invention;

[0017] Figure 2 This is an example diagram of transmitting multiple DMR service data packets one by one provided by an embodiment of the present invention;

[0018] Figure 3 This is an example diagram of an application scenario of the deterministic forwarding scheduling method for DMR services provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0019] The present invention is further described in detail below with reference to specific embodiments, but the embodiments of the present invention are not limited thereto.

[0020] In the description of the present invention, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0021] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification.

[0022] Although the present invention is described herein in conjunction with various embodiments, in the process of implementing the claimed invention, those skilled in the art may understand and implement other variations of the disclosed embodiments by viewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple situations. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0023] Now, in conjunction with the accompanying drawings, a deterministic forwarding scheduling method for DMR services provided by an embodiment of the present invention is described in detail. Figure 1 FIG. 1 is a flow chart of a deterministic forwarding scheduling method for DMR services provided by an embodiment of the present invention. Figure 1 As shown, the method includes:

[0024] S110 . Acquire multiple DMR service data packets in the message queue in real time.

[0025] Here, the server responsible for DMR service scheduling receives DMR service data packets sent by multiple terminal devices via multiple links in real time, and multiple DMR service data packets form a message queue. Each DMR service data packet includes: source node ID, destination node ID, multiple transmission node IDs, data frame length, multiple node sending times and multiple node receiving times.

[0026] By obtaining the message queue on the server side, there is no need to increase the channel capacity to improve the network performance of the DMR network, and it will not significantly increase the power consumption and cost of the downstream equipment, and it occupies less resources.

[0027] S120: Determine a service scheduling period using a plurality of transmission periods corresponding to a plurality of DMR service data packets.

[0028] Here, the transmission period of the DMR service data packet can be understood as the generation period of the DMR service data packet. S120 includes: obtaining the lowest common multiple of multiple transmission periods corresponding to multiple DMR service data packets to obtain a service scheduling period. In this service scheduling period, each service is sent at least once. Exemplarily, the server receives 3 DMR service data packets, namely DMR service data packet 1, DMR service data packet 2 and DMR service data packet 3; the transmission period corresponding to DMR service data packet 1 is 30ms, the transmission period corresponding to DMR service data packet 2 is 20ms, and the transmission period corresponding to DMR service data packet 3 is 10ms, then the service scheduling period corresponding to the 3 DMR service data packets is 60ms. Within 60ms, the three services are sent once respectively.

[0029] Here, the method further includes: performing a greatest common divisor processing on multiple transmission periods corresponding to multiple DMR service data packets to obtain a minimum transmission period corresponding to multiple DMR service data packets. Exemplarily, the minimum transmission period corresponding to DMR service data packet 1, DMR service data packet 2, and DMR service data packet 3 is 10ms.

[0030] S130: Determine a first scheduling time of each DMR service data packet within a service scheduling period, where the first scheduling time refers to a scheduling time of each DMR service data packet relative to time zero.

[0031] Here, the transmission link of each DMR service data packet includes Q nodes, each node corresponds to a starting transmission time, and Q is a positive integer greater than 1; S130 includes: within the service scheduling period, based on the Q starting transmission times corresponding to each DMR service data packet, multiple DMR service data packets are randomly sorted multiple times to obtain multiple permutations and combinations; wherein each permutation and combination corresponds to a transmission offset, and the transmission offset refers to the transmission offset of the last DMR service data packet in each permutation and combination relative to the zero time; determining the minimum value of the transmission offsets corresponding to the multiple permutations and combinations; obtaining the transmission time corresponding to each DMR service data packet in the permutation and combination corresponding to the minimum value, and using the transmission time corresponding to each DMR service data packet as the first scheduling time of each DMR service data packet.

[0032] Here, within the service scheduling period, a node sends J DMR service data packets one by one, where J is a positive integer greater than 1; at the qth node among the Q nodes, the qth starting transmission time corresponding to the J DMR service data packets is calculated in the following manner: within the service scheduling period, the transmission rate and preset protection delay corresponding to the qth node among the Q nodes are obtained, 1≤q≤Q; the data frame length corresponding to the jth service data packet is divided by the transmission rate at the qth node to obtain the qth occupied time slot corresponding to the jth service data packet, 1≤j≤J; The qth occupied time slot corresponding to the jth DMR service data packet is used as the qth starting transmission time of the j+1th DMR service data packet; the qth starting transmission time, data frame length and preset protection delay of the j+1th DMR service data packet are continued to be used to determine the qth occupied time slot of the j+1th DMR service data packet, and the qth occupied time slot of the j+1th DMR service data packet is used as the qth starting transmission time of the j+2th DMR service data packet, until the qth starting transmission time corresponding to the Jth DMR service data packet is obtained.

[0033] Here, in the service scheduling period, one node sends J DMR service data packets. Exemplarily, Q is 3, and in the service scheduling period, the first node of the three nodes can send 5 DMR service data packets one by one, the second node can send 7 DMR service data packets one by one, and the third node can send 3 DMR service data packets one by one.

[0034] It should be noted that a transmission link of a DMR service data packet includes Q nodes, and the DMR service data packet corresponds to a start transmission time at each node.

[0035] Here, when the value of q is 1, at the first node among the Q nodes, the first starting transmission time of the first DMR service data packet is time zero; and the first starting transmission time of the second DMR service data packet is the sum of the first starting transmission time of the first DMR service data packet and the first occupied time slot of the first DMR service data packet.

[0036] It should be noted that, at the first node among the Q nodes, the first starting transmission time of the second DMR service data packet is obtained by adding the first starting transmission time of the first DMR service data packet and the occupied time slot of the first DMR service data packet at the first node, and so on, the first starting transmission time corresponding to multiple DMR service data packets at the first node can be obtained.

[0037] Exemplarily, two DMR service data packets are received at the first node, namely DMR service data packet 2, DMR service data packet 4 and DMR service data packet 5; the first starting transmission time of DMR service data packet 2 is time zero, and the data frame length of DMR service data packet 2 is divided by the transmission rate corresponding to the first node to obtain the required transmission duration of DMR service data packet 2, and then the required transmission duration of DMR service data packet 2 is added to the preset protection delay corresponding to the first node to obtain the first occupied time slot of DMR service data packet 2; the end time of transmission of DMR service data packet 2 is used as the first starting transmission time of DMR service data packet 4; the data frame length of DMR service data packet 4 is continued to be divided by the transmission rate corresponding to the first node to obtain the required transmission duration of DMR service data packet 4; then the required transmission duration of DMR service data packet 4 is added to the preset protection delay corresponding to the first node to obtain the first occupied time slot of DMR service data packet 4; the end time of transmission of DMR service data packet 4 is used as the first starting transmission time of DMR service data packet 5.

[0038] Here, when the value of q is greater than 1, at the qth node among Q nodes, the qth starting transmission time of the 1st service data packet is obtained by adding the q-1th starting transmission time of the 1st service data packet and the q-1th occupied time slot.

[0039] Here, after determining the Q starting transmission times corresponding to each DMR service data packet, the required transmission time of each DMR service data packet on the corresponding transmission link is obtained, and the Q starting transmission times corresponding to multiple DMR service data packets are used for random sorting to ensure that each node can send DMR service data packets uninterruptedly.

[0040] Specifically, the following constraints must be met during random permutation:

[0041] For each end node: (a) when the end node sends data, the next DMR service data packet to be sent must be sent after the previous DMR service data packet is sent; (b) when the end node receives data, the DMR service data packets must arrive at different times and must arrive at least after the previous data packet is fully received.

[0042] At the end node, the transmission time of adjacent services satisfies: (service i offset-service j offset-transmission time)*(service j offset-service i offset-transmission time)<=0.

[0043] For each switch (a type of node), the following conditions must be met: (a) When the switch sends data, the next DMR service data packet sent by the same port must be sent after the previous service is sent; (b) When the switch receives data, it only accepts and processes one DMR service data packet at the same time; this condition is equivalent to limiting the data packets from conflicting in the current switch; (c) For the same DMR service data packet, the time when the switch sends the DMR service data packet must be the time when the DMR service data packet is received plus the processing delay before it can be sent.

[0044] At the switch, the transmission time of adjacent services satisfies: (service i offset-service j offset-transmission time)*(service j offset-service i offset-transmission time)<=0.

[0045] For each DMR service data packet, when it arrives from the previous node to the next node, it must meet the following conditions: the sending time at the previous node plus the time spent on propagation in the channel equals the receiving time at the next node.

[0046] Here, DMR service data packets with the same transmission link and close transmission time can form a service flow. Therefore, when randomly sorting multiple DMR service data packets, it is also necessary to constrain them from the perspective of service flow to ensure that the transmission interval between adjacent service flows is small.

[0047] After the above constraints are met, the permutation and combination corresponding to the minimum value of the transmission offset is obtained, and the transmission time corresponding to each DMR service data packet in the permutation and combination is used as the first scheduling time of each DMR service data packet.

[0048] S140. Generate a service scheduling periodic table based on the first scheduling time.

[0049] Table 1 is an example of a service scheduling periodic table provided by an embodiment of the present invention. Assume that 4 DMR service data packets are received in the message queue, and after the 4 DMR service data packets are processed through step 120 and step 130, a service scheduling periodic table is obtained.

[0050] Table 1 Business scheduling cycle table

[0051]

[0052] S150 . Transmit multiple DMR service data packets one by one based on the service scheduling periodic table.

[0053] Here, S150 includes: based on the service scheduling periodic table, sorting multiple DMR service data packets in the message queue to obtain an optimized message queue; and transmitting multiple DMR service data packets one by one according to the optimized message queue.

[0054] Figure 2 2 is an example diagram of transmitting multiple DMR service data packets one by one according to an embodiment of the present invention. Figure 2 As shown, DMR service data packet 1, DMR service data packet 2, DMR service data packet 3 and DMR service data packet 4 are received in the message queue. According to the service reception time, the order of the four services in the message queue (in order of reception time) is: DMR service data packet 3, DMR service data packet 1, DMR service data packet 4 and DMR service data packet 2; the service scheduling period table specifies the sending time of the four services (also referred to as the first scheduling time); based on the specified sending time, the sending order of the four services is adjusted, and they are sent in the order of DMR service data packet 1, DMR service data packet 2, DMR service data packet 3 and DMR service data packet 4.

[0055] It should be noted that the server responsible for DMR service scheduling obtains the services in the message queue in real time, and when a DMR service data packet is newly added or reduced, it updates the service scheduling period table according to the DMR service data packet in the current message queue.

[0056] By re-adjusting the sending order of DMR service data packets based on the service scheduling periodic table, the probability of a large amount of data retransmission when a large amount of burst data enters the network can be reduced, and the data packet loss rate can be reduced.

[0057] To further understand the technical solution provided by the embodiment of the present invention, Figure 3 FIG. 1 is an example diagram of an application scenario of a deterministic forwarding scheduling method for DMR services provided by an embodiment of the present invention. Figure 3 As shown, the terminal device is a mobile station, or a mobile phone; mobile station 1 and mobile station 2 reach the server through the switching device via the relay station 1, and mobile station 3 and mobile station 4 reach the server through the switching device via the relay station 2. The server obtains the DMR service data packets sent by multiple mobile stations in real time, and generates a service scheduling period table based on the transmission link and transmission period of each DMR service data packet. The server distributes the generated service scheduling period table to multiple relay stations, and each relay station sends the DMR service data packet based on the service scheduling period table.

[0058] In view of the problem that a large number of burst data enters the network in the existing DMR communication system, a long service queue phenomenon occurs at some nodes, resulting in high latency. The present invention provides a deterministic forwarding scheduling method for DMR services. The method obtains multiple DMR service data packets in a message queue in real time, determines the service scheduling cycle by using the transmission cycles of multiple DMR service data packets, and randomly sorts multiple DMR service data packets in the service scheduling cycle to determine the first scheduling time of each DMR service data packet that meets the constraint conditions, and then uses the first scheduling time of each DMR service data packet to generate a service scheduling cycle table; and then uses the service scheduling cycle table to send each DMR service data packet one by one. Through the technical solution provided by the present invention, when a large number of burst data enters the network, services can be sent one by one according to the service scheduling cycle table, so as to achieve peak-shifting forwarding of services, prevent transmission congestion, reduce network jitter, and improve the stability and reliability of the system.

[0059] The above contents are further detailed descriptions of the present invention in combination with specific preferred embodiments, and it cannot be determined that the specific implementation of the present invention is limited to these descriptions. For ordinary technicians in the technical field to which the present invention belongs, several simple deductions or substitutions can be made without departing from the concept of the present invention, which should be regarded as falling within the protection scope of the present invention.

Claims

1. A deterministic forwarding scheduling method for DMR services, characterized in that: include: Get multiple DMR service data packets in the message queue in real time; Determine a service scheduling period using a plurality of transmission periods corresponding to the plurality of DMR service data packets; Determine a first scheduling time of each DMR service data packet within the service scheduling period, where the first scheduling time refers to a scheduling time of each DMR service data packet relative to time zero; Based on the first scheduling time, generating a service scheduling periodic table; Based on the service scheduling periodic table, the multiple DMR service data packets are transmitted one by one.

2. The deterministic forwarding scheduling method for DMR services according to claim 1, characterized in that: The transmission link of each DMR service data packet includes Q nodes, each node corresponds to a start transmission time, and Q is a positive integer greater than 1; The determining of the first scheduling time of each DMR service data packet within the service scheduling period includes: In the service scheduling period, based on the Q starting transmission times corresponding to each DMR service data packet, the multiple DMR service data packets are randomly sorted multiple times to obtain multiple permutations and combinations; wherein each permutation and combination corresponds to a transmission offset, and the transmission offset refers to the transmission offset of the last DMR service data packet in each permutation and combination relative to the zero time; Determine a minimum value of the transmission offsets corresponding to the multiple permutations and combinations; The transmission time corresponding to each DMR service data packet in the permutation and combination corresponding to the minimum value is obtained, and the transmission time corresponding to each DMR service data packet is used as the first scheduling time of each DMR service data packet.

3. The deterministic forwarding scheduling method for DMR services according to claim 2, characterized in that: In the service scheduling period, a node sends J DMR service data packets one by one, where J is a positive integer greater than 1; at the qth node among the Q nodes, the qth start transmission time corresponding to the J DMR service data packets is calculated in the following manner: In the service scheduling period, obtaining a transmission rate and a preset protection delay corresponding to a qth node among the Q nodes, 1≤q≤Q; Using the data frame length corresponding to the j-th DMR service data packet and dividing it by the transmission rate at the q-th node, the q-th occupied time slot corresponding to the j-th DMR service data packet is obtained, 1≤j≤J; The qth occupied time slot corresponding to the jth DMR service data packet is used as the qth starting transmission time of the j+1th DMR service data packet; the qth starting transmission time of the j+1th DMR service data packet, the data frame length and the preset protection delay are continued to be used to determine the qth occupied time slot of the j+1th DMR service data packet, and the qth occupied time slot of the j+1th DMR service data packet is used as the qth starting transmission time of the j+2th DMR service data packet, until the qth starting transmission time corresponding to the Jth DMR service data packet is obtained.

4. The deterministic forwarding scheduling method for DMR services according to claim 3, characterized in that: The method further comprises: When the value of q is greater than 1, at the qth node among the Q nodes, the qth starting transmission time of the 1st DMR service data packet is obtained by adding the q-1th starting transmission time of the 1st DMR service data packet and the q-1th occupied time slot.

5. The deterministic forwarding scheduling method for DMR services according to claim 3, characterized in that: The method further comprises: When the value of q is 1, at the first node among the Q nodes, the first start transmission time of the first DMR service data packet is time zero.

6. The deterministic forwarding scheduling method for DMR services according to claim 1, characterized in that: The determining the service scheduling period by using the multiple transmission periods corresponding to the multiple DMR service data packets includes: The service scheduling period is obtained by obtaining the least common multiple of multiple transmission periods corresponding to the multiple DMR service data packets.

7. The deterministic forwarding scheduling method for DMR services according to claim 1, characterized in that: The method further comprises: A greatest common divisor is obtained for a plurality of transmission periods corresponding to the plurality of DMR service data packets to obtain a minimum transmission period corresponding to the plurality of DMR service data packets.

8. The deterministic forwarding scheduling method for DMR services according to claim 1, characterized in that: Each DMR service data packet includes: a source node ID, a destination node ID, multiple transmission node IDs, a data frame length, multiple node sending times, and multiple node receiving times.

9. The deterministic forwarding scheduling method for DMR services according to claim 1, characterized in that: The transmitting the plurality of DMR service data packets one by one based on the service scheduling periodic table includes: Based on the service scheduling periodic table, multiple DMR service data packets in the message queue are sorted to obtain an optimized message queue; The multiple DMR service data packets are transmitted one by one according to the optimized message queue.

Images