A method and scheduling system for transmitting demand response service data packets

Abstract

The present invention relates to a transmission method and scheduling system for demand response service data packets, including: sending a received demand response service data packet to the tail of its corresponding queue; updating the scheduling system scheduling parameters; calculating the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters; selecting the demand response service data packet with the smallest transmission time in all queues for forwarding. The technical solution provided by the present invention improves the scheduling algorithm by setting dynamic weights, so that the scheduling system can effectively reduce the transmission delay and packet loss rate of the demand response service while meeting the QoS performance of the demand response service; thereby improving the reliability and real-time performance of the data transmitted by the scheduling system, and improving the service quality of the scheduling system.

Description

Technical Field

[0001] The present invention relates to the technical field of electric power demand response communication networks, and in particular to a transmission method and a dispatching system for demand response service data packets. Background Art

[0002] With the advancement of "Internet + Smart Energy" and the deep integration of electrical information technology, the power demand response business has also been given new missions such as new energy consumption and auxiliary services, and is facing the transformation from emergency to normalization. At present, the construction of power demand response pilot projects has accumulated rich experience for the development of demand response business, but in the future, in the process of large-scale replication and promotion of demand response, how to improve the service quality of demand response business while ensuring QoS requirements still has some bottlenecks.

[0003] The reliability and real-time performance of the demand response communication network are directly related to the large-scale promotion and application of demand response services. When burst data flows appear in the communication network, congestion of network nodes or links may occur, which may affect the normal operation of the demand response business and lead to a decline in service quality, which may in turn have a certain impact on the security and stability of the power grid.

[0004] Currently, most existing queue scheduling schemes use static weights without considering dynamic data traffic, such as bursts and queue size changes, which will directly reduce the reliability and real-time performance of demand response communication networks.

[0005] The currently proposed transmission method for demand response communication data packets is based on the basic WFQ algorithm structure. The transmission delay and packet loss rate of its demand response service are relatively high. Therefore, it is urgent to propose a transmission method that can effectively improve the transmission delay and packet loss rate of the demand response service. Summary of the invention

[0006] In view of the deficiencies in the prior art, the purpose of the present invention is to provide a method for transmitting demand response service data packets, which can effectively reduce the transmission delay and packet loss rate of the demand response service while meeting the QoS performance of the demand response service, thereby improving the reliability and real-time performance of the demand response communication network.

[0007] The purpose of the present invention is achieved by adopting the following technical solutions:

[0008] The present invention provides a method for transmitting a demand response service data packet, wherein the method comprises:

[0009] Sending the received demand response service data packet to the tail of its corresponding queue;

[0010] Update the scheduling parameters of the scheduling system;

[0011] Calculate the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters;

[0012] The demand response service data packet with the shortest transmission time is selected from all queues for forwarding.

[0013] Preferably, the updating of scheduling system scheduling parameters includes:

[0014] Update time t by pressing k The length q of the i-th queue in the system si (t k ):

[0015] q si (t k )=q si (t k-1 )+η iA (t k )L i1 (t k )-μ iB (t k )L i2 (t k )

[0016] In the formula, q si (t k-1 ) is the time t k-1 The length of the i-th queue in the system; L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; L i2 (t k ) is the time t k The length of the demand response service data packet leaving the i-th queue of the system; η iA is time t k The receiving coefficient of the i-th queue; η iB is time t k The transmission coefficient of the i-th queue;

[0017] Among them, if time t k The event that occurs is sending the received demand response service data packet to the tail of the i-th queue of the system, then η iA =1; otherwise η iA =0;

[0018] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then η iB =1; otherwise η iB =0;

[0019] Update time t by pressing k The average length q of the i-th queue in the system ai (t k ):

[0020] q ai (t k )=(1-λ)q ai (t k-1 )+λq si (t k )

[0021] In the formula, q ai (t k-1 ) is the time t k-1 The average length of the i-th queue in the system; λ is the queue sensitivity parameter;

[0022] Update time t by pressing k The total weight of all queues in the system S b (t k ):

[0023]

[0024] In the formula, S b (t k-1 ) is the time t k-1 The total weight of all queues in the system; η i (t k ) is the time t k The additive coefficient of the i-th queue in the system; μ i (t k ) is the time t k The reduction coefficient of the i-th queue in the system; ω i (t k ) is the time t k-1 The weight of the i-th queue in the system;

[0025] Among them, if time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k Previously, there was no demand response service data packet in the i-th queue of the system, then η i (t k )=1; otherwise η i (t k )=0;

[0026] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ i (t k )=1; otherwise μ i (tk )=0;

[0027] Update time t by pressing k System virtual time V(t k ):

[0028] V(t k )=max(V′(t k ),k 2 )

[0029] In the formula, V′(t k ) is the time t k Systems Theory Virtual Time;

[0030] Determine the time t by the following formula k System theory virtual time V′(t k ):

[0031]

[0032] In the formula, V(t k-1 ) is the time t k-1 System virtual time;

[0033] Update time t by pressing k The weight of the i-th queue in the system ω i (t k ):

[0034] when When ω i (t k )=ω i0 ;

