CN109327406A - A method for quality of service assurance for differential queue service queue data packets - Google Patents
A method for quality of service assurance for differential queue service queue data packets Download PDFInfo
- Publication number
- CN109327406A CN109327406A CN201811455528.2A CN201811455528A CN109327406A CN 109327406 A CN109327406 A CN 109327406A CN 201811455528 A CN201811455528 A CN 201811455528A CN 109327406 A CN109327406 A CN 109327406A
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- queue
- service
- high priority
- 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/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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5019—Ensuring fulfilment of SLA
- H04L41/5022—Ensuring fulfilment of SLA by giving priorities, e.g. assigning classes of service
-
- 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/56—Queue scheduling implementing delay-aware scheduling
- H04L47/564—Attaching a deadline to packets, e.g. earliest due date first
-
- 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/6295—Queue scheduling characterised by scheduling criteria using multiple queues, one for each individual QoS, connection, flow or priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明公开了一种用于差分队列服务队列数据包的服务质量保障的方法，包括：端到端有明确时延要求的数据包中，有服务质量保障要求的数据包设为高优先级，否则设为低优先级。在有差分队列服务队列的节点设置权重系数，将有服务质量保障要求的高优先级数据包在该节点可容忍的最大等待时长乘以该权重系数，计算对应数据包新的可容忍的最大等待时长、最迟需要离开的时刻，将队列中所有的数据包按照其最迟需要离开的时刻升序排序，在队列头依次转发数据包即可。本发明实施例使差分队列服务队列对有服务质量保障要求的高优先级数据包优先进行转发，实现了对差分队列服务队列数据包的服务质量保障的良好支持，更好的满足了端到端的服务质量保障要求。
The invention discloses a service quality assurance method for differential queue service queue data packets. Otherwise set to low priority. Set the weight coefficient at the node with the differential queue service queue, multiply the maximum waiting time of the high-priority data packet with the requirement of service quality assurance at the node by the weight coefficient, and calculate the new tolerable maximum waiting time for the corresponding data packet. The duration and the latest time to leave, sort all the data packets in the queue in ascending order according to the time when they need to leave at the latest, and forward the data packets in sequence at the head of the queue. The embodiment of the present invention enables the differential queue service queue to preferentially forward high-priority data packets with service quality assurance requirements, realizes good support for the service quality assurance of the differential queue service queue data packets, and better satisfies the end-to-end requirements. Service quality assurance requirements.
Description
Technical field
The present invention relates to technical field of data transmission more particularly to a kind of clothes for difference queue service queuing data packet
The method of business quality assurance.
Background technique
In next generation network standards system, it is extremely crucial content, especially real-time industry that service quality (QoS), which ensures,
Service quality guarantee problem must be taken into consideration in business.In existing Internet protocols, mainly use two kinds of quality of service model, i.e., it is comprehensive
Service (Integrated Services) and Differentiated Services (Differentiated Services).Integrated Services Quality model
Resource Reservation Protocol is mainly used to carry out resource reservation in its each router passed through by each data flow, to mention for it
For service quality, since network needs to store a large amount of status information, Integrated Services Quality model has scalability problem, no
Suitable for catenet.Differentiated Services quality model using the mechanism of classification to business realizing differential service, in every class business
Data flow obtains identical service in the all-router in the different service domains that it is passed through, which has scalability,
But it is relatively rough to service granularity.Realtime traffic requirements network provides diversified service quality, it is desirable that Service Quality end to end
Amount scheme had not only had scalability but also had been capable of providing fine-grained QoS.
The problem of for integrated service and Differentiated Services, a kind of new quality of service model difference queue service quilt
It is proposed, the main thought of the program is: each data packet carries its delay requirement, and intermediate forwarding nodes are according to the time delay of data packet
Calculate the data packet in this node tolerable maximum waiting time with link circuit condition, and calculate that it needs to leave at the latest when
It carves, its position in the difference queue service queue of this node is determined with this, to provide the service quality of data packet.Difference
The major advantage of queue service scheme is, since quality of service requirement is to be carried by data packet, thus have scalability；Separately
Outside, the data packet newly arrived is inserted into the suitable position of queue due to the program by delay requirement, thus with data packet granularity
Quality of service configuration.
Difference queue service scheme is by particular priority queue, the queue of difference queue service, three layers of prerequisite variable queue
It is clear to respectively correspond the data flow that controls stream, have clear delay requirement, nothing of the processing without clear delay requirement for queue structure's composition
The data flow of delay requirement, after the queuing of each queue processing, output scheduler is only needed in queue heads successively forwarding number
According to packet, thus scheduling mode is very simple.
Existing difference queue service scheme mainly uses difference queue service queue to provide service quality, difference queue clothes
It is engaged in the characteristics of queue being rule of joining the team using single data packet, estimates each data packet in the delivery in its residual paths
Between, calculate data packet in node tolerable maximum waiting time, with this come calculate the data packet node need at the latest from
At the time of opening, size insertion difference queue clothes at the time of determining to need to leave at the latest by it by the data packet by caching admission control
The business suitable position of queue, size ascending order is lined up at the time of making data packet all in queue need to leave at the latest by it.In order to
The data packet newly arrived is inserted into the suitable position of difference queue service queue faster, S.M.Jiang et al. proposes a kind of use
It quickly joins the team method in the data packet of difference queue service system.This method, which passes through, draws the difference queue service queue of the system
It is divided into difference queue service section and first in first out section, reduces the time consumed by data packet enqueue operations, accelerates data packet
It joins the team speed, makes that it is suitable for high speed networks, but do not account for reaching the otherness of the data packet of queue.Due to link circuit condition
Variation, for reaching the data packet of difference queue service queue, some have service quality guarantee requirement, some do not have service quality
Ensure and require how to meet the service quality guarantee requirement of difference queue service queuing data packet, support has service quality guarantee
It is required that packet priority be forwarded, be a key factor for better meeting service quality guarantee requirement end to end.
Summary of the invention
The purpose of the present invention is to provide a kind of sides of service quality guarantee for difference queue service queuing data packet
Method, it is intended to which support is forwarded the packet priority for having service quality guarantee requirement, takes end to end to better meet
Business quality assurance requirement.
To achieve the goals above, the present invention provides a kind of service quality guarantor for difference queue service queuing data packet
The method of barrier, which comprises
(11) according to delay requirement, high priority is arranged to the data packet required with service quality guarantee in source node,
To not having the data packet that service quality guarantee requires, low priority is set；
(12) in the node that each has difference queue service queue, the first counter and the second counter are set, it is described
First counter is the high priority packets quantity that the node is successfully transmitted, and second counter is to reach the node always
High priority packets quantity；
(13) there is the node of difference queue service queue for each, it is high preferential to weight coefficient, the node of the node
The corresponding target value that is successfully transmitted rate of grade data packet, node setting parameter, weight coefficient reduce adjusted value, weight coefficient
Increase adjusted value to be initialized, wherein the reduction adjusted value of weight coefficient is greater than it and increases adjusted value
(14) have the node of difference queue service queue for any one, judge to reach the node data packet whether be
High priority；
(15) if so, the second counter counts increase, new to high priority packets calculating data packet is tolerable
Maximum waiting time, data packet need the departure time in the node at the latest；
(16) judge reach node data packet whether be disposed, judgement reach node high priority packets at
In the case that function is sent, the count value of the first counter increases；
(17) according to the value of the value of first counter and second counter, the node high-priority data is calculated
Packet is successfully transmitted rate, judges the successful hair for being successfully transmitted rate P and high priority packets of the node high priority packets
Send whether the corresponding target value P' of rate meets:Wherein, ε is node setting parameter, if so, step (19) are gone to,
If not, executing step (18)；
(18) judge the node high priority packets be successfully transmitted rate P and high priority packets be successfully transmitted rate
Corresponding target value P' whether meet: P'-P > P'* ε, if it is satisfied, then according to the reduction adjusted value of weight coefficient reduce weight
Coefficient simultaneously returns to step (15), and otherwise, judge the node high priority packets is successfully transmitted rate P and high-priority data
Whether the corresponding target value P' for being successfully transmitted rate of packet meets: P'-P <-P'* ε, if so, being adjusted according to the increase of weight coefficient
Value increases weight coefficient and returns to step (15), otherwise, executes step (19)；
(19) the adaptive adjustment process of the node weights coefficient terminates, and exports the weight coefficient of node setting.
In the preferred embodiment of the present invention, the high priority packets tolerable maximum waiting new in the node
The calculation formula of duration are as follows:
D'=a*d,
Wherein, a represents the weight coefficient of node setting, and d' is the data packet tolerable maximum waiting new in the node
Duration, d are tolerable maximum waiting time of the data packet in the node；
Data packet needs the calculation formula of departure time in the node at the latest, comprising:
E=clock+d',
Wherein, at the time of clock represents data packet and reaches the node, data packet maximum is waited in the tolerable of the node
The expression of duration are as follows:D represent end to end maximum delay,Data packet is represented in arrival
The practical maximum delay undergone of preceding i-1 node of i-th of node,Represent data packet the node of residual paths will
The maximum delay of experience.
The method of a kind of service quality guarantee for difference queue service queuing data packet provided by the invention, beneficial to effect
Fruit is as follows:
The method of service quality guarantee disclosed by the invention for difference queue service queuing data packet, it is only necessary in number
According to indicating that whether there is or not the priority tags that service quality guarantee requirement is arranged for the data packet in packet packet header, there will be service quality guarantor
Hinder desired high priority packets in node tolerable maximum waiting time multiplied by a weight coefficient, obtains corresponding data
The tolerable maximum waiting time of Bao Xin, and at the time of calculate it and need to leave at the latest, data packet all in queue is pressed
Size ascending sort at the time of needing to leave at the latest according to it successively forwards data packet in queue heads, thus is simply easy to real
It is existing；By adaptively adjusting the weight coefficient of each node, making the rates that is successfully transmitted of node high priority packets, to meet its right
Target value is answered, the good support of the service quality guarantee to difference queue service queuing data packet is realized, thus preferably full
Foot service quality guarantee requirement end to end.
Detailed description of the invention
Fig. 1 is system of the embodiment of the present invention for the method for the service quality guarantee of difference queue service queuing data packet
Structure chart.
Fig. 2 is process of the embodiment of the present invention for the method for the service quality guarantee of difference queue service queuing data packet
Figure.
Specific embodiment
Illustrate embodiments of the present invention below by way of specific specific example, those skilled in the art can be by this specification
Other advantages and efficacy of the present invention can be easily understood for disclosed content.The present invention can also pass through in addition different specific realities
The mode of applying is embodied or practiced, the various details in this specification can also based on different viewpoints and application, without departing from
Various modifications or alterations are carried out under spirit of the invention.
Please refer to Fig. 1-2.It should be noted that only the invention is illustrated in a schematic way for diagram provided in the present embodiment
Basic conception, only shown in schema then with related component in the present invention rather than component count, shape when according to actual implementation
Shape and size are drawn, when actual implementation kenel, quantity and the ratio of each component can arbitrarily change for one kind, and its component cloth
Office's kenel may also be increasingly complex.
Fig. 1 is three layer queue structural schematic diagrams of the improved difference queue service scheme of the present invention, such as at source node
For the end-to-end data packet for having clear delay requirement, the data packet for having service quality guarantee requirement is set into high priority mark
Know, the data packet setting low priority mark required without service quality guarantee；Source node issues data packet, and arrival has difference team
After the node of column service queue, the data packet of all setting priority tags enters difference queue service queue, is connect by caching
Receive control, by all high priority packets the node tolerable maximum waiting time multiplied by the suitable weight of the node
Coefficient, lower-priority data packet is remained unchanged in the tolerable maximum waiting time of the node, and calculates all data packets most
At the time of needing to leave late；For the data packet of arrival, caches admission control and guarantees that data packet is inserted into the suitable position of queue,
It is lined up the data packet of entire difference queue service queue by size ascending order at the time of needing to leave at the latest, queue dispatcher
It only needs successively to forward data packet in queue heads.
Specifically, as depicted in figs. 1 and 2, the embodiment of the invention provides one kind to be used for difference queue service queuing data
The method of the service quality guarantee of packet, which comprises
(11) according to delay requirement, in source node to the end-to-end data packet for having clear delay requirement, by it, whether there is or not services
Quality assurance requires setting height priority tag, has the data packet of service quality guarantee requirement to be set as high priority, does not take
The data packet that business quality assurance requires is set as low priority.
(12) in the node that each has difference queue service queue, the first counter and the second counter are set, it is described
First counter is the high priority packets quantity that the node is successfully transmitted, and second counter is to reach the node always
High priority packets quantity.
(13) there is the node of difference queue service queue for each, it is high preferential to weight coefficient, the node of the node
The corresponding target value that is successfully transmitted rate of grade data packet, node setting parameter, weight coefficient reduce adjusted value, weight coefficient
Increase adjusted value to be initialized, wherein the reduction adjusted value of weight coefficient is greater than it and increases adjusted value；
For example, in the node that each has difference queue service queue, two counter m and n are set, m represents the node
The high priority packets quantity being successfully transmitted, n, which is represented, reaches the total high priority packets quantity of the node, weight coefficient a
Parameter ε (ε is arranged in (0 < a < 1), the corresponding target value P' for being successfully transmitted rate of node high priority packets, specific node
> 0), a reduce adjusted value Δ, a increase adjusted value δ (Δ > δ > 0).
(14) have the node of difference queue service queue for any one, judge to reach the node data packet whether be
High priority；
(15) if so, the second counter counts increase, for example, executing n++, data packet is calculated to the high priority packets
New tolerable maximum waiting time, data packet need the departure time in the node at the latest；
(16) judge reach node data packet whether be disposed, judgement reach node high priority packets at
In the case that function is sent, the count value of the first counter increases, for example, executing m++；
(17) according to the value of the value of first counter and second counter, the node high-priority data is calculated
Packet is successfully transmitted rate P, for example,Judge the node high priority packets is successfully transmitted rate P and high priority number
Whether meet according to the corresponding target value P' for being successfully transmitted rate of packet:Wherein, ε is node setting parameter, if so,
Step (19) are gone to, if not, executing step (18)；
(18) judge the node high priority packets be successfully transmitted rate P and high priority packets be successfully transmitted rate
Corresponding target value P' whether meet: P'-P > P'* ε, if it is satisfied, then according to the reduction adjusted value of weight coefficient reduce weight
Coefficient simultaneously returns to step (15), and otherwise, judge the node high priority packets is successfully transmitted rate P and high-priority data
Whether the corresponding target value P' for being successfully transmitted rate of packet meets: P'-P <-P'* ε, if so, being adjusted according to the increase of weight coefficient
Value increases weight coefficient and returns to step (15), otherwise, executes step (19)；
For example, reducing weight coefficient according to the reduction adjusted value of weight coefficient are as follows: a=a- Δ, Δ represent the reduction adjustment of a
Value；Increase weight coefficient according to the increase adjusted value of weight coefficient are as follows: a=a+ δ, δ represent the increase adjusted value of a, Δ > δ > 0.
(19) the adaptive adjustment process of the node weights coefficient terminates, and exports the weight coefficient of node setting.
In the preferred embodiment of the present invention, the high priority packets tolerable maximum waiting new in the node
The calculation formula of duration are as follows:
D'=a*d,
Data packet needs the calculation formula of departure time in the node at the latest, comprising:
E=clock+d',
Wherein, at the time of clock represents data packet and reaches the node,Data packet is represented to exist
The tolerable maximum waiting time of the node, D represent end to end maximum delay,Data packet is represented the i-th of arrival
The practical maximum delay undergone of preceding i-1 node of a node,Represent data packet the node of residual paths will be through
The maximum delay gone through.
The above-described embodiments merely illustrate the principles and effects of the present invention, and is not intended to limit the present invention.It is any ripe
The personage for knowing this technology all without departing from the spirit and scope of the present invention, carries out modifications and changes to above-described embodiment.Cause
This, institute is complete without departing from the spirit and technical ideas disclosed in the present invention by those of ordinary skill in the art such as
At all equivalent modifications or change, should be covered by the claims of the present invention.
Claims (2)
1. a kind of method of the service quality guarantee for difference queue service queuing data packet, which is characterized in that the method
Include:
(11) according to delay requirement, high priority is arranged to the data packet required with service quality guarantee in source node, to not
Low priority is arranged in the data packet required with service quality guarantee；
(12) in the node that each has difference queue service queue, the first counter and the second counter be set, described first
Counter is the high priority packets quantity that the node is successfully transmitted, and second counter is to reach the total Gao You of the node
First grade data packet number；
(13) there is the node of difference queue service queue for each, weight coefficient, node high priority number to the node
According to the increase for reducing adjusted value, weight coefficient of the corresponding target value for being successfully transmitted rate of packet, node setting parameter, weight coefficient
Adjusted value is initialized, wherein the reduction adjusted value of weight coefficient is greater than it and increases adjusted value
(14) there is the node of difference queue service queue for any one, whether the data packet for judging to reach the node is Gao You
First grade；
(15) if so, the second counter counts increase, the new tolerable maximum of data packet is calculated to the high priority packets
Waiting time, data packet need the departure time in the node at the latest；
(16) judge whether the data packet for reaching node is disposed, successfully sent out in the high priority packets that judgement reaches node
In the case where sending, the count value of the first counter increases；
(17) according to the value of the value of first counter and second counter, the node high priority packets are calculated
Be successfully transmitted rate, judge the node high priority packets be successfully transmitted rate P and high priority packets be successfully transmitted rate
Corresponding target value P' whether meet:Wherein, ε is node setting parameter, if so, step (19) are gone to, if
It is no, it executes step (18)；
(18) judge pair for being successfully transmitted rate for being successfully transmitted rate P and high priority packets of the node high priority packets
Answer whether target value P' meets: P'-P > P'* ε, if it is satisfied, then reducing weight coefficient according to the reduction adjusted value of weight coefficient
And return to step (15), otherwise, judge the node high priority packets is successfully transmitted rate P and high priority packets
Whether the corresponding target value P' for being successfully transmitted rate meets: P'-P <-P'* ε, if so, being increased according to the increase adjusted value of weight coefficient
Big weight coefficient simultaneously returns to step (15), otherwise, executes step (19)；
(19) the adaptive adjustment process of the node weights coefficient terminates, and exports the weight coefficient of node setting.
2. the method for the service quality guarantee according to claim 1 for difference queue service queuing data packet, special
Sign is, calculation formula of the high priority packets in the node new tolerable maximum waiting time are as follows:
D'=a*d,
Wherein, a represents the weight coefficient of node setting, and d' is data packet in the new tolerable maximum waiting of the node
Long, d is tolerable maximum waiting time of the data packet in the node；
Data packet needs the calculation formula of departure time in the node at the latest, comprising:
E=clock+d',
Wherein, at the time of clock represents data packet and reaches the node, tolerable maximum waiting time of the data packet in the node
Expression are as follows:D represent end to end maximum delay,Data packet is represented the i-th of arrival
The practical maximum delay undergone of preceding i-1 node of a node,Represent data packet the node of residual paths will be through
The maximum delay gone through.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811455528.2A CN109327406B (en) | 2018-11-30 | 2018-11-30 | A method for quality of service assurance for differential queue service queue data packets |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811455528.2A CN109327406B (en) | 2018-11-30 | 2018-11-30 | A method for quality of service assurance for differential queue service queue data packets |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109327406A true CN109327406A (en) | 2019-02-12 |
| CN109327406B CN109327406B (en) | 2022-08-02 |
Family
ID=65255907
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811455528.2A Active CN109327406B (en) | 2018-11-30 | 2018-11-30 | A method for quality of service assurance for differential queue service queue data packets |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109327406B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266607A (en) * | 2019-05-20 | 2019-09-20 | 中国电力科学研究院有限公司 | A demand response data scheduling method and device |
| CN114035930A (en) * | 2021-11-29 | 2022-02-11 | 重庆大学 | Method and apparatus for task scheduling, electronic device, and readable storage medium |
| WO2023234816A1 (en) * | 2022-06-03 | 2023-12-07 | Telefonaktiebolaget Lm Ericsson (Publ) | Method for handling data communication by providing an indication of a required delivery time (dt) to a packet |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7110359B1 (en) * | 2001-03-05 | 2006-09-19 | Advanced Micro Devices, Inc. | System and method for dynamically updating weights of weighted round robin in output queues |
| CN102404225A (en) * | 2011-11-30 | 2012-04-04 | 华南理工大学 | Method for rapid enqueue of packet for differential queue service system |
| US20150082345A1 (en) * | 2011-09-29 | 2015-03-19 | Avvasi Inc. | System for generating enhanced advertizements and methods for use therewith |
| CN106793132A (en) * | 2016-11-21 | 2017-05-31 | 中国联合网络通信集团有限公司 | A kind of resource allocation methods and network communicating system based on carrier aggregation |
-
2018
- 2018-11-30 CN CN201811455528.2A patent/CN109327406B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7110359B1 (en) * | 2001-03-05 | 2006-09-19 | Advanced Micro Devices, Inc. | System and method for dynamically updating weights of weighted round robin in output queues |
| US20150082345A1 (en) * | 2011-09-29 | 2015-03-19 | Avvasi Inc. | System for generating enhanced advertizements and methods for use therewith |
| CN102404225A (en) * | 2011-11-30 | 2012-04-04 | 华南理工大学 | Method for rapid enqueue of packet for differential queue service system |
| CN106793132A (en) * | 2016-11-21 | 2017-05-31 | 中国联合网络通信集团有限公司 | A kind of resource allocation methods and network communicating system based on carrier aggregation |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266607A (en) * | 2019-05-20 | 2019-09-20 | 中国电力科学研究院有限公司 | A demand response data scheduling method and device |
| CN114035930A (en) * | 2021-11-29 | 2022-02-11 | 重庆大学 | Method and apparatus for task scheduling, electronic device, and readable storage medium |
| CN114035930B (en) * | 2021-11-29 | 2024-05-10 | 重庆大学 | Method and device for task scheduling, electronic equipment and readable storage medium |
| WO2023234816A1 (en) * | 2022-06-03 | 2023-12-07 | Telefonaktiebolaget Lm Ericsson (Publ) | Method for handling data communication by providing an indication of a required delivery time (dt) to a packet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109327406B (en) | 2022-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104378309B (en) | Method, system and the relevant device of QoS are realized in OpenFlow network | |
| CN114422448B (en) | Time-sensitive network traffic shaping method | |
| CN105490962B (en) | A kind of QoS management methods based on OpenFlow networks | |
| CN115643220B (en) | Deterministic service transmission method and device based on jitter time delay | |
| CN106533970A (en) | Differential flow control method and device for cloud computing data center network | |
| CN109905330B (en) | Dynamic weighted fair queue train network scheduling method based on queue length | |
| CN103457871A (en) | Window increasing method based on deferred constraint at congestion avoidance stage in data communication network (DCN) | |
| Zhang et al. | Congestion control and packet scheduling for multipath real time video streaming | |
| CN106921594B (en) | A QoS guarantee method for dynamic network resource reservation oriented to industrial SDN | |
| CN112822268B (en) | A method for multi-service coexistence and IP layer data packet scheduling in the Industrial Internet of Things | |
| CN101369962A (en) | Method and network device for forwarding message | |
| CN113950104A (en) | Satellite network service deterministic scheduling method based on dynamic period mapping | |
| CN109327406A (en) | A method for quality of service assurance for differential queue service queue data packets | |
| CN105978822A (en) | Congestion control method based on deadline sensitivity and round-trip time in data center | |
| CN101436996A (en) | Method for scheduling packet feedback based on short time fairness | |
| JP3830937B2 (en) | Packet scheduling system and method for high-speed packet networks | |
| CN116266826A (en) | A distributed machine learning network optimization system, method and electronic equipment | |
| CN107302504B (en) | Multipath transmission scheduling method and system based on virtual sending queue | |
| CN105915468A (en) | Service scheduling method and device | |
| CN115733808B (en) | A data transmission method, device and equipment based on circular queue cluster forwarding | |
| CN102739508B (en) | A kind of method and system of express network data transmission | |
| CN109995800A (en) | The middleware services system and method applied towards dynamic realtime in industrial SDN network | |
| CN102404208B (en) | Stable network congestion control method with high-efficiency | |
| CN116016357B (en) | Data transmission method, device, storage medium and electronic device | |
| CN102638401B (en) | Bandwidth allocation method of differentiated service system structure 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |