CN114363215A - Train communication network time delay analysis method based on supply and demand balance - Google Patents
Train communication network time delay analysis method based on supply and demand balance Download PDFInfo
- Publication number
- CN114363215A CN114363215A CN202111619128.2A CN202111619128A CN114363215A CN 114363215 A CN114363215 A CN 114363215A CN 202111619128 A CN202111619128 A CN 202111619128A CN 114363215 A CN114363215 A CN 114363215A
- Authority
- CN
- China
- Prior art keywords
- delay
- switch
- communication network
- supply
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004891 communication Methods 0.000 title claims abstract description 35
- 238000004458 analytical method Methods 0.000 title claims abstract description 25
- 230000005540 biological transmission Effects 0.000 claims abstract description 39
- 238000004364 calculation method Methods 0.000 claims abstract description 15
- 230000000737 periodic effect Effects 0.000 claims description 21
- 230000004044 response Effects 0.000 claims description 11
- 238000000034 method Methods 0.000 claims description 7
- 230000001934 delay Effects 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 4
- 238000005192 partition Methods 0.000 abstract description 6
- 238000005457 optimization Methods 0.000 abstract description 4
- 238000011156 evaluation Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000008186 active pharmaceutical agent Substances 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a train communication network time delay analysis method based on supply and demand balance, and belongs to the technical field of train-mounted network system control. The invention provides an end-to-end time delay calculation method based on supply and demand balance, which is used for calculating the maximum end-to-end time delay of real-time period data in a resource partition model, wherein the maximum end-to-end time delay comprises all transmission time, interference time delay, switch time delay and link time delay. The delay analysis method based on supply and demand balance provided by the invention analyzes key factors influencing the real-time performance of the train communication network based on the Ethernet, provides a theoretical basis for the deployment and optimization of the train communication network, and ensures the reliability and the real-time performance of the train communication network.
Description
Technical Field
The invention belongs to the technical field of train-mounted network system control, and particularly relates to a train communication network delay analysis method based on supply and demand balance.
Background
Real-time is a major indicator for evaluating ethernet solutions. The train communication network real-time evaluation theory based on the Ethernet is mainly end-to-end time delay analysis, wherein the most important is the end-to-end time delay of real-time periodic data. The common network delay analysis method is to introduce a network operation theory, which considers the end-to-end delay under extreme conditions, and the calculation result has larger pessimism. The network delay is a very important real-time evaluation index of the train communication network, and the delay characteristic of a network system must be considered when the train communication network is designed and data stream distribution is carried out, so that the data stream is ensured to be transmitted within a determined delay range, and simultaneously, the waste of resources is not caused. Therefore, the research of a new network delay analysis method has important significance for improving the accuracy of delay calculation.
Disclosure of Invention
Technical problem to be solved
The invention aims to solve the technical problem of how to provide a train communication network delay analysis method based on supply and demand balance so as to solve the problem that a common network delay analysis method is to introduce a network operation theory, the network operation theory considers end-to-end delay under extreme conditions, and a calculation result has larger pessimism.
(II) technical scheme
In order to solve the technical problem, the invention provides a train communication network delay analysis method based on supply and demand balance, which comprises the following steps:
period information miIn two fixed links laAnd a link lbThe response time between is shown by the following equation:
iterating from
Is started and when the response is no longer changed
When the iteration is over, the response time is now
Each term in the formula has the following specific meaning:
represents miTotal transmission time of CiRepresents period information miTransmission time of δi,a,bIs an influence parameter; u shapei,a,bIndicating a delay caused by interference of high-priority or same-priority data; SDi,a,bRepresenting switch delays, including switch forwarding delays SFDiAnd basic time delay of the switch; vi,a,bWhich is indicative of the delay of the link,
wherein
Represents miThe sum of all link lengths passed during transmission, v represents the propagation speed of the signal in the physics.
Further, the influence parameter δi,a,bComprises the following steps:
wherein LWlRepresents a link liThe size of the periodic phase window of (1), EC being the fundamental period, Idi,lIndicating the idle time in the periodic phase.
Further, idle time Id in periodic phasei,lIs composed of
Wherein, PKjRepresents mjSize of data packet, mjAnd miSharing a certain link liData m, data mjIs higher than or equal to miWhere j e [1, N)]。
Further, the U isi,a,bThe calculation method is shown as the following formula:
Ckrepresents mkTransmission time of mkRepresents a sum of miSharing laTo lbAnd its priority is higher than or equal to mi，TkRepresents mkThe period of (c).
Further, the switch latency may be affected by other data transmission besides the transmission time of the switch.
Further, the impact of the switch latency during the transmission of the message queue only needs to be considered once.
Further, there is no switch forwarding delay at the source node, and the switch delay is calculated from la+1Initially, the switch forwarding delay is calculated in two cases:
m1and m2Only sharing an input link, wherein the output links are different, and the forwarding time delay of the switch is equal to the respective transmission time;
m1and m2The output link is shared only and the input link and the output link are shared simultaneously, because the output links are the same, data can be queued at the same output port of the switch, and in the process of forwarding the first data to the output port, the second data is in a state of being stored and waiting for forwarding.
Further, miSwitch latency SDi,a,bAs shown in the following formula:
SDi,a,b＝SFDi,,a,b+SWDi,a,b
wherein C isqRepresents mqSFD is the switch forwarding delay, and SWD is the switch hardware delay.
Further, the switch hardware latency is 50 μ s.
Further, the propagation velocity v is 2.0 x 108 m/s.
(III) advantageous effects
The invention provides a train communication network time delay analysis method based on supply and demand balance, and provides an end-to-end time delay calculation method based on supply and demand balance, which is used for calculating the maximum end-to-end time delay of real-time periodic data in a resource partition model. The delay analysis method based on supply and demand balance provided by the invention analyzes key factors influencing the real-time performance of the train communication network based on the Ethernet, provides a theoretical basis for the deployment and optimization of the train communication network, and ensures the reliability and the real-time performance of the train communication network.
Drawings
Fig. 1 is a diagram of a data transmission link;
FIG. 2 is a small switched Ethernet network;
FIG. 3 is a switch port schedule;
fig. 4 is a switch latency.
Detailed Description
In order to make the objects, contents and advantages of the present invention clearer, the following detailed description of the embodiments of the present invention will be made in conjunction with the accompanying drawings and examples.
The real-time performance is a main index for evaluating an Ethernet solution, and the train communication network real-time performance evaluation theory based on the Ethernet is mainly end-to-end time delay analysis, wherein the most important is the end-to-end time delay of real-time periodic data. The invention provides a time delay analysis method based on supply and demand balance, which is used for analyzing key factors influencing the real-time performance of a train communication network based on Ethernet, providing a theoretical basis for the deployment and optimization of the train communication network and ensuring the reliability and the real-time performance of the train communication network.
The invention provides aAn end-to-end time delay calculation method based on supply and demand balance is used for calculating the maximum end-to-end time delay of real-time periodic data in a resource partition model. The resource partitioning model with latency constraints can be described as RB＝(UB,DB) Wherein U isBRepresenting the total network capacity of partitioned resources, DBAn upper bound on the delay representing completion of the task; the periodic task may be described as T (p, e), where p represents the period of the periodic task and e represents the time required for the task to execute. The train communication network based on the Ethernet distributes different bandwidth resources for periodic data and non-periodic data, and data transmission has a time delay requirement and is equivalent to a resource partition model with time delay constraint.
According to the generation reason of the delay, the end-to-end delay of the data mainly comprises: data transmission delay, interference delay, switch delay and the like. An end-to-end delay calculation method based on supply and demand balance respectively calculates a maximum value (rbf) of network requirements in the execution process of a periodic task and a minimum value (sbf) of network resources which can be provided for the periodic task by a resource partition model with delay constraint.
Performing mathematical description on real-time period information transmitted in a train communication network, assuming that the number of the period information to be transmitted in the network is N, and performing mathematical description on ith period information miThe transmission task can be described as:
γi＝{mi(Ci,Di,Ti,PKi,Si,DSi,Pi,Li,ni),i＝1…N}
wherein, CiRepresents period information miTransmission time (data length/bandwidth); diAnd TiRespectively represents miThe cutoff time and period, PKiRepresents miThe size of the data packet; siAnd DSiRepresents miA source node and a destination node; piIndicating a priority; l isiRepresents miSet of links through, niRepresents miNumber of link segments passed, Li＝{lk|k＝1...niAs shown in FIG. 1, Li,a,bRepresents miIn the transmission link of (1), the link laTo lbA link between; n represents the number of data;
the time required from the data transmission from the source node to the data arrival at the destination node is the end-to-end delay, also referred to herein as the response time (rt), rti,a,bRepresents miOn the link laAnd link lbThe transmission delay between the two, the end-to-end time delay of the data is calculated, laFor the transmit link at the source node,/bIs the receive link at the destination node.
Let laAnd lbIs miTwo links, m, through which the transmission passesiFirst via link laThen via link lb. Data miBy links laTo link lbThe maximum value of the response time of (c) is shown by the following equation:
rbf(t)＝Ci+SLDi,a,b(t)+SDi,a,b(t)
wherein, CiRepresenting data miThe transmission delay of (2); SLDi,a,bRepresentation and data miData of shared link, for miDelay caused by the influence of the transmission of (c); SDi,a,bIndicating switch latency.
The periodic resource model network can provide the lower bound of network resources as shown in the following equation:
LW denotes the size of the data transmission window,
and
respectively representing links laAnd a link lbThe idle time of the periodic phase window.
rbf (t) and sbf (t) both follow numbersAccording to the change of transmission time, miOn the link laAnd a link lbThe response time of the transmission between is numerically equal to
The time of day.
The method is improved on the basis, the time supply limit of the switch is considered while the data transmission time requirement is calculated, the supply and the demand are integrated, and the maximum value of the data end-to-end delay is further obtained by adopting an iteration method.
At this time, the period information miIn two fixed links laAnd a link lbThe response time between is shown by the following equation:
iterating from
Is started and when the response is no longer changed
When the iteration is over, at which point
Each term in the formula has the following specific meaning:
(1)
represents miThe total transmission time of. Considering the bandwidth limitation that can be provided by the switch, an impact parameter δ is introduced, where δ is expressed as:
wherein LWlRepresents a link liThe size of the periodic phase window of (c), EC being the fundamental period,Idi,lrepresents the idle time in the periodic phase, and has the following value:
wherein, PKjRepresents mjSize of data packet, mjAnd miSharing a certain link liData m, data mjIs higher than or equal to miThe priority of (2). Wherein j is equal to [1, N ]]。
(2)Ui,a,bRepresenting the delay caused by interference of high or equal priority data, all preceding links being paired with m in order to avoid duplicate consideration of a certain piece of dataiThe calculation is performed on the current link, which is the cause of the influence. Also consider the periodic phase window size limit, Ui,a,bThe calculation method is shown as the following formula:
Ckrepresents mkTransmission time of mkRepresents a sum of miSharing laTo lbAnd its priority is higher than or equal to mi，TkRepresents mkA period of (a); .
(3)SDi,a,bThe switch latency is represented, including the switch forwarding latency SFDi and the switch hardware latency (50 μ s).
The forwarding delay of a switch refers to the buffering time of data arriving at the switch before it is transmitted. The switch forwarding delay of data may be affected by other data transmission besides the self transmission time. Each link of each time period is respectively represented by two containers, namely a sending link and a receiving link, wherein the transmission direction of data of the sending link is from a node to a switch, the transmission direction of data of the receiving link is from the switch to the node, and the size of the container is equal to the window time. Scheduling starts with a high priority queue in the ready queues, filling the corresponding container. As shown in the small network of FIG. 2, consider two pieces of data m1 and m2, where m1 is passed by node S1 to node S2 and m2 is passed by node S3 to node S2. Assume that m2 has a higher priority. As shown in fig. 3, the transmission links of S1 and S2 and the reception link of S2 are represented by three containers, respectively. Since m2 has a higher priority, the transmit time of m2 and the switch latency of m2 are first filled into the receive link container of S2.
Considering the continuous forwarding of data, the influence caused by the switch delay in the transmission process of the message queue only needs to be considered once, for example, the second data is in a state of being stored and waiting for forwarding in the process that the first data is forwarded to the output port, and the switch delay of m1 is not included in the receiving link container of S2 because the switch delay of m2 is greater than the switch delay of m 1.
There is no switch forwarding delay at the source node, so the slave/is calculateda+1And starting. The switch forwarding delay is calculated in two cases:
(i)m1and m2Only the input link is shared. Because the outgoing links are different, they are stored in different outgoing queues of the switch, and the switch forwarding delay is equal to the respective transmission time.
(ii)m1And m2Sharing only the output link and sharing both the input and output links. In both cases, the data will be queued at the same output port of the switch due to the same output link. While the first data is being forwarded to the output port, the second data is in a state of being stored and waiting for forwarding. As shown in fig. 4, when the transmission time C of the period information1>C2When m is due to1When forwarded, m2Wait to be forwarded, at which time m2Is equal to m1Rather than its own transmission time. Therefore, when m1And m2When sharing output links simultaneously or sharing input and output links simultaneously, m2The calculation of the transmission delay of the switch needs to consider m1The switch transmit delay. When C is present1<C2When m is2Switch forwarding delay equal to C2。
Therefore, miSwitch latency SDi,a,bAs shown in the following formula:
SDi,a,b＝SFDi,,a,b+SWDi,a,b
wherein C isqRepresents mqSFD is the switch forwarding delay and SWD is the switch hardware delay, e.g. 50 μ s.
(4)Vi,a,bThe link delay is represented, and the calculation result is shown as the following formula:
wherein
Represents miThe sum of all link lengths passed during transmission, v represents the propagation speed of the signal in physics 2.0 x 108 m/s.
The invention provides an end-to-end time delay calculation method based on supply and demand balance, which is used for calculating the maximum end-to-end time delay of real-time period data in a resource partition model. The delay analysis method based on supply and demand balance provided by the invention analyzes key factors influencing the real-time performance of the train communication network based on the Ethernet, provides a theoretical basis for the deployment and optimization of the train communication network, and ensures the reliability and the real-time performance of the train communication network.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.
Claims (10)
1. A train communication network time delay analysis method based on supply and demand balance is characterized by comprising the following steps:
period information miIn two fixed links laAnd a link lbThe response time between is shown by the following equation:
iterating from
Is started and when the response is no longer changed
When the iteration is over, the response time is now
Each term in the formula has the following specific meaning:
represents miTotal transmission time of CiRepresents period information miTransmission time of δi,a,bIs an influence parameter; u shapei,a,bIndicating a delay caused by interference of high-priority or same-priority data; SDi,a,bRepresenting switch delays, including switch forwarding delays SFDiAnd basic time delay of the switch; vi,a,bWhich is indicative of the delay of the link,
wherein
Represents miAll the links passed by in the transmission process are longThe sum of degrees, v, represents the propagation velocity of the signal in the physical.
2. The supply and demand balance based train communication network delay analysis method according to claim 1, wherein the influence parameter δi,a,bComprises the following steps:
wherein LWlRepresents a link liThe size of the periodic phase window of (1), EC being the fundamental period, Idi,lIndicating the idle time in the periodic phase.
3. The supply and demand balance based train communication network delay analysis method according to claim 2, wherein idle time Id in a periodic phasei,lIs composed of
Wherein, PKjRepresents mjSize of data packet, mjAnd miSharing a certain link liData m, data mjIs higher than or equal to miWhere j e [1, N)]。
4. The supply and demand balance based train communication network delay analysis method according to any one of claims 1 to 3, wherein the U isi,a,bThe calculation method is shown as the following formula:
Ckrepresents mkTransmission time of mkRepresents a sum of miSharing laTo lbOf one or more links with priority higher than or equal toAt mi，TkRepresents mkThe period of (c).
5. The method for analyzing the delay of the train communication network based on the supply and demand balance as claimed in claim 4, wherein the switch delay is affected by other data transmission besides the transmission time of the switch.
6. The supply and demand balance based train communication network delay analysis method according to claim 4, wherein an influence caused by the switch delay in the transmission process of the message queue only needs to be considered once.
7. The supply and demand balance based train communication network delay analysis method according to claim 4, wherein the switch forwarding delay does not exist at the source node, and the switch delay calculation is carried out from la+1Initially, the switch forwarding delay is calculated in two cases:
m1and m2Only sharing an input link, wherein the output links are different, and the forwarding time delay of the switch is equal to the respective transmission time;
m1and m2The output link is shared only and the input link and the output link are shared simultaneously, because the output links are the same, data can be queued at the same output port of the switch, and in the process of forwarding the first data to the output port, the second data is in a state of being stored and waiting for forwarding.
8. The supply and demand balance based train communication network delay analysis method according to claim 4, wherein m isiSwitch latency SDi,a,bAs shown in the following formula:
SDi,a,b＝SFDi,,a,b+SWDi,a,b
wherein C isqRepresents mqSFD is the switch forwarding delay, and SWD is the switch hardware delay.
9. The supply and demand balance based train communication network delay analysis method according to claim 8, wherein the switch hardware delay is 50 μ s.
10. The supply and demand balance based train communication network delay analysis method according to claim 1, wherein the propagation velocity v is 2.0 x 108 m/s.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111619128.2A CN114363215B (en) | 2021-12-27 | 2021-12-27 | Train communication network time delay analysis method based on supply and demand balance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111619128.2A CN114363215B (en) | 2021-12-27 | 2021-12-27 | Train communication network time delay analysis method based on supply and demand balance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114363215A true CN114363215A (en) | 2022-04-15 |
| CN114363215B CN114363215B (en) | 2024-05-28 |
Family
ID=81102431
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111619128.2A Active CN114363215B (en) | 2021-12-27 | 2021-12-27 | Train communication network time delay analysis method based on supply and demand balance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114363215B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404177A (en) * | 2011-11-28 | 2012-04-04 | 浙江网新技术有限公司 | Method for networking train ring network |
| CN103716194A (en) * | 2013-12-31 | 2014-04-09 | 北京交通大学 | Method for optimizing network topology of urban rail train |
| JP2015047916A (en) * | 2013-08-30 | 2015-03-16 | 三菱電機株式会社 | Railway vehicle air conditioner and wireless communication device |
| EP3364608A1 (en) * | 2017-02-20 | 2018-08-22 | GE Aviation Systems LLC | Systems and methods for scheduling a message |
| CN108924901A (en) * | 2018-06-26 | 2018-11-30 | 新华三技术有限公司成都分公司 | communication link switching method and device |
| CN109219019A (en) * | 2018-10-12 | 2019-01-15 | 北京特种机械研究所 | Train Communication Network multi-hop dispatching method based on Ethernet |
| CN109947574A (en) * | 2019-03-29 | 2019-06-28 | 南京邮电大学 | A kind of vehicle big data calculating discharging method based on mist network |
| CN112441087A (en) * | 2019-08-30 | 2021-03-05 | 比亚迪股份有限公司 | Train control system and train control method |
| CN113098778A (en) * | 2021-04-04 | 2021-07-09 | 河南工业大学 | Flow table compression method based on spanning tree folding routing in software defined network |
| CN113452618A (en) * | 2021-06-06 | 2021-09-28 | 吉林建筑科技学院 | M/M/1 queuing model scheduling method based on congestion control |
| CN113572706A (en) * | 2021-06-16 | 2021-10-29 | 燕山大学 | Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network |
| CN113595774A (en) * | 2021-07-19 | 2021-11-02 | 广西大学 | High-speed train networking topology optimization method based on IAGA algorithm |
-
2021
- 2021-12-27 CN CN202111619128.2A patent/CN114363215B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404177A (en) * | 2011-11-28 | 2012-04-04 | 浙江网新技术有限公司 | Method for networking train ring network |
| JP2015047916A (en) * | 2013-08-30 | 2015-03-16 | 三菱電機株式会社 | Railway vehicle air conditioner and wireless communication device |
| CN103716194A (en) * | 2013-12-31 | 2014-04-09 | 北京交通大学 | Method for optimizing network topology of urban rail train |
| EP3364608A1 (en) * | 2017-02-20 | 2018-08-22 | GE Aviation Systems LLC | Systems and methods for scheduling a message |
| CN108924901A (en) * | 2018-06-26 | 2018-11-30 | 新华三技术有限公司成都分公司 | communication link switching method and device |
| CN109219019A (en) * | 2018-10-12 | 2019-01-15 | 北京特种机械研究所 | Train Communication Network multi-hop dispatching method based on Ethernet |
| CN109947574A (en) * | 2019-03-29 | 2019-06-28 | 南京邮电大学 | A kind of vehicle big data calculating discharging method based on mist network |
| CN112441087A (en) * | 2019-08-30 | 2021-03-05 | 比亚迪股份有限公司 | Train control system and train control method |
| CN113098778A (en) * | 2021-04-04 | 2021-07-09 | 河南工业大学 | Flow table compression method based on spanning tree folding routing in software defined network |
| CN113452618A (en) * | 2021-06-06 | 2021-09-28 | 吉林建筑科技学院 | M/M/1 queuing model scheduling method based on congestion control |
| CN113572706A (en) * | 2021-06-16 | 2021-10-29 | 燕山大学 | Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network |
| CN113595774A (en) * | 2021-07-19 | 2021-11-02 | 广西大学 | High-speed train networking topology optimization method based on IAGA algorithm |
Non-Patent Citations (3)
| Title |
|---|
| SATYANARAYAN K. PADAGANUR: "A feed forward based smart link management scheme for future generation network", 2018 4TH INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN INFORMATION TECHNOLOGY (RAIT) * |
| 蔡杨湧: "基于工业以太网的列车通信网络调度算法优化", 中国知网 * |
| 雷昊;贺德强;苗剑;: "高速动车组车载以太网时延分析", no. 05 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114363215B (en) | 2024-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bauer et al. | Applying and optimizing trajectory approach for performance evaluation of AFDX avionics network | |
| Liu et al. | Fluid Simulation of Large Scale Networks: Issues and Tradeoffs. | |
| CN112235194B (en) | Method and device for scheduling delay sensitive flow on line route | |
| Houtan et al. | Synthesising schedules to improve QoS of best-effort traffic in TSN networks | |
| US10887244B1 (en) | Methods, systems and apparatuses for optimizing time-triggered ethernet (TTE) network scheduling by bin allocation, demand prediction and machine learning | |
| US11552857B2 (en) | Methods, systems and appratuses for optimizing the bin selection of a network scheduling and configuration tool (NST) by bin allocation, demand prediction and machine learning | |
| US10917355B1 (en) | Methods, systems and apparatuses for optimizing time-triggered ethernet (TTE) network scheduling by using a directional search for bin selection | |
| Adnan et al. | Model for worst case delay analysis of an AFDX network using timed automata | |
| 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 | |
| Zhou et al. | Reliability-aware scheduling and routing for messages in time-sensitive networking | |
| CN103324592A (en) | Data migration control method, data migration method and data migration device | |
| CN112311494A (en) | Message transmission method, device and system | |
| Yao et al. | MixCPS: Mixed time/event-triggered architecture of cyber–physical systems | |
| Ashjaei et al. | Improved message forwarding for multi-hop hartes real-time ethernet networks | |
| Huang et al. | Flexible cyclic queuing and forwarding for time-sensitive software-defined networks | |
| Gutiérrez et al. | Response time analysis in AFDX networks with sub-virtual links and prioritized switches | |
| CN101478456A (en) | Fast forwarding service end-to-end time delay prediction method | |
| CN112202595A (en) | Abstract model construction method based on time sensitive network system | |
| Li et al. | Determinism enhancement of AFDX networks via frame insertion and sub-virtual link aggregation | |
| Feng et al. | SMT-based task-and network-level static schedule for time sensitive network | |
| CN101023455A (en) | Method and apparatus for network congestion control using queue control and one-way delay measurements | |
| Xie et al. | Robust time-sensitive networking with delay bound analyses | |
| CN112202596A (en) | Abstract model construction device based on time sensitive network system | |
| CN114363215A (en) | Train communication network time delay analysis method based on supply and demand balance |
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 |