CN114401233A - Message scheduling method of time-aware scheduler and time-aware scheduler - Google Patents
Message scheduling method of time-aware scheduler and time-aware scheduler Download PDFInfo
- Publication number
- CN114401233A CN114401233A CN202111564371.9A CN202111564371A CN114401233A CN 114401233 A CN114401233 A CN 114401233A CN 202111564371 A CN202111564371 A CN 202111564371A CN 114401233 A CN114401233 A CN 114401233A
- Authority
- CN
- China
- Prior art keywords
- message
- transmitted
- packet
- time
- queue
- 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
- 238000000034 method Methods 0.000 title claims abstract description 23
- 230000005540 biological transmission Effects 0.000 claims abstract description 13
- 241001522296 Erithacus rubecula Species 0.000 claims 1
- 125000004122 cyclic group Chemical group 0.000 claims 1
- 239000002699 waste material Substances 0.000 description 5
- 230000001960 triggered effect Effects 0.000 description 3
- 206010012186 Delayed delivery Diseases 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
Images
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
-
- 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/6205—Arrangements for avoiding head of line blocking
-
- 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/628—Queue scheduling characterised by scheduling criteria for service slots or service orders based on packet size, e.g. shortest packet first
Abstract
The invention provides a message scheduling method of a time-aware scheduler and the time-aware scheduler, which relate to the technical field of network resource scheduling and comprise the following steps: scanning to obtain an effective queue in each queue to be scheduled according to each scheduling period of each time slice, selecting a message to be transmitted and at least one alternative message from the effective queue, and adding each alternative message into an alternative set, wherein the message length of the alternative message is smaller than that of the message to be transmitted; judging whether the message to be transmitted can be transmitted in the current time slice: if so, scheduling and transmitting the message to be transmitted, and then entering the next scheduling period; if not, judging whether an alternative message capable of completing transmission in the current time slice exists in the alternative set: if yes, scheduling and transmitting the corresponding alternative message, and then waiting for entering the next time slice; if not, waiting for entering the next time slice. The method has the advantages of effectively improving the utilization rate of the bandwidth and the fault tolerance of the time-aware scheduler.
Description
Technical Field
The invention relates to the technical field of network resource scheduling, in particular to a message scheduling method of a time-aware scheduler and the time-aware scheduler.
Background
In industrial and automotive control applications, data transmitted over a network is used to provide parameters of a control loop critical to the operation of the plant or machine involved, and to transmit frames carrying control data in a repetitive time schedule, the delayed delivery of such frames may result in instability, inaccuracy, or operational failure of the associated control loop. The time sensitive traffic described above requires that the overall delay and jitter time experienced by the frame when transmitted to the destination be deterministic. The industry has defined and developed TSN (time sensitive network) standards for supporting time sensitive traffic.
The TSN time aware scheduler specified by IEEE 802.1Qbv is designed to divide communications over ethernet into fixed length, repeating time periods. In these periods, different time slices may be configured, which may be assigned to one or several of the 8 ethernet priorities. By doing so, it is possible to grant exclusive use of the ethernet transmission medium for a limited time for those communication classes that require transmission guarantees and cannot be interrupted.
The TSN time-aware scheduler specified by IEEE 802.1Qbv introduces the concept of time slicing. The protocol specifies that the transmission of ethernet frames cannot cross the slice boundary, so at the end of a slice, a situation may occur in which the currently scheduled packet cannot be transmitted in the slice. In this case, bandwidth is wasted.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a message scheduling method of a time-aware scheduler, which is applied to a time-sensitive network, wherein the time-sensitive network is provided with a circulating time slice and a plurality of queues to be scheduled, and each time slice comprises a plurality of scheduling periods;
then, for each time slice, the packet scheduling method includes:
step S1, the time-aware scheduler scans each scheduling cycle to obtain an effective queue in each queue to be scheduled, selects a message to be transmitted and at least one alternative message from the effective queue, and adds each alternative message into an alternative set;
step S2, the time-aware scheduler determines whether the packet to be transmitted can be transmitted in the current time slice:
if so, scheduling and transmitting the message to be transmitted, and then entering the next scheduling period;
if not, go to step S3;
step S3, the time-aware scheduler determines whether the candidate packet that can be transmitted in the current time slice exists in the candidate set:
if yes, scheduling and transmitting the corresponding alternative message, and then waiting for entering the next time slice;
if not, waiting to enter the next time slice.
Preferably, in step S1, the time-aware scheduler selects, from all the active queues, a packet with the shortest packet length as the candidate packet to add to the candidate set.
Preferably, in step S1, the time-aware scheduler adds the packet in the effective queue as the candidate packet to the candidate set;
the step S3 includes:
step S31, the time-aware scheduler determines whether the candidate packet with the shortest packet length in the candidate set can be transmitted in the current time slice:
if yes, go to step S32;
if not, waiting for entering the next time slice;
step S32, the time-aware scheduler schedules and transmits the candidate packet with the shortest packet length, updates the candidate set, and then returns to step S31.
Preferably, a gating list is pre-configured in the time sensitive network, and a gating state of each queue to be scheduled in each time slice is configured in the gating list;
in step S1, when the time-aware scheduler detects that any gating state changes, or an empty queue exists in each queue to be scheduled and a packet arrives in the empty queue, or when the packet to be transmitted is scheduled and transmitted, the time-aware scheduler triggers to scan the effective queue in each queue to be scheduled.
Preferably, in step S1, the time-aware scheduler selects the packet to be transmitted from the effective queue by using a priority policy or a polling policy.
The invention also provides a time-aware scheduler, which adopts the message scheduling method, and the time-aware scheduler comprises:
the message selection module is used for scanning to obtain an effective queue in each queue to be scheduled according to each scheduling period in each time slice, selecting a message to be transmitted and at least one alternative message from the effective queue, and adding each alternative message into an alternative set;
the first judgment module is connected with the message selection module and used for scheduling and transmitting the message to be transmitted when judging that the message to be transmitted can be transmitted in the current time slice, then entering the next scheduling period, and outputting an alternative signal when the message to be transmitted can not be transmitted in the current time slice;
and the second judgment module is respectively connected with the message selection module and the first judgment module and used for scheduling and transmitting the corresponding alternative message according to the alternative signal when judging that the alternative message which can be transmitted in the current time slice exists in the alternative set, and then waiting for entering the next time slice.
Preferably, the message selection module selects a message with the shortest message length from all the effective queues as the candidate message to be added into the candidate set.
Preferably, the message selection module adds the message in the effective queue as the alternative message to the alternative set;
the second determining module includes:
a judging unit, configured to, in the alternative set, judge that the alternative packet with the shortest packet length can output a scheduling signal when the transmission of the current time slice is completed;
the scheduling unit is connected with the judging unit and used for scheduling and transmitting the alternative message with the shortest message length according to the scheduling signal and then updating the alternative set;
the judging unit judges whether the alternative packet with the shortest packet length in the updated alternative set can be transmitted in the current time slice or not until the alternative packet with the shortest packet length in the alternative set cannot be transmitted in the current time slice.
Preferably, a gating list is pre-configured in the time sensitive network, and a gating state of each queue to be scheduled in each time slice is configured in the gating list;
and triggering to scan the effective queue in each queue to be scheduled when detecting that any gating state changes, or when an empty queue exists in each queue to be scheduled and a message arrives in the empty queue, or when the last message to be transmitted is scheduled and transmitted.
Preferably, the message selection module selects the message to be transmitted from the effective queue by using a priority policy or a polling policy.
The technical scheme has the following advantages or beneficial effects:
1) under the condition of complying with the service quality strategy of the time sensitive network and not increasing the original cost, the possibility of time slice waste is reduced as much as possible, and the utilization rate of the bandwidth is effectively improved;
2) the method that the minimum packet message is first moved is adopted for selecting the alternative message, and the optimal principle of short service priority is met;
3) when the length of the message is larger than the gating time due to improper configuration of the user and further the message blocks other queues, other messages can pass through the scheduling method and device without service interruption, and the fault tolerance of the time-aware scheduler is effectively improved.
Drawings
FIG. 1 is a flow chart illustrating a message scheduling method of a time-aware scheduler according to a preferred embodiment of the present invention;
fig. 2 is a schematic flow chart illustrating a time-aware scheduler determining whether there is an alternative packet that can be transmitted in a current time slice in an alternative set according to a preferred embodiment of the present invention;
FIG. 3 is a diagram illustrating a time-aware scheduler according to a preferred embodiment of the present invention.
Detailed Description
The invention is described in detail below with reference to the figures and specific embodiments. The present invention is not limited to the embodiment, and other embodiments may be included in the scope of the present invention as long as the gist of the present invention is satisfied.
In a preferred embodiment of the present invention, based on the above problems in the prior art, a method for scheduling a packet by a time-aware scheduler is provided, which is applied to a time-sensitive network, where a plurality of queues to be scheduled and a plurality of time slices are configured in a cycle, and each time slice includes a plurality of scheduling periods;
as shown in fig. 1, the message scheduling method for each time slice includes:
step S1, the time perception dispatcher scans to obtain the effective queue in each queue to be dispatched in each dispatching cycle, selects a message to be transmitted and at least one alternative message from the effective queue, and adds each alternative message into an alternative set;
step S2, the time-aware scheduler determines whether the message to be transmitted can be transmitted in the current time slice:
if so, scheduling and transmitting the message to be transmitted, and then entering the next scheduling period;
if not, go to step S3;
step S3, the time-aware scheduler determines whether there is an alternative packet that can be transmitted in the current time slice in the alternative set:
if yes, scheduling and transmitting the corresponding alternative message, and then waiting for entering the next time slice;
if not, waiting for entering the next time slice.
Specifically, when the existing time-aware scheduler performs packet scheduling, if a selected packet to be transmitted cannot be transmitted in the current time slice, because transmission of an ethernet frame cannot cross a time slice boundary, the selected packet to be transmitted cannot be transmitted, and must wait in a queue, when next gating time arrives, the time-aware scheduler will reschedule a new packet from an effective queue, and therefore, a period of time exists on a link, which cannot transmit the packet, and this situation usually occurs at the end of the time slice, which causes waste of bandwidth resources.
Based on this, in the technical scheme, at least one alternative message is selected while the selected message to be transmitted is transmitted, when the selected message to be transmitted cannot be transmitted in the current time slice, whether the alternative message can be transmitted in the current time slice is further determined, and if the alternative message can be transmitted in the current time slice, the alternative message is scheduled and transmitted, so that the possibility that the time slice is wasted is reduced as much as possible, and the utilization rate of bandwidth is effectively improved. For example, if the remaining bandwidth of the current time slice is 450 bytes and the message length of the selected message to be transmitted is 500 bytes, the transmission of the message to be transmitted needs to cross the boundary of the time slice, which is not allowed, so that the message to be transmitted cannot be transmitted in the current time slice, at this time, if an alternative message with the message length of 400 bytes exists, the alternative message can be scheduled and transmitted, and it can be seen that the bandwidth waste of 400 bytes in the time slice is reduced, and the bandwidth utilization rate is effectively improved. Further, when the selected message to be transmitted cannot be transmitted in the time slice, the remaining time fragments are wasted, and at this time, any other message to be transmitted is selected without violating the QoS policy. Therefore, the technical scheme avoids bandwidth waste on the premise of complying with the QoS strategy.
In a preferred embodiment of the present invention, the number of the candidate messages in the candidate set may be one or more, and when there is one candidate message, in step S1, the time-aware scheduler selects a message with the shortest message length from all the active queues as the candidate message to add to the candidate set.
When there are multiple candidate messages, in step S1, the time-aware scheduler adds the messages in the effective queue as the candidate messages to the candidate set;
as shown in fig. 2, if the minimum packet is taken first to perform packet scheduling, and the optimal principle of short service priority is met, step S3 includes:
step S31, the time-aware scheduler determines whether the candidate packet with the shortest packet length in the candidate set can be transmitted in the current time slice:
if yes, go to step S32;
if not, waiting for entering the next time slice;
and step S32, the time-aware scheduler schedules and transmits the candidate message with the shortest message length, updates the candidate set, and then returns to step S31.
Specifically, in this embodiment, for example, when the remaining bandwidth of the current time slice is 450 bytes, and the message length of the selected message to be transmitted is 500 bytes, the message to be transmitted cannot be transmitted in the current time slice, at this time, if 200 bytes, 220 bytes, and 230 bytes of messages sequentially exist in all the active queues according to the sequence from small to large of the message length, it is first determined whether the candidate message with the shortest message length, that is, the message with 200 bytes can be transmitted in the current time slice, since 200 bytes are smaller than 450 bytes, it can be seen that the transmission can be completed in the current time slice, after the transmission is completed, the remaining bandwidth of the current time slice is 250 bytes, and then the candidate message with the shortest message length, that is, the message with 220 bytes is smaller than 250 bytes, is selected from the candidate set, and it can also be transmitted in the current time slice, after the transmission is completed, the remaining bandwidth of the current time slice is 30 bytes, and then an alternative message with the shortest message length, namely a 230-byte message, is selected from the alternative set, and since the 230 bytes are larger than 30 bytes, the alternative message cannot be transmitted in the current time slice, and then the next time slice is waited to enter. It can be seen that when a long packet is selected, which cannot be transmitted in the time slice, a plurality of alternative short packets may fill the remaining time slices, which reduces the bandwidth waste of 420 bytes in the time slice and can fully improve the bandwidth utilization rate.
In a preferred embodiment of the invention, a gating list is pre-configured in the time sensitive network, and the gating list is configured with gating states of queues to be scheduled in time slices;
in step S1, when the time-aware scheduler detects that any gating state changes, or an empty queue exists in each queue to be scheduled and a message arrives in the empty queue, or a message to be transmitted is scheduled and transmitted, the time-aware scheduler triggers to scan an effective queue in each queue to be scheduled.
Specifically, in this embodiment, the time-aware scheduler is configured with a scheduling state machine and a shortest packet selection state machine, where trigger conditions of the scheduling state machine and the shortest packet selection state machine are the same and the scheduling state machine and the shortest packet selection state machine synchronously scan an effective queue in each queue to be scheduled. The scheduling state machine is in a scheduling state when triggering to scan the effective queues in the queues to be scheduled and schedule and transmit the messages to be transmitted, otherwise, the scheduling state machine is in an idle state, and the scheduling state machine detects that any gating state changes in the idle state, or an empty queue exists in each queue to be scheduled and a message arrives in the empty queue, or when the scheduling and transmission of the last message to be transmitted are completed, triggering to scan the effective queues in each queue to be scheduled. The states and trigger conditions of the shortest packet selection state machine and the scheduling state machine are the same, and are not described herein again. The optional message of the shortest packet selection state machine is triggered by the message arrival and departure event, can be realized in a progressive mode, does not need a high-speed operation circuit, and therefore the hardware overhead is very small.
Further specifically, the gating state corresponding to each queue to be scheduled in different time slices may change, taking the existence of 8 queues to be scheduled as an example, when the last time slice is a time slice, the gating state of the first queue to be scheduled is an open state, when the current time slice is a time slice, the gating state of the first queue to be scheduled is a closed state, then, in the last time slice, the first queue to be scheduled may be used as an effective queue, and when the first queue to be scheduled is not an effective queue in the current time slice, therefore, when a change in any gating state is detected, the effective queue may change, and it is necessary to trigger scanning of the effective queues in each queue to be scheduled, so as to implement updating of the effective queues.
Further specifically, when an empty queue exists in each queue to be scheduled and a message arrives in the empty queue, and when no message arrives, the empty queue is not required to transmit the message and is not an effective queue, but when a message arrives, the empty queue may have a higher priority and needs to be preferentially transmitted, so that when a message arrives in the empty queue, the empty queue needs to be triggered to scan the effective queue in each queue to be scheduled, and the update of the effective queue is realized.
Further specifically, when the previous to-be-transmitted message is scheduled and transmitted, the next to-be-transmitted message needs to be scheduled next, that is, one to-be-transmitted message needs to be selected from the effective queues, and in the scheduling and transmitting process of the previous to-be-transmitted message, the state of each to-be-scheduled queue may change, and at this time, the effective queues in each to-be-scheduled queue need to be triggered and scanned, so that the effective queues are updated.
In a preferred embodiment of the present invention, in step S1, the time-aware scheduler selects a message to be transmitted from the active queue by using a priority policy or a polling policy.
The present invention further provides a time-aware scheduler, which uses the above-mentioned message scheduling method, as shown in fig. 3, the time-aware scheduler includes:
the message selection module 1 is configured to scan to obtain an effective queue in each queue to be scheduled for each scheduling period of each time slice, select a message to be transmitted and at least one alternative message from the effective queue, and add each alternative message into an alternative set;
the first judgment module 2 is connected with the message selection module 1 and is used for scheduling and transmitting the message to be transmitted when judging that the message to be transmitted can be transmitted in the current time slice, then entering the next scheduling period, and outputting an alternative signal when the message to be transmitted can not be transmitted in the current time slice;
and the second judging module 3 is respectively connected with the message selecting module 1 and the first judging module 2, and is used for scheduling and transmitting the corresponding alternative message when judging that the alternative message capable of completing transmission in the current time slice exists in the alternative set according to the alternative signal, and then waiting for entering the next time slice.
In a preferred embodiment of the present invention, the message selection module 1 selects a message with the shortest message length from all the effective queues as an alternative message to be added to the alternative set.
In the preferred embodiment of the present invention, the message selection module 1 adds the message in the effective queue as the alternative message into the alternative set;
the second determination module 3 includes:
the judging unit 31 is configured to, in the alternative set, output a scheduling signal when the alternative packet with the shortest packet length is transmitted in the current time slice;
the scheduling unit 32 is connected to the judging unit 31, and is configured to schedule and transmit the candidate packet with the shortest packet length according to the scheduling signal, and then update the candidate set;
the determining unit 31 determines whether the candidate packet with the shortest packet length in the updated candidate set can be transmitted in the current time slice until the candidate packet with the shortest packet length in the candidate set cannot be transmitted in the current time slice.
In a preferred embodiment of the invention, a gating list is pre-configured in the time sensitive network, and the gating list is configured with gating states of queues to be scheduled in time slices;
then, in the message selection module 1, when detecting that any gating state changes, or when an empty queue exists in each queue to be scheduled and a message arrives in the empty queue, or when a previous message to be transmitted is scheduled and transmitted, triggering to scan an effective queue in each queue to be scheduled.
In a preferred embodiment of the present invention, the message selection module 1 selects a message to be transmitted from the effective queue by using a priority policy or a polling policy.
While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention.
Claims (10)
1. A message scheduling method of a time-aware scheduler is characterized in that the method is applied to a time-sensitive network, a cyclic time slice and a plurality of queues to be scheduled are configured in the time-sensitive network, and each time slice comprises a plurality of scheduling periods;
then, for each time slice, the packet scheduling method includes:
step S1, the time-aware scheduler scans each scheduling cycle to obtain an effective queue in each queue to be scheduled, selects a message to be transmitted and at least one alternative message from the effective queue, and adds each alternative message into an alternative set;
step S2, the time-aware scheduler determines whether the packet to be transmitted can be transmitted in the current time slice:
if so, scheduling and transmitting the message to be transmitted, and then entering the next scheduling period;
if not, go to step S3;
step S3, the time-aware scheduler determines whether the candidate packet that can be transmitted in the current time slice exists in the candidate set:
if yes, scheduling and transmitting the corresponding alternative message, and then waiting for entering the next time slice;
if not, waiting to enter the next time slice.
2. The packet scheduling method according to claim 1, wherein in step S1, the time-aware scheduler selects a packet with the shortest packet length from all the active queues to be added as the candidate packet into the candidate set.
3. The packet scheduling method according to claim 1, wherein in the step S1, the time-aware scheduler adds the packet in the active queue as the candidate packet to the candidate set;
the step S3 includes:
step S31, the time-aware scheduler determines whether the candidate packet with the shortest packet length in the candidate set can be transmitted in the current time slice:
if yes, go to step S32;
if not, waiting for entering the next time slice;
step S32, the time-aware scheduler schedules and transmits the candidate packet with the shortest packet length, updates the candidate set, and then returns to step S31.
4. The message scheduling method according to claim 1, wherein a gating list is pre-configured in the time sensitive network, and a gating state of each queue to be scheduled in each time slice is configured in the gating list;
in step S1, when the time-aware scheduler detects that any gating state changes, or an empty queue exists in each queue to be scheduled and a packet arrives in the empty queue, or when the packet to be transmitted is scheduled and transmitted, the time-aware scheduler triggers to scan the effective queue in each queue to be scheduled.
5. The message scheduling method according to claim 1, wherein in step S1, the time-aware scheduler selects the message to be transmitted from the active queue by using a priority policy or a polling policy.
6. A time-aware scheduler employing the message scheduling method according to any of claims 1-5, the time-aware scheduler comprising:
the message selection module is used for scanning to obtain an effective queue in each queue to be scheduled according to each scheduling period in each time slice, selecting a message to be transmitted and at least one alternative message from the effective queue, and adding each alternative message into an alternative set;
the first judgment module is connected with the message selection module and used for scheduling and transmitting the message to be transmitted when judging that the message to be transmitted can be transmitted in the current time slice, then entering the next scheduling period, and outputting an alternative signal when the message to be transmitted can not be transmitted in the current time slice;
and the second judgment module is respectively connected with the message selection module and the first judgment module and used for scheduling and transmitting the corresponding alternative message according to the alternative signal when judging that the alternative message which can be transmitted in the current time slice exists in the alternative set, and then waiting for entering the next time slice.
7. The time-aware scheduler of claim 6, wherein the packet selecting module selects a packet with the shortest packet length from all the active queues to be added as the candidate packet into the candidate set.
8. The time-aware scheduler of claim 6, wherein the packet selection module adds the packet in the active queue as the candidate packet to the candidate set;
the second determining module includes:
a judging unit, configured to, in the alternative set, judge that the alternative packet with the shortest packet length can output a scheduling signal when the transmission of the current time slice is completed;
the scheduling unit is connected with the judging unit and used for scheduling and transmitting the alternative message with the shortest message length according to the scheduling signal and then updating the alternative set;
the judging unit judges whether the alternative packet with the shortest packet length in the updated alternative set can be transmitted in the current time slice or not until the alternative packet with the shortest packet length in the alternative set cannot be transmitted in the current time slice.
9. The time-aware scheduler of claim 6, wherein a gating list is pre-configured in the time-sensitive network, and a gating state of each queue to be scheduled in each time slice is configured in the gating list;
and triggering to scan the effective queue in each queue to be scheduled when detecting that any gating state changes, or when an empty queue exists in each queue to be scheduled and a message arrives in the empty queue, or when the last message to be transmitted is scheduled and transmitted.
10. The time-aware scheduler of claim 6, wherein the packet selection module selects the packet to be transmitted from the active queue using a priority policy or a round robin policy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111564371.9A CN114401233A (en) | 2021-12-20 | 2021-12-20 | Message scheduling method of time-aware scheduler and time-aware scheduler |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111564371.9A CN114401233A (en) | 2021-12-20 | 2021-12-20 | Message scheduling method of time-aware scheduler and time-aware scheduler |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114401233A true CN114401233A (en) | 2022-04-26 |
Family
ID=81227166
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111564371.9A Pending CN114401233A (en) | 2021-12-20 | 2021-12-20 | Message scheduling method of time-aware scheduler and time-aware scheduler |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114401233A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107682417A (en) * | 2017-09-19 | 2018-02-09 | 深圳市盛路物联通讯技术有限公司 | The method for allocating tasks and device of a kind of back end |
| CN111224895A (en) * | 2019-12-27 | 2020-06-02 | 全球能源互联网研究院有限公司 | Time-sensitive message transmission method, device and equipment in HSR network |
| WO2020155185A1 (en) * | 2019-02-03 | 2020-08-06 | 华为技术有限公司 | Message scheduling method, scheduler, network device and network system |
| CN112737979A (en) * | 2021-01-29 | 2021-04-30 | 西安电子科技大学 | Best effort flow scheduling method for time sensitive network |
-
2021
- 2021-12-20 CN CN202111564371.9A patent/CN114401233A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107682417A (en) * | 2017-09-19 | 2018-02-09 | 深圳市盛路物联通讯技术有限公司 | The method for allocating tasks and device of a kind of back end |
| WO2020155185A1 (en) * | 2019-02-03 | 2020-08-06 | 华为技术有限公司 | Message scheduling method, scheduler, network device and network system |
| CN111224895A (en) * | 2019-12-27 | 2020-06-02 | 全球能源互联网研究院有限公司 | Time-sensitive message transmission method, device and equipment in HSR network |
| CN112737979A (en) * | 2021-01-29 | 2021-04-30 | 西安电子科技大学 | Best effort flow scheduling method for time sensitive network |
Non-Patent Citations (1)
| Title |
|---|
| 贾正义;陈晓;: "时间感知整形调度技术研究", 网络新媒体技术, no. 04, 15 July 2020 (2020-07-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Cicconetti et al. | Quality of service support in IEEE 802.16 networks | |
| KR101977523B1 (en) | Method of traffic shaping of data frames in a network and its devices and computer programs | |
| US7613114B2 (en) | Packet scheduling apparatus | |
| US6879561B1 (en) | Method and system for wireless packet scheduling with per packet QoS support and link adaptation | |
| CN106304377B (en) | Method and equipment for scheduling | |
| EP1117213A2 (en) | Packet switch device and scheduling control method | |
| KR20050095307A (en) | Apparatus and method of scheduling for processing packet data in a wireless communication system | |
| US20090103438A1 (en) | Grant Based Adaptive Media Access Control Scheduling | |
| CN113383505A (en) | Signaling of de-jitter buffer capability for TSN integration | |
| EP1376948A1 (en) | Quality of service scheduling for packet switched data services | |
| WO2021148152A1 (en) | Mechanism to control forwarding of deterministic data flow | |
| US9756654B2 (en) | Timer-based scheme for user equipment queue state estimation | |
| Marau et al. | Utilization-based schedulability analysis for switched Ethernet aiming dynamic QoS management | |
| EP2556714B1 (en) | Method and node for handling queues in communication networks, and corresponding computer program product | |
| CN1939005A (en) | Expedited data transmission in packet based network | |
| CN114221912B (en) | Time-sensitive network access method for non-periodic time-triggered service flow | |
| Kaur et al. | Core-stateless guaranteed throughput networks | |
| Ternon et al. | FTT-openFlow, on the way towards real-time SDN | |
| US8355403B2 (en) | Stale data removal using latency count in a WiMAX scheduler | |
| CN114401233A (en) | Message scheduling method of time-aware scheduler and time-aware scheduler | |
| Hassani et al. | Work-in-progress: Layering concerns for the analysis of credit-based shaping in IEEE 802.1 TSN | |
| Benzaoui | Deterministic latency networks for 5G applications | |
| CN114500520A (en) | Data transmission method, device and communication node | |
| Liebeherr et al. | A versatile packet multiplexer for quality-of-service networks | |
| Lazzez et al. | Segments-priorities based contention resolution technique for QoS support in optical burst-switched networks |
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 |