CN105915468A - Service scheduling method and device - Google Patents
Service scheduling method and device Download PDFInfo
- Publication number
- CN105915468A CN105915468A CN201610437207.4A CN201610437207A CN105915468A CN 105915468 A CN105915468 A CN 105915468A CN 201610437207 A CN201610437207 A CN 201610437207A CN 105915468 A CN105915468 A CN 105915468A
- Authority
- CN
- China
- Prior art keywords
- length
- queue
- service queue
- team
- described service
- 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.)
- Granted
Links
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/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2416—Real-time traffic
-
- 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
-
- 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/6265—Queue scheduling characterised by scheduling criteria for service slots or service orders past bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The embodiment of the invention discloses a service scheduling method and device. Whether the length of a queue head packet is not greater than a deficit counter preset for a service queue or not is judged; whether the length of the queue satisfies the time delay priority condition of the service queue or not is judged if the length is not greater than the deficit counter; the queue head packet is sent if the length of the queue satisfies the time delay priority condition; whether a cycle counter is not smaller than a preset threshold value of the service queue or not is judged if the length of the queue does not satisfy the time delay priority condition; the queue head packet is sent if the cycle counter is not smaller than the preset threshold value; the cycle counter is initialized after the queue head packet is sent; the deficit counter of the service queue is updated; round robin is carried out on a next service queue; when the length of the queue head packet is greater than the deficit counter preset for the service queue or the cycle counter is smaller than the preset threshold value, the cycle counter of the service queue is updated; the deficit counter of the service queue is updated; and round robin is carried out on the next service queue. According to the method and the device, both fairness and time delay are taken into consideration.
Description
Technical field
The present invention relates to communication technical field, particularly to dispatching method and the device of a kind of business.
Background technology
In network communication technology field, grouping scheduling method is one of the most of paramount importance research direction, also
It is to ensure that one of important method of various different business service quality.Grouping scheduling method be commonly used to due to
Resource contention and needing waits in line the scene of scheduling, is to solve multiple service competitions to share having of resource problem
Effect means.Concrete, dispatching method mainly solves in the case of bandwidth chahnel is limited, advises with which type of
Then arrange the transmission sequence that each Business Stream is grouped, so that it is guaranteed that the service quality of these Business Streams, Yi Jitong
The high usage of road bandwidth.In prior art, grouping scheduling method numerous studies are carried out, it was also proposed that very
Many grouping scheduling methods.Existing grouping scheduling method includes dispatching method based on priority, based on poll
Several classes such as dispatching method, dispatching method based on GPS model and dispatching method based on time delay, wherein,
Dispatching method based on poll realizes simple, so being widely used in network communications because of it.Based on
The basic thought of the method for poll is that the scheduler queue cyclically to each Business Stream services in turn
Packet in transmit queue.
Difference poll (Deficit Round Robin, DRR) dispatching method is conventional a kind of polling dispatching side
Method, the method is that each service queue is provided with a bandwidth quota, and arranges a balance counter, its
Middle bandwidth is rated for corresponding service queue and often takes turns the service words joint number of acquisition, for often taking turns permission in balance counter
The byte number sent.In polling procedure, if team's head block length of the service queue being polled to is not more than
The balance counter that this service queue is corresponding, just i.e. sends this team's head packet for this queue service；Simultaneously
The value of balance counter needs to cut the length value of this packet；Whereas if the service queue being polled to is wanted
The balance counter that the block length sent is corresponding more than this queue, then epicycle is not this queue service；The most more
New balance counter is bandwidth quota and the epicycle balance counter sum of this service queue, then, under poll
One service queue.This dispatching method can be avoided being used the packet of different length to draw by different business queue
The unfairness risen, but, delay character is bad.
Summary of the invention
The purpose of the embodiment of the present invention is to provide dispatching method and the device of a kind of business, so that in scheduling office
Ductility and fairness when taking into account when managing the packet of different business stream.
For reaching above-mentioned purpose, the embodiment of the invention discloses dispatching method and the device of a kind of business.Technology
Scheme is as follows:
First aspect, the dispatching method of a kind of business, described method includes:
For the service queue of the non-NULL being polled to, obtain queue length and team's head packet of described service queue
Length；
Judge whether the length of described team head packet is not more than the difference counting arranged in advance for described service queue
Device；
If it is not greater, judge whether described queue length meets the Delay Priority condition of described service queue,
If it is satisfied, send the head packet of described team；If be unsatisfactory for, it is judged that be that described service queue is arranged in advance
Whether cycle counter is not less than the predetermined threshold value of described service queue, if it is not, send described team head
Packet；
After sending the head packet of described team, initialize the cycle counter of described service queue, according to described business
The queue length of queue determines renewal step-length, with institute with the relative size of the length of the described team head packet of transmission
State the balance counter updating the step-length described service queue of renewal, next service queue of poll；
In the length of described team head packet more than be the balance counter of described service queue setting in advance, or,
Described cycle counter, less than in the case of described predetermined threshold value, updates described service queue in the way of increasing
Cycle counter；Bandwidth quota with described service queue updates the balance counter of described service queue；
Next service queue of poll.
Preferably, the described Delay Priority condition judging whether described queue length meets described service queue,
Including:
Judge whether described queue length is not less than the queue thresholds of described service queue, if it is not, table
Show that described queue length meets the Delay Priority condition of described service queue；If it is lower, represent described team
Row length is unsatisfactory for the Delay Priority condition of described service queue；Wherein, described queue thresholds is according to institute
The relative size having service queue delay requirement is preset.
Preferably, the predetermined threshold value of described service queue is bandwidth quota and the largest packet of described service queue
The ratio of length.
Preferably, described relative with the length of the described team head packet of transmission according to described service queue length
Size determines renewal step-length, including:
When the length of the described team head packet sent is equal with described service queue length, determine the institute of transmission
State a length of renewal step-length of team's head packet；
When the length of the described team head packet sent is unequal with described service queue length, determine transmission
The length of described team head packet is renewal step-length with the difference of the bandwidth quota of described service queue.
Preferably, when described service queue is non-NULL by space-variant, initialize described balance counter, wherein,
The initial value of described balance counter is the bandwidth quota sum of maximum packet and described service queue.
Second aspect, the dispatching device of a kind of business, it is characterised in that described device includes:
Acquisition module, for the service queue for the non-NULL being polled to, obtains the queue of described service queue
Length and the length of team's head packet；
First judge module, for judging whether the length of described team head packet is not more than in advance for described business
The balance counter that queue is arranged；
Second judge module, the judged result for described first judge module be no more than time, it is judged that described
Whether queue length meets the Delay Priority condition of described service queue；
3rd judge module, for the judged result of described second judge module for being unsatisfactory for time, it is judged that in advance
Whether the cycle counter arranged for described service queue is not less than the predetermined threshold value of described service queue；
Sending module, for the judged result of described second judge module for meeting time, or the described 3rd judge
The judged result of module be not less than time, send the packet of described team head；
Balance counter first more new module, after sending module sends the head packet of described team, initializes institute
State the cycle counter of service queue, divide with the described team head of transmission according to the queue length of described service queue
The relative size of the length of group determines renewal step-length, updates the difference of described service queue with described renewal step-length
Enumerator；
Balance counter second more new module, for the judged result at described first judge module for being more than,
Or in the case of the judged result of described 3rd judge module is for being less than, in the way of increasing, update described business
The cycle counter of queue；The difference counting of described service queue is updated with the bandwidth quota of described service queue
Device；
Poller module, for next service queue of poll.
Preferably, described second judge module, specifically for:
Judge whether described queue length is not less than the queue thresholds of described service queue, if it is not, table
Show that described queue length meets the Delay Priority condition of described service queue；If it is lower, represent described team
Row length is unsatisfactory for the Delay Priority condition of described service queue；Wherein, described queue thresholds is according to institute
The relative size having service queue delay requirement is preset.
Preferably, the predetermined threshold value of described service queue is bandwidth quota and the largest packet of described service queue
The ratio of length.
Preferably, described balance counter first more new module, including:
First determines unit, for the length being grouped when the described team head sent and described service queue length phase
Deng time, determine a length of renewal step-length of the described team head packet of transmission；
Second determines unit, for the length when the described team head packet sent with described service queue length not
Time equal, determine that the length of described team head packet of transmission with the difference of the bandwidth quota of described service queue is
Update step-length.
Preferably, described device also includes:
Initialization module, for when described service queue is non-NULL by space-variant, initializes described difference counting
Device, wherein, the initial value of described balance counter is that the bandwidth of maximum packet and described service queue is fixed
Volume sum.
The dispatching method of a kind of business that the present invention proposes and device, relative to difference poll in prior art
(Deficit Round Robin, DRR) dispatching method, adds Delay Priority condition, Delay Priority
Service queue that the setting of condition makes low time delay require is the most excellent to be served before, so that meeting business team
The delay requirement of row.For being unsatisfactory for Delay Priority condition, further according to judging to set as service queue in advance
Whether the cycle counter put determines whether to send out more than or equal to the judged result of the predetermined threshold value of this service queue
Send team's head packet, if not sending, cycle counter can be updated, so arrange and can ensure that service queue
Team's head packet time arbitrarily all can be sent after certain wrap count, thus guarantee will not be because of length
Time is not serviced and is produced the phenomenons such as packet loss, to ensure the fairness between service queue.Therefore, above-mentioned side
Ductility and fairness when method can be taken into account when processing the packet of different business stream.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to enforcement
In example or description of the prior art, the required accompanying drawing used is briefly described, it should be apparent that, describe below
In accompanying drawing be only some embodiments of the present invention, for those of ordinary skill in the art, do not paying
On the premise of going out creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
A kind of packet scheduling model schematic that Fig. 1 is used by the embodiment of the present invention；
The schematic flow sheet of the dispatching method of a kind of business that Fig. 2 provides for the embodiment of the present invention；
The structural representation of the dispatching device of a kind of business that Fig. 3 provides for the embodiment of the present invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clearly
Chu, be fully described by, it is clear that described embodiment be only a part of embodiment of the present invention rather than
Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creation
The every other embodiment obtained under property work premise, broadly falls into the scope of protection of the invention.
As it is shown in figure 1, be a kind of packet scheduling model shown in Fig. 1, it is commonly applied in the network equipment, as
Switch, router etc., wherein, the service queue used is FIFO (FIFO) queue, permissible
It is that a class business shares a service queue, it is also possible to be per-flow service queue.
During specific works, traffic packets arrives grader, will packet according to the classifying rules preset by grader
Corresponding service queue is put into after classification.For data link layer, conventional classifying rules is according to IEEE
The standard definition of 802.1Q and IEEE 802.1P.Service defined in the VLAN tag of the frame head of 802.1Q
Classification (CoS) field, 802.1P defines the priority mechanism of business.For Internet, international mutual
Differentiated Services (DiffServ) model that networking project task groups (IETF) is formulated has redefined IPv4 report
COS (ToS) field (the TC territory in IPv6 head) of head, and the most named DS field, for
Each type service specifies type code DiffSer code point (DSCP), fills in this field.Generally
In the case of, different types of service such as video traffic, audio service, route test business, network management etc.,
CoS value or DSCP value have certain mapping relations.Such as, the CoS value of real time audio traffic is 5, DSCP
Value is 46.Packet can be classified by grader according to CoS value or DSCP value.For per-flow team
The situation of row, grader can be according to source address, destination address, protocol type, source port, destination interface
Determine which business packet belongs to Deng five-tuple, and put it into corresponding service queue.
For a kind of packet scheduling model shown in Fig. 1, service queue is polled, and then carries out business
Scheduling, the most first illustrates the dispatching method of a kind of business that the embodiment of the present invention provides.
As in figure 2 it is shown, the schematic flow sheet of the dispatching method of a kind of business that Fig. 2 provides for the embodiment of the present invention,
The method is mainly used in scheduler, and the method includes:
S101, service queue for the non-NULL being polled to, obtain queue length and team's head of this service queue
The length of packet；
When there being packet to arrive, grader is classified according to the principle of classification preset, and packet is put into correspondence
Service queue.
When scheduler polls to a certain service queue, can by obtaining the queue length of corresponding service queue,
Judge whether this service queue is empty service queue with this, it is of course also possible to obtain by other means
Know whether this service queue is empty service queue, such as, obtained by the communication with grader.If
It is empty service queue, directly skips, continue next service queue of poll；If not empty service queue,
Then proceed by step S101.
Here team's head packet, the packet of the team's head being in this service queue, is also this service queue quilt
During polling dispatching, the packet preferentially sent.
S102, judge whether the length of this team head packet is not more than beat-frequency meter for the setting of this service queue the most in advance
Number device；If it is not greater, perform step S103；If it does, perform step S107.
The balance counter of this service queue, in this poll, when servicing this service queue, it is allowed to send
Max number of characters.If the length of team's head packet is more than the balance counter arranged for this service queue in advance,
This poll, will not send team's head packet of this service queue, i.e. this poll does not service this service queue.
S103, judge whether this queue length meets the Delay Priority condition of this service queue；If it is satisfied,
Perform step S105；If be unsatisfactory for, perform step S104；
Here Delay Priority condition is that the delay requirement according to service queue is arranged.
Specifically, it is judged that whether this queue length meets the Delay Priority condition of this service queue, including:
Judge whether this queue length is more than the queue thresholds of this service queue, if it is, represent that this queue is long
Degree meets the Delay Priority condition of this service queue；If it does not, represent that this queue length is unsatisfactory for this business
The Delay Priority condition of queue；Wherein, this queue thresholds is the phase according to all service queue delay requirement
Size is preset.According to the requirement of real-time of each service queue, the queue threshold of each service queue is set
Value, such as, if there being the service queue of 3 non-NULLs, comparatively speaking, the time delay of second service queue requirement is little,
The time delay of first service queue requirement is taken second place, and the 3rd service queue is without special delay requirement, the most permissible
The queue thresholds queue thresholds less than first service queue of second service queue, the 3rd business are set
The maximum that the queue thresholds of queue can be arranged.So arrange, in the case of not considering other factors, the
Two service queues are maximum by the probability of Priority Service, and first service queue is by the probability of Priority Service
Taking second place, the 3rd service queue is minimum by the probability of Priority Service.
S104, judge that the cycle counter arranged as this service queue in advance is whether not less than this service queue
Predetermined threshold value, if it is not, perform step S105；If it is lower, perform step S107.
Here cycle counter is used to record current team's head packet of this service queue and is in after team's head not
Sent, the wrap count experienced.
In this step, the predetermined threshold value of this service queue is the ratio of bandwidth quota and maximum packet, its
In, the bandwidth of this service queue is rated for this service queue and often takes turns the service words joint number of acquisition.
S105, send head packet of this team, perform step S106；
Send this team's head packet, i.e. this service queue obtains service.
S106, initialize the cycle counter of this service queue, according to the queue length of this service queue with send out
The relative size of the length of this team's head packet sent determines renewal step-length, updates this business team with this renewal step-length
The balance counter of row；
After this team's head packet is sent, need to initialize the cycle counter of this service queue, with record again,
It is currently entering the packet wrap count by experience of team's head.
In the present embodiment, true with the relative size of the length of team's head packet of transmission according to this service queue length
Surely step-length is updated, including:
When the length of the team's head packet sent is equal with this service queue length, i.e. mean to have sent team's head
After packet, this service queue becomes empty queue, determines a length of renewal step-length of team's head packet of transmission；Tool
Body implement time, it may be determined that arbitrary value for update step-length, when determine 0 for update step-length time, represent do not carry out more
Newly.
When the length of the team's head packet sent is unequal with this service queue length, i.e. mean to have sent team
After head packet, this service queue remains as non-empty queue, determines length and this business of team's head packet of transmission
The difference of the bandwidth quota of queue is for updating step-length, specifically so that current balance counter deducts transmission
The length of team head packet, add the bandwidth quota of this service queue that next poll should obtain.
S107, in the way of increasing, update the cycle counter of this service queue；Bandwidth with this service queue
Quota updates the balance counter of this service queue；
In this step, in the way of increasing, update this service queue, to record the poll of this team's head packet experience
Number of times.
When this team's head packet is not sent, the bandwidth quota of this service queue can be regained.
Next service queue of S108, poll.
It should be noted that before being polled scheduling, need to pre-set for each service queue
Following parameter:
Bandwidth quota, is arranged according to the bandwidth demand of different business；
Balance counter, for the bandwidth quota sum of maximum packet and each service queue；
Cycle counter, initial value could be arranged to 0, it is of course also possible to be arranged to other values；
Queue thresholds, is arranged according to the real-time demand of different business；
It addition, service queue is when being non-NULL by space-variant, initialize the balance counter of this service queue, its
In, the initial value of this balance counter is the bandwidth quota sum of maximum packet and this service queue.
Apply embodiment illustrated in fig. 2 of the present invention, relative to difference poll (Deficit Round in prior art
Robin, DRR) dispatching method, add Delay Priority condition, the setting of Delay Priority condition makes
The service queue of low time delay requirement is the most excellent to be served before, so that meeting the delay requirement of service queue.
For being unsatisfactory for Delay Priority condition, further according to judge in advance as service queue arrange cycle counter
Whether determine whether to send team's head packet more than or equal to the judged result of the predetermined threshold value of this service queue, as
Fruit does not sends, and can update cycle counter, team's head time so setting can ensure that service queue any
Packet all can be sent after certain wrap count, thus guarantee will not be because of long-time by service
Produce the phenomenons such as packet loss, to ensure the fairness between service queue.Therefore, said method is the most of the same trade or business in process
Ductility and fairness when can take into account during the packet that business is flowed.
It practice, the method that the present invention uses is relative to prior art, although be provided with the priority limit of time delay
System, but this is not a strict priority restriction, when queue length is not reaching to queue thresholds,
Just can be dispatched when being not and wait the queue higher than its Delay Priority for sky, but be passed through cycle count
Device so that it is always have the chance obtaining scheduling.
As it is shown on figure 3, be the structure of dispatching device of a kind of business that the embodiment of the present invention provides shown in Fig. 3
Schematic diagram, this device is mainly used in scheduler, and this device includes:
Acquisition module 31, for the service queue for the non-NULL being polled to, obtains the queue of this service queue
Length and the length of team's head packet；
First judge module 32, for judging whether the length of this team's head packet is not more than in advance for this business team
The balance counter that row are arranged；
Second judge module 33, the judged result for the first judge module 32 be no more than time, it is judged that this team
Whether row length meets the Delay Priority condition of this service queue；
3rd judge module 34, for the judged result of the second judge module 33 for being unsatisfactory for time, it is judged that in advance
Whether the cycle counter arranged for this service queue is not less than the predetermined threshold value of this service queue；
Sending module 35, for the judged result of the second judge module 33 for meeting time, or the 3rd judge module
The judged result of 34 be not less than time, send head packet of this team；
Balance counter first more new module 36, after sending module 35 sends this team's head packet, initializes
The cycle counter of this service queue, is grouped according to the queue length of this service queue and this team's head of transmission
The relative size of length determines renewal step-length, updates the balance counter of this service queue with this renewal step-length；
Balance counter second more new module 37, is big for the judged result at described first judge module 32
In, or in the case of the judged result of described 3rd judge module 34 is for being less than, in the way of increasing, update this
The cycle counter of service queue；The difference counting of this service queue is updated with the bandwidth quota of this service queue
Device.
Poller module 38, for next service queue of poll.
In the present embodiment, described second judge module 33, specifically for:
Judge whether this queue length is more than the queue thresholds of this service queue, if it is not, represent this team
Row length meets the Delay Priority condition of this service queue；If it is lower, represent that this queue length is unsatisfactory for
The Delay Priority condition of this service queue；Wherein, queue thresholds is according to all service queue delay requirement
Relative size preset.
When being embodied as, the predetermined threshold value of described service queue is the ratio of bandwidth quota and maximum packet.
Further, balance counter first more new module 36, including:
First determines unit, when the length of the team's head packet when transmission is equal with this service queue length,
Determine a length of renewal step-length of team's head packet of transmission；
Second determines unit, when the length being grouped when the team's head sent and this service queue length are unequal,
Determine that the difference of the length of team's head packet of transmission and the bandwidth quota of this service queue is for updating step-length.
Said structure, also includes:
Initialization module, for when described service queue is non-NULL by space-variant, initializes this service queue
Balance counter, wherein, the initial value of described balance counter is maximum packet and this service queue
Bandwidth quota sum.
Apply embodiment illustrated in fig. 3 of the present invention, relative to difference poll (Deficit Round in prior art
Robin, DRR) dispatching method, add Delay Priority condition, the setting of Delay Priority condition makes
The service queue of low time delay requirement is the most excellent to be served before, so that meeting the delay requirement of service queue.
For being unsatisfactory for Delay Priority condition, further according to judge in advance as service queue arrange cycle counter
Whether determine whether to send team's head packet more than or equal to the judged result of the predetermined threshold value of this service queue, as
Fruit does not sends, and can update cycle counter, team's head time so setting can ensure that service queue any
Packet all can be sent after certain wrap count, thus guarantee will not be because of long-time by service
Produce the phenomenons such as packet loss, to ensure the fairness between service queue.Therefore, said method is the most of the same trade or business in process
Ductility and fairness when can take into account during the packet that business is flowed.
It should be noted that in this article, the relational terms of such as first and second or the like be used merely to by
One entity or operation separate with another entity or operating space, and not necessarily require or imply these
Relation or the order of any this reality is there is between entity or operation.And, term " includes ", " comprising "
Or its any other variant is intended to comprising of nonexcludability, so that include the mistake of a series of key element
Journey, method, article or equipment not only include those key elements, but also other including being not expressly set out
Key element, or also include the key element intrinsic for this process, method, article or equipment.Do not having
In the case of more restrictions, statement " including ... " key element limited, it is not excluded that including described wanting
Process, method, article or the equipment of element there is also other identical element.
Each embodiment in this specification all uses relevant mode to describe, phase homophase between each embodiment
As part see mutually, what each embodiment stressed is the difference with other embodiments.
For device embodiment, owing to it is substantially similar to embodiment of the method, so the comparison described
Simply, relevant part sees the part of embodiment of the method and illustrates.
One of ordinary skill in the art will appreciate that all or part of step realizing in said method embodiment
The program that can be by completes to instruct relevant hardware, and described program can be stored in computer-readable
Take in storage medium, the storage medium obtained designated herein, such as: ROM/RAM, magnetic disc, CD etc..
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit protection scope of the present invention.
All any modification, equivalent substitution and improvement etc. made within the spirit and principles in the present invention, are all contained in
In protection scope of the present invention.
Claims (10)
1. the dispatching method of a business, it is characterised in that described method includes:
For the service queue of the non-NULL being polled to, obtain queue length and team's head packet of described service queue
Length；
Judge whether the length of described team head packet is not more than the difference counting arranged in advance for described service queue
Device；
If it is not greater, judge whether described queue length meets the Delay Priority condition of described service queue,
If it is satisfied, send the head packet of described team；If be unsatisfactory for, it is judged that be that described service queue is arranged in advance
Whether cycle counter is not less than the predetermined threshold value of described service queue, if it is not, send described team head
Packet；
After sending the head packet of described team, initialize the cycle counter of described service queue, according to described business
The queue length of queue determines renewal step-length, with institute with the relative size of the length of the described team head packet of transmission
State the balance counter updating the step-length described service queue of renewal, next service queue of poll；
In the length of described team head packet more than be the balance counter of described service queue setting in advance, or,
Described cycle counter, less than in the case of described predetermined threshold value, updates described service queue in the way of increasing
Cycle counter；Bandwidth quota with described service queue updates the balance counter of described service queue；
Next service queue of poll.
Method the most according to claim 1, it is characterised in that described whether judge described queue length
Meet the Delay Priority condition of described service queue, including:
Judge whether described queue length is not less than the queue thresholds of described service queue, if it is not, table
Show that described queue length meets the Delay Priority condition of described service queue；If it is lower, represent described team
Row length is unsatisfactory for the Delay Priority condition of described service queue；Wherein, described queue thresholds is according to institute
The relative size having service queue delay requirement is preset.
Method the most according to claim 1, it is characterised in that the predetermined threshold value of described service queue is
The bandwidth quota of described service queue and the ratio of maximum packet.
Method the most according to claim 1, it is characterised in that described according to described service queue length
Renewal step-length is determined with the relative size of the length of the described team head packet sent, including:
When the length of the described team head packet sent is equal with described service queue length, determine the institute of transmission
State a length of renewal step-length of team's head packet；
When the length of the described team head packet sent is unequal with described service queue length, determine transmission
The length of described team head packet is renewal step-length with the difference of the bandwidth quota of described service queue.
5. according to the method described in any one of claim 1-4, it is characterised in that when described service queue is by sky
When becoming non-NULL, initializing described balance counter, wherein, the initial value of described balance counter is maximum
The bandwidth quota sum of block length and described service queue.
6. the dispatching device of a business, it is characterised in that described device includes:
Acquisition module, for the service queue for the non-NULL being polled to, obtains the queue of described service queue
Length and the length of team's head packet；
First judge module, for judging whether the length of described team head packet is not more than in advance for described business
The balance counter that queue is arranged；
Second judge module, the judged result for described first judge module be no more than time, it is judged that described
Whether queue length meets the Delay Priority condition of described service queue；
3rd judge module, for the judged result of described second judge module for being unsatisfactory for time, it is judged that in advance
Whether the cycle counter arranged for described service queue is not less than the predetermined threshold value of described service queue；
Sending module, for the judged result of described second judge module for meeting time, or the described 3rd judge
The judged result of module be not less than time, send the packet of described team head；
Balance counter first more new module, after sending module sends the head packet of described team, initializes institute
State the cycle counter of service queue, divide with the described team head of transmission according to the queue length of described service queue
The relative size of the length of group determines renewal step-length, updates the difference of described service queue with described renewal step-length
Enumerator；
Balance counter second more new module, for the judged result at described first judge module for being more than,
Or in the case of the judged result of described 3rd judge module is for being less than, in the way of increasing, update described business
The cycle counter of queue；The difference counting of described service queue is updated with the bandwidth quota of described service queue
Device；
Poller module, for next service queue of poll.
Device the most according to claim 6, it is characterised in that described second judge module, specifically uses
In:
Judge whether described queue length is not less than the queue thresholds of described service queue, if it is not, table
Show that described queue length meets the Delay Priority condition of described service queue；If it is lower, represent described team
Row length is unsatisfactory for the Delay Priority condition of described service queue；Wherein, described queue thresholds is according to institute
The relative size having service queue delay requirement is preset.
Device the most according to claim 6, it is characterised in that the predetermined threshold value of described service queue is
The bandwidth quota of described service queue and the ratio of maximum packet.
Device the most according to claim 6, it is characterised in that described balance counter first updates mould
Block, including:
First determines unit, for the length being grouped when the described team head sent and described service queue length phase
Deng time, determine a length of renewal step-length of the described team head packet of transmission；
Second determines unit, for the length when the described team head packet sent with described service queue length not
Time equal, determine that the length of described team head packet of transmission with the difference of the bandwidth quota of described service queue is
Update step-length.
10. according to the device described in any one of claim 6-9, it is characterised in that described device also includes:
Initialization module, for when described service queue is non-NULL by space-variant, initializes described difference counting
Device, wherein, the initial value of described balance counter is that the bandwidth of maximum packet and described service queue is fixed
Volume sum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610437207.4A CN105915468B (en) | 2016-06-17 | 2016-06-17 | A kind of dispatching method and device of business |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610437207.4A CN105915468B (en) | 2016-06-17 | 2016-06-17 | A kind of dispatching method and device of business |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105915468A true CN105915468A (en) | 2016-08-31 |
| CN105915468B CN105915468B (en) | 2019-03-29 |
Family
ID=56750415
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610437207.4A Active CN105915468B (en) | 2016-06-17 | 2016-06-17 | A kind of dispatching method and device of business |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105915468B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107509127A (en) * | 2017-07-27 | 2017-12-22 | 中国船舶重工集团公司第七二四研究所 | A kind of adaptive polling dispatching method of multi fiber input rank |
| CN108021439A (en) * | 2016-10-31 | 2018-05-11 | 阿里巴巴集团控股有限公司 | A kind of task polling method, task arrangement method and relevant apparatus |
| CN108632162A (en) * | 2017-03-22 | 2018-10-09 | 华为技术有限公司 | A kind of array dispatching method and forwarding unit |
| WO2018195728A1 (en) * | 2017-04-24 | 2018-11-01 | 华为技术有限公司 | Client service transmission method and device |
| CN108965160A (en) * | 2018-06-29 | 2018-12-07 | 北京邮电大学 | Dynamic difference Weight Round Robin method suitable for mine Internet of Things multi-service transport |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1809034A (en) * | 2006-02-23 | 2006-07-26 | 上海交通大学 | Network packet scheduling method applicable to wireless high-speed adaptive channels |
| CN1866927A (en) * | 2006-05-08 | 2006-11-22 | 国家数字交换***工程技术研究中心 | Information switching realizing system and method and scheduling algorithm |
| CN101964758A (en) * | 2010-11-05 | 2011-02-02 | 南京邮电大学 | Differentiated service-based queue scheduling method |
| CN102684983A (en) * | 2011-03-15 | 2012-09-19 | 中兴通讯股份有限公司 | Cell scheduling method and device |
-
2016
- 2016-06-17 CN CN201610437207.4A patent/CN105915468B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1809034A (en) * | 2006-02-23 | 2006-07-26 | 上海交通大学 | Network packet scheduling method applicable to wireless high-speed adaptive channels |
| CN1866927A (en) * | 2006-05-08 | 2006-11-22 | 国家数字交换***工程技术研究中心 | Information switching realizing system and method and scheduling algorithm |
| CN101964758A (en) * | 2010-11-05 | 2011-02-02 | 南京邮电大学 | Differentiated service-based queue scheduling method |
| CN102684983A (en) * | 2011-03-15 | 2012-09-19 | 中兴通讯股份有限公司 | Cell scheduling method and device |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108021439A (en) * | 2016-10-31 | 2018-05-11 | 阿里巴巴集团控股有限公司 | A kind of task polling method, task arrangement method and relevant apparatus |
| CN108632162A (en) * | 2017-03-22 | 2018-10-09 | 华为技术有限公司 | A kind of array dispatching method and forwarding unit |
| WO2018195728A1 (en) * | 2017-04-24 | 2018-11-01 | 华为技术有限公司 | Client service transmission method and device |
| TWI680663B (en) * | 2017-04-24 | 2019-12-21 | 大陸商華為技術有限公司 | Method and apparatus for client service transmission |
| US11785113B2 (en) | 2017-04-24 | 2023-10-10 | Huawei Technologies Co., Ltd. | Client service transmission method and apparatus |
| CN107509127A (en) * | 2017-07-27 | 2017-12-22 | 中国船舶重工集团公司第七二四研究所 | A kind of adaptive polling dispatching method of multi fiber input rank |
| CN108965160A (en) * | 2018-06-29 | 2018-12-07 | 北京邮电大学 | Dynamic difference Weight Round Robin method suitable for mine Internet of Things multi-service transport |
| CN108965160B (en) * | 2018-06-29 | 2020-06-05 | 北京邮电大学 | Dynamic difference weighted polling scheduling method suitable for mine Internet of things multi-service transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105915468B (en) | 2019-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3029896B1 (en) | Qos implementation method, apparatus and system in openflow network | |
| KR100608904B1 (en) | System and method for providing quality of service in ip network | |
| CN105915468A (en) | Service scheduling method and device | |
| Wang et al. | Autonomic QoS management mechanism in software defined network | |
| CN107872403B (en) | Five-stage queue scheduling device and method for realizing hierarchical QoS | |
| CN101692648B (en) | Method and system for queue scheduling | |
| CN104378309A (en) | Method, system and related equipment for achieving QoS in Open Flow network | |
| US7894344B2 (en) | System and method for aggregated shaping of multiple prioritized classes of service flows | |
| Park et al. | Collaborative QoS architecture between DiffServ and 802.11 e wireless LAN | |
| CN101964758A (en) | Differentiated service-based queue scheduling method | |
| CN110636011A (en) | Intelligent scheduling method and device for power communication service data stream and terminal equipment | |
| CN101958844A (en) | Active queue scheduling method based on QoS (Quality of Service) in differentiated service network | |
| CN107835133B (en) | Stream priority control method based on multi-attribute decision | |
| CN103354527B (en) | The method of improving service quality, Apparatus and system | |
| CN109831393B (en) | Multi-granularity QoS control method for network virtualization | |
| US7957394B1 (en) | Automatic network switch configuration to support quality of service | |
| CN102780630B (en) | A kind of method and apparatus realizing QoS queue based on FPGA queue | |
| CN105577563B (en) | flow management method | |
| US20060239286A1 (en) | Method for commonly controlling the bandwidths of a group of individual information flows | |
| CN100377545C (en) | Network quality service system and method | |
| CN103973590B (en) | A kind of QoS dispatching methods and device | |
| KR101587379B1 (en) | Method of dynamic control for queue size and apparatus thereof | |
| Karamchati et al. | A novel architecture to enhance Quality of Service in IP networks | |
| Stattenberger et al. | Performance evaluation of a Linux DiffServ implementation | |
| Li et al. | Design and implementation of a new queue scheduling scheme in DiffServ networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |