CN110445728A - A kind of transmission method of demand response business data packet and scheduling system - Google Patents
A kind of transmission method of demand response business data packet and scheduling system Download PDFInfo
- Publication number
- CN110445728A CN110445728A CN201910555780.9A CN201910555780A CN110445728A CN 110445728 A CN110445728 A CN 110445728A CN 201910555780 A CN201910555780 A CN 201910555780A CN 110445728 A CN110445728 A CN 110445728A
- Authority
- CN
- China
- Prior art keywords
- queue
- moment
- data packet
- demand response
- business data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000004044 response Effects 0.000 title claims abstract description 202
- 230000005540 biological transmission Effects 0.000 title claims abstract description 68
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000012546 transfer Methods 0.000 claims description 14
- 238000005530 etching Methods 0.000 claims description 6
- 230000035945 sensitivity Effects 0.000 claims description 6
- 238000004422 calculation algorithm Methods 0.000 abstract description 7
- 230000006870 function Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 3
- 230000005611 electricity Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/623—Weighted service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/6235—Variable service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/624—Altering the ordering of packets in an individual queue
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of transmission methods of demand response business data packet and scheduling system, comprising: the demand response business data packet received is sent to its tail portion for corresponding to queue；Update scheduling system call parameter；The transmission time that the demand response business data packet is sent to its head for corresponding to queue is calculated based on updated system call parameter；The smallest demand response business data packet of the transmission time is selected to be forwarded in whole queues.Technical solution provided by the invention, the present invention improve dispatching algorithm by setting changeable weight, so that scheduling system efficiently reduces propagation delay time, the packet loss of demand response business while the QoS performance of meet demand response business；And then the reliability and real-time of scheduling system transmission data are promoted, improve the service quality of scheduling system.
Description
Technical field
The present invention relates to electricity needs to respond technical field of communication network, and in particular to a kind of demand response business data packet
Transmission method and scheduling system.
Background technique
With the propulsion of " internet+wisdom energy " and the depth integration of electric information technology, electricity needs responds business
The new missions such as new energy consumption, ancillary service have been also imparted with, and have been faced with the transition from urgent state to normalization.Mesh
Preceding electricity needs response pilot project construction has been that demand response business development has accumulated rich experiences, but future is in demand
In the extensive duplication extension process of response, how while ensureing qos requirement raising demand response business service quality still
So there are some bottlenecks.
Reliability, real-time of demand response communication network etc. are directly related to demand response business large-scale promotion and answer
With, may result in network node when bursty traffic occurs in communication network or congestion occur in link, be likely to influence need
The normal operation for seeking response business, causes service quality to decline, so may safety to power grid, stability cause centainly
Influence.
Data of the current most of existing queue scheduling schemes using static weight without considering dynamic data flow, it is such as prominent
Hair and queue size variation, this will directly reduce reliability, the real-time of demand response communication network.
The transmission method of the demand response communication data packet proposed at present is proposed on the WFQ algorithm structure based on basis
, the propagation delay time of demand response business, packet loss are relatively high, so be badly in need of proposing that one kind can be effectively improved demand and ring
Answer the propagation delay time of business, the transmission method of packet loss situation.
Summary of the invention
In view of the deficiencies of the prior art, the object of the present invention is to provide a kind of transmission sides of demand response business data packet
Method, this method meet demand response business QoS performance while can efficiently reduce demand response business propagation delay time,
Packet loss；And then promote the reliability and real-time of demand response communication network.
The purpose of the present invention is adopt the following technical solutions realization:
The present invention provides a kind of transmission method of demand response business data packet, it is improved in that the method packet
It includes:
The demand response business data packet received is sent to its tail portion for corresponding to queue；
Update scheduling system call parameter；
The demand response business data packet, which is calculated, based on updated system call parameter is sent to its correspondence queue
The transmission time on head；
The smallest demand response business data packet of the transmission time is selected to be forwarded in whole queues.
Preferably, system call parameter is dispatched in the update, comprising:
Renewable time t as the following formulakThe length q of i-th of queue of systemsi(tk):
qsi(tk)=qsi(tk-1)+ηiA(tk)Li1(tk)-μiB(tk)Li2(tk)
In formula, qsi(tk-1) it is moment tk-1The length of i-th of queue of system；Li1(tk) it is moment tkIt is sent to system i-th
The length of the demand response business data packet of the tail portion of a queue；Li2(tk) it is moment tkLeave the demand of i-th of queue of system
Respond the length of business data packet；ηiAFor moment tkThe reception coefficient of i-th of queue；ηiBFor moment tkThe transmission of i-th of queue
Coefficient；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue, then ηiA=1；Otherwise ηiA=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then ηiB=1；Otherwise
ηiB=0；
Renewable time t as the following formulakThe average length q of i-th of queue of systemai(tk):
qai(tk)=(1- λ) qai(tk-1)+λqsi(tk)
In formula, qai(tk-1) it is moment tk-1The average length of i-th of queue of system；λ is queue sensitivity parameter；
Renewable time t as the following formulakTotal weight S of all queues of systemb(tk):
In formula, Sb(tk-1) it is moment tk-1Total weight of all queues of system；ηi(tk) it is moment tkI-th of queue of system
Plus item coefficient；μi(tk) it is moment tkThe deduction item coefficient of i-th of queue of system；ωi(tk) it is moment tk-1I-th of queue of system
Weight；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue and moment tkI-th of queue of system before exists without demand response business data packet, then ηi(tk)=1；Otherwise ηi
(tk)=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then μi(tk)=1；It is no
Then μi(tk)=0；
Renewable time t as the following formulakSystem virtualization time V (tk):
V(tk)=max (V ' (tk),k2)
In formula, V ' (tk) it is moment tkSystems Theory virtual time；
Moment t is determined as the following formulakSystems Theory virtual time V ' (tk):
In formula, V (tk-1) it is moment tk-1The system virtualization time；
Renewable time t as the following formulakThe weights omega of i-th of queue of systemi(tk):
WhenWhen, then ωi(tk)=ωi0；
WhenWhen, then
Wherein, αkiFor moment tkThe coefficient of the exponential function of i-th of queue of system；bkiFor moment tkI-th of queue of system
Business burst rate；qmiFor the length preset maximum value of i-th of queue of system；
The moment t is determined as the following formulakThe factor alpha of the exponential function of i-th of queue of systemki:
In formula, βki1For moment tkFirst system of the service traffics burst rate of i-th of queue of system to weights influence degree
Number；βki2Moment tkSecond coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；ρkijFor moment tk
The business that the business data packet of j-th of receiving is superior to the queue of the business datum package level of i-th of queue of system receiving is negative
Carrying capacity；C is the total of the queue for the business datum package level that the business data packet received is superior to i-th of queue of system receiving
Number；
The moment t is determined as the following formulakJ-th of received business data packet is superior to i-th of queue of system receiving
The business load amount ρ of the queue of business datum package levelkij:
In formula, qsj(tk) it is moment tkJ-th of received business data packet is superior to the industry of i-th of queue of system receiving
The length of the business other queue of packet-level；qmjFor moment tkJ-th of received business data packet is superior to i-th of queue of system
The length preset maximum value of the queue of the business datum package level of receiving；
The moment t is determined as the following formulakThe business burst rate b of i-th of queue of systemki:
In formula, qai(tk) be when i-th of queue of etching system average length；
The moment tkAt the time of generation event P secondary for kth；The event P is the demand that will be received in scheduling system
Response business data packet is sent to its tail portion for corresponding to queue and/or demand response business data packet leaves its corresponding queue.
Further, described to be sent to based on the updated system call parameter calculating demand response business data packet
The transmission time on its head for corresponding to queue, comprising:
If moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before exists without demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on its head for corresponding to queue
If moment tkThe time of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before is with the presence of demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on the head of i-th of queue of system
Wherein, Li1(tk) it is moment tkIt is sent to the length of the demand response business data packet of the tail portion of i-th of queue of system
Degree；ωi(tk) it is moment tkThe weight of i-th of queue of system；fitIt (h-1) is moment tkBefore and with moment tkIt meets shortest
The transmission time that moment reaches the demand response business data packet of i-th of queue of system is sent to the head of i-th of queue of system
The transmission time in portion；L is the length of data packet；V(tk) it is tkThe system virtualization time at a moment.
Preferably, before the demand response business data packet that scheduling system receives for the first time, further includes:
Initialization scheduling system call parameter.
Further, system call parameter is dispatched in the initialization, comprising:
Initialize initial time t0System virtualization time V (t0)=0, all queues of system total weight Sb(t0)=0 is
Unite the length q of i-th of queuesi(t0)=0, system queue average length qai(t0)=0, i-th of queue of system weights omegai
(t0)=ωi0, wherein i ∈ (1~n), n are system queue sum, ωi0For the original allocation weight of i-th of queue of system.
Preferably, the demand response business data packet that will be received is sent to its tail portion for corresponding to queue, comprising:
Requirement according to the demand response business data packet received to transfer delay and transmission bandwidth is by demand response industry
Business data packet is classified, and the demand response business data packet is sent to the tail portion that its place rank corresponds to queue.
The present invention provides a kind of scheduling system, it is improved in that the system comprises:
Sending module: the demand response business data packet for will receive is sent to its tail portion for corresponding to queue；
Update module: for updating scheduling system call parameter；
Computing module: it is sent to for calculating the demand response business data packet based on updated system call parameter
The transmission time on its head for corresponding to queue；
Forwarding module: for selecting the smallest demand response business data packet of the transmission time to carry out in whole queues
Forwarding.
Preferably, the update module, is used for:
Renewable time t as the following formulakThe length q of i-th of queue of systemsi(tk):
qsi(tk)=qsi(tk-1)+ηiA(tk)Li1(tk)-μiB(tk)Li2(tk)
In formula, qsi(tk-1) it is moment tk-1The length of i-th of queue of system；Li1(tk) it is moment tkIt is sent to system i-th
The length of the demand response business data packet of the tail portion of a queue；Li2(tk) it is moment tkLeave the demand of i-th of queue of system
Respond the length of business data packet；ηiAFor moment tkThe reception coefficient of i-th of queue；ηiBFor moment tkThe transmission of i-th of queue
Coefficient；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue, then ηiA=1；Otherwise ηiA=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then ηiB=1；Otherwise
ηiB=0；
Renewable time t as the following formulakThe average length q of i-th of queue of systemai(tk):
qai(tk)=(1- λ) qai(tk-1)+λqsi(tk)
In formula, qai(tk-1) it is moment tk-1The average length of i-th of queue of system；λ is queue sensitivity parameter；
Renewable time t as the following formulakTotal weight S of all queues of systemb(tk):
In formula, Sb(tk-1) it is moment tk-1Total weight of all queues of system；ηi(tk) it is moment tkI-th of queue of system
Plus item coefficient；μi(tk) it is moment tkThe deduction item coefficient of i-th of queue of system；ωi(tk) it is moment tk-1I-th of queue of system
Weight；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue and moment tkI-th of queue of system before exists without demand response business data packet, then ηi(tk)=1；Otherwise ηi
(tk)=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then μi(tk)=1；It is no
Then μi(tk)=0；
Renewable time t as the following formulakSystem virtualization time V (tk):
V(tk)=max (V ' (tk),k2)
In formula, V ' (tk) it is moment tkSystems Theory virtual time；
Moment t is determined as the following formulakSystems Theory virtual time V ' (tk):
In formula, V (tk-1) it is moment tk-1The system virtualization time；
Renewable time t as the following formulakThe weights omega of i-th of queue of systemi(tk):
WhenWhen, then ωi(tk)=ωi0；
WhenWhen, then
Wherein, αkiFor moment tkThe coefficient of the exponential function of i-th of queue of system；bkiFor moment tkI-th of queue of system
Business burst rate；qmiFor the length preset maximum value of i-th of queue of system；
The moment t is determined as the following formulakThe factor alpha of the exponential function of i-th of queue of systemki:
In formula, βki1For moment tkFirst system of the service traffics burst rate of i-th of queue of system to weights influence degree
Number；βki2Moment tkSecond coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；ρkijFor moment tk
The business that the business data packet of j-th of receiving is superior to the queue of the business datum package level of i-th of queue of system receiving is negative
Carrying capacity；C is the total of the queue for the business datum package level that the business data packet received is superior to i-th of queue of system receiving
Number；
The moment t is determined as the following formulakJ-th of received business data packet is superior to i-th of queue of system receiving
The business load amount ρ of the queue of business datum package levelkij:
In formula, qsj(tk) it is moment tkJ-th of received business data packet is superior to the industry of i-th of queue of system receiving
The length of the business other queue of packet-level；qmjFor moment tkJ-th of received business data packet is superior to i-th of queue of system
The length preset maximum value of the queue of the business datum package level of receiving；
The moment t is determined as the following formulakThe business burst rate b of i-th of queue of systemki:
In formula, qai(tk) be when i-th of queue of etching system average length；
The moment tkAt the time of generation event P secondary for kth；The event P is the demand that will be received in scheduling system
Response business data packet is sent to its tail portion for corresponding to queue and/or demand response business data packet leaves its corresponding queue.
Further, the computing module, is used for:
If moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before exists without demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on its head for corresponding to queue
If moment tkThe time of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before is with the presence of demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on the head of i-th of queue of system
Wherein, Li1(tk) it is moment tkIt is sent to the length of the demand response business data packet of the tail portion of i-th of queue of system
Degree；ωi(tk) it is moment tkThe weight of i-th of queue of system；fitIt (h-1) is moment tkBefore and with moment tkIt meets shortest
The transmission time that moment reaches the demand response business data packet of i-th of queue of system is sent to the head of i-th of queue of system
The transmission time in portion；L is the length of data packet；V(tk) it is tkThe system virtualization time at a moment.
Preferably, before the demand response business data packet that scheduling system receives for the first time, further includes:
Initialization scheduling system call parameter.
Further, the initialization module, is used for:
Initialize initial time t0System virtualization time V (t0)=0, all queues of system total weight Sb(t0)=0 is
Unite the length q of i-th of queuesi(t0)=0, system queue average length qai(t0)=0, i-th of queue of system weights omegai
(t0)=ωi0, wherein i ∈ (1~n), n are system queue sum, ωi0For the original allocation weight of i-th of queue of system.
Preferably, the sending module, is used for:
Requirement according to the demand response business data packet received to transfer delay and transmission bandwidth is by demand response industry
Business data packet is classified, and the demand response business data packet is sent to the tail portion that its place rank corresponds to queue.
Compared with the immediate prior art, the invention has the benefit that
The demand response business data packet received is sent to its tail portion for corresponding to queue by technical solution of the present invention, more
New scheduling system call parameter；The demand response business data packet, which is calculated, based on updated system call parameter is sent to it
The transmission time on the head of corresponding queue；The smallest demand response business data packet of the transmission time is selected in whole queues
It is forwarded.The present invention improves dispatching algorithm by setting changeable weight, so that scheduling system is in meet demand response business
Propagation delay time, the packet loss of demand response business are efficiently reduced while QoS performance；And then it promotes scheduling system and transmits data
Reliability and real-time, improve scheduling system service quality.
Detailed description of the invention
Fig. 1 is a kind of transmission method flow chart of demand response business data packet；
Fig. 2 is scheduling system model figure；
Fig. 3 is a kind of scheduling system flow chart.
Specific embodiment
Specific embodiments of the present invention will be described in further detail with reference to the accompanying drawing.
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
All other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
The present invention provides a kind of transmission methods of demand response business data packet, as shown in Figure 1, which comprises
The demand response business data packet received from transmitting terminal is sent to it and corresponds to queue by step 101. scheduling system
Tail portion；
In highly preferred embodiment of the present invention, the network state of real-time monitoring demand response service communication network is needed, with
It obtains individual queue business burst rate, network over loading and the data packet respectively lined up and arrives and departs from situation etc.；
Step 102. dispatches the scheduling parameter in system update scheduling system；
Step 103. dispatches system and is based on the updated system call parameter calculating demand response business data packet biography
It send to it and corresponds to the transmission time on the head of queue；
In most highly preferred embodiment of the invention, will be sent to its correspond to queue head demand response business data packet by
Being inserted into the centering of system minimum transfer time series from small to large according to transmission time, (the smallest data packet of transmission time is in most brief biography
The head of defeated time series pair), scheduling system reads minimum transfer time series centering head demand response business data packet
Location information, and the data packet is forwarded according to the positional information；
The location information of demand response business data packet include: queue number where demand response business data packet and its
Position in queue.
Step 104. scheduling system selects the smallest demand response business data packet of the transmission time in whole queues
It is forwarded to receiving end.
In most highly preferred embodiment of the invention, dispatching algorithm of the invention is changed on the WFQ algorithm structure on basis
Into, the main advantage of improved algorithm (low complex degree dynamic weighting fair queuing scheduling algorithm) is: firstly, being based on industry
The dynamic characteristic for the data traffics such as burst rate and network over loading of being engaged in, proposes a kind of Dynamic Weights scheduling mechanism；Secondly, to simplify
The temporal complexity of system update is dispatched, this parameter of system virtualization time is proposed, sets the triggering update status of system simultaneously
The renewal time of system is obtained by calibration system virtual time generator；It is improved by this two to improve demand response industry
The reliability and real-time of business communication network.
Specifically, the step 102, comprising:
Renewable time t as the following formulakThe length q of i-th of queue of systemsi(tk):
qsi(tk)=qsi(tk-1)+ηiA(tk)Li1(tk)-μiB(tk)Li2(tk)
In formula, qsi(tk-1) it is moment tk-1The length of i-th of queue of system；Li1(tk) it is moment tkIt is sent to system i-th
The length of the demand response business data packet of the tail portion of a queue；Li2(tk) it is moment tkLeave the demand of i-th of queue of system
Respond the length of business data packet；ηiAFor moment tkThe reception coefficient of i-th of queue；ηiBFor moment tkThe transmission of i-th of queue
Coefficient；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue, then ηiA=1；Otherwise ηiA=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then ηiB=1；Otherwise
ηiB=0；
Renewable time t as the following formulakThe average length q of i-th of queue of systemai(tk):
qai(tk)=(1- λ) qai(tk-1)+λqsi(tk)
In formula, qai(tk-1) it is moment tk-1The average length of i-th of queue of system；λ is queue sensitivity parameter；
Renewable time t as the following formulakTotal weight S of all queues of systemb(tk):
In formula, Sb(tk-1) it is moment tk-1Total weight of all queues of system；ηi(tk) it is moment tkI-th of queue of system
Plus item coefficient；μi(tk) it is moment tkThe deduction item coefficient of i-th of queue of system；ωi(tk) it is moment tk-1I-th of queue of system
Weight；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue and moment tkI-th of queue of system before exists without demand response business data packet, then ηi(tk)=1；Otherwise ηi
(tk)=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then μi(tk)=1；It is no
Then μi(tk)=0；
Renewable time t as the following formulakSystem virtualization time V (tk):
V(tk)=max (V ' (tk),k2)
In formula, V ' (tk) it is moment tkSystems Theory virtual time；
Moment t is determined as the following formulakSystems Theory virtual time V ' (tk):
In formula, V (tk-1) it is moment tk-1The system virtualization time；
Renewable time t as the following formulakThe weights omega of i-th of queue of systemi(tk):
WhenWhen, then ωi(tk)=ωi0；
WhenWhen, then
Wherein, αkiFor moment tkThe coefficient of the exponential function of i-th of queue of system；bkiFor moment tkI-th of queue of system
Business burst rate；qmiFor the length preset maximum value of i-th of queue of system；
In most highly preferred embodiment of the invention, queue weight is by queue size, the control of business burst rate and qos requirement
System.
The moment t is determined as the following formulakThe factor alpha of the exponential function of i-th of queue of systemki:
In formula, βki1For moment tkFirst system of the service traffics burst rate of i-th of queue of system to weights influence degree
Number；βki2Moment tkSecond coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；ρkijFor moment tk
The business that the business data packet of j-th of receiving is superior to the queue of the business datum package level of i-th of queue of system receiving is negative
Carrying capacity；C is the total of the queue for the business datum package level that the business data packet received is superior to i-th of queue of system receiving
Number；
In highly preferred embodiment of the present invention, different queue is in same traffic load, αkiMeet following formula:
αk1> αk2> αk3... > αkn
The moment t is determined as the following formulakJ-th of received business data packet is superior to i-th of queue of system receiving
The business load amount ρ of the queue of business datum package levelkij:
In formula, qsj(tk) it is moment tkJ-th of received business data packet is superior to the industry of i-th of queue of system receiving
The length of the business other queue of packet-level；qmjFor moment tkJ-th of received business data packet is superior to i-th of queue of system
The length preset maximum value of the queue of the business datum package level of receiving；
The moment t is determined as the following formulakThe business burst rate b of i-th of queue of systemki:
In formula, qai(tk) be when i-th of queue of etching system average length；
The moment tkAt the time of generation event P secondary for kth；The event P is the demand that will be received in scheduling system
Response business data packet is sent to its tail portion for corresponding to queue and/or demand response business data packet leaves its corresponding queue.
Further, the step 103, comprising:
If moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before exists without demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on its head for corresponding to queue
If moment tkThe time of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before is with the presence of demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on the head of i-th of queue of system
Wherein, Li1(tk) it is moment tkIt is sent to the length of the demand response business data packet of the tail portion of i-th of queue of system
Degree；ωi(tk) it is moment tkThe weight of i-th of queue of system；fitIt (h-1) is moment tkBefore and with moment tkIt meets shortest
The transmission time that moment reaches the demand response business data packet of i-th of queue of system is sent to the head of i-th of queue of system
The transmission time in portion；L is the length of data packet；V(tk) it is tkThe system virtualization time at a moment.
Specifically, before the demand response business data packet that scheduling system receives for the first time, further includes:
Initialization scheduling system call parameter.
Specifically, system call parameter is dispatched in the initialization, comprising:
Initialize initial time t0System virtualization time V (t0)=0, all queues of system total weight Sb(t0)=0 is
Unite the length q of i-th of queuesi(t0)=0, system queue average length qai(t0)=0, i-th of queue of system weights omegai
(t0)=ωi0, wherein i ∈ (1~n), n are system queue sum, ωi0For the original allocation weight of i-th of queue of system.
Specifically, the step 101, comprising:
Requirement according to the demand response business data packet received to transfer delay and transmission bandwidth is by demand response industry
Business data packet is classified, and the demand response business data packet is sent to the tail portion that its place rank corresponds to queue.
In highly preferred embodiment of the present invention, as shown in Fig. 2, scheduling each demand response business data packet clock synchronization of network analysis
Prolong the requirement with broadband, demand response business data packet can be divided into emergent control class data packet (level-one business data packet), held
It measures ancillary service plan class data packet (secondary traffic data packet), interruptible load and direct load and controls class data packet (three-level
Business data packet) and price type demand response class data packet (level Four business data packet)；Wherein, price type demand response class data
Packet can be divided into tou power price demand response business data packet, Spot Price demand response business data packet and Critical Peak Pricing demand
Respond business data packet etc.；It is then sent the demand response business of different stage to by demand response identification technology different
In queue；
If the transfer delay requirement of the demand response business data packet received is no more than 3s and transmission bandwidth requirement is
When not less than 2M, then the demand response business data packet is classified, and according to
For level-one business data packet, and the demand response business data packet is sent to level-one business data packet and corresponds to queue
Tail portion；
If the transfer delay requirement of the demand response business data packet received is no more than 4s and transmission bandwidth requirement is
When no more than 2M, then the demand response business data packet is secondary traffic data packet, and the demand response business data packet is sent out
It send to secondary traffic data packet and corresponds to the tail portion of queue；
If the transfer delay requirement of the demand response business data packet received is no more than 15s and transmission bandwidth requirement is
When no more than 2M, then the demand response business data packet is grade-3 service data packet, and the demand response business data packet is sent out
It send to grade-3 service data packet and corresponds to the tail portion of queue；
If the transfer delay requirement of the demand response business data packet received is no more than 30s and transmission bandwidth requirement is
When no more than 2M, then the demand response business data packet is level Four business data packet, and the demand response business data packet is sent out
It send to level Four business data packet and corresponds to the tail portion of queue.
The present invention provides a kind of scheduling system, as shown in figure 3, the system comprises:
Sending module: the demand response business data packet for will receive is sent to its tail portion for corresponding to queue；
Update module: for updating scheduling system call parameter；
Computing module: it is sent to for calculating the demand response business data packet based on updated system call parameter
The transmission time on its head for corresponding to queue；
Forwarding module: for selecting the smallest demand response business data packet of the transmission time to carry out in whole queues
Forwarding.
Specifically, the update module, is used for:
Renewable time t as the following formulakThe length q of i-th of queue of systemsi(tk):
qsi(tk)=qsi(tk-1)+ηiA(tk)Li1(tk)-μiB(tk)Li2(tk)
In formula, qsi(tk-1) it is moment tk-1The length of i-th of queue of system；Li1(tk) it is moment tkIt is sent to system i-th
The length of the demand response business data packet of the tail portion of a queue；Li2(tk) it is moment tkLeave the demand of i-th of queue of system
Respond the length of business data packet；ηiAFor moment tkThe reception coefficient of i-th of queue；ηiBFor moment tkThe transmission of i-th of queue
Coefficient；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue, then ηiA=1；Otherwise ηiA=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then ηiB=1；Otherwise
ηiB=0；
Renewable time t as the following formulakThe average length q of i-th of queue of systemai(tk):
qai(tk)=(1- λ) qai(tk-1)+λqsi(tk)
In formula, qai(tk-1) it is moment tk-1The average length of i-th of queue of system；λ is queue sensitivity parameter；
Renewable time t as the following formulakTotal weight S of all queues of systemb(tk):
In formula, Sb(tk-1) it is moment tk-1Total weight of all queues of system；ηi(tk) it is moment tkI-th of queue of system
Plus item coefficient；μi(tk) it is moment tkThe deduction item coefficient of i-th of queue of system；ωi(tk) it is moment tk-1I-th of queue of system
Weight；
Wherein, if moment tkThe event of generation is to be sent to the demand response business data packet received i-th of system
The tail portion of queue and moment tkI-th of queue of system before exists without demand response business data packet, then ηi(tk)=1；Otherwise ηi
(tk)=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then μi(tk)=1；It is no
Then μi(tk)=0；
Renewable time t as the following formulakSystem virtualization time V (tk):
V(tk)=max (V ' (tk),k2)
In formula, V ' (tk) it is moment tkSystems Theory virtual time；
Moment t is determined as the following formulakSystems Theory virtual time V ' (tk):
In formula, V (tk-1) it is moment tk-1The system virtualization time；
Renewable time t as the following formulakThe weights omega of i-th of queue of systemi(tk):
WhenWhen, then ωi(tk)=ωi0；
WhenWhen, then
Wherein, αkiFor moment tkThe coefficient of the exponential function of i-th of queue of system；bkiFor moment tkI-th of queue of system
Business burst rate；qmiFor the length preset maximum value of i-th of queue of system；
The moment t is determined as the following formulakThe factor alpha of the exponential function of i-th of queue of systemki:
In formula, βki1For moment tkFirst system of the service traffics burst rate of i-th of queue of system to weights influence degree
Number；βki2Moment tkSecond coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；ρkijFor moment tk
The business that the business data packet of j-th of receiving is superior to the queue of the business datum package level of i-th of queue of system receiving is negative
Carrying capacity；C is the total of the queue for the business datum package level that the business data packet received is superior to i-th of queue of system receiving
Number；
The moment t is determined as the following formulakJ-th of received business data packet is superior to i-th of queue of system receiving
The business load amount ρ of the queue of business datum package levelkij:
In formula, qsj(tk) it is moment tkJ-th of received business data packet is superior to the industry of i-th of queue of system receiving
The length of the business other queue of packet-level；qmjFor moment tkJ-th of received business data packet is superior to i-th of queue of system
The length preset maximum value of the queue of the business datum package level of receiving；
The moment t is determined as the following formulakThe business burst rate b of i-th of queue of systemki:
In formula, qai(tk) be when i-th of queue of etching system average length；
The moment tkAt the time of generation event P secondary for kth；The event P is the demand that will be received in scheduling system
Response business data packet is sent to its tail portion for corresponding to queue and/or demand response business data packet leaves its corresponding queue.
Specifically, the computing module, is used for:
If moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before exists without demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on its head for corresponding to queue
If moment tkThe time of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before is with the presence of demand response business data packet, then the demand response business datum
Packet is sent to the transmission time on the head of i-th of queue of system
Wherein, Li1(tk) it is moment tkIt is sent to the length of the demand response business data packet of the tail portion of i-th of queue of system
Degree；ωi(tk) it is moment tkThe weight of i-th of queue of system；fitIt (h-1) is moment tkBefore and with moment tkIt meets shortest
The transmission time that moment reaches the demand response business data packet of i-th of queue of system is sent to the head of i-th of queue of system
The transmission time in portion；L is the length of data packet；V(tk) it is tkThe system virtualization time at a moment.
Specifically, before the demand response business data packet that scheduling system receives for the first time, further includes:
Initialization scheduling system call parameter.
Specifically, the initialization module, is used for:
Initialize initial time t0System virtualization time V (t0)=0, all queues of system total weight Sb(t0)=0 is
Unite the length q of i-th of queuesi(t0)=0, system queue average length qai(t0)=0, i-th of queue of system weights omegai
(t0)=ωi0, wherein i ∈ (1~n), n are system queue sum, ωi0For the original allocation weight of i-th of queue of system.
Specifically, the sending module, is used for:
Requirement according to the demand response business data packet received to transfer delay and transmission bandwidth is by demand response industry
Business data packet is classified, and the demand response business data packet is sent to the tail portion that its place rank corresponds to queue.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application is referring to method, the process of equipment (system) and computer program product according to the embodiment of the present application
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Finally it should be noted that: the above embodiments are merely illustrative of the technical scheme of the present invention and are not intended to be limiting thereof, to the greatest extent
Invention is explained in detail referring to above-described embodiment for pipe, it should be understood by those ordinary skilled in the art that: still
It can be with modifications or equivalent substitutions are made to specific embodiments of the invention, and without departing from any of spirit and scope of the invention
Modification or equivalent replacement, should all cover within the scope of the claims of the present invention.
Claims (12)
1. a kind of transmission method of demand response business data packet, which is characterized in that the described method includes:
The demand response business data packet received is sent to its tail portion for corresponding to queue；
Update scheduling system call parameter；
The demand response business data packet, which is calculated, based on updated system call parameter is sent to its head for corresponding to queue
Transmission time；
The smallest demand response business data packet of the transmission time is selected to be forwarded in whole queues.
2. the method as described in claim 1, which is characterized in that system call parameter is dispatched in the update, comprising:
Renewable time t as the following formulakThe length q of i-th of queue of systemsi(tk):
qsi(tk)=qsi(tk-1)+ηiA(tk)Li1(tk)-μiB(tk)Li2(tk)
In formula, qsi(tk-1) it is moment tk-1The length of i-th of queue of system；Li1(tk) it is moment tkIt is sent to i-th of team of system
The length of the demand response business data packet of the tail portion of column；Li2(tk) it is moment tkLeave the demand response of i-th of queue of system
The length of business data packet；ηiAFor moment tkThe reception coefficient of i-th of queue；ηiBFor moment tkThe transfer ratio of i-th of queue；
Wherein, if moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion, then ηiA=1；Otherwise ηiA=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then ηiB=1；Otherwise ηiB=
0；
Renewable time t as the following formulakThe average length q of i-th of queue of systemai(tk):
qai(tk)=(1- λ) qai(tk-1)+λqsi(tk)
In formula, qai(tk-1) it is moment tk-1The average length of i-th of queue of system；λ is queue sensitivity parameter；
Renewable time t as the following formulakTotal weight S of all queues of systemb(tk):
In formula, Sb(tk-1) it is moment tk-1Total weight of all queues of system；ηi(tk) it is moment tkThe plus item of i-th of queue of system
Coefficient；μi(tk) it is moment tkThe deduction item coefficient of i-th of queue of system；ωi(tk) it is moment tk-1The weight of i-th of queue of system；
N is system queue sum；
Wherein, if moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before exists without demand response business data packet, then ηi(tk)=1；Otherwise ηi(tk)=
0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then μi(tk)=1；Otherwise μi
(tk)=0；
Renewable time t as the following formulakSystem virtualization time V (tk):
V(tk)=max (V ' (tk),k2)
In formula, V ' (tk) it is moment tkSystems Theory virtual time；K is the number that event P occurs；
Moment t is determined as the following formulakSystems Theory virtual time V ' (tk):
In formula, V (tk-1) it is moment tk-1The system virtualization time；
Renewable time t as the following formulakThe weights omega of i-th of queue of systemi(tk):
WhenWhen, then ωi(tk)=ωi0；
WhenWhen, then
Wherein, αkiFor moment tkThe coefficient of the exponential function of i-th of queue of system；bkiFor moment tkThe industry of i-th of queue of system
Business burst rate；qmiFor the length preset maximum value of i-th of queue of system；ωi0For the original allocation weight of i-th of queue of system；
The moment t is determined as the following formulakThe factor alpha of the exponential function of i-th of queue of systemki:
In formula, βki1For moment tkFirst coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；βki2
Moment tkSecond coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；ρkijFor moment tkIt connects for j-th
The business data packet received is superior to the business load amount of the queue of the business datum package level of i-th of queue of system receiving；C is
The business data packet of receiving is superior to the sum of the queue of the business datum package level of i-th of queue of system receiving；
The moment t is determined as the following formulakJ-th of received business data packet is superior to the business number of i-th of queue of system receiving
According to the business load amount ρ of the queue of package levelkij:
In formula, qsj(tk) it is moment tkJ-th of received business data packet is superior to the business number of i-th of queue of system receiving
According to the length of the queue of package level；qmjFor moment tkJ-th of received business data packet is superior to i-th of queue of system receiving
Business datum package level queue length preset maximum value；
The moment t is determined as the following formulakThe business burst rate b of i-th of queue of systemki:
In formula, qai(tk) be when i-th of queue of etching system average length；
The moment tkAt the time of generation event P secondary for kth；The event P is the demand response industry that will be received in scheduling system
Business data packet is sent to its tail portion for corresponding to queue and/or demand response business data packet leaves its corresponding queue.
3. method according to claim 2, which is characterized in that described to calculate the need based on updated system call parameter
Response business data packet is asked to be sent to the transmission time on its head for corresponding to queue, comprising:
If moment tkThe event of generation is that the demand response business data packet received is sent to the tail portion of i-th of queue of system
And moment tkI-th of queue of system before exists without demand response business data packet, then the demand response business data packet passes
It send to it and corresponds to the transmission time on the head of queue
If moment tkThe time of generation is the tail portion that the demand response business data packet received is sent to i-th of queue of system
And moment tkI-th of queue of system before is with the presence of demand response business data packet, then the demand response business data packet passes
It send to the transmission time on the head of i-th of queue of system
Wherein, Li1(tk) it is moment tkIt is sent to the length of the demand response business data packet of the tail portion of i-th of queue of system；ωi
(tk) it is moment tkThe weight of i-th of queue of system；fitIt (h-1) is moment tkBefore and with moment tkShortest moment of meeting arrives
Up to the demand response business data packet of i-th of queue of system transmission time be sent to i-th of queue of system head biography
The defeated time；L is the length of data packet；V(tk) it is tkThe system virtualization time at a moment.
4. the method as described in claim 1, which is characterized in that when the demand response business datum that scheduling system receives for the first time
Before packet, further includes:
Initialization scheduling system call parameter.
5. method as claimed in claim 4, which is characterized in that system call parameter is dispatched in the initialization, comprising:
Initialize initial time t0System virtualization time V (t0)=0, all queues of system total weight Sb(t0)=0, system i-th
The length q of a queuesi(t0)=0, system queue average length qai(t0)=0, i-th of queue of system weights omegai(t0)=
ωi0, wherein i ∈ (1~n), n are system queue sum, ωi0For the original allocation weight of i-th of queue of system.
6. the method as described in claim 1, which is characterized in that the demand response business data packet that will be received is sent to
Its tail portion for corresponding to queue, comprising:
Requirement according to the demand response business data packet received to transfer delay and transmission bandwidth is by demand response business number
It is classified according to packet, and the demand response business data packet is sent to the tail portion that its place rank corresponds to queue.
7. a kind of scheduling system, which is characterized in that the system comprises:
Sending module: the demand response business data packet for will receive is sent to its tail portion for corresponding to queue；
Update module: for updating scheduling system call parameter；
Computing module: right for being sent to its based on the updated system call parameter calculating demand response business data packet
Answer the transmission time on the head of queue；
Forwarding module: for selecting the smallest demand response business data packet of the transmission time to be turned in whole queues
Hair.
8. system as claimed in claim 7, which is characterized in that the update module is used for:
Renewable time t as the following formulakThe length q of i-th of queue of systemsi(tk):
qsi(tk)=qsi(tk-1)+ηiA(tk)Li1(tk)-μiB(tk)Li2(tk)
In formula, qsi(tk-1) it is moment tk-1The length of i-th of queue of system；Li1(tk) it is moment tkIt is sent to i-th of team of system
The length of the demand response business data packet of the tail portion of column；Li2(tk) it is moment tkLeave the demand response of i-th of queue of system
The length of business data packet；ηiAFor moment tkThe reception coefficient of i-th of queue；ηiBFor moment tkThe transfer ratio of i-th of queue；
Wherein, if moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion, then ηiA=1；Otherwise ηiA=0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then ηiB=1；Otherwise ηiB=
0；
Renewable time t as the following formulakThe average length q of i-th of queue of systemai(tk):
qai(tk)=(1- λ) qai(tk-1)+λqsi(tk)
In formula, qai(tk-1) it is moment tk-1The average length of i-th of queue of system；λ is queue sensitivity parameter；
Renewable time t as the following formulakTotal weight S of all queues of systemb(tk):
In formula, Sb(tk-1) it is moment tk-1Total weight of all queues of system；ηi(tk) it is moment tkThe plus item of i-th of queue of system
Coefficient；μi(tk) it is moment tkThe deduction item coefficient of i-th of queue of system；ωi(tk) it is moment tk-1The weight of i-th of queue of system；
N is system queue sum；
Wherein, if moment tkThe event of generation is that the demand response business data packet received is sent to i-th of queue of system
Tail portion and moment tkI-th of queue of system before exists without demand response business data packet, then ηi(tk)=1；Otherwise ηi(tk)=
0；
If moment tkThe event of generation is that demand response business data packet leaves i-th of queue of system, then μi(tk)=1；Otherwise μi
(tk)=0；
Renewable time t as the following formulakSystem virtualization time V (tk):
V(tk)=max (V ' (tk),k2)
In formula, V ' (tk) it is moment tkSystems Theory virtual time；
Moment t is determined as the following formulakSystems Theory virtual time V ' (tk):
In formula, V (tk-1) it is moment tk-1The system virtualization time；
Renewable time t as the following formulakThe weights omega of i-th of queue of systemi(tk):
WhenWhen, then ωi(tk)=ωi0；
WhenWhen, then
Wherein, αkiFor moment tkThe coefficient of the exponential function of i-th of queue of system；bkiFor moment tkThe industry of i-th of queue of system
Business burst rate；qmiFor the length preset maximum value of i-th of queue of system；ωi0For the original allocation weight of i-th of queue of system；
The moment t is determined as the following formulakThe factor alpha of the exponential function of i-th of queue of systemki:
In formula, βki1For moment tkFirst coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；βki2
Moment tkSecond coefficient of the service traffics burst rate of i-th of queue of system to weights influence degree；ρkijFor moment tkIt connects for j-th
The business data packet received is superior to the business load amount of the queue of the business datum package level of i-th of queue of system receiving；C is
The business data packet of receiving is superior to the sum of the queue of the business datum package level of i-th of queue of system receiving；
The moment t is determined as the following formulakJ-th of received business data packet is superior to the business number of i-th of queue of system receiving
According to the business load amount ρ of the queue of package levelkij:
In formula, qsj(tk) it is moment tkJ-th of received business data packet is superior to the business number of i-th of queue of system receiving
According to the length of the queue of package level；qmjFor moment tkJ-th of received business data packet is superior to i-th of queue of system receiving
Business datum package level queue length preset maximum value；
The moment t is determined as the following formulakThe business burst rate b of i-th of queue of systemki:
In formula, qai(tk) be when i-th of queue of etching system average length；
The moment tkAt the time of generation event P secondary for kth；The event P is the demand response industry that will be received in scheduling system
Business data packet is sent to its tail portion for corresponding to queue and/or demand response business data packet leaves its corresponding queue.
9. system as claimed in claim 8, which is characterized in that the computing module is used for:
If moment tkThe event of generation is that the demand response business data packet received is sent to the tail portion of i-th of queue of system
And moment tkI-th of queue of system before exists without demand response business data packet, then the demand response business data packet passes
It send to it and corresponds to the transmission time on the head of queue
If moment tkThe time of generation is the tail portion that the demand response business data packet received is sent to i-th of queue of system
And moment tkI-th of queue of system before is with the presence of demand response business data packet, then the demand response business data packet passes
It send to the transmission time on the head of i-th of queue of system
Wherein, Li1(tk) it is moment tkIt is sent to the length of the demand response business data packet of the tail portion of i-th of queue of system；ωi
(tk) it is moment tkThe weight of i-th of queue of system；fitIt (h-1) is moment tkBefore and with moment tkShortest moment of meeting arrives
Up to the demand response business data packet of i-th of queue of system transmission time be sent to i-th of queue of system head biography
The defeated time；L is the length of data packet；V(tk) it is tkThe system virtualization time at a moment.
10. system as claimed in claim 7, it is characterised in that when the demand response business datum that scheduling system receives for the first time
Before packet, further includes:
Initialization scheduling system call parameter.
11. system as claimed in claim 10, which is characterized in that the initialization module is used for:
Initialize initial time t0System virtualization time V (t0)=0, all queues of system total weight Sb(t0)=0, system i-th
The length q of a queuesi(t0)=0、The average length q of system queueai(t0)=0、SystemiThe weights omega of a queuei(t0)=
ωi0, wherein i ∈ (1~n), n are system queue sum, ωi0For the original allocation weight of i-th of queue of system.
12. system as claimed in claim 7, which is characterized in that the sending module is used for:
Requirement according to the demand response business data packet received to transfer delay and transmission bandwidth is by demand response business number
It is classified according to packet, and the demand response business data packet is sent to the tail portion that its place rank corresponds to queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910555780.9A CN110445728A (en) | 2019-06-25 | 2019-06-25 | A kind of transmission method of demand response business data packet and scheduling system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910555780.9A CN110445728A (en) | 2019-06-25 | 2019-06-25 | A kind of transmission method of demand response business data packet and scheduling system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110445728A true CN110445728A (en) | 2019-11-12 |
Family
ID=68428255
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910555780.9A Pending CN110445728A (en) | 2019-06-25 | 2019-06-25 | A kind of transmission method of demand response business data packet and scheduling system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110445728A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102326369A (en) * | 2011-08-04 | 2012-01-18 | 华为技术有限公司 | Queue scheduling method and apparatus |
| US20120327778A1 (en) * | 2011-06-22 | 2012-12-27 | Cygnus Broadband, Inc. | Systems and methods for prioritizing and scheduling packets in a communication network |
| CN104079501A (en) * | 2014-06-05 | 2014-10-01 | 深圳市邦彦信息技术有限公司 | Queue scheduling method based on multiple priorities |
| CN108768888A (en) * | 2018-04-20 | 2018-11-06 | 北京国电通网络技术有限公司 | A kind of array dispatching method of electric system quantum cryptography business |
| CN109905330A (en) * | 2019-03-22 | 2019-06-18 | 西南交通大学 | A kind of dynamic weighting Fair Queue train network dispatching method based on queue length |
-
2019
- 2019-06-25 CN CN201910555780.9A patent/CN110445728A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120327778A1 (en) * | 2011-06-22 | 2012-12-27 | Cygnus Broadband, Inc. | Systems and methods for prioritizing and scheduling packets in a communication network |
| CN102326369A (en) * | 2011-08-04 | 2012-01-18 | 华为技术有限公司 | Queue scheduling method and apparatus |
| CN104079501A (en) * | 2014-06-05 | 2014-10-01 | 深圳市邦彦信息技术有限公司 | Queue scheduling method based on multiple priorities |
| CN108768888A (en) * | 2018-04-20 | 2018-11-06 | 北京国电通网络技术有限公司 | A kind of array dispatching method of electric system quantum cryptography business |
| CN109905330A (en) * | 2019-03-22 | 2019-06-18 | 西南交通大学 | A kind of dynamic weighting Fair Queue train network dispatching method based on queue length |
Non-Patent Citations (1)
| Title |
|---|
| 翁春荣;: "权重优化的WFQ算法分析", 青岛大学学报(自然科学版), no. 01, 15 February 2018 (2018-02-15), pages 115 - 119 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103294521B (en) | A kind of method reducing data center's traffic load and energy consumption | |
| CN108076158B (en) | Minimum load route selection method and system based on naive Bayes classifier | |
| CN111682891B (en) | Virtual network mapping method for high dynamic satellite network | |
| CN108566659A (en) | A kind of online mapping method of 5G networks slice based on reliability | |
| CN101729386B (en) | Flow control method and device based on token scheduling | |
| CN103346922A (en) | Controller for determining network state based on SDN (Software Defined Networking) and determination method thereof | |
| CN108965014A (en) | The service chaining backup method and system of QoS perception | |
| CN105242956A (en) | Virtual function service chain deployment system and deployment method therefor | |
| CN112350949B (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| CN114567598A (en) | Load balancing method and device based on deep learning and cross-domain cooperation | |
| CN105871745A (en) | Mixed-service-based dispatching method in SDN network | |
| CN113810205A (en) | Method for reporting and receiving service computing power information, server and data center gateway | |
| EP4024212A1 (en) | Method for scheduling interference workloads on edge network resources | |
| WO2024092993A1 (en) | Service function chain profit maximization mapping method and system | |
| CN102404213A (en) | Method and system for cache management of message | |
| CN110247859B (en) | Data sending method and device based on AIRT-ROS node | |
| CN112005528A (en) | Data exchange method, data exchange node and data center network | |
| CN106209683B (en) | Data transmission method and system based on data center's wide area network | |
| Meng et al. | Intelligent routing orchestration for ultra-low latency transport networks | |
| CN110445728A (en) | A kind of transmission method of demand response business data packet and scheduling system | |
| Zhang et al. | Vehicular multi-slice optimization in 5G: Dynamic preference policy using reinforcement learning | |
| CN110677301A (en) | Software defined transmission control method for single controller with multiple switches in 5G network | |
| CN103259723A (en) | Energy conservation method based on combination of data center network routing and flow preemptive scheduling | |
| CN115208765A (en) | Slice arranging method and system for power business | |
| CN115543582A (en) | Method, system and equipment for unified scheduling of super computing power network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |