CN114363215B - 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
- CN114363215B CN114363215B CN202111619128.2A CN202111619128A CN114363215B CN 114363215 B CN114363215 B CN 114363215B CN 202111619128 A CN202111619128 A CN 202111619128A CN 114363215 B CN114363215 B CN 114363215B
- Authority
- CN
- China
- Prior art keywords
- delay
- time
- switch
- communication network
- supply
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 35
- 238000004458 analytical method Methods 0.000 title claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims abstract description 51
- 238000004364 calculation method Methods 0.000 claims abstract description 16
- 238000000034 method Methods 0.000 claims description 18
- 230000000737 periodic effect Effects 0.000 claims description 18
- 238000005192 partition Methods 0.000 abstract description 6
- 238000005457 optimization Methods 0.000 abstract description 4
- 238000011156 evaluation Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000008186 active pharmaceutical agent Substances 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 238000010586 diagram Methods 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
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 vehicle-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 theoretical basis for 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 vehicle-mounted network system control, and particularly relates to a train communication network time delay analysis method based on supply and demand balance.
Background
Real-time is a major indicator for evaluating ethernet solutions. The real-time evaluation theory of the train communication network 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 period data. The common network delay analysis method is to introduce a network algorithm theory, which considers the end-to-end delay under extreme conditions, and the calculation result has a larger pessimistic property. The network delay is an important real-time evaluation index of the train communication network, and when the train communication network is designed and the data streams are distributed, the delay characteristic of the network system must be considered, so that the data streams are ensured to be transmitted within a certain delay range, and meanwhile, the waste of resources is not caused. Therefore, research on a new network delay analysis method has important significance in improving the accuracy of delay calculation.
Disclosure of Invention
First, the technical problem to be solved
The invention aims to provide a train communication network time delay analysis method based on supply and demand balance, so as to solve the problem that the conventional network time delay analysis method introduces a network algorithm theory, and the network algorithm theory considers the end-to-end time delay under extreme conditions, so that the calculation result has higher pessimistic property.
(II) technical scheme
In order to solve the technical problems, the invention provides a train communication network time delay analysis method based on supply-demand balance, which comprises the following steps:
The response time of the period information m i between the two fixed links l a and l b is shown as follows:
iterative slave Initially, and when the response is no longer changing, i.e./>At the end of the iteration, at which time the response time/>The specific meaning of each term in the formula is as follows: /(I)Indicating the total transmission time of m i, C i indicating the transmission time of the period information m i, δ i,a,b being an influencing parameter; u i,a,b represents the delay caused by interference of high-priority or same-priority data; SD i,a,b represents the switch delay, including the switch forwarding delay SFD i and the switch basic delay; v i,a,b denotes the link delay and,
Wherein the method comprises the steps ofRepresents the sum of all link lengths traversed during transmission of m i, and v represents the propagation speed of the signal in the matter.
Further, the influencing parameter δ i,a,b is:
Where LW l represents the size of the periodic phase window of link l i, EC is the fundamental period, and Id i,l represents the idle time in the periodic phase.
Further, the idle time Id i,l in the periodic phase is
Wherein PK j represents the size of an m j packet, m j shares a link l i with m i, and the priority of data m j is higher than or equal to the priority of m i, where j e [1, n ].
Further, the calculation method of U i,a,b is as follows:
C k denotes a transmission time of m k, m k denotes data sharing one or more links of l a to l b with m i, and a priority higher than or equal to m i,Tk denotes a period of m k.
Further, the switch delay may be affected by the transmission time itself, and may also be affected by other data transmission.
Further, the impact of the switch latency during transmission of the message queues need only be considered once.
Further, there is no switch forwarding delay at the source node, and the switch forwarding delay is calculated from l a+1, where the calculation of the switch forwarding delay is divided into two cases:
m 1 and m 2 only share input links, output links are different, and the forwarding delay of the switch is equal to the respective transmission time;
m 1 and m 2 share only the output link and share both the input and output links, and since the output links are the same, data will be queued at the same output port of the switch, and the second data is in a state of being stored and waiting for forwarding during the process of forwarding the first data to the output port.
Further, the switch delay SD i,a,b of m i is shown as follows:
SDi,a,b＝SFDi,,a,b+SWDi,a,b
wherein C q represents the transmission time of m q, SFD 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 108m/s.
(III) beneficial 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 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 theoretical basis for 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 form factor switched Ethernet;
FIG. 3 is a switch port schedule;
Fig. 4 is a switch latency.
Detailed Description
To make the objects, contents and advantages of the present invention more apparent, the following detailed description of the present invention will be given with reference to the accompanying drawings and examples.
Real-time performance is a main index for evaluating an Ethernet solution, and a 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 period data. The invention provides a delay analysis method based on supply-demand balance, which analyzes key factors influencing the real-time performance of a train communication network based on Ethernet, provides theoretical basis for deployment and optimization of the train communication network, and ensures the reliability and the real-time performance of the train communication network.
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 resource partitioning model with latency constraints may be described as R B＝(UB,DB, where U B represents the total network capacity of the partitioned resources and D B represents the upper bound on latency for task completion; periodic tasks 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 allocates different bandwidth resources for periodic data and non-periodic data, and the data transmission has a time delay requirement, which is equivalent to a resource partition model with time delay constraint.
According to the generation reason of the time delay, the end-to-end time delay of the data mainly comprises the following steps: data transmission delay, interference delay, switch delay and the like. The end-to-end time delay calculation method based on supply and demand balance calculates the maximum value (request bound function, rbf) of network requirements in the periodic task execution process and the minimum value (supply bound function, sbf) of network resources which can be provided for the periodic task by the resource partition model with time delay constraint.
The real-time period information transmitted in the train communication network is mathematically described, and the transmission task of the ith period information m i can be described as follows, assuming that the number of period information to be transmitted in the network is N:
γi＝{mi(Ci,Di,Ti,PKi,Si,DSi,Pi,Li,ni),i＝1…N}
Wherein C i denotes a transmission time (data length/bandwidth) of the period information m i; d i and T i represent the deadline and period of m i, respectively, and PK i represents the size of an m i packet; s i and DS i represent a source node and a destination node of m i; p i denotes priority; l i represents a link set through which m i passes, n i represents a link segment number through which m i passes, L i＝{lk|k＝1...ni }, as shown in fig. 1, L i,a,b represents a link between links L a to L b among transmission links of m i; n represents the number of data;
The time required for data to be sent from a source node to reach a destination node is an end-to-end delay, also referred to herein as response time (rt), rt i,a,b represents the transmission delay of m i between link l a and link l b, the end-to-end delay of the data is calculated, l a is the transmit link at the source node and l b is the receive link at the destination node.
Assuming that l a and l b are two links through which m i is transmitted, m i passes through link l a before passing through link l b. The maximum value of the response time for data m i to pass from link l a to link l b is shown as follows:
rbf(t)＝Ci+SLDi,a,b(t)+SDi,a,b(t)
wherein C i represents the transmission delay of the data m i; SLD i,a,b represents the delay caused by the effect of the transmission of data sharing a link with data m i on the transmission of m i; SD i,a,b represents switch latency.
The periodic resource model network can provide the lower bound of network resources as follows:
LW denotes the size of the data transmission window, And/>The idle times of the periodic phase windows of link l a and link l b are shown, respectively.
Both rbf (t) and sbf (t) vary with the time of transmission of the data, and the response time of the transmission of m i between link l a and link l b is equal in valueIs a time of day (c).
The method is improved on the basis of the method, 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 time delay is further obtained by adopting an iteration method.
At this time, the response time of the period information m i between the two fixed links l a and l b is as follows:
iterative slave Initially, and when the response is no longer changing, i.e./>At the end of the iteration, at this time/>The specific meaning of each term in the formula is as follows:
(1) indicating the total transmission time of m i. Considering the bandwidth limitations that can be provided by the switch, an impact parameter δ is introduced, where δ is represented by the following formula:
Where LW l represents the size of the periodic phase window of link l i, EC is the fundamental period, id i,l represents the idle time in the periodic phase, the value of which is shown in the following formula:
Wherein PK j represents the size of the m j packet, m j shares a link l i with m i, and the priority of data m j is higher than or equal to the priority of m i. Wherein j is E [1, N ].
(2) U i,a,b represents the delay caused by interference of high priority or co-priority data, and to avoid repeated consideration of a certain piece of data, all previous links have an effect on m i, and all are calculated on the current link. Also considering the periodic phase window size limit, the U i,a,b calculation method is as follows:
C k represents the transmission time of m k, m k represents data sharing one or more links of l a to l b with m i, and m i,Tk represents a period of m k or higher in priority; .
(3) SD i,a,b represents switch latency, including switch forwarding latency SFDi and switch hardware latency (50 mus).
The forwarding delay of a switch refers to the buffering time of data arriving at the switch before it is transmitted. The forwarding delay of the data exchange may be affected by the transmission time of the data exchange and may also be affected by other data transmission. Each section of link of each time period is respectively represented by two containers, namely a sending link and a receiving link, wherein the transmission direction of the data of the sending link is from a node to a switch, the transmission direction of the data of the receiving link is from the switch to the node, and the size of the containers is equal to the window time. Scheduling starts with a high priority queue in the ready queue, filling the corresponding container. As in the small network shown in fig. 2, consider two pieces of data m1 and m2, where m1 is passed from node S1 to node S2 and m2 is passed from node S3 to node S2. Let m2 have 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 transmission time of m2 and the switch delay of m2 are first filled into the receiving link container of S2.
Considering 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, in the process that the first data is forwarded to the output port, the second data is in a state of being stored and waiting for forwarding, and since the switch delay of m2 is greater than the switch delay of m1, the switch delay of m1 is not included in the receiving link container of S2.
There is no switch forwarding delay at the source node, so the calculation starts from l a+1. The computation of the switch forwarding delay is divided into two cases:
(i) m 1 and m 2 share only the input links. Because the output links are different, they are stored in different output queues of the switch, and the switch forwarding delay is equal to the respective transmission time.
(Ii) m 1 and m 2 share only the output link and both the input and output links. In both cases, data will be queued at the same output port of the switch, since the output links are identical. During 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. As shown in fig. 4, when the transmission time C 1>C2 of the period information, since m 1 is forwarded, m 2 waits to be forwarded, at which time the switch transmission delay of m 2 is equal to the transmission time of m 1, not the transmission time itself. Thus, when m 1 and m 2 share an output link simultaneously or share an input and output link simultaneously, the computation of the switch transmission delay of m 2 needs to take into account the switch transmission delay of m 1. When C 1<C2, the switch forwarding delay of m 2 is equal to C 2.
Therefore, the switch latency SD i,a,b of m i is shown as follows:
SDi,a,b＝SFDi,,a,b+SWDi,a,b
Where C q represents the transmission time of m q, SFD is the switch forwarding delay, SWD is the switch hardware delay, e.g. 50 mus.
(4) V i,a,b represents the link delay, and the calculation result is shown as follows:
Wherein the method comprises the steps of Representing the sum of all link lengths traversed during transmission of m i, v representing the propagation speed of the signal in the medium of 2.0 x 108m/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 theoretical basis for deployment and optimization of the train communication network, and ensures the reliability and the real-time performance of the train communication network.
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.
Claims (10)
1. A train communication network time delay analysis method based on supply and demand balance is characterized by comprising the following steps:
The response time of the period information m i between the two fixed links l a and l b is shown as follows:
iterative slave Initially, and when the response is no longer changing, i.e./>At the end of the iteration, at which time the response time/>The specific meaning of each term in the formula is as follows: /(I)Indicating the total transmission time of m i, C i indicating the transmission time of the period information m i, δ i,a,b being an influencing parameter; u i,a,b represents the delay caused by interference of high-priority or same-priority data; SD i,a,b represents the switch delay, including the switch forwarding delay SFD i and the switch basic delay; v i,a,b denotes the link delay and,
Wherein the method comprises the steps ofRepresents the sum of all link lengths traversed during transmission of m i, and v represents the propagation speed of the signal in the matter.
2. The method for analyzing the time delay of the train communication network based on the supply and demand balance as set forth in claim 1, wherein the influencing parameter δ i,a,b is:
Where LW l represents the size of the periodic phase window of link l i, EC is the fundamental period, and Id i,l represents the idle time in the periodic phase.
3. The method for analyzing time delay of train communication network based on supply and demand balance according to claim 2, wherein the idle time Id i,l in the periodic phase is
Wherein PK j represents the size of m j packet, m j shares a link l i with m i, and the priority of data m j is higher than or equal to the priority of m i, where j e [1, N ], N is the number of periodic information to be transmitted in the network.
4. A train communication network time delay analysis method based on supply and demand balance as claimed in any one of claims 1 to 3, wherein the calculation method of U i,a,b is as follows:
C k denotes a transmission time of m k, m k denotes data sharing one or more links of l a to l b with m i, and a priority higher than or equal to m i,Tk denotes a period of m k.
5. The method for analyzing time delay of train communication network based on supply and demand balance according to claim 4, wherein the switch time delay is affected by the transmission time itself and other data transmission.
6. The method for analyzing time delay of train communication network based on supply and demand balance according to claim 4, wherein the influence of the switch time delay during the transmission of the message queue is considered only once.
7. The method for analyzing train communication network delay based on supply and demand balance according to claim 4, wherein there is no switch forwarding delay at the source node, the switch delay calculation starts from l a+1, and the switch forwarding delay calculation is divided into two cases:
m 1 and m 2 only share input links, output links are different, and the forwarding delay of the switch is equal to the respective transmission time;
m 1 and m 2 share only the output link and share both the input and output links, and since the output links are the same, data will be queued at the same output port of the switch, and the second data is in a state of being stored and waiting for forwarding during the process of forwarding the first data to the output port.
8. The supply and demand balance-based train communication network delay analysis method of claim 4, wherein the switch delay SD i,a,b of m i is as follows:
SDi,a,b＝SFDi,a,b+SFDi,a,b
wherein C q represents the transmission time of m q, SFD is the switch forwarding delay, and SWD is the switch hardware delay.
9. The method for analyzing the time delay of the train communication network based on the supply and demand balance according to claim 8, wherein the hardware time delay of the switch is 50 μs.
10. The method for analyzing time delay of train communication network based on supply and demand balance according to claim 1, wherein the propagation velocity v is 2.0 x 108m/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 CN114363215A (en) | 2022-04-15 |
| CN114363215B true 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 |
|---|
| A feed forward based smart link management scheme for future generation network;Satyanarayan K. Padaganur;2018 4th International Conference on Recent Advances in Information Technology (RAIT);全文 * |
| 基于工业以太网的列车通信网络调度算法优化;蔡杨湧;中国知网;全文 * |
| 雷昊 ; 贺德强 ; 苗剑 ; .高速动车组车载以太网时延分析.计算机测量与控制.2013,(05),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114363215A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bauer et al. | Applying and optimizing trajectory approach for performance evaluation of AFDX avionics network | |
| Scharbarg et al. | A probabilistic analysis of end-to-end delays on an AFDX avionic network | |
| Zhang et al. | Task-and network-level schedule co-synthesis of Ethernet-based time-triggered systems | |
| Bauer et al. | Applying Trajectory approach with static priority queuing for improving the use of available AFDX resources | |
| 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 | |
| US9253045B2 (en) | Modeling and simulating flow propagation in dynamic bandwidth systems | |
| US10887244B1 (en) | Methods, systems and apparatuses for optimizing time-triggered ethernet (TTE) network scheduling 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 | |
| CN113498106A (en) | Scheduling method and device for time-sensitive network TSN (transport stream network) stream | |
| CN112311494A (en) | Message transmission method, device and system | |
| CN114448894A (en) | Multi-level service scheduling engine facing time sensitive network and implementation method | |
| Huang et al. | Flexible cyclic queuing and forwarding for time-sensitive software-defined networks | |
| CN101478456A (en) | Fast forwarding service end-to-end time delay prediction method | |
| US20050055196A1 (en) | Wireless network hybrid simulation | |
| Ashjaei et al. | Improved message forwarding for multi-hop hartes real-time ethernet networks | |
| Soni et al. | Optimizing network calculus for switched ethernet network with deficit round robin | |
| Gutiérrez et al. | Response time analysis in AFDX networks with sub-virtual links and prioritized switches | |
| Deng et al. | A low-delay AVB flow scheduling method occupying the guard band in Time-Sensitive Networking | |
| Feng et al. | SMT-based task-and network-level static schedule for time sensitive network | |
| CN114363215B (en) | Train communication network time delay analysis method based on supply and demand balance | |
| CN117439959A (en) | Traffic scheduling method for industrial heterogeneous network | |
| Xie et al. | A real-time CAN-CAN gateway with tight latency analysis and targeted priority assignment | |
| Ayed et al. | Frame packing strategy within gateways for multi-cluster avionics embedded networks | |
| Watson et al. | Determining end-to-end delays using network calculus | |
| Sun et al. | Joint Routing and Scheduling Optimization of in Vehicle Time Sensitive Networks based on Improved Grey Wolf Optimizer |
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 |