[0035] when When

[0036] Among them, α ki is time t k The coefficient of the exponential function of the i-th queue in the system; b ki is time t k The service burst rate of the i-th queue in the system; q mi Preset the maximum value for the length of the i-th queue in the system;

[0037] The time t is determined as follows: k The coefficient α of the exponential function of the i-th queue of the system ki :

[0038]

[0039] In the formula, β ki1 is time t kThe first coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; β ki2 Time t k The second coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; ρ kij is time t k The service load of the jth queue whose service data packet level is higher than the service data packet level of the i-th queue in the system; c is the total number of queues whose service data packet level is higher than the service data packet level of the i-th queue in the system;

[0040] The time t is determined as follows: k The traffic load of the queue whose service data packet level received by the jth queue is higher than the service data packet level received by the i-th queue of the system ρ kij :

[0041]

[0042] In the formula, q sj (t k ) is the time t k The length of the queue whose j-th received service data packet level is higher than the service data packet level accepted by the i-th queue of the system; q mj is time t k The length of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system is preset to the maximum value;

[0043] The time t is determined as follows: k The service burst rate b of the i-th queue in the system ki :

[0044]

[0045] In the formula, q ai (t k ) is the average length of the i-th queue in the system at the moment;

[0046] The time t k is the moment when event P occurs for the kth time; the event P is that the received demand response service data packet is sent to the tail of its corresponding queue in the scheduling system and / or the demand response service data packet leaves its corresponding queue.

[0047] Furthermore, the calculation of the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters includes:

[0048] If time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time tk If there is no demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of its corresponding queue is

[0049] If time t k The time when the received demand response service data packet is sent to the tail of the i-th queue of the system and time t k If there is a demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of the i-th queue of the system is

[0050] Among them, L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; ω i (t k ) is the time t k The weight of the i-th queue in the system; f it (h-1) is the time t k Before and at time t k The shortest time for the transmission of the demand response service data packet arriving at the i-th queue of the system is the transmission time for the data packet to be transmitted to the head of the i-th queue of the system; L is the length of the data packet; V(t k ) is the tth k The system virtual time at that moment.

[0051] Preferably, before the dispatching system receives the demand response service data packet for the first time, it also includes:

[0052] Initialize the scheduling system scheduling parameters.

[0053] Furthermore, the initialization of the scheduling system scheduling parameters includes:

[0054] Initialize the initial time t0 system virtual time V(t0) = 0, the total weight of all queues in the system S b (t0) = 0, the length of the i-th queue in the system is q si (t0) = 0, the average length of the system queue q ai (t0) = 0, the weight of the i-th queue in the system ω i (t0) = ω i0 , where i∈(1~n), n is the total number of system queues, ω i0 The initial allocation weight for the i-th queue in the system.

[0055] Preferably, sending the received demand response service data packet to the tail of its corresponding queue includes:

[0056] The demand response service data packets are graded according to the requirements of the received demand response service data packets for transmission delay and transmission bandwidth, and the demand response service data packets are sent to the tail of the queue corresponding to the level thereof.

[0057] The present invention provides a scheduling system, the improvement of which lies in that the system comprises:

[0058] Sending module: used to send the received demand response service data packet to the end of its corresponding queue;

[0059] Update module: used to update the scheduling parameters of the scheduling system;

[0060] Calculation module: used for calculating the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters;

[0061] Forwarding module: used for selecting the demand response service data packet with the shortest transmission time from all queues for forwarding.

[0062] Preferably, the update module is used to:

[0063] Update time t by pressing k The length q of the i-th queue in the system si (t k ):

[0064] q si (t k )=q si (t k-1 )+η iA (t k )L i1 (t k )-μ iB (t k )L i2 (t k )

[0065] In the formula, q si (t k-1 ) is the time t k-1 The length of the i-th queue in the system; L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; L i2 (t k ) is the time t k The length of the demand response service data packet leaving the i-th queue of the system; η iA is time t k The receiving coefficient of the i-th queue; ηiB is time t k The transmission coefficient of the i-th queue;

[0066] Among them, if time t k The event that occurs is sending the received demand response service data packet to the tail of the i-th queue of the system, then η iA =1; otherwise η iA =0;

[0067] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then η iB =1; otherwise η iB =0;

[0068] Update time t by pressing k The average length q of the i-th queue in the system ai (t k ):

[0069] q ai (t k )=(1-λ)q ai (t k-1 )+λq si (t k )

[0070] In the formula, q ai (t k-1 ) is the time t k-1 The average length of the i-th queue in the system; λ is the queue sensitivity parameter;

[0071] Update time t by pressing k The total weight of all queues in the system S b (t k ):

[0072]

[0073] In the formula, S b (t k-1 ) is the time t k-1 The total weight of all queues in the system; η i (t k ) is the time t k The additive coefficient of the i-th queue in the system; μ i (t k ) is the time t k The reduction coefficient of the i-th queue in the system; ω i (t k ) is the time t k-1 The weight of the i-th queue in the system;

[0074] Among them, if time tk The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k Previously, there was no demand response service data packet in the i-th queue of the system, then η i (t k )=1; otherwise η i (t k )=0;

