CN111030942B - TTE network offline scheduling method based on response constraint - Google Patents
TTE network offline scheduling method based on response constraint Download PDFInfo
- Publication number
- CN111030942B CN111030942B CN201911072758.5A CN201911072758A CN111030942B CN 111030942 B CN111030942 B CN 111030942B CN 201911072758 A CN201911072758 A CN 201911072758A CN 111030942 B CN111030942 B CN 111030942B
- Authority
- CN
- China
- Prior art keywords
- information
- period
- response
- scheduling
- network
- 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.)
- Active
Links
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/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2416—Real-time traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/525—Queue scheduling by attributing bandwidth to queues by redistribution of residual bandwidth
-
- 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
-
- 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/58—Changing or combining different scheduling modes, e.g. multimode scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the field of aerospace communication, and provides a TTE network offline scheduling table generation method suitable for response constraint in order to introduce TT response constraint. Therefore, the technical scheme adopted by the invention is that the TTE network offline scheduling method based on response constraint comprises the following steps: 1) TTE mixed flow partition scheduling; 2) the design principle of the periodic schedule table is based on the TT information constraint response, the TT information constraint response is considered in a basic scheduling mode of TTE mixed flow partition scheduling, the TT information response priority condition is added into the generation factors of the periodic schedule table, meanwhile, a strategy that all TT information is firstly generated into a composite schedule table and then is issued to each port node is adopted, and the periodic schedule table generation process is simplified. The invention is mainly applied to the aerospace communication occasions.
Description
Technical Field
The invention belongs to the field of aerospace communication, and relates to the field of time-triggered Ethernet. In particular to a TTE network offline scheduling method based on response constraint.
Background
With the continuous development and progress of aerospace technology, aerospace technology has been widely beneficial to all mankind in civil fields, and especially reaches unprecedented heights in the fields of space exploration, satellite navigation, meteorological observation, extraterrestrial life exploration and the like. But also causes the increasing complexity of the whole spacecraft system, although the spacecraft system is subjected to the multiple updating and upgrading of electronic technology, the processing capacity of each single-machine device is greatly improved, but the interconnection transmission system between the devices is slightly lagged behind.
Time-triggered Ethernet (TTE) is a new high-speed, real-Time, fault-tolerant Ethernet network communication technology combining high-real-Time services and traditional best effort services, and has a high value in the aspect of transmission technology application in the field of aerospace. The time-triggered ethernet network utilizes three infrastructures, namely a synchronization controller sm (synchronization master), a synchronization client sc (synchronization client), and a compression controller cm (compression master), to ensure time synchronization of the whole network. Meanwhile, for the real-Time performance and the security of the TTE network, transmission traffic is divided into Time-Triggered TT (Time-Triggered) traffic, Rate-limited RC (Rate-Constrained) traffic and Best-Effort BE (Best-Effort) traffic according to Time key characteristics.
The TTE network adopts a mixed flow scheduling mode, reasonable time planning and design of a time scheduling table, so that three different transmission rules in the network and information streams with priorities are reasonably transmitted, delay is reduced, and collision and loss of important information in a time window under link contention and conflict are avoided. At present, domestic and foreign research focuses on the optimized scheduling design of the TTE network. The TT schedule is designed offline in document [1] using a Tabu (Tabu) search algorithm. Document [2] proposes a scheduling strategy for converting TT into TT-RC, which ensures that TT information is not lost due to time window collision. Document [3] describes a method for generating a periodic schedule offline and dynamically, with mixed traffic zone scheduling. Document [4] proposes a method of partition design of a periodic schedule table using a priori scheduling and a posteriori dilution. The time-triggered Ethernet reasonably schedules the mixed flow, realizes the conflict-free composition of different task flows, avoids the contention of data frames for links, and ensures the real-time performance and the accuracy of communication tasks [5-7 ].
Disclosure of Invention
In order to overcome the defects of the prior art, the invention aims to introduce TT response constraint and design a TTE network offline scheduling table generation method suitable for the existence of response constraint. Therefore, the technical scheme adopted by the invention is that the TTE network offline scheduling method based on response constraint comprises the following steps:
1) TTE mixed traffic zone scheduling
TTE networks are classified into three categories according to the time importance of traffic: TT information has very high real-time requirement, its waiting time, delay, jitter, etc. are all fixed, all TT information is sent on time according to the good scheduling table that is designed in advance, have the highest priority in all information; RC information needs to guarantee the maximum bandwidth interval and is sent in an idle area where TT information is sent; the BE information uses the remaining bandwidth of the network and has a higher priority than the TT and RC messages;
the TTE period schedule contents of the hybrid scheduling mode are as follows: a plurality of basic cycles BC (basic cycle) form a matrix cycle MC (matrix cycle) of TT, the basic cycle is the greatest common divisor of all TT flow cycles, the matrix cycle is the least common multiple of all TT flow cycles, a cycle schedule table is n parallel basic cycles in longitudinal view, the basic cycles are sequentially connected end to end, the total time of the n basic cycles is the time length of the matrix cycle, and each basic cycle is composed of a TT frame in the first half and an RC + BE frame in the second half in transverse view;
2) design principle of periodic schedule table
The periodic scheduling table based on TT information constraint response introduces the consideration of TT information constraint response under the basic scheduling mode of TTE mixed flow partition scheduling, adds the TT information response priority condition into the generating factors of the periodic scheduling table, and simultaneously adopts the strategy that all TT information generates a composite scheduling table firstly and then is issued to each port node, thereby simplifying the periodic scheduling table generating process.
The specific process is as follows:
(1) summarizing all TT information tasks in the network;
(2) the n TT information periods are period respectively, the basic period and the matrix period length are calculated according to different TT information periods, and a composite scheduling table is designed and generated;
fundamental period BC of
BC＝ngcd(periodi)i＝1,2,3...n
Matrix period MC of
MC＝nlcm(periodi)i＝1,2,3...n
(3) Adding a constraint rule of TT information, namely the order of receiving TT by each receiving terminal;
(4) counting the ith TT information needing to be received of each receiving end, and grouping, wherein the TT information at the same receiving level is a grouping unit;
(5) classifying the packet units with the same TT period;
(6) sequentially performing off-line design of a composite period scheduling table on each grouping unit according to the receiving level sequence until all grouping units are circulated, wherein the generation principle is as follows:
(7) and allocating the periodic scheduling tables of the ports according to the composite table so as to ensure that the TT flow is composited in the switch without conflict.
Designing periodic scheduling table generating software, wherein the software specifically comprises the following steps:
(1) a topology generation step: the number of the sending ends, the number of the switches and the number of the receiving ends which need to be designed can be input by a software user in the part, and the sending ends, the receiving ends and the switches in the network can be generated on the display interface by clicking the generation button;
(2) a connection generation step: connecting different nodes in a network to generate a connecting line in a network topology;
(3) task add button part: response constraints of TT tasks and TT tasks in a network are added, a corresponding button is clicked, a TXT document of corresponding information is added, the TXT document is the added TT information, the information meanings are respectively a sending receiving end number, a switchboard number, a time slot length and a cycle length, and FIG. 5 shows the added TT information constraints and TT information of the same priority level of each terminal is written in sequence;
(4) generating a table and clearing, namely generating a network period scheduling table function and clearing an existing topology function;
(5) and a display step, namely displaying the design topological structure, clicking different nodes of the display interface, and displaying the corresponding scheduling table.
The invention has the characteristics and beneficial effects that:
the invention improves the method for generating the offline periodic scheduling table based on the TTE network mixed flow partition scheduling model.
(1) The method comprises the steps of comprehensively considering various factors of TT information period schedule design, providing a method for generating an offline period schedule under the constraint of TT information response, simplifying a period schedule design process by using a method for generating a mixed period schedule, designing a period schedule implementation method flow based on the TT response constraint, and verifying the reasonable row of the method through a concrete network TT information example.
(2) The software is provided with a visual topological interface and a periodic schedule generation flow, and the feasibility and the rationality of the method are verified by carrying out example verification on the provided method through the software, and meanwhile, the reasonability and the reliability of the design of the software for generating the offline periodic schedule are proved.
Description of the drawings:
fig. 1 is a schematic diagram of periodic scheduling.
FIG. 2 is a flow of cycle schedule design based on response constraints.
FIG. 3 off-line periodic schedule generation software.
Fig. 4 adds a TT information document.
Fig. 5 adds a constraint information document.
Fig. 6 is a simple network topology connection scenario.
Fig. 7 is a simple network cycle schedule generation scenario.
Detailed Description
TT response constraint is introduced based on the existing TTE mixed flow partition scheduling strategy, and a TTE network offline scheduling table generation method suitable for the existing response constraint is designed. The strategy of comprehensively compounding the network flow information and then refining the scheduling tables of different terminal nodes is adopted, the scheduling table generation method is simplified, and off-line scheduling table generation software is designed and verified through examples.
TTE Mixed traffic zone scheduling
TTE networks are classified into three categories according to the time importance of traffic: TT information has very high real-time requirement, its waiting time, delay, jitter, etc. are all fixed, all TT information is sent on time according to the good scheduling table that is designed in advance, have the highest priority in all information; RC information needs to guarantee the maximum bandwidth interval and is sent in an idle area where TT information is sent; the BE information uses the remaining bandwidth of the network and has a higher priority than the TT and RC messages.
TTE cycle schedule of hybrid scheduling mode As shown in FIG. 1, several basic cycles BC (basic cycle) constitute a matrix cycle MC (matrix cycle) of TT. The basic period is the greatest common divisor of all TT flow periods, and the matrix period is the least common multiple of all TT flow periods. The period schedule is n basic periods which are parallel seen from the longitudinal direction, and are sequentially connected end to end, and the total time of the n basic periods is the time length of the matrix period. Each basic period is composed of TT frame of the first half and RC + BE frame of the second half as viewed in the lateral direction.
2. Design principle of periodic schedule table
The periodic scheduling table based on the TT information constraint response introduces the consideration of the TT information constraint response under the basic scheduling mode of mixed flow partition scheduling, and adds the TT information response priority condition into the generation factors of the periodic scheduling table. Meanwhile, a strategy that all TT information is adopted to generate a composite scheduling table firstly and then is issued to each port node is adopted, and the generation process of the periodic scheduling table is simplified.
The specific method comprises the following steps:
(1) all TT information tasks in the network are summarized,
(2) the n TT information periods are period respectivelyiCalculating the lengths of a basic cycle and a matrix cycle according to different TT information cycles, and designing and generating a composite scheduling table;
fundamental period BC of
BC＝ngcd(periodi)i＝1,2,3...n
Matrix period MC of
MC＝nlcm(periodi)i＝1,2,3...n
(3) Adding a constraint rule of TT information, namely the order of receiving TT by each receiving terminal;
(4) counting the ith TT information needing to be received of each receiving end, and grouping, wherein the TT information at the same receiving level is a grouping unit;
(5) classifying the packet units with the same TT period;
(6) sequentially performing off-line design of a composite period scheduling table on each grouping unit according to the receiving level sequence until all grouping units are circulated, wherein the generation principle is as follows:
(7) and allocating the periodic scheduling tables of the ports according to the composite table so as to ensure that the TT flow is composited in the switch without conflict. The periodic schedule design flow chart based on TT information constraint response is shown in FIG. 2.
TTE offline scheduling table generation software
Design cycle schedule generation software as shown in fig. 3, the interface comprises 5 sections,
(1) the topology generating part can be used for a software user to input the number of the transmitting ends, the number of the switches and the number of the receiving ends which need to be designed, and the transmitting ends, the receiving ends and the switches in the network can be generated on a display interface by clicking a generating button;
(2) a connection generation section: this part is used to connect different nodes in the network, generating connection lines in the network topology. For example, the number of a sending end is input to be 1, the number of a switch is input to be 1, and the number of a receiving end is input to be 1, so that connecting lines among three nodes can be generated;
(3) task add button part: response constraints for adding TT tasks and TT tasks in a network are added, and TXT documents with corresponding information can be added by clicking corresponding buttons, wherein the TT information is added in the figure 4, the information meanings are respectively the number of a sending and receiving end, the number of a switch, the time slot length and the period length, the TT information constraint is added in the figure 5, and TT information with the same priority level of each terminal is written in sequence;
(4) a generation table and clearing function part for realizing the functions of generating a scheduling table around a network and clearing the existing topology of the software;
(5) and the display area is used for displaying the design topological structure, clicking different nodes of the display interface and displaying the corresponding scheduling table.
And (4) carrying out topological connection on a simple network, inputting designed TT tasks and constraints, connecting an interface with the topology and generating a scheduling table. The rationality of the off-line periodic schedule generation software based on response constraints is verified by examples.
Design cycle schedule generation software as shown in fig. 3, the embodiment includes 5 steps:
(1) the topology generation part can be used for a software user to input the number of the sending ends, the number of the switches and the number of the receiving ends which need to be designed, and the sending ends, the receiving ends and the switches in the network can be generated on the display interface by clicking the generation button;
(2) different nodes in the connection network are set in the connection generation part, and connection lines in the network topology are generated. For example, the number of a sending end is input to be 1, the number of a switch is input to be 1, and the number of a receiving end is input to be 1, so that connecting lines among three nodes can be generated;
(3) adding response constraints of TT tasks and TT tasks in the network by a task adding button part, clicking a corresponding button to add TXT documents of corresponding information, wherein the added TT information is shown in figure 4, the information meanings are respectively a sending receiving end number, a switch number, a time slot length and a period length, and the added TT information constraint is shown in figure 5, and TT information with the same priority level of each terminal is written in sequence;
(4) the generation table and clearing function part is used for realizing the functions of generating a network surrounding scheduling table and clearing the existing topology of the software;
(5) and displaying the design topological structure by using the display area, and clicking different nodes of the display interface to display a corresponding scheduling table.
Reference to the literature
[1]Tamasselicean D,Pop P,Madsen J.Design of Mixed Criticality Applications on Distributed RealTime Systems.Denmark:Technical University of Denmark,2015
[2]Yi J,Xiong H G,He F,et al.Research on traffic classes transformation strategy and real-time guarantee scheduling algorithm in TTEthernet.Acta Aeronautica et Astronauti-ca Sinica,2014,35(4),pp.1071-1078
[3]Liu W C，Li Q，He F，Xiong H G.Research on time-triggerd-ethernet synchronization and scheduling mechanism.Aeronautical Computing Technique,2011.41(4),pp.122-127
[4]Yan P,Zhang Q,Quan H.Research on time synchronization technology and scheduling mecha-nism.Application of Electronic Technique,2017,43(1),pp.72-76
[5]H.Kopetz,A.Ademaj,P.Grillinger and K.Steinhammer.The time-triggered Ethernet(TTE)design.Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing(ISORC'05),2005,pp.22-33.
[6]K.Steinhammer,P.Grillinger,A.Ademaj and H.Kopetz.A Time-Triggered Ethernet(TTE)Switch.Proceedings of the Design Automation&Test in Europe Conference,Munich,2006,pp.1-6.
[7]H.Kopetz,"The Rationale for Time-Triggered Ethernet,"2008 Real-Time Systems Symposium,Barcelona,2008,pp.3-11。
Claims (2)
1. A TTE network offline scheduling method based on response constraint comprises the following specific steps:
(1) summarizing all TT information tasks in the network;
(2) n TT information periods are period respectively, basic periods and matrix period lengths are calculated according to different TT information periods, a composite scheduling table is designed and generated, wherein the basic periods are the greatest common divisor of all TT information periods, the matrix periods are the least common multiple of all TT information periods, and a plurality of basic periods BC form a TT matrix period MC;
fundamental period BC of
Matrix period MC of
(3) The generation of the periodic scheduling table based on response constraint introduces the consideration of TT information response constraint, and constraint rules of TT information are added into the algorithm, namely the order of receiving TT by each receiving terminal, and the TT information response priority condition is added into the generation factors of the periodic scheduling table;
(4) counting the ith TT information needing to be received of each receiving end, and grouping, wherein the TT information at the same receiving level is a grouping unit;
(5) classifying the packet units with the same TT period;
(6) sequentially performing off-line design of a composite period scheduling table on each grouping unit according to the receiving level sequence until all grouping units are circulated, wherein the generation principle is as follows:
the left-end tightening principle is that the TT frame is placed in the left time period as much as possible, and the smaller the occupied TT frame is, the larger the space for transmitting other information is;
period is as follows
Different TT tasks with the same ms are satisfied according to the periodic scheduling table
Longitudinally arranged at intervals;
(7) and allocating the periodic scheduling tables of the ports according to the composite table so as to ensure that TT information is composited in the switch without conflict.
2. The TTE network offline scheduling method based on response constraints as recited in claim 1, wherein a periodic schedule generation software is designed, and the software specifically executes the steps of:
(1) a topology generation step: the number of the sending ends, the number of the switches and the number of the receiving ends which need to be designed can be input by a software user in the part, and the sending ends, the receiving ends and the switches in the network can be generated on the display interface by clicking the generation button;
(2) a connection generation step: connecting different nodes in a network to generate a connecting line in a network topology;
(3) task add button part: response constraints of TT tasks and TT tasks in the network are added, corresponding buttons are clicked, TXT documents of corresponding information are added, the TXT documents contain the added TT information, and the information meanings are respectively a sending receiving end number, a switchboard number, a time slot length and a cycle length; the method also comprises added TT information constraint, and sequentially writes the TT information of each terminal with the same priority level;
(4) generating a table and clearing, namely generating a network period scheduling table function and clearing an existing topology function;
(5) and a display step, namely displaying the design topological structure, clicking different nodes of the display interface, and displaying the corresponding scheduling table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911072758.5A CN111030942B (en) | 2019-11-05 | 2019-11-05 | TTE network offline scheduling method based on response constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911072758.5A CN111030942B (en) | 2019-11-05 | 2019-11-05 | TTE network offline scheduling method based on response constraint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111030942A CN111030942A (en) | 2020-04-17 |
| CN111030942B true CN111030942B (en) | 2021-12-17 |
Family
ID=70200817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911072758.5A Active CN111030942B (en) | 2019-11-05 | 2019-11-05 | TTE network offline scheduling method based on response constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111030942B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112565107A (en) * | 2020-10-09 | 2021-03-26 | 天津大学 | TTE scheduling communication method based on self-adaptive dual redundancy |
| CN113794654B (en) * | 2021-09-15 | 2023-04-25 | 电子科技大学 | Packet scheduling method for time trigger message in TT-FC network |
| CN114374640A (en) * | 2021-12-15 | 2022-04-19 | 陕西电器研究所 | Service scheduling method based on time-triggered Ethernet |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AT506623A1 (en) * | 2008-04-03 | 2009-10-15 | Fts Computertechnik Gmbh | PROCESS FOR SAFE DYNAMIC BANDWIDTH ALLOCATION IN TT-ETHERNET |
| CN104660477A (en) * | 2015-03-02 | 2015-05-27 | 中国航空无线电电子研究所 | Star topology network constructing method based on time triggered bus |
| CN107241179B (en) * | 2017-04-19 | 2020-07-03 | 西安电子科技大学 | Method for generating time-triggered service static scheduling table |
| CN110048949B (en) * | 2019-03-27 | 2022-02-25 | 天津大学 | Communication method based on TTE network capacity estimation |
-
2019
- 2019-11-05 CN CN201911072758.5A patent/CN111030942B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111030942A (en) | 2020-04-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pop et al. | Design optimisation of cyber‐physical distributed systems using IEEE time‐sensitive networks | |
| CN111030942B (en) | TTE network offline scheduling method based on response constraint | |
| CN108777660B (en) | Method for scheduling service in time-triggered FC network | |
| Al Sheikh et al. | Optimal design of virtual links in AFDX networks | |
| Basu et al. | Verification of an AFDX infrastructure using simulations and probabilities | |
| Mifdaoui et al. | Performance analysis of a master/slave switched ethernet for military embedded applications | |
| Liu et al. | Online job scheduling for distributed machine learning in optical circuit switch networks | |
| CN113938930A (en) | Construction method of virtual network function forwarding graph adapting to 5G network multi-service scene | |
| Zheng et al. | The research of scheduling algorithm for time-triggered ethernet based on path-hop | |
| CN102045256B (en) | COTS (Commercial Off-The-Shelf) based bandwidth predistribution guarantee network function demonstration system | |
| Ferrandiz et al. | Worst-case end-to-end delays evaluation for spacewire networks | |
| CN114039935B (en) | Message scheduling system and method based on distributed real-time bus configuration | |
| Li | Worst-case delay analysis of real-time switched Ethernet networks with flow local synchronization | |
| Beekhuizen et al. | Reduction of a polling network to a single node | |
| Eramo et al. | A max plus algebra based scheduling algorithm for supporting time triggered services in ethernet networks | |
| Mi et al. | A scheduling algorithm of maximize the number of porosity for the time-triggered DIMA system | |
| Zhao et al. | Distributed resource allocation for synchronous fork and join processing networks | |
| Tariq et al. | Analysis of synchronization in distributed avionics systems based on time-triggered Ethernet | |
| Xu et al. | Performance evaluation on packet transmission for distributed real-time avionics networks using forward end-to-end delay analysis | |
| Xiang et al. | End-to-end delay analysis considering partition scheduling on a DIMA platform | |
| Gao et al. | Publish/subscribe architecture for airborne time-triggered network in avionics system | |
| Zhang et al. | A Novel Method Based on Time-Frequency Modeling for Interference Analysis in Avionics Systems | |
| Hanzálek et al. | Incremental Scheduling of the Time-triggered Traffic on TTEthernet Network. | |
| He et al. | Complex real-time network topology generation optimization based on message flow control | |
| Scharbarg et al. | Dimensioning of civilian avionics 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |