CN113179177B - Scheduling method and system for solving time trigger message conflict - Google Patents
Scheduling method and system for solving time trigger message conflict Download PDFInfo
- Publication number
- CN113179177B CN113179177B CN202110368213.XA CN202110368213A CN113179177B CN 113179177 B CN113179177 B CN 113179177B CN 202110368213 A CN202110368213 A CN 202110368213A CN 113179177 B CN113179177 B CN 113179177B
- Authority
- CN
- China
- Prior art keywords
- virtual link
- time
- forwarding
- scheduling
- calculating
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/084—Configuration by using pre-existing information, e.g. using templates or copying from other elements
- H04L41/0846—Configuration by using pre-existing information, e.g. using templates or copying from other elements based on copy from other elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a scheduling algorithm and a system for solving time-triggered message conflict, wherein the algorithm comprises the following steps: s1, acquiring related information according to the network topology model and the data traffic plan; s2, calculating and acquiring the forwarding time of the virtual link by using the front-end scheduling process; s3, calculating the greatest common divisor according to the virtual link, and performing correlation operation; and S4, writing the data related to the virtual link into the configuration file, and downloading the data to the switch and each end node device. Has the advantages that: the algorithm provided by the invention allows a plurality of end nodes to send TT messages at the same time, and the TT messages are forwarded to the destination end node after being processed by the switch, so that the bandwidth utilization rate of a switching network is improved; and under different bandwidths, the time slot resources can be utilized to the maximum extent, virtual links are arranged to participate in scheduling as many as possible, and the bandwidth is fully utilized.
Description
Technical Field
The invention relates to the technical field of data communication buses, in particular to a scheduling method and a scheduling system for solving time-triggered message conflicts.
Background
The aviation airborne bus is used for connecting all subsystems in an airplane, is the center of a modern avionics system, and is of great importance to influence of the performance of the airborne total line on the overall performance of the airplane.
Aiming at the aviation aircrafts with specific models, airborne equipment network topology models, equipment quantity, data flow and the like are generally determined, and the situations of dynamically adding equipment nodes and adjusting network topology are basically avoided, so that the novel airborne data communication protocol of time-triggered Ethernet is adopted, and the requirements of airborne equipment on data communication can be better met.
The time-triggered network mainly comprises a sending end node, a receiving end node and a switch, wherein a plurality of Virtual Links (VL) are planned in the network, the sending end node configures and sends messages to the switch according to VL parameters, and the switch is responsible for receiving the messages sent by all the VLs and forwarding the messages to the corresponding receiving end nodes.
After receiving the message from the sending end, the switch needs to forward the message to the receiving end node according to a pre-planned time point, each VL sends the message according to a respective configured period, and the switch also forwards the message according to the period, so that a plurality of forwarding time points exist for one VL, and for a plurality of VLs, a forwarding schedule is formed, the abscissa is time, and the ordinate is VL number.
Because the switch can only forward one message at the same time, two same times cannot exist in the forwarding time table, and therefore, the condition of time conflict needs to be checked and processed in a scheduling algorithm of the time-triggered network.
The existing time-triggered network scheduling scheme has low bandwidth utilization rate for a switching network, only one end node is allowed to communicate with a target end node through a switch at the same time for TT messages, and the TT messages of other end nodes cannot occupy the bandwidth of the switching network at the time.
Some research has been done domestically and abroad on the basis of the switched time-triggered network, for example, a time slot allocation scheduling method based on the switched time-triggered network disclosed in patent No. 201910922611.4, which determines communication equipment and a network scheduling period in an airborne network system according to the communication requirements of the airborne network system; counting the number of time-triggered communication streams required by each communication device, and counting the proportion of the communication bandwidth required by each communication device and sent based on time triggering to the total communication bandwidth; the network scheduling period is divided into separate time slots in equal length according to the total time trigger communication flow number required by all communication equipment; and allocating the time slots to corresponding communication equipment after certain processing, wherein each communication equipment sends time trigger communication streams in the respective whole time slots, and in the residual bandwidth of the network scheduling period, the communication equipment adopts a flow control type mode and a best effort transmission type mode to access and transmit according to an exchange type communication mode.
An effective solution to the problems in the related art has not been proposed yet.
Disclosure of Invention
Aiming at the problems in the related art, the invention provides a scheduling method and a scheduling system for solving the conflict of time-triggered messages, so as to overcome the technical problems in the prior art.
Therefore, the invention adopts the following specific technical scheme:
according to one aspect of the present invention, a scheduling method for resolving time-triggered packet collisions is provided, wherein the algorithm comprises the following steps:
s1, acquiring related information according to the network topology model and the data flow planning;
s2, calculating and acquiring the forwarding time of the virtual link by using the front-end scheduling process;
s3, calculating the greatest common divisor according to the virtual link, and performing correlation operation;
s4, writing the data related to the virtual link into a configuration file, and downloading the data to the switch and each end node device;
wherein, the step S3 of calculating the greatest common divisor according to the virtual link and performing the correlation operation includes the following steps:
s31, calculating the greatest common divisor according to the virtual link period;
s32, dividing a plurality of intervals according to the fixed time unit and the greatest common divisor;
s33, utilizing the forwarding time of the virtual link to carry out complementation on the maximum common divisor and obtaining a remainder;
S34, placing the corresponding virtual link into the corresponding interval according to the remainder, and calculating the forwarding timetable in each interval;
and S35, traversing the forwarding schedule, if a conflict moment exists, increasing an offset to the initial forwarding moment of the corresponding virtual link, and accumulating the offset in the interval.
Further, the related information includes the number of nodes in the network and the corresponding relationship between each node and a switch port, which are obtained according to the network topology model, and the virtual link parameters of each TT type, which are obtained according to the data traffic plan.
Further, the virtual link parameters include a virtual link number, a virtual link sending node, a virtual link receiving node, a virtual link length, and a virtual link period.
Further, the calculating and obtaining the forwarding time of the virtual link by using the front-end scheduling process includes the following steps:
s21, calculating the forwarding time of each virtual link on the switch by using a front-end scheduling process;
and S22, acquiring the forwarding time after the operation of the front-end scheduling process is finished.
Further, the forwarding time is guaranteed to be a multiple of a fixed time unit by a front-end algorithm.
Further, the related data includes virtual link forwarding time, virtual link period, and virtual link transceiving node.
Furthermore, the exchanger and the end node run a VxWorks6.9 real-time operating system, and data transmission in a switching network is processed in a multi-task mode.
According to another aspect of the present invention, there is also provided a scheduling system for resolving time-triggered packet collisions, the system including:
the information acquisition module is used for acquiring related information according to the network topology model and the data flow planning;
the forwarding time calculation module is used for calculating and acquiring the forwarding time of the virtual link by utilizing the front-end scheduling process;
the operation module is used for calculating the greatest common divisor according to the virtual link and carrying out related operation;
and the configuration downloading module is used for writing the data related to the virtual link into the configuration file and downloading the data to the switch and each end node device.
Further, the related information includes the number of nodes in the network and the corresponding relationship between each node and a switch port, which are obtained according to the network topology model, and the virtual link parameters of each TT type, which are obtained according to the data traffic plan, and the related data includes the virtual link forwarding time, the virtual link period, and the virtual link transceiving nodes.
The beneficial effects of the invention are as follows: the invention is used as a link for planning and scheduling time-triggered Ethernet, parameters are extracted from preposed links and conditions such as a network topology model, data flow planning, a front-end scheduling algorithm and the like so as to be processed by the scheduling algorithm, and the provided algorithm allows a plurality of end nodes to send TT messages at the same time and forwards the TT messages to a target end node after the TT messages are processed by a switch, so that the bandwidth utilization rate of a switching network is improved; and under different bandwidths, the time slot resources can be utilized to the maximum extent, virtual links are arranged to participate in scheduling as many as possible, and the bandwidth is fully utilized.
Compared with the prior art, the invention adopts the modes of interval division and forwarding time offset to solve the problem of forwarding time conflict, and the scheduling and forwarding work is finished by centralizing the scheduling and forwarding work at the switch side, so that the constraint of the opposite end nodes in the network can be simplified, each end node can plan more virtual links, and a plurality of end nodes can send messages to the switch at the same time, thereby more fully utilizing the bandwidth of a switching network; and the technical scheme can fully exert the hardware capability according to the parameters such as the interval range, the forwarding offset and the like of the hardware adjustment of the switch. The scheme can better meet the requirements of time-critical services in the aspect of avionics and the real-time performance and the certainty of communication among all nodes in the distributed airborne network.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
FIG. 1 is a flowchart of a scheduling method for resolving time-triggered packet conflicts according to an embodiment of the present invention;
Fig. 2 is a schematic diagram of a period of time when nodes transmit TT frames in a scheduling period in a scheduling method for resolving a time-triggered message conflict according to an embodiment of the present invention;
fig. 3 is a schematic diagram illustrating partial conditions of each VL before offset processing in a scheduling method for resolving a time-triggered packet conflict according to an embodiment of the present invention;
fig. 4 is a VL1\ VL3\ VL4 forwarding schedule in a scheduling method for resolving a time-triggered message conflict according to an embodiment of the present invention;
fig. 5 is a schematic diagram illustrating partial VL parts after offset processing in a scheduling method for resolving a time triggered packet collision according to an embodiment of the present invention;
fig. 6 is a system block diagram of a scheduling system for resolving time triggered packet collisions according to an embodiment of the present invention.
In the figure:
1. an information acquisition module; 2. a forwarding time calculation module; 3. an operation module; 4. and configuring a downloading module.
Detailed Description
For further explanation of the various embodiments, the drawings which form a part of the disclosure and which are incorporated in and constitute a part of this specification, illustrate embodiments and, together with the description, serve to explain the principles of operation of the embodiments, and to enable others of ordinary skill in the art to understand the various embodiments and advantages of the invention, and, by reference to these figures, reference is made to the accompanying drawings, which are not to scale and wherein like reference numerals generally refer to like elements.
According to the embodiment of the invention, a scheduling method and a scheduling system for solving the conflict of time-triggered messages are provided.
Referring to the drawings and the detailed description, the present invention will be further explained, as shown in fig. 1 to 5, according to the scheduling method for resolving a time triggered packet conflict in the embodiment of the present invention, the algorithm includes the following steps:
s1, acquiring related information according to the network topology model and the data flow planning;
s2, calculating and acquiring the forwarding time of the virtual link by using the front-end scheduling process;
s3, calculating the greatest common divisor according to the virtual link, and performing correlation operation;
s4, writing the data related to the virtual link into a configuration file, and downloading the data to the switch and each end node device;
wherein, the step S3 of calculating the greatest common divisor according to the virtual link and performing the correlation operation includes the following steps:
s31, calculating the greatest common divisor according to the virtual link period;
s32, dividing a plurality of intervals according to the fixed time unit and the greatest common divisor;
s33, utilizing the forwarding time of the virtual link to carry out complementation on the maximum common divisor and obtaining a remainder;
s34, putting the corresponding virtual link into the corresponding interval according to the remainder, and calculating a forwarding schedule in each interval;
And S35, traversing the forwarding schedule, if a conflict moment exists, adding an offset to the initial forwarding moment of the corresponding virtual link, and accumulating the offset in an interval.
In an embodiment, the related information includes the number of nodes in the network and the correspondence between each node and a switch port, which are obtained according to the network topology model, and the virtual link parameters of each TT type, which are obtained according to the data traffic plan.
In one embodiment, the virtual link parameters include a virtual link number, a virtual link sending node, a virtual link receiving node, a virtual link length, and a virtual link period.
In an embodiment, the calculating and obtaining the forwarding time of the virtual link by using the front-end scheduling process includes the following steps:
s21, calculating the forwarding time of each virtual link on the switch by using a front-end scheduling process;
and S22, acquiring the forwarding time after the operation of the front-end scheduling process is finished.
For the problem of scheduling time conflict, the method of adopting interval grouping and forwarding time offset is considered to process: assuming that the initial packet forwarding time of each VL (virtual link) on the switch differs by a multiple of 20us (guaranteed by a front-end scheduling algorithm), and the greatest common divisor of each planned VL cycle is M (M is a multiple of 20us), M/20 intervals can be set: 0us, 20us), 20us, 40us) … … M-20us, M.
In one embodiment, the forwarding time is guaranteed by the front-end algorithm to be a multiple of a fixed unit of time.
Calculating a remainder obtained by complementing M at each VL message forwarding moment, putting the VL into a corresponding interval according to the remainder, calculating a forwarding timetable in each interval, wherein the starting moment of a time axis of the forwarding timetable is 0 moment, and the ending moment is the least common multiple of each VL period in the interval, traversing the timetable, and if a conflict moment exists, adding an offset to the corresponding VL initial forwarding moment, wherein the offset is accumulated in the interval, for example, the initial offset is 0, and the offset step value is delta (the value is usually ns level), and the processed VL initial forwarding moment is changed from X to X + delta; if more conflict moments are traversed subsequently, the offset needs to be increased at each corresponding VL initial forwarding moment: 2 Δ, 3 Δ … … n Δ. Distribution of each VL in the section before the shift processing is shown in fig. 3.
As can be seen from fig. 3, VL1\ VL3\ VL4 falls within the interval [0,20us), so that the forwarding time table of VL1\ VL3\ VL4 in [0,20us) is calculated before the migration processing, and the obtained time table is shown in fig. 3.
It can be seen from fig. 4 that three VLs collide at times t2\ t3\ t4\ t6, so that a forwarding time shifting manner needs to be adopted to shift VL4 and VL3 by Δ and 2 Δ, respectively, and the shifting process is as shown in fig. 5.
The core of the invention is to avoid the scheduling conflict by the mode of the forwarding time deviation, and establish a forwarding time table in an interval as the reference of deviation processing. In addition, the algorithm implemented herein does not require that the VLs within the span grouping must be from the same end node, e.g., [0,20us) VL1, VL3, VL4 may be from three end nodes, respectively. Through the algorithm processing, the time without conflict in the intervals can be ensured, and the intervals are distributed in different us time ranges, so that the conflict time does not exist, and the condition that the global forwarding timetable composed of all VLs has no time conflict is ensured.
In addition, the algorithm step of the present invention does not limit that the initial message forwarding time of each VL must differ by a multiple of 20us, and according to the front-end algorithm and the hardware capability, the initial message forwarding time of each VL may differ by a smaller or larger time unit, such as a multiple of 2us or a multiple of 2 ms.
In one embodiment, the related data includes a virtual link forwarding time, a virtual link period, and a virtual link transceiving node.
In one embodiment, the switch and the end nodes run a vxworks6.9 real-time operating system and handle data transmission in the switching network in a multitasking manner.
According to another embodiment of the present invention, as shown in fig. 6, there is further provided a scheduling system for resolving a time-triggered message conflict, for implementing the steps of the scheduling method for resolving a time-triggered message conflict, the system including:
the information acquisition module 1 is used for acquiring related information according to a network topology model and data flow planning;
the forwarding time calculation module 2 is used for calculating and acquiring the forwarding time of the virtual link by using a front-end scheduling process;
the operation module 3 is used for calculating the greatest common divisor according to the virtual link and carrying out related operation;
and the configuration downloading module 4 is used for writing the data related to the virtual link into the configuration file and downloading the data to the switch and each end node device.
In an embodiment, the related information includes the number of nodes in the network and the corresponding relationship between each node and a switch port, which are obtained according to the network topology model, and the virtual link parameters of each TT type, which are obtained according to the data traffic plan, and the related data includes virtual link forwarding time, virtual link period, and virtual link transceiving nodes.
In summary, with the above technical solution of the present invention, the present invention is used as a link of time-triggered ethernet planning and scheduling, parameters are extracted from the network topology model, data traffic planning, front-end scheduling algorithm and other pre-links and conditions, so as to perform scheduling algorithm processing, and the provided algorithm allows multiple end nodes to send TT packets at the same time, and the TT packets are forwarded to the destination end node after being processed by the switch, thereby improving the bandwidth utilization rate of the switching network; and under different bandwidths, the time slot resources can be utilized to the maximum extent, virtual links are arranged to participate in scheduling as many as possible, and the bandwidth is fully utilized.
Compared with the prior art, the invention adopts the modes of interval division and forwarding time offset to solve the problem of forwarding time conflict, and the scheduling and forwarding work is completed by centralizing the dispatching and forwarding work at the side of the switch, so that the constraint of opposite end nodes in the network can be simplified, each end node can plan more virtual links, and a plurality of end nodes can send messages to the switch at the same time, thereby more fully utilizing the bandwidth of a switching network; in addition, the technical scheme can fully exert the hardware capability according to the parameters such as the interval range, the forwarding offset and the like of the hardware adjustment of the switch. The scheme can better meet the requirements of time-critical services in the aspect of avionics and the real-time performance and the certainty of communication among all nodes in the distributed airborne network.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (7)
1. A scheduling method for resolving time triggered packet conflicts is characterized in that the method comprises the following steps:
s1, acquiring related information according to the network topology model and the data traffic plan;
S2, calculating and acquiring the forwarding time of the virtual link by using the front-end scheduling process;
s3, calculating the greatest common divisor according to the virtual link, and performing correlation operation;
s4, writing the data related to the virtual link into a configuration file, and downloading the data to the switch and each end node device;
wherein, the step S3 of calculating the greatest common divisor according to the virtual link and performing the correlation operation includes the following steps:
s31, calculating the greatest common divisor according to the virtual link period;
s32, dividing a plurality of intervals according to the fixed time unit and the greatest common divisor;
s33, utilizing the forwarding time of the virtual link to carry out complementation on the maximum common divisor and obtaining a remainder;
s34, placing the corresponding virtual link into the corresponding interval according to the remainder, and calculating the forwarding timetable in each interval;
s35, traversing the forwarding timetable, if a conflict moment exists, adding an offset to the corresponding virtual link initial forwarding moment, and accumulating the offset in an interval;
the related information comprises the number of nodes in the network and the corresponding relation between each node and a switch port, which are obtained according to the network topology model, and parameters of virtual links of each TT type, which are obtained according to the data flow plan;
The related data comprises virtual link forwarding time, virtual link period and virtual link transceiving nodes.
2. The scheduling method of claim 1 wherein the virtual link parameters include a virtual link number, a virtual link sending node, a virtual link receiving node, a virtual link length, and a virtual link period.
3. The scheduling method of claim 2, wherein the step of calculating and obtaining the forwarding time of the virtual link by using the front-end scheduling process comprises the following steps:
s21, calculating the forwarding time of each virtual link on the switch by using the front-end scheduling process;
and S22, acquiring the forwarding time after the operation of the front-end scheduling process is finished.
4. The scheduling method of claim 3 wherein the forwarding time is guaranteed by a front-end algorithm to be a multiple of a fixed time unit.
5. The dispatching method for resolving time-triggered packet collisions as recited in claim 4, wherein the switch and the end nodes run a vxworks6.9 real-time operating system and handle data transmission in the switching network in a multitasking manner.
6. A scheduling system for resolving time-triggered message conflicts, used in the steps of a scheduling method for resolving time-triggered message conflicts according to any one of claims 1 to 5, the system comprising:
the information acquisition module is used for acquiring related information according to the network topology model and the data flow planning;
the forwarding time calculation module is used for calculating and acquiring the forwarding time of the virtual link by utilizing the front-end scheduling flow;
the operation module is used for calculating the greatest common divisor according to the virtual link and carrying out related operation;
and the configuration downloading module is used for writing the data related to the virtual link into the configuration file and downloading the data to the switch and each end node device.
7. The scheduling system of claim 6 wherein the relevant information includes the number of nodes in the network and the correspondence between each node and a switch port, which are obtained according to the network topology model, and the TT-type virtual link parameters, which are obtained according to the data traffic plan, and the relevant data includes the virtual link forwarding time, the virtual link period, and the virtual link transceiving nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110368213.XA CN113179177B (en) | 2021-04-06 | 2021-04-06 | Scheduling method and system for solving time trigger message conflict |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110368213.XA CN113179177B (en) | 2021-04-06 | 2021-04-06 | Scheduling method and system for solving time trigger message conflict |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113179177A CN113179177A (en) | 2021-07-27 |
| CN113179177B true CN113179177B (en) | 2022-07-29 |
Family
ID=76922988
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110368213.XA Active CN113179177B (en) | 2021-04-06 | 2021-04-06 | Scheduling method and system for solving time trigger message conflict |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113179177B (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3798720B2 (en) * | 2002-03-28 | 2006-07-19 | 株式会社東芝 | Message initial transmission time calculation method and program |
| CN108848146B (en) * | 2018-05-25 | 2020-02-18 | 西安云维智联科技有限公司 | Scheduling optimization method based on time-triggered communication service |
| CN109818876B (en) * | 2019-03-11 | 2021-04-27 | 西安电子科技大学 | Method for generating global optimization time-triggered service schedule |
| CN111327473B (en) * | 2020-02-26 | 2021-03-19 | 腾讯科技（深圳）有限公司 | Network regulation and control method, device, network regulation and control system and electronic equipment |
-
2021
- 2021-04-06 CN CN202110368213.XA patent/CN113179177B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113179177A (en) | 2021-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6456330B2 (en) | Realization method of industrial Internet broadband fieldbus | |
| CN103493448A (en) | Hierarchical profiled scheduling and shaping | |
| CN110971543B (en) | Transmission scheduling method and system of TTFC network | |
| CN109639560B (en) | Method for improving availability of real-time computer network | |
| CN117156563B (en) | Channel resource access allocation method adapting to high dynamic and strong random service change | |
| CN116319549B (en) | Distributed flow scheduling method and device | |
| US5276682A (en) | Medium access technique for LAN systems | |
| CN110971538A (en) | Time-triggered transmission method supporting burst real-time data | |
| CN107786457B (en) | High-speed Ethernet deterministic high-bandwidth data transmission method | |
| CN115297031B (en) | ARINC664 terminal message delay upper bound analysis method based on FIFO scheduling | |
| CN110661589B (en) | Time slot allocation scheduling method based on switched time-triggered network | |
| US10389806B2 (en) | Method for asynchronous data communication in a real-time capable ethernet data network | |
| CN109429347A (en) | Slot allocation method and device | |
| CN113179177B (en) | Scheduling method and system for solving time trigger message conflict | |
| CN113055301A (en) | Congestion control method and related equipment | |
| CN108566343B (en) | Traffic management for a switch port time firewall based on time-triggered switches | |
| CN1089416A (en) | Method for allocating communication technology resources in a communication system operating in asynchronous transfer mode | |
| JP6152425B2 (en) | Real-time message transmission method and computer network for transmitting real-time messages | |
| CN114285541A (en) | A method for generating Ethernet scheduling table based on delay error time triggering | |
| CN107770875A (en) | Aeronautical Ad hoc networks hybrid MAC protocols | |
| WO2023109445A1 (en) | Service scheduling method based on time trigger ethernet | |
| CN110601744B (en) | Dispatching method for sending virtual link of AFDX (avionics full Duplex switched Ethernet) network | |
| CN110601996B (en) | Looped network anti-starvation flow control method adopting token bottom-preserving distributed greedy algorithm | |
| US8817622B1 (en) | Data network with aggregate flow monitoring | |
| CN106788863A (en) | A kind of aviation electronics WDM network management analogue systems for supporting subnet time triggered to communicate |
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 |