[0075] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ i (t k )=1; otherwise μ i (t k )=0;

[0076] Update time t by pressing k System virtual time V(t k ):

[0077] V(t k )=max(V′(t k ),k 2 )

[0078] In the formula, V′(t k ) is the time t k Systems Theory Virtual Time;

[0079] Determine the time t by the following formula k System theory virtual time V′(t k ):

[0080]

[0081] In the formula, V(t k-1 ) is the time t k-1 System virtual time;

[0082] Update time t by pressing k The weight of the i-th queue in the system ω i (t k ):

[0083] when When ω i (t k )=ω i0 ;

[0084] when When

[0085] Among them, α ki is time t kThe coefficient of the exponential function of the i-th queue in the system; b ki is time t k The service burst rate of the i-th queue in the system; q mi Preset the maximum value for the length of the i-th queue in the system;

[0086] The time t is determined as follows: k The coefficient α of the exponential function of the i-th queue of the system ki :

[0087]

[0088] In the formula, β ki1 is time t k The first coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; β ki2 Time t k The second coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; ρ kij is time t k The service load of the jth queue whose service data packet level is higher than the service data packet level of the i-th queue in the system; c is the total number of queues whose service data packet level is higher than the service data packet level of the i-th queue in the system;

[0089] The time t is determined as follows: k The traffic load of the queue whose service data packet level received by the jth queue is higher than the service data packet level received by the i-th queue of the system ρ kij :

[0090]

[0091] In the formula, q sj (t k ) is the time t k The length of the queue whose j-th received service data packet level is higher than the service data packet level accepted by the i-th queue of the system; q mj is time t k The length of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system is preset to the maximum value;

[0092] The time t is determined as follows: k The service burst rate b of the i-th queue in the system ki :

[0093]

[0094] In the formula, q ai (t k ) is the average length of the i-th queue in the system at the moment;

[0095] The time t k is the moment when event P occurs for the kth time; the event P is that the received demand response service data packet is sent to the tail of its corresponding queue in the scheduling system and / or the demand response service data packet leaves its corresponding queue.

[0096] Furthermore, the computing module is used to:

[0097] If time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k If there is no demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of its corresponding queue is

[0098] If time t k The time when the received demand response service data packet is sent to the tail of the i-th queue of the system and time t k If there is a demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of the i-th queue of the system is

[0099] Among them, L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; ω i (t k ) is the time t k The weight of the i-th queue in the system; f it (h-1) is the time t k Before and at time t k The shortest time for the transmission of the demand response service data packet arriving at the i-th queue of the system is the transmission time for the data packet to be transmitted to the head of the i-th queue of the system; L is the length of the data packet; V(t k ) is the tth k The system virtual time at that moment.

[0100] Preferably, before the dispatching system receives the demand response service data packet for the first time, it also includes:

[0101] Initialize the scheduling system scheduling parameters.

[0102] Furthermore, the initialization module is used to:

[0103] Initialize the initial time t0 system virtual time V(t0) = 0, the total weight of all queues in the system S b(t0) = 0, the length of the i-th queue in the system is q si (t0) = 0, the average length of the system queue q ai (t0) = 0, the weight of the i-th queue in the system ω i (t0) = ω i0 , where i∈(1~n), n is the total number of system queues, ω i0 The initial allocation weight for the i-th queue in the system.

[0104] Preferably, the sending module is used to:

[0105] The demand response service data packets are graded according to the requirements of the received demand response service data packets for transmission delay and transmission bandwidth, and the demand response service data packets are sent to the tail of the queue corresponding to the level thereof.

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

[0107] The technical solution of the present invention sends the received demand response service data packet to the tail of its corresponding queue, updates the scheduling system scheduling parameters; calculates the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters; selects the demand response service data packet with the smallest transmission time in all queues for forwarding. The present invention improves the scheduling algorithm by setting dynamic weights, so that the scheduling system can effectively reduce the transmission delay and packet loss rate of the demand response service while meeting the QoS performance of the demand response service; thereby improving the reliability and real-time performance of the scheduling system's transmission data and improving the service quality of the scheduling system. BRIEF DESCRIPTION OF THE DRAWINGS

[0108] Figure 1 It is a flow chart of a method for transmitting a demand response service data packet;

[0109] Figure 2 It is the scheduling system model diagram;

[0110] Figure 3 It is a scheduling system flow chart. DETAILED DESCRIPTION

[0111] The specific implementation modes of the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0112] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0113] The present invention provides a method for transmitting a demand response service data packet, such as Figure 1 As shown, the method includes:

[0114] Step 101. The scheduling system sends the demand response service data packet received from the sending end to the tail of its corresponding queue;

[0115] In the best embodiment of the present invention, it is necessary to monitor the network status of the demand response service communication network in real time to obtain the service burst rate of each queue, network overload and the arrival and departure of data packets in each queue;

[0116] Step 102. The scheduling system updates the scheduling parameters in the scheduling system;

[0117] Step 103. The scheduling system calculates the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters;

