CN117596201A - Combined routing scheduling method and device based on cyclic queuing forwarding mechanism - Google Patents
Combined routing scheduling method and device based on cyclic queuing forwarding mechanism Download PDFInfo
- Publication number
- CN117596201A CN117596201A CN202311564657.6A CN202311564657A CN117596201A CN 117596201 A CN117596201 A CN 117596201A CN 202311564657 A CN202311564657 A CN 202311564657A CN 117596201 A CN117596201 A CN 117596201A
- Authority
- CN
- China
- Prior art keywords
- time
- scheduling
- flow
- path
- 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 38
- 230000007246 mechanism Effects 0.000 title claims abstract description 32
- 125000004122 cyclic group Chemical group 0.000 title claims abstract description 26
- 238000002347 injection Methods 0.000 claims abstract description 34
- 239000007924 injection Substances 0.000 claims abstract description 34
- 230000005540 biological transmission Effects 0.000 claims description 25
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012163 sequencing technique Methods 0.000 claims description 10
- 102100023444 Centromere protein K Human genes 0.000 claims description 6
- 101000907931 Homo sapiens Centromere protein K Proteins 0.000 claims description 6
- 238000011144 upstream manufacturing Methods 0.000 claims description 6
- 241001522296 Erithacus rubecula Species 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 230000000737 periodic effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 239000000243 solution Substances 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000007493 shaping process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000452 restraining effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/6225—Fixed service order, e.g. Round Robin
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The invention discloses a joint routing scheduling method and a device based on a cyclic queuing forwarding mechanism, wherein the method comprises the steps of obtaining characteristic information of a flow to be scheduled, including a source end and a destination end; determining a scheduling overcycle T according to the cycle time of the stream, and restricting core information in the characteristic information through the T; determining a scheduling path of the flow according to a shortest path algorithm according to a source end and a destination end of the flow; the method comprises the steps of sorting flows according to set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on injection time of time sensitive flows on a scheduling path of each flow to finish joint routing scheduling.
Description
Technical Field
The invention relates to a joint routing scheduling method and device based on a cyclic queuing forwarding mechanism, and belongs to the technical field of routing allocation.
Background
Along with the development of the industrial Internet of things, the age of intelligent manufacturing brings about new rapid development. But also puts higher demands on real-time and deterministic transmission of information. The traditional Ethernet has great advantages in the aspects of expandability, cost characteristics and the like, and is not suitable for the application with high requirements on real-time performance and safety. Today, to ensure deterministic transmission of real-time data, many solutions like EtherCAT, powerlink, PROFINET IRT, etc. have been developed in industrial automation networks. However, conventional fieldbuses and industrial ethernet are always incompatible. Time Sensitive Networks (TSNs) are a standard developed by TSN working groups in the IEEE802.1 working group, the predecessor of which is the audio/video bridging (AVB) task group, and names change as standardized working groups work expands. TSN working groups have been working on standardizing real-time and safety critical mechanisms of ethernet so that time-sensitive and non-time-sensitive streams coexist in ethernet, providing deterministic latency guarantees for industrial communications.
The flow scheduling problem has been demonstrated as a study of the NP-hard problem with respect to the resource scheduling problem as long as it is developed from the scheduling model of the data plane and the scheduling algorithm of the control plane. The control plane builds constraint conditions according to the flow and the characteristics of the scheduling model, solves a feasible scheduling scheme by using a scheduling algorithm, and configures the data plane according to the scheduling scheme. Ieee802.1qch proposes a traffic shaping mechanism for round robin queuing forwarding, which can be seen as a simplified form of TAS mechanism, which provides a deterministic and computationally easy delay service for critical data flows through traffic shaping. Most scheduling schemes today do not take into account the effect of the network topology, considering only the case of one switch.
Disclosure of Invention
The invention aims to overcome the defects in the prior art, provides a joint routing scheduling method and a joint routing scheduling device based on a cyclic queuing forwarding mechanism, considers constraint conditions of various scheduling scheme influences, provides a solution on finding injection time slots, and increases the number of schedulable flows.
In order to achieve the above purpose, the invention is realized by adopting the following technical scheme:
in a first aspect, the present invention provides a joint routing scheduling method based on a cyclic queuing forwarding mechanism, including:
acquiring characteristic information of a flow to be scheduled, wherein the characteristic information comprises a source end and a destination end;
determining a scheduling overcycle T according to the cycle time of the stream, and restricting core information in the characteristic information through the T;
determining a scheduling path of the flow according to a shortest path algorithm according to a source end and a destination end of the flow;
ordering the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on the injection time of the time sensitive stream on the scheduling path of each stream to finish joint routing scheduling.
Further, the determining the scheduling supersycle T according to the cycle time of the flow, and constraining the core information in the feature information through T includes:
determining a scheduling overcycle T according to the cycle time of the flow, setting the overcycle T as the least common multiple of all flow cycles, and adopting the following formula:
T＝LCM(f i .prd)
f i prd the flow period, LCM the least common multiple to all flow periods;
the data frame transmission offset is constrained so that the injection time slot of each data frame in the source switch does not exceed the number of time slots in each period, and the formula is as follows:
f i OFFSET represents data frame OFFSET, SLOT represents minimum time SLOT;
the receiving window is adjusted so that the time slot of the downstream switch receiving the message is the same as the time slot of the upstream switch sending the message Wen Shixi, and the time slot of each hop for the time sensitive stream is:
wherein T is SLOT Representing the time slot of the stream at each hop, f i .PATH(SW i ) Indicating that the switch is at f i The number of hops on the path;
and constraining the end-to-end time delay so that when the transmission time of the time-sensitive stream from the source end to the destination end is less than or equal to the cut-off time of the stream, the formula is as follows:
wherein,representing the total number of hops of the switch on the flow path, f i OFFSET represents the data frame OFFSET; restricting the buffer resource of the switch queue so that the total size of the data packets in the queue does not exceed the buffer size of the queue, and the flow transmitted by the sending queue does not exceed the bandwidth size of the queue, and setting flow f i Is passed through in time slot tSwitch SW k Then Q (i, m, k, t) =1, the form of the queue cache resource constraint is as follows:
wherein L is queue Indicating the length of the cache queue,for data stream f i The number of data frames which will be cycled in a scheduling large period T, f i Size represents packet size, SOLT represents minimum slot length;
the queue bandwidth resources are constrained as follows:
wherein B is the link transmission rate, SLOT is the minimum SLOT length, f i PATH represents the flow PATH, SW k Representing a switch.
Further, when determining the scheduling paths of the flows according to the shortest path algorithm according to the source end and the destination end of the flows, it is required to ensure that the source end switch and the destination switch of each time-sensitive flow are not the same switch.
Further, in the sorting of the streams according to the set parameters, the set parameters include path length, message size, period size, and allowed end-to-end delay.
Further, sorting the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that each constraint is satisfied, and performing offset adjustment on the injection time of the time sensitive stream on a scheduling path of each stream to complete joint routing scheduling, wherein the method comprises the following steps:
retrieving, for each switch present on the path, its time slot that satisfies the offset constraint;
retrieving whether each exchanger has continuous time slots meeting a cyclic queuing forwarding mechanism;
the method comprises the steps of performing queue resource sequencing on the searched continuous time slots, finding out a time slot with the minimum network resource utilization rate, and performing time slot offset on a source-end switch;
judging end-to-end time delay constraint, and if the end-to-end time delay constraint is met, successful scheduling is performed;
returning the number of successfully scheduled streams.
In a second aspect, the present invention provides a joint routing scheduling device based on a cyclic queuing forwarding mechanism, including:
the acquisition module is used for acquiring characteristic information of the flow to be scheduled, and comprises a source end and a destination end;
the constraint module is used for determining a scheduling overcycle T according to the cycle time of the flow, and constraining the core information in the characteristic information through the T;
the path determining module is used for determining the scheduling path of the flow according to a shortest path algorithm according to the source end and the destination end of the flow;
and the scheduling module is used for sequencing the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on the injection time of the time-sensitive stream on the scheduling path of each stream to finish the joint routing scheduling.
Further, in the constraint module, a scheduling supersycle T is determined according to a cycle time of the flow, and the constraint is performed on core information in the feature information through T, including:
determining a scheduling overcycle T according to the cycle time of the flow, setting the overcycle T as the least common multiple of all flow cycles, and adopting the following formula:
T＝LCM(f i .prd)
f i prd the flow period, LCM the least common multiple to all flow periods;
the data frame transmission offset is constrained so that the injection time slot of each data frame in the source switch does not exceed the number of time slots in each period, and the formula is as follows:
f i OFFSET represents data frame OFFSET, SLOT represents minimum time SLOT;
the receiving window is adjusted so that the time slot of the downstream switch receiving the message is the same as the time slot of the upstream switch sending the message Wen Shixi, and the time slot of each hop for the time sensitive stream is:
wherein T is SLOT Representing the time slot of the stream at each hop, f i .PATH(SW i ) Indicating that the switch is at f i The number of hops on the path;
and constraining the end-to-end time delay so that when the transmission time of the time-sensitive stream from the source end to the destination end is less than or equal to the cut-off time of the stream, the formula is as follows:
wherein,representing the total number of hops of the switch on the flow path, f i OFFSET represents the data frame OFFSET; restricting the buffer resource of the switch queue so that the total size of the data packets in the queue does not exceed the buffer size of the queue, and the flow transmitted by the sending queue does not exceed the bandwidth size of the queue, and setting flow f i The mth message of (2) passes through the switch SW in time slot t k Then Q (i, m, k, t) =1, the form of the queue cache resource constraint is as follows:
wherein L is queue Indicating the length of the cache queue,for data stream f i The number of data frames which will be cycled in a scheduling large period T, f i Size represents packet size, SOLT represents minimum slot length;
the queue bandwidth resources are constrained as follows:
wherein B is the link transmission rate, SLOT is the minimum SLOT length, f i PATH represents the flow PATH, SW k Representing a switch.
Further, in the scheduling module, the flows are ordered according to the set parameters, and under the condition that each constraint is satisfied, an algorithm for searching injection time slots is called, and on a scheduling path of each flow, the injection time of the time sensitive flow is subjected to offset adjustment, so that the joint routing scheduling is completed, and the method comprises the following steps:
retrieving, for each switch present on the path, its time slot that satisfies the offset constraint;
retrieving whether each exchanger has continuous time slots meeting a cyclic queuing forwarding mechanism;
the method comprises the steps of performing queue resource sequencing on the searched continuous time slots, finding out a time slot with the minimum network resource utilization rate, and performing time slot offset on a source-end switch;
judging end-to-end time delay constraint, and if the end-to-end time delay constraint is met, successful scheduling is performed;
returning the number of successfully scheduled streams.
In a third aspect, the present invention provides an electronic device, comprising a processor and a storage medium;
the storage medium is used for storing instructions;
the processor is operative according to the instructions to perform the steps of the method according to any one of the preceding claims.
In a fourth aspect, the present invention provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of any of the methods described in the preceding claims.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a joint route scheduling method and a device based on a cyclic queuing forwarding mechanism, which utilize minimum route planning, stream sequencing and time slot injection adjustment to schedule time-sensitive streams.
Drawings
Fig. 1 is a schematic diagram of a cyclic queuing forwarding mechanism according to an embodiment of the present invention;
fig. 2 is a schematic diagram of the number of successful stream numbers scheduled in four ordering manners according to the embodiment of the present invention;
fig. 3 is a schematic diagram of the effect of the queue length on the number of stream schedules according to an embodiment of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings. The following examples are only for more clearly illustrating the technical aspects of the present invention, and are not intended to limit the scope of the present invention.
Example 1
The embodiment introduces a joint routing scheduling method based on a cyclic queuing forwarding mechanism, which comprises the following steps:
acquiring characteristic information of a flow to be scheduled, wherein the characteristic information comprises a source end and a destination end;
determining a scheduling overcycle T according to the cycle time of the stream, and restricting core information in the characteristic information through the T;
determining a scheduling path of the flow according to a shortest path algorithm according to a source end and a destination end of the flow;
ordering the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on the injection time of the time sensitive stream on the scheduling path of each stream to finish joint routing scheduling.
The invention is described in further detail below with reference to the drawings.
Cyclic queuing forwarding mechanism in time sensitive networks as shown in fig. 1, the cyclic queuing forwarding mechanism divides two queues into a group, and the queues in a group cannot be opened at the same time. When the time slot is odd, the gate of the queue 1 is opened, and data can be sent to the next switch, but at the same time, the gate of the queue 2 needs to be closed, so that the data cannot be transmitted, and only the data packet can be received and buffered. At even slots, 2 queue states are interchanged.
The time sensitive stream is a periodic stream and directly calculating the transmission schedule of the data stream at each time slot is not possible. Since the transmission of the data stream is also periodic, we find a large scheduling period T, which is set to the least common multiple of all stream periods. And finally, when the flow scheduling experiment is carried out, the flow scheduling experiment can be scheduled within the scheduling period T.
In determining the source switch and the destination switch, it is necessary to ensure that the source and destination switches are not the same switch. And obtaining a flow path according to a minimum path algorithm according to the determined source end, the determined destination end and the determined network topology. Since the queue length is limited, once the amount of data exceeds the buffer size, queue overflow occurs and packets are discarded. The occurrence of such phenomena can be effectively avoided by pre-allocating resources in advance at the source switch offset time slot. However, when the flow offset is too large, the delay of the flow increases, and the allowable end-to-end delay may not be satisfied.
The application process of the joint routing scheduling method based on the cyclic queuing forwarding mechanism provided by the embodiment specifically relates to the following steps:
step one: the method comprises the steps of obtaining characteristic information of a flow to be scheduled, and restraining core information:
(1) Scheduling a supersycle constraint:
the time sensitive stream is a periodic stream and directly calculating the transmission schedule of the data stream at each time slot is not possible. Since the transmission of the data stream is also periodic, we find a large scheduling period T, which is set to the least common multiple of all stream periods, namely:
T＝LCM(f i .prd)
f i prd the flow period, LCM the least common multiple to all flow periods;
(2) Frame transmission offset constraint
The injected time slots of each data frame at the source switch should not exceed the number of time slots per cycle. Namely:
f i OFFSET represents data frame OFFSET, SLOT represents minimum time SLOT;
the reasonable offset time slot of the switch at the source end can lead the resources to be more reasonably allocated, thereby enabling more streams to be transmitted.
(3) Accepting window constraints:
this constraint needs to ensure that when there is a switch on it to transmit a flow, there are sufficient network resources for the downstream switch to accept the packet. The time slot of the downstream switch receiving the message should be the same as the time slot of the upstream switch sending the message. The time slots at each hop for the time sensitive stream are:
wherein T is SLOT Representing the time slot of the stream at each hop, f i .PATH(SW i ) Indicating that the switch is at f i The number of hops on the path.
(4) End-to-end delay constraint:
when the transmission time of a bias time sensitive stream from a source to a destination should be less than or equal to the deadline of the stream, namely:
wherein,representing the total number of hops of the switch on the flow path, f i OFFSET represents the data frame OFFSET;
(5) Switch queue resource constraints:
the CQF occupies a total of two queues, one for buffering messages and the other for transmitting messages. So at each time slot, buffer memoryThe total size of the packets of the queue should not exceed the queue buffer size and the stream transmitted by the transmit queue should not exceed the queue bandwidth size. If flow f i The mth message of (2) passes through the switch SW in time slot t k Then Q (i, m, kt) =1, the form of the queue cache resource constraint is as follows:
wherein L is queue Indicating the length of the cache queue,for data stream f i The number of data frames which will be cycled in a scheduling large period T, f i Size represents the packet size and SOLT represents the minimum slot length.
The queue bandwidth resource constraints are as follows:
wherein B is the link transmission rate, SLOT is the minimum SLOT length, f i PATH represents the flow PATH, SW k Representing a switch.
The model is to be able to maximize the number of schedulable flows under conditions that meet the above constraints.
Step two: determining a flow scheduling path
And according to the source end and the destination end of the stream, the path of the stream is obtained according to a minimum path algorithm. Where we need to ensure that the source and destination switches of each time sensitive flow are not the same switch.
Step three: the streams are ordered according to set parameters (path length, message size, period size, allowed end-to-end delay).
Each ordering has an impact on the number of last schedulable flows.
Step four: and calling an algorithm for searching injection time slots, and performing offset adjustment on the injection time of the time sensitive stream.
Due to the transmission acceptance mechanism of CQFs, consecutive slots must be found among the available slots of the switches on each path. The available time slots are added to the set continue slot. In order to make the load more balanced, the network resources are fully utilized, and the stream will preferentially select the time slot with low resource utilization rate to inject. And judging the time delay constraint of the selected time slot, and if the allowable end-to-end time delay is met, successful scheduling is realized.
The design of the embodiment has the advantages that:
aiming at the joint routing and scheduling problem in the time-sensitive network, the embodiment provides a joint routing and scheduling problem based on a cyclic queuing forwarding mechanism, and the time-sensitive flow is scheduled by utilizing minimum routing planning, flow sequencing and injection time slot adjustment. The routing and flow scheduling provided by the embodiment has better performance in maximizing the number of flow scheduling, wherein searching for schedulable time slots and judging time slot network resources have better promotion on target results. This embodiment significantly increases the number of schedulable flows.
Example 2
The embodiment provides a joint routing scheduling device based on a cyclic queuing forwarding mechanism, which comprises the following components:
the acquisition module is used for acquiring characteristic information of the flow to be scheduled, and comprises a source end and a destination end;
the constraint module is used for determining a scheduling overcycle T according to the cycle time of the flow, and constraining the core information in the characteristic information through the T;
the path determining module is used for determining the scheduling path of the flow according to a shortest path algorithm according to the source end and the destination end of the flow;
and the scheduling module is used for sequencing the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on the injection time of the time-sensitive stream on the scheduling path of each stream to finish the joint routing scheduling.
In the constraint module, a scheduling overcycle T is determined according to the cycle time of the flow, and core information in the characteristic information is constrained through the T, and the constraint module comprises the following steps:
determining a scheduling overcycle T according to the cycle time of the flow, setting the overcycle T as the least common multiple of all flow cycles, and adopting the following formula:
T＝LCM(f i .prd)
f i prd the flow period, LCM the least common multiple to all flow periods;
the data frame transmission offset is constrained so that the injection time slot of each data frame in the source switch does not exceed the number of time slots in each period, and the formula is as follows:
f i OFFSET denotes data frame OFFSET, SLOT represents the minimum time slot;
the receiving window is adjusted so that the time slot of the downstream switch receiving the message is the same as the time slot of the upstream switch sending the message Wen Shixi, and the time slot of each hop for the time sensitive stream is:
wherein T is SLOT Representing the time slot of the stream at each hop, f i .PATH(SW i ) Indicating that the switch is at f i The number of hops on the path;
and constraining the end-to-end time delay so that when the transmission time of the time-sensitive stream from the source end to the destination end is less than or equal to the cut-off time of the stream, the formula is as follows:
wherein,representing the total number of hops of the switch on the flow path, f i OFFSET represents the data frame OFFSET; restricting the buffer resource of the switch queue so that the total size of the data packets in the queue does not exceed the buffer size of the queue, and the flow transmitted by the sending queue does not exceed the bandwidth size of the queue, and setting flow f i The mth message of (2) passes through the switch SW in time slot t k Then Q (i, m, k, t) =1, the form of the queue cache resource constraint is as follows:
wherein L is queue Indicating the length of the cache queue,for data stream f i The number of data frames which will be cycled in a scheduling large period T, f i Size represents packet size, SOLT represents minimum slot length;
the queue bandwidth resources are constrained as follows:
wherein B is the link transmission rate, SLOT is the minimum SLOT length, f i PATH represents the flow PATH, SW k Representing a switch.
The scheduling module orders the streams according to the set parameters, calls an algorithm for searching injection time slots under the condition that each constraint is satisfied, performs offset adjustment on the injection time of the time sensitive stream on a scheduling path of each stream, and completes joint routing scheduling, and the method comprises the following steps:
retrieving, for each switch present on the path, its time slot that satisfies the offset constraint;
retrieving whether each exchanger has continuous time slots meeting a cyclic queuing forwarding mechanism;
the method comprises the steps of performing queue resource sequencing on the searched continuous time slots, finding out a time slot with the minimum network resource utilization rate, and performing time slot offset on a source-end switch;
judging end-to-end time delay constraint, and if the end-to-end time delay constraint is met, successful scheduling is performed;
returning the number of successfully scheduled streams.
Example 3
The embodiment provides an electronic device, which comprises a processor and a storage medium;
the storage medium is used for storing instructions;
the processor is operative according to the instructions to perform the steps of the method according to any one of embodiment 1.
Example 4
The present embodiment provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method of any of embodiment 1.
The foregoing is merely a preferred embodiment of the present invention, and it should be noted that modifications and variations could be made by those skilled in the art without departing from the technical principles of the present invention, and such modifications and variations should also be regarded as being within the scope of the invention.
It will be appreciated by those skilled in the art that embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the foregoing embodiments are merely for illustrating the technical solution of the present disclosure and not for limiting the scope thereof, and although the present disclosure has been described in detail with reference to the foregoing embodiments, it will be understood by those skilled in the art that various changes, modifications or equivalents may be made to the specific embodiments of the invention after reading the present disclosure, and these changes, modifications or equivalents are within the scope of the claims appended hereto.
Claims (10)
1. A joint route scheduling method based on a cyclic queuing forwarding mechanism is characterized by comprising the following steps:
acquiring characteristic information of a flow to be scheduled, wherein the characteristic information comprises a source end and a destination end;
determining a scheduling overcycle T according to the cycle time of the stream, and restricting core information in the characteristic information through the T;
determining a scheduling path of the flow according to a shortest path algorithm according to a source end and a destination end of the flow;
ordering the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on the injection time of the time sensitive stream on the scheduling path of each stream to finish joint routing scheduling.
2. The joint routing scheduling method based on the cyclic queuing forwarding mechanism according to claim 1, wherein the determining the scheduling supersycle T according to the cycle time of the flow, and constraining the core information in the feature information by T includes:
determining a scheduling overcycle T according to the cycle time of the flow, setting the overcycle T as the least common multiple of all flow cycles, and adopting the following formula:
T＝LCM(f i .prd)
f i prd the flow period, LCM the least common multiple to all flow periods;
the data frame transmission offset is constrained so that the injection time slot of each data frame in the source switch does not exceed the number of time slots in each period, and the formula is as follows:
f i OFFSET represents data frame OFFSET, SLOT represents minimum time SLOT;
the receiving window is adjusted so that the time slot of the downstream switch receiving the message is the same as the time slot of the upstream switch sending the message Wen Shixi, and the time slot of each hop for the time sensitive stream is:
wherein T is SLOT Representing the time slot of the stream at each hop, f i .PATH(SW i ) Indicating that the switch is at f i The number of hops on the path;
and constraining the end-to-end time delay so that when the transmission time of the time-sensitive stream from the source end to the destination end is less than or equal to the cut-off time of the stream, the formula is as follows:
wherein H is fi.PATH Representing the total number of hops of the switch on the flow path, f i OFFSET represents the data frame OFFSET;
restricting the buffer resource of the switch queue so that the total size of the data packets in the queue does not exceed the buffer size of the queue, and the flow transmitted by the sending queue does not exceed the bandwidth size of the queue, and setting flow f i The mth message of (2) passes through the switch SW in time slot t k Then Q (i, m, k, t) =1, the form of the queue cache resource constraint is as follows:
wherein L is queue Indicating the length of the cache queue,for data stream f i The number of data frames which will be cycled in a scheduling large period T, f i Size represents packet size, SOLT represents minimum slot length;
the queue bandwidth resources are constrained as follows:
wherein B is the link transmission rate, SLOT is the minimum SLOT length, f i PATH represents the flow PATH, SW k Representing a switch.
3. The joint routing scheduling method based on the round robin queuing forwarding mechanism according to claim 1, wherein when determining the scheduling paths of the flows according to the shortest path algorithm according to the source and destination of the flows, it is required to ensure that the source and destination switches of each time-sensitive flow are not the same switch.
4. The joint routing scheduling method based on the round robin queuing forwarding mechanism according to claim 1, wherein in the ordering of the flows according to the set parameters, the set parameters include path length, message size, period size, allowed end-to-end delay.
5. The joint routing scheduling method based on the cyclic queuing forwarding mechanism according to claim 1, wherein the flows are ordered according to set parameters, and the find injection time slot algorithm is called to perform offset adjustment on the injection time of the time-sensitive flow on the scheduling path of each flow in case that each constraint is satisfied, so as to complete joint routing scheduling, and the method comprises the following steps:
retrieving, for each switch present on the path, its time slot that satisfies the offset constraint;
retrieving whether each exchanger has continuous time slots meeting a cyclic queuing forwarding mechanism;
the method comprises the steps of performing queue resource sequencing on the searched continuous time slots, finding out a time slot with the minimum network resource utilization rate, and performing time slot offset on a source-end switch;
judging end-to-end time delay constraint, and if the end-to-end time delay constraint is met, successful scheduling is performed;
returning the number of successfully scheduled streams.
6. A joint routing scheduling device based on a cyclic queuing forwarding mechanism, comprising:
the acquisition module is used for acquiring characteristic information of the flow to be scheduled, and comprises a source end and a destination end;
the constraint module is used for determining a scheduling overcycle T according to the cycle time of the flow, and constraining the core information in the characteristic information through the T;
the path determining module is used for determining the scheduling path of the flow according to a shortest path algorithm according to the source end and the destination end of the flow;
and the scheduling module is used for sequencing the streams according to the set parameters, calling an algorithm for searching injection time slots under the condition that all constraints are met, and performing offset adjustment on the injection time of the time-sensitive stream on the scheduling path of each stream to finish the joint routing scheduling.
7. The joint routing scheduling device based on the cyclic queuing forwarding mechanism according to claim 6, wherein the constraint module determines a scheduling supersycle T according to a cycle time of a flow, and constrains core information in feature information by T, including:
determining a scheduling overcycle T according to the cycle time of the flow, setting the overcycle T as the least common multiple of all flow cycles, and adopting the following formula:
T＝LCM(f i .prd)
f i prd the flow period, LCM the least common multiple to all flow periods;
the data frame transmission offset is constrained so that the injection time slot of each data frame in the source switch does not exceed the number of time slots in each period, and the formula is as follows:
f i OFFSET represents data frame OFFSET, SLOT represents minimum time SLOT;
the receiving window is adjusted so that the time slot of the downstream switch receiving the message is the same as the time slot of the upstream switch sending the message Wen Shixi, and the time slot of each hop for the time sensitive stream is:
wherein T is SLOT Representing the time slot of the stream at each hop, f i .PATH(SW i ) Indicating that the switch is at f i The number of hops on the path;
and constraining the end-to-end time delay so that when the transmission time of the time-sensitive stream from the source end to the destination end is less than or equal to the cut-off time of the stream, the formula is as follows:
wherein H is fi.PATH Representing the total number of hops of the switch on the flow path, f i OFFSET represents the data frame OFFSET;
restricting the buffer resource of the switch queue so that the total size of the data packets in the queue does not exceed the buffer size of the queue, and the flow transmitted by the sending queue does not exceed the bandwidth size of the queue, and setting flow f i The mth message of (2) passes through the switch SW in time slot t k Then Q (i, m, k, t) =1, the form of the queue cache resource constraint is as follows:
wherein L is queue Indicating the length of the cache queue,for data stream f i The number of data frames which will be cycled in a scheduling large period T, f i Size represents packet size, SOLT represents minimum slot length;
the queue bandwidth resources are constrained as follows:
wherein B is the link transmission rate, SLOT is the minimum SLOT length, f i PATH represents the flow PATH, SW k Representing a switch.
8. The joint routing scheduling method based on the cyclic queuing forwarding mechanism according to claim 6, wherein the scheduling module orders the flows according to set parameters, calls an algorithm for searching injection time slots in case of meeting each constraint, performs offset adjustment on injection time of a time-sensitive flow on a scheduling path of each flow, and completes joint routing scheduling, and the method comprises the following steps:
retrieving, for each switch present on the path, its time slot that satisfies the offset constraint;
retrieving whether each exchanger has continuous time slots meeting a cyclic queuing forwarding mechanism;
the method comprises the steps of performing queue resource sequencing on the searched continuous time slots, finding out a time slot with the minimum network resource utilization rate, and performing time slot offset on a source-end switch;
judging end-to-end time delay constraint, and if the end-to-end time delay constraint is met, successful scheduling is performed;
returning the number of successfully scheduled streams.
9. An electronic device, characterized in that: comprises a processor and a storage medium;
the storage medium is used for storing instructions;
the processor being operative according to the instructions to perform the steps of the method according to any one of claims 1 to 5.
10. A computer-readable storage medium having stored thereon a computer program, characterized by: the program, when executed by a processor, implements the steps of the method of any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311564657.6A CN117596201A (en) | 2023-11-22 | 2023-11-22 | Combined routing scheduling method and device based on cyclic queuing forwarding mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311564657.6A CN117596201A (en) | 2023-11-22 | 2023-11-22 | Combined routing scheduling method and device based on cyclic queuing forwarding mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117596201A true CN117596201A (en) | 2024-02-23 |
Family
ID=89921371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311564657.6A Pending CN117596201A (en) | 2023-11-22 | 2023-11-22 | Combined routing scheduling method and device based on cyclic queuing forwarding mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117596201A (en) |
-
2023
- 2023-11-22 CN CN202311564657.6A patent/CN117596201A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gavriluţ et al. | Scheduling in time sensitive networks (TSN) for mixed-criticality industrial applications | |
| Gavriluţ et al. | AVB-aware routing and scheduling of time-triggered traffic for TSN | |
| Nayak et al. | Incremental flow scheduling and routing in time-sensitive software-defined networks | |
| Laursen et al. | Routing optimization of AVB streams in TSN networks | |
| Craciunas et al. | An overview of scheduling mechanisms for time-sensitive networks | |
| Imtiaz et al. | A performance study of Ethernet Audio Video Bridging (AVB) for Industrial real-time communication | |
| CN114422448B (en) | Time-sensitive network traffic shaping method | |
| CN112311494B (en) | Message transmission method, device and system | |
| CN114448894B (en) | Multi-level service scheduling engine for time sensitive network and implementation method | |
| CN112468412A (en) | Method for generating schedules for mixed-critical computer networks | |
| TWI665896B (en) | Method, entity and program for transmitting communication signal frames | |
| CN111030835A (en) | Task scheduling model of TTFC network and message scheduling table generation method | |
| CN113498106A (en) | Scheduling method and device for time-sensitive network TSN (transport stream network) stream | |
| Huang et al. | TACQ: Enabling zero-jitter for cyclic-queuing and forwarding in time-sensitive networks | |
| Deng et al. | A low-delay AVB flow scheduling method occupying the guard band in Time-Sensitive Networking | |
| CN112688812B (en) | Reliability perception time-sensitive network routing method applied to power data transmission | |
| CN115604193B (en) | Deterministic resource scheduling method and system in hot rolling control system | |
| US11943046B2 (en) | Method to configure real-time communications in a network with time-triggered and rate-constrained traffic | |
| Ashjaei et al. | Response time analysis of multi-hop HaRTES ethernet switch networks | |
| CN117596201A (en) | Combined routing scheduling method and device based on cyclic queuing forwarding mechanism | |
| CN114615205B (en) | Mixed flow scheduling method under time sensitive network based on time benefit function | |
| Zhao et al. | Improving worst-case end-to-end delay analysis of multiple classes of AVB traffic in TSN networks using network calculus | |
| CN114500520A (en) | Data transmission method, device and communication node | |
| Benammar et al. | Timing analysis of AVB Ethernet network using the forward end-to-end delay analysis | |
| CN114785738B (en) | Scheduling method and device of time-sensitive flow and electronic equipment |
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 |