[0118] In the optimal embodiment of the present invention, the demand response service data packet transmitted to the head of its corresponding queue is inserted into the system minimum transmission time sequence pair according to the transmission time from small to large (the data packet with the smallest transmission time is at the head of the minimum transmission time sequence pair), and the scheduling system reads the position information of the head demand response service data packet in the minimum transmission time sequence pair, and forwards the data packet according to the position information;

[0119] The location information of the demand response service data packet includes: the queue number where the demand response service data packet is located and the location of the data packet in the queue.

[0120] Step 104: The scheduling system selects the demand response service data packet with the shortest transmission time from all queues and forwards it to the receiving end.

[0121] In the optimal embodiment of the present invention, the scheduling algorithm of the present invention is improved on the basic WFQ algorithm structure. The main advantages of the improved algorithm (low-complexity dynamic weighted fair queue scheduling algorithm) are: first, based on the dynamic characteristics of data traffic such as business burst rate and network overload, a dynamic weight scheduling mechanism is proposed; secondly, in order to simplify the complexity of the scheduling system update time, the parameter of system virtual time is proposed, the system trigger update situation is set and the system update time is obtained by calibrating the system virtual time generator; these two improvements are used to improve the reliability and real-time performance of the demand response business communication network.

[0122] Specifically, the step 102 includes:

[0123] Update time t by pressing k The length q of the i-th queue in the system si (t k ):

[0124] q si (t k )=q si (t k-1 )+η iA (t k )L i1 (t k )-μ iB (t k )L i2 (t k )

[0125] In the formula, q si (t k-1 ) is the time t k-1 The length of the i-th queue in the system; L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; L i2 (t k ) is the time t k The length of the demand response service data packet leaving the i-th queue of the system; η iA is time t k The receiving coefficient of the i-th queue; η iB is time t k The transmission coefficient of the i-th queue;

[0126] Among them, if time t k The event that occurs is sending the received demand response service data packet to the tail of the i-th queue of the system, then η iA =1; otherwise η iA =0;

[0127] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then η iB =1; otherwise η iB =0;

[0128] Update time t by pressing k The average length q of the i-th queue in the system ai (t k ):

[0129] q ai (t k )=(1-λ)q ai (t k-1 )+λq si (t k )

[0130] In the formula, q ai (t k-1 ) is the time t k-1 The average length of the i-th queue in the system; λ is the queue sensitivity parameter;

[0131] Update time t by pressing k The total weight of all queues in the system S b (t k ):

[0132]

[0133] In the formula, S b (t k-1 ) is the time t k-1 The total weight of all queues in the system; η i (t k ) is the time t k The additive coefficient of the i-th queue in the system; μ i (t k ) is the time t k The reduction coefficient of the i-th queue in the system; ω i (t k ) is the time t k-1 The weight of the i-th queue in the system;

[0134] Among them, if time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k Previously, there was no demand response service data packet in the i-th queue of the system, then η i (t k )=1; otherwise η i (t k )=0;

[0135] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ i (t k )=1; otherwise μ i (t k )=0;

[0136] Update time t by pressing k System virtual time V(t k ):

[0137] V(t k )=max(V′(t k ),k 2 )

[0138] In the formula, V′(t k ) is the time t k Systems Theory Virtual Time;

[0139] Determine the time t by the following formula k System theory virtual time V′(t k ):

[0140]

[0141] In the formula, V(t k-1 ) is the time t k-1 System virtual time;

[0142] Update time t by pressing k The weight of the i-th queue in the system ω i (t k ):

[0143] when When ω i (t k )=ω i0 ;

[0144] when When

[0145] Among them, α ki is time t k The coefficient of the exponential function of the i-th queue in the system; b ki is time t k The service burst rate of the i-th queue in the system; q mi Preset the maximum value for the length of the i-th queue in the system;

[0146] In the preferred embodiment of the present invention, the queue weight is controlled by the queue size, traffic burst rate and QoS requirements.

[0147] The time t is determined as follows: k The coefficient α of the exponential function of the i-th queue of the system ki :

[0148]

[0149] In the formula, β ki1 is time t k The first coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; β ki2 Time t k The second coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; ρ kij is time t k The service load of the jth queue whose service data packet level is higher than the service data packet level of the i-th queue in the system; c is the total number of queues whose service data packet level is higher than the service data packet level of the i-th queue in the system;

[0150] In the best embodiment of the present invention, different queues have the same traffic load. ki Satisfy the following formula:

[0151] α k1 >α k2 >α k3 …>α kn

[0152] The time t is determined as follows: k The traffic load of the queue whose service data packet level received by the jth queue is higher than the service data packet level received by the i-th queue of the system ρ kij :

[0153]

[0154] In the formula, q sj (t k ) is the time t k The length of the queue whose j-th received service data packet level is higher than the service data packet level accepted by the i-th queue of the system; q mj is time t k The length of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system is preset to the maximum value;

[0155] The time t is determined as follows: k The service burst rate b of the i-th queue in the system ki :

[0156]

[0157] In the formula, qai (t k ) is the average length of the i-th queue in the system at the moment;

[0158] The time t k is the moment when event P occurs for the kth time; the event P is that the received demand response service data packet is sent to the tail of its corresponding queue in the scheduling system and / or the demand response service data packet leaves its corresponding queue.

[0159] Furthermore, the step 103 includes:

[0160] If time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k If there is no demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of its corresponding queue is

[0161] If time t k The time when the received demand response service data packet is sent to the tail of the i-th queue of the system and time t k If there is a demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of the i-th queue of the system is

[0162] Among them, L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; ω i (t k ) is the time t k The weight of the i-th queue in the system; f it (h-1) is the time t k Before and at time t k The shortest time for the transmission of the demand response service data packet arriving at the i-th queue of the system is the transmission time for the data packet to be transmitted to the head of the i-th queue of the system; L is the length of the data packet; V(t k ) is the tth k The system virtual time at that moment.

[0163] Specifically, before the dispatching system receives the demand response service data packet for the first time, it also includes:

[0164] Initialize the scheduling system scheduling parameters.

[0165] Specifically, the initialization scheduling system scheduling parameters include:

[0166] Initialize the initial time t0 system virtual time V(t0) = 0, the total weight of all queues in the system S b (t0) = 0, the length of the i-th queue in the system is q si (t0) = 0, the average length of the system queue q ai (t0) = 0, the weight of the i-th queue in the system ω i (t0) = ω i0 , where i∈(1~n), n is the total number of system queues, ω i0 The initial allocation weight for the i-th queue in the system.

[0167] Specifically, step 101 includes:

[0168] The demand response service data packets are graded according to the requirements of the received demand response service data packets for transmission delay and transmission bandwidth, and the demand response service data packets are sent to the tail of the queue corresponding to the level thereof.

[0169] In the preferred embodiment of the present invention, Figure 2 As shown, the dispatching system analyzes the requirements of each demand response service data packet for delay and bandwidth, and can divide the demand response service data packet into emergency control data packet (level 1 service data packet), capacity auxiliary service plan data packet (level 2 service data packet), interruptible load and direct load control data packet (level 3 service data packet) and price-based demand response data packet (level 4 service data packet); among which, the price-based demand response data packet can be divided into time-of-use electricity price demand response service data packet, real-time electricity price demand response service data packet, and peak electricity price demand response service data packet, etc.; then, different levels of demand response services are sent to different queues through demand response identification technology;

[0170] If the transmission delay requirement of the received demand response service data packet is no more than 3s and the transmission bandwidth requirement is no less than 2M, the demand response service data packet is classified and

[0171] The demand response service data packet is a first-level service data packet, and the demand response service data packet is sent to the tail of the queue corresponding to the first-level service data packet;

[0172] If the transmission delay requirement of the received demand response service data packet is no more than 4s and the transmission bandwidth requirement is no more than 2M, the demand response service data packet is a secondary service data packet, and the demand response service data packet is sent to the tail of the queue corresponding to the secondary service data packet;

[0173] If the transmission delay requirement of the received demand response service data packet is no more than 15s and the transmission bandwidth requirement is no more than 2M, the demand response service data packet is a level-3 service data packet, and the demand response service data packet is sent to the tail of the queue corresponding to the level-3 service data packet;

[0174] If the transmission delay requirement of the received demand response service data packet is no more than 30s and the transmission bandwidth requirement is no more than 2M, then the demand response service data packet is a level 4 service data packet, and the demand response service data packet is sent to the tail of the queue corresponding to the level 4 service data packet.

[0175] The present invention provides a scheduling system, such as Figure 3 As shown, the system comprises:

[0176] Sending module: used to send the received demand response service data packet to the end of its corresponding queue;

[0177] Update module: used to update the scheduling parameters of the scheduling system;

[0178] Calculation module: used for calculating the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters;

[0179] Forwarding module: used for selecting the demand response service data packet with the shortest transmission time from all queues for forwarding.

[0180] Specifically, the update module is used to:

[0181] Update time t by pressing k The length q of the i-th queue in the system si (t k ):

[0182] q si (t k )=q si (t k-1 )+η iA (t k )L i1 (t k )-μ iB (t k )L i2 (t k )

[0183] In the formula, q si (t k-1 ) is the time t k-1 The length of the i-th queue in the system; L i1 (t k ) is the time t kThe length of the demand response service data packet sent to the tail of the i-th queue of the system; L i2 (t k ) is the time t k The length of the demand response service data packet leaving the i-th queue of the system; η iA is time t k The receiving coefficient of the i-th queue; η iB is time t k The transmission coefficient of the i-th queue;

[0184] Among them, if time t k The event that occurs is sending the received demand response service data packet to the tail of the i-th queue of the system, then η iA =1; otherwise η iA =0;

[0185] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then η iB =1; otherwise η iB =0;

[0186] Update time t by pressing k The average length q of the i-th queue in the system ai (t k ):

[0187] q ai (t k )=(1-λ)q ai (t k-1 )+λq si (t k )

[0188] In the formula, q ai (t k-1 ) is the time t k-1 The average length of the i-th queue in the system; λ is the queue sensitivity parameter;

[0189] Update time t by pressing k The total weight of all queues in the system S b (t k ):

[0190]

[0191] In the formula, S b (t k-1 ) is the time t k-1 The total weight of all queues in the system; η i (t k ) is the time t k The additive coefficient of the i-th queue in the system; μi (t k ) is the time t k The reduction coefficient of the i-th queue in the system; ω i (t k ) is the time t k-1 The weight of the i-th queue in the system;

[0192] Among them, if time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k Previously, there was no demand response service data packet in the i-th queue of the system, then η i (t k )=1; otherwise η i (t k )=0;

[0193] If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ i (t k )=1; otherwise μ i (t k )=0;

[0194] Update time t by pressing k System virtual time V(t k ):

[0195] V(t k )=max(V′(t k ),k 2 )

[0196] In the formula, V′(t k ) is the time t k Systems Theory Virtual Time;

[0197] Determine the time t by the following formula k System theory virtual time V′(t k ):

[0198]

[0199] In the formula, V(t k-1 ) is the time t k-1 System virtual time;

[0200] Update time t by pressing k The weight of the i-th queue in the system ω i (t k ):

[0201] when When ω i (tk )=ω i0 ;

[0202] when When

[0203] Among them, α ki is time t k The coefficient of the exponential function of the i-th queue in the system; b ki is time t k The service burst rate of the i-th queue in the system; q mi Preset the maximum value for the length of the i-th queue in the system;

[0204] The time t is determined as follows: k The coefficient α of the exponential function of the i-th queue of the system ki :

[0205]

[0206] In the formula, β ki1 is time t k The first coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; β ki2 Time t k The second coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; ρ kij is time t k The service load of the jth queue whose service data packet level is higher than the service data packet level of the i-th queue in the system; c is the total number of queues whose service data packet level is higher than the service data packet level of the i-th queue in the system;

[0207] The time t is determined as follows: k The traffic load of the queue whose service data packet level received by the jth queue is higher than the service data packet level received by the i-th queue of the system ρ kij :

[0208]

[0209] In the formula, q sj (t k ) is the time t k The length of the queue whose j-th received service data packet level is higher than the service data packet level accepted by the i-th queue of the system; q mj is time t k The length of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system is preset to the maximum value;

[0210] The time t is determined as follows: kThe service burst rate b of the i-th queue in the system ki :

[0211]

[0212] In the formula, q ai (t k ) is the average length of the i-th queue in the system at the moment;

[0213] The time t k is the moment when event P occurs for the kth time; the event P is that the received demand response service data packet is sent to the tail of its corresponding queue in the scheduling system and / or the demand response service data packet leaves its corresponding queue.

[0214] Specifically, the computing module is used to:

[0215] If time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k If there is no demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of its corresponding queue is

[0216] If time t k The time when the received demand response service data packet is sent to the tail of the i-th queue of the system and time t k If there is a demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of the i-th queue of the system is

[0217] Among them, L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; ω i (t k ) is the time t k The weight of the i-th queue in the system; f it (h-1) is the time t k Before and at time t k The shortest time for the transmission of the demand response service data packet arriving at the i-th queue of the system is the transmission time for the data packet to be transmitted to the head of the i-th queue of the system; L is the length of the data packet; V(t k ) is the tth k The system virtual time at that moment.

[0218] Specifically, before the dispatching system receives the demand response service data packet for the first time, it also includes:

[0219] Initialize the scheduling system scheduling parameters.

[0220] Specifically, the initialization module is used to:

[0221] Initialize the initial time t0 system virtual time V(t0) = 0, the total weight of all queues in the system S b (t0) = 0, the length of the i-th queue in the system is q si (t0) = 0, the average length of the system queue q ai (t0) = 0, the weight of the i-th queue in the system ω i (t0) = ω i0 , where i∈(1~n), n is the total number of system queues, ω i0 The initial allocation weight for the i-th queue in the system.

[0222] Specifically, the sending module is used to:

[0223] The demand response service data packets are graded according to the requirements of the received demand response service data packets for transmission delay and transmission bandwidth, and the demand response service data packets are sent to the tail of the queue corresponding to the level thereof.

[0224] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0225] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0226] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0227] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0228] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A method for transmitting a demand response service data packet, characterized in that: The method comprises: Sending the received demand response service data packet to the tail of its corresponding queue; Update the scheduling parameters of the scheduling system; Calculate the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters; Selecting the demand response service data packet with the shortest transmission time from all queues for forwarding; The updating of scheduling system scheduling parameters includes: Update time t by pressing k The length q of the i-th queue in the system si (t k ): q si (t k )=q si (t k-1 )+η iA (t k )L i1 (t k )-μ iB (t k )L i2 (t k ) In the formula, q si (t k-1 ) is the time t k-1 The length of the i-th queue in the system; L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; L i2 (t k ) is the time t k The length of the demand response service data packet leaving the i-th queue of the system; η iA is time t k The receiving coefficient of the i-th queue; μ iB is time t k The transmission coefficient of the i-th queue; Among them, if time t k The event that occurs is sending the received demand response service data packet to the tail of the i-th queue of the system, then η iA =1; otherwise η iA =0; If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ iB =1; otherwise μ iB =0; Update time t by pressing k The average length q of the i-th queue in the system ai (t k ): q ai (t k )=(1-λ)q ai (t k-1 )+λq si (t k ) In the formula, q ai (t k-1 ) is the time t k-1 The average length of the i-th queue in the system; λ is the queue sensitivity parameter; Update time t by pressing k The total weight of all queues in the system S b (t k ): In the formula, S b (t k-1 ) is the time t k-1 The total weight of all queues in the system; η i (t k ) is the time t k The additive coefficient of the i-th queue in the system; μ i (t k ) is the time t k The reduction coefficient of the i-th queue in the system; ω i (t k ) is the time t k-1 The weight of the i-th queue in the system; n is the total number of queues in the system; Among them, if time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k Previously, there was no demand response service data packet in the i-th queue of the system, then η i (t k )=1; otherwise η i (t k )=0; If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ i (t k )=1; otherwise μ i (t k )=0; Update time t by pressing k System virtual time V(t k ): V(t k )=max(V′(t k ),k 2 ) In the formula, V′(t k ) is the time t k System theory virtual time; k is the number of times event P occurs; Determine the time t by the following formula k System theory virtual time V′(t k ): In the formula, V(t k-1 ) is the time t k-1 System virtual time; Update time t by pressing k The weight of the i-th queue in the system ω i (t k ): when When ω i (t k )=ω i0 ; when When Among them, α ki is time t k The coefficient of the exponential function of the i-th queue in the system; b ki is time t k The service burst rate of the i-th queue in the system; q mi Preset the maximum value for the length of the i-th queue in the system; ω i0 is the initial allocation weight of the i-th queue in the system; The time t is determined as follows: k The coefficient α of the exponential function of the i-th queue of the system ki : In the formula, β ki1 is time t k The first coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; β ki2 Time t k The second coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; ρ kij is time t k The service load of the jth queue whose service data packet level is higher than the service data packet level of the i-th queue in the system; c is the total number of queues whose service data packet level is higher than the service data packet level of the i-th queue in the system; The time t is determined as follows: k The traffic load of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system ρ kij : In the formula, q sj (t k ) is the time t k The length of the queue whose j-th received service data packet level is higher than the service data packet level accepted by the i-th queue of the system; q mj is time t k The length of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system is preset to the maximum value; The time t is determined as follows: k The service burst rate b of the i-th queue in the system ki : In the formula, q ai (t k ) is the average length of the i-th queue in the system at the moment; The time t k is the moment when event P occurs for the kth time; the event P is that the received demand response service data packet is sent to the tail of its corresponding queue in the scheduling system and / or the demand response service data packet leaves its corresponding queue.

2. The method according to claim 1, characterized in that The calculating, based on the updated system scheduling parameters, the transmission time of the demand response service data packet to the head of its corresponding queue includes: If time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k If there is no demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of its corresponding queue is If time t k The time when the received demand response service data packet is sent to the tail of the i-th queue of the system and time t k If there is a demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of the i-th queue of the system is Among them, L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; ω i (t k ) is the time t k The weight of the i-th queue in the system; f it (h-1) is the time t k Before and at time t k The shortest time for the transmission of the demand response service data packet arriving at the i-th queue of the system is the transmission time for the data packet to be transmitted to the head of the i-th queue of the system; L is the length of the data packet; V(t k ) is the tth k The system virtual time at that moment.

3. The method according to claim 1, characterized in that When the dispatch system receives the demand response service data packet for the first time, it also includes: Initialize the scheduling system scheduling parameters.

4. The method according to claim 3, characterized in that The initialization scheduling system scheduling parameters include: Initialize the initial time t0 system virtual time V(t0) = 0, the total weight of all queues in the system S b (t0) = 0, the length of the i-th queue in the system is q si (t0) = 0, the average length of the system queue q ai (t0) = 0, the weight of the i-th queue in the system ω i (t0) = ω i0 , where i∈(1~n), n is the total number of system queues, ω i0 The initial weight assigned to the i-th queue in the system.

5. The method according to claim 1, characterized in that The step of sending the received demand response service data packet to the tail of its corresponding queue includes: The demand response service data packets are graded according to the requirements of the received demand response service data packets for transmission delay and transmission bandwidth, and the demand response service data packets are sent to the tail of the queue corresponding to the level thereof.

6. A scheduling system, characterized in that: The system comprises: Sending module: used to send the received demand response service data packet to the end of its corresponding queue; Update module: used to update the scheduling parameters of the scheduling system; Calculation module: used for calculating the transmission time of the demand response service data packet to the head of its corresponding queue based on the updated system scheduling parameters; Forwarding module: used for selecting the demand response service data packet with the shortest transmission time from all queues for forwarding; The update module is used to: Update time t by pressing k The length q of the i-th queue in the system si (t k ): q si (t k )=q si (t k-1 )+η iA (t k )L i1 (t k )-μ iB (t k )L i2 (t k ) In the formula, q si (t k-1 ) is the time t k-1 The length of the i-th queue in the system; L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; L i2 (t k ) is the time t k The length of the demand response service data packet leaving the i-th queue of the system; η iA is time t k The receiving coefficient of the i-th queue; μ iB is time t k The transmission coefficient of the i-th queue; Among them, if time t k The event that occurs is sending the received demand response service data packet to the tail of the i-th queue of the system, then η iA =1; otherwise η iA =0; If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ iB =1; otherwise μ iB =0; Update time t by pressing k The average length q of the i-th queue in the system ai (t k ): q ai (t k )=(1-λ)q ai (t k-1 )+λq si (t k ) In the formula, q ai (t k-1 ) is the time t k-1 The average length of the i-th queue in the system; λ is the queue sensitivity parameter; Update time t by pressing k The total weight of all queues in the system S b (t k ): In the formula, S b (t k-1 ) is the time t k-1 The total weight of all queues in the system; η i (t k ) is the time t k The additive coefficient of the i-th queue in the system; μ i (t k ) is the time t k The reduction coefficient of the i-th queue in the system; ω i (t k ) is the time t k-1 The weight of the i-th queue in the system; n is the total number of queues in the system; Among them, if time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k Previously, there was no demand response service data packet in the i-th queue of the system, then η i (t k )=1; otherwise η i (t k )=0; If time t k The event that occurs is that the demand response service data packet leaves the i-th queue of the system, then μ i (t k )=1; otherwise μ i (t k )=0; Update time t by pressing k System virtual time V(t k ): V(t k )=max(V′(t k ),k 2 ) In the formula, V′(t k ) is the time t k System theory virtual time; k is the number of times event P occurs; Determine the time t by the following formula k System theory virtual time V′(t k ): In the formula, V(t k-1 ) is the time t k-1 System virtual time; Update time t by pressing k The weight of the i-th queue in the system ω i (t k ): when When ω i (t k )=ω i0 ; when When Among them, α ki is time t k The coefficient of the exponential function of the i-th queue in the system; b ki is time t k The service burst rate of the i-th queue in the system; q mi Preset the maximum value for the length of the i-th queue in the system; ω i0 is the initial allocation weight of the i-th queue in the system; The time t is determined as follows: k The coefficient α of the exponential function of the i-th queue of the system ki : In the formula, β ki1 is time t k The first coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; β ki2 Time t k The second coefficient of the influence of the burst rate of the service flow of the i-th queue of the system on the weight; ρ kij is time t k The service load of the jth queue whose service data packet level is higher than the service data packet level of the i-th queue in the system; c is the total number of queues whose service data packet level is higher than the service data packet level of the i-th queue in the system; The time t is determined as follows: k The traffic load of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system ρ kij : In the formula, q sj (t k ) is the time t k The length of the queue whose j-th received service data packet level is higher than the service data packet level accepted by the i-th queue of the system; q mj is time t k The length of the queue whose jth received service data packet level is higher than the service data packet level accepted by the i-th queue of the system is preset to the maximum value; The time t is determined as follows: k The service burst rate b of the i-th queue in the system ki : In the formula, q ai (t k ) is the average length of the i-th queue in the system at the moment; The time t k is the moment when event P occurs for the kth time; the event P is that the received demand response service data packet is sent to the tail of its corresponding queue in the scheduling system and / or the demand response service data packet leaves its corresponding queue.

7. The system according to claim 6, characterized in that The computing module is used for: If time t k The event that occurs is that the received demand response service data packet is sent to the tail of the i-th queue of the system and at time t k If there is no demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of its corresponding queue is If time t k The time when the received demand response service data packet is sent to the tail of the i-th queue of the system and time t k If there is a demand response service data packet in the i-th queue of the system before, the transmission time of the demand response service data packet to the head of the i-th queue of the system is Among them, L i1 (t k ) is the time t k The length of the demand response service data packet sent to the tail of the i-th queue of the system; ω i (t k ) is the time t k The weight of the i-th queue in the system; f it (h-1) is the time t k Before and at time t k The shortest time for the transmission of the demand response service data packet arriving at the i-th queue of the system is the transmission time for the data packet to be transmitted to the head of the i-th queue of the system; L is the length of the data packet; V(t k ) is the tth k The system virtual time at that moment.

8. The system of claim 6, wherein When the dispatch system receives the demand response service data packet for the first time, it also includes: Initialize the scheduling system scheduling parameters.

9. The system according to claim 8, characterized in that The initialization scheduling system scheduling parameters include: Initialize the initial time t0 system virtual time V(t0) = 0, the total weight of all queues in the system S b (t0) = 0, the length of the i-th queue in the system is q si (t0) = 0, the average length of the system queue q ai (t0) = 0, the weight of the i-th queue in the system ω i (t0) = ω i0 , where i∈(1~n), n is the total number of system queues, ω i0 The initial weight assigned to the i-th queue in the system.

10. The system according to claim 6, characterized in that The sending module is used for: The demand response service data packets are graded according to the requirements of the received demand response service data packets for transmission delay and transmission bandwidth, and the demand response service data packets are sent to the tail of the queue corresponding to the level thereof.

Images