CN113904993B - Multi-priority time-triggered Ethernet clock synchronous control method - Google Patents
Multi-priority time-triggered Ethernet clock synchronous control method Download PDFInfo
- Publication number
- CN113904993B CN113904993B CN202111258576.4A CN202111258576A CN113904993B CN 113904993 B CN113904993 B CN 113904993B CN 202111258576 A CN202111258576 A CN 202111258576A CN 113904993 B CN113904993 B CN 113904993B
- Authority
- CN
- China
- Prior art keywords
- priority
- node
- synchronous
- message
- synchronization
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Synchronisation In Digital Transmission Systems (AREA)
Abstract
The invention discloses a time-triggered Ethernet clock synchronous control method supporting multiple priority levels, which controls the priority levels of a synchronous source node, a compression control node and a synchronous slave node by adopting three parameters of local priority levels, current priority levels and lowest priority levels, and different priority marks distinguish different sub-networks, so that the nodes can automatically match with the current reasonable synchronous source through the priority level control in the process of topology change of the network, thereby establishing autonomous resynchronization in the process of changing the synchronous source for the network node without modifying synchronous configuration, and having positive significance for improving the flexibility of the time-triggered Ethernet. The invention can realize the network clock synchronization under the condition of clock source change, and improves the flexibility of clock synchronization; the priority control in the invention is automatically completed by the bottom hardware, does not need user intervention, is transparent to users, and reduces the use difficulty.
Description
Technical Field
The invention belongs to the technical field of Ethernet, and particularly relates to a time-triggered Ethernet clock synchronous control method supporting multiple priority.
Background
The time-triggered Ethernet adopts distributed network clock synchronization, a certain number of synchronization source nodes, compression control nodes and synchronization slave nodes are needed in the synchronization process, after the number of the synchronization source nodes is determined, all the synchronization source nodes, the compression control nodes and the synchronization slave nodes are needed to be configured, the configuration can be used for defining the synchronization source nodes in the network, and when the network topology changes, for example, network merging and the like, the synchronization source nodes cannot establish new synchronization if the synchronization source nodes change.
At present, the synchronization needs to be re-established after the synchronization source node changes by means of upper software to re-configure the nodes, and the mode generally requires user intervention, has large time overhead and difficult operation, and limits the flexibility of the time-triggered Ethernet.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a clock synchronization control method of a time-triggered Ethernet supporting multiple priority, which is used for solving the problems that user intervention is needed, time cost is high, operation is difficult, and flexibility of the time-triggered Ethernet is limited.
In order to achieve the above purpose, the present invention provides the following technical solutions:
a time-triggered Ethernet clock synchronous control method supporting multiple priority levels adopts three parameters of local priority level, current priority level and lowest priority level to carry out priority level control on a synchronous source node, a compression control node and a synchronous slave node, wherein the larger the value of the local priority level parameter is, the higher the priority level of the node is;
the synchronous source node is used for maintaining three parameters of local priority, current priority and lowest priority; the synchronous messages sent by the synchronous source nodes all contain the local priority of the synchronous source nodes; after receiving the synchronous message, the synchronous source node analyzes the message, extracts the priority in the message and compares the current priority of the synchronous source node, and receives the synchronous message when the priority in the message and the current priority of the synchronous source node are the same, otherwise does not receive the synchronous message; when the priority of the received synchronous message is greater than the current priority of the synchronous source node, the node assigns the message priority to the current priority, and when the priority of the received synchronous message is not greater than the current priority of the synchronous source node, the node maintains the current priority unchanged;
the compression control node is used for maintaining the parameter of local priority; the synchronous messages sent by the compression control nodes all contain local priority of the compression control nodes; after receiving the synchronous message, the compression control node analyzes the message, extracts the priority in the message and compares the priority with the local priority of the node, and receives the synchronous message when the priority in the message is the same as the local priority of the node, otherwise, does not receive the synchronous message;
the synchronous slave node is used for maintaining two parameters of the current priority and the lowest priority; after receiving the synchronous message, the synchronous slave node analyzes the message, extracts the priority in the message and compares the current priority of the synchronous slave node, and receives the synchronous message when the priority in the message is the same as the current priority, otherwise does not receive the synchronous message; when the priority of the received synchronous message is greater than the current priority of the synchronous slave node, the node assigns the message priority to the current priority, and when the priority of the received synchronous message is not greater than the current priority of the synchronous slave node, the node maintains the current priority unchanged.
Preferably, a current priority overtime counter with the length of Q is maintained in the synchronous source node, the current priority overtime counter counts up from 0 to Q, when a message with the same current priority is received, the counter starts counting again from 0, and when the count value of the counter increases to Q, the node assigns the lowest priority to the current priority.
Preferably, the priority in the synchronization message forwarded by the compression control node is not processed by the compression control node.
Preferably, the priority in the synchronization message forwarded by the synchronization slave node is not processed by the synchronization slave node.
Preferably, the synchronization slave node maintains a current priority timeout counter with a length of Q, the counter counts up from 0 to Q, when a message with the same current priority is received, the counter starts counting again from 0, and when the counter count value of the counter increases to Q, the node assigns the lowest priority to the current priority.
Preferably, the local priority values of the synchronization source node and the compression control node are unchanged during operation.
Preferably, the lowest priority values of the sync slave node and the sync source node are unchanged during operation.
Compared with the prior art, the invention has the following beneficial technical effects:
the invention provides a time-triggered Ethernet clock synchronous control method supporting multiple priority levels, which controls the priority levels of a synchronous source node, a compression control node and a synchronous slave node by adopting three parameters of local priority levels, current priority levels and lowest priority levels, and different priority marks distinguish different sub-networks, so that the nodes can automatically match with the current reasonable synchronous source through the priority level control in the process of topology change of the network, thereby establishing autonomous resynchronization in the process of changing the synchronous source for the network node without modifying synchronous configuration, and having positive significance for improving the flexibility of the time-triggered Ethernet. The invention can realize the network clock synchronization under the condition of clock source change, and improves the flexibility of clock synchronization; the priority control in the invention is automatically completed by the bottom hardware, does not need user intervention, is transparent to users, and reduces the use difficulty.
Drawings
FIG. 1 is a schematic diagram of a network topology according to an embodiment of the present invention;
in the accompanying drawings: 1 is a first compression control node; 2 is a second compression control node; 3 is a first synchronization slave node; 4 is a first synchronization source node; 5 is a second synchronization source node; 6 is a third synchronization source node; 7 is a fourth synchronization source node; 8 is a second synchronization slave node; and 9 is an interconnection cable.
Detailed Description
The invention will now be described in further detail with reference to specific examples, which are intended to illustrate, but not to limit, the invention.
The invention discloses a time-triggered Ethernet clock synchronous control method supporting multiple priority levels, which adopts three parameters of local priority level, current priority level and lowest priority level to carry out priority level control on a synchronous source node, a compression control node and a synchronous slave node, wherein the larger the value of the local priority level parameter is, the higher the priority level of the node is.
A priority control mechanism of the synchronous source node;
three parameters of local priority, current priority and lowest priority are maintained in the synchronous source node. The local priority indicates the priority of the node, the value range is 0 to N, the larger the numerical value is, the higher the priority is, the numerical value is set by a user, and the numerical value is unchanged in the running process. The current priority indicates the current and which priority clusters of the node are synchronized, the value range is 0 to N, the larger the value is, the higher the priority is, the initial value of the parameter is set by a user, and the node is controlled autonomously in the running process. The lowest priority indicates the lowest priority of the cluster with which the node can synchronize, the value range is 0 to N, the larger the value is, the higher the priority is indicated, the value is set by a user, and the value is unchanged in the running process.
The synchronization messages sent by the synchronization source nodes all contain the local priority of the nodes. After receiving the synchronous message, the synchronous source node analyzes the message, extracts the priority in the message and compares the current priority of the node, and receives the synchronous message when the priority in the message is the same as the current priority of the node, otherwise does not receive the synchronous message.
The method for maintaining the current priority of the node by the synchronous source node is as follows: when initializing, setting a current priority value by a user; when the priority of the received synchronous message is greater than the current priority of the node, the node assigns the message priority to the current priority, and when the priority of the received synchronous message is not greater than the current priority of the node, the node maintains the current priority unchanged; meanwhile, the node maintains a current priority overtime counter with the length of Q, the counter counts up from 0 to Q, when a message with the same current priority is received, the counter starts counting again from 0, and when the count value of the counter increases to Q, the node assigns the lowest priority to the current priority.
A priority control mechanism of the compression control node;
the compression control node maintains the local priority parameter. The local priority indicates the priority of the node, the value range is 0 to N, the larger the numerical value is, the higher the priority is, the numerical value is set by a user, and the numerical value is unchanged in the running process.
The synchronous messages sent by the compression control node all contain local priority. After receiving the synchronous message, the compression control node analyzes the message, extracts the priority in the message and compares the priority with the local priority of the node, and receives the synchronous message when the priority in the message is the same as the local priority of the node, otherwise, does not receive the synchronous message. The priority in the synchronous message forwarded by the control node is compressed, and the node does not process the synchronous message.
A priority control mechanism for synchronizing the slave nodes;
the synchronization slave node maintains two parameters of current priority and lowest priority. The current priority indicates the current and which priority clusters of the node are synchronized, the value range is 0 to N, the larger the value is, the higher the priority is, the initial value of the parameter is set by a user, and the node is controlled autonomously in the running process. The lowest priority indicates the lowest priority of the cluster with which the node can synchronize, the value range is 0 to N, the higher the value is, the higher the priority is indicated, the value is set by a user, and the value is unchanged in the running process.
The sync slave node does not send any sync message. After the synchronous slave node receives the synchronous message, the message is analyzed, the priority in the message is extracted and compared with the current priority of the node, when the priority in the message is the same as the current priority, the synchronous message is received, otherwise, the synchronous message is not received. The priority in the synchronization message forwarded by the slave node is synchronized, and the node does not process the priority.
The method for maintaining the current priority of the node by the synchronous slave node is consistent with the synchronous master node, and comprises the following steps: when initializing, setting a current priority value by a user; when the priority of the received synchronous message is greater than the current priority of the node, the node assigns the message priority to the current priority, and when the priority of the received synchronous message is not greater than the current priority of the node, the node maintains the current priority unchanged; meanwhile, the node maintains a current priority overtime counter with the length of Q, the counter counts up from 0 to Q, when a message with the same current priority is received, the counter starts counting again from 0, and when the count value of the counter increases to Q, the node assigns the lowest priority to the current priority.
Examples
As shown in fig. 1, according to the detailed implementation of the content design of the present invention, a network is constructed with 4 sync source nodes, 2 sync slave nodes, and 2 compression control nodes; the network topology structure of the embodiment of the invention comprises a first compression control node 1, a second compression control node 2, a first synchronization slave node 3, a first synchronization source node 4, a second synchronization source node 5, a third synchronization source node 6, a fourth synchronization source node 7, a second synchronization slave node 8, and an interconnection cable 9 between the first compression control node 1 and the second compression control node 2.
Initial values of the priority parameters for each node are shown in table 8.1 below, where i < j < k:
TABLE 8.1 initial values of priority parameters for nodes
After the operation starts, the first synchronization source node 4 and the second synchronization source node 5 send synchronization messages, the priority in the messages is equal to the local priority j of the node, the third synchronization source node 6 and the fourth synchronization source node 7 send synchronization messages, the priority in the messages is equal to the local priority k of the node, and the first synchronization slave node 3 and the second synchronization slave node 8 do not send synchronization messages; then, the first compression control node 1 receives the synchronous messages sent by the first synchronous source node 4 and the second synchronous source node 5, and sends the synchronous message with the priority of j after compression; the second compression control node 2 receives the synchronous messages sent by the third synchronous source node 6 and the fourth synchronous source node 7, and sends the synchronous message with the priority of k after compression. The first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 receive the synchronization message sent by the first compression control node 1, and because the priority of the synchronization message sent by the second compression control node 2 is k, and k is greater than the current priority j of the node, the priority control mechanism of the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 changes the current priority of the node into k, and meanwhile, the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8 receive the synchronization message sent by the second compression control node 2, so that the current priority is not changed. Through this synchronization message interaction, the priority related parameters of each node are shown in the following table 8.2:
TABLE 8.2 priority parameter values for nodes (1)
After that, the first synchronization source node 4 and the second synchronization source node 5 send synchronization messages, the priority in the messages is equal to the local priority j of the nodes, and the third synchronization source node 6 and the fourth synchronization source node 7 send synchronization messages, and the priority in the messages is equal to the local priority k of the nodes. The first compression control node 1 receives the synchronous messages sent by the first synchronous source node 4 and the second synchronous source node 5, and sends the synchronous message with the priority of j after compression; the second compression control node 2 receives the synchronous messages sent by the third synchronous source node 6 and the fourth synchronous source node 7, and sends the synchronous message with the priority of k after compression. The first synchronization slave node 3, the first synchronization source node 4, the second synchronization source node 5, the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8 all receive the synchronization message sent by the second compression control node 2.
Therefore, the synchronization relationship of the whole network is that the third synchronization source node 6 and the fourth synchronization source node 7 are synchronization sources of the whole network, the second compression control node 2 realizes synchronization with the third synchronization source node 6 and the fourth synchronization source node 7 through message interaction, the first synchronization slave node 3, the first synchronization source node 4, the second synchronization source node 5 and the second synchronization slave node 8 realize synchronization with the second compression control node 2 through message interaction, the first compression control node 1 realizes synchronization with the first synchronization source node 4 and the second synchronization source node 5 through message interaction, and the whole network realizes synchronization with the synchronization source node with the priority of k.
When the interconnection cable 9 between the first compression control node 1 and the second compression control node 2 is disconnected, the original network is divided into a sub-network formed by the first compression control node 1, the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5, and a sub-network formed by the second compression control node 2, the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8, the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 cannot receive the synchronization message with the priority k sent by the second compression control node 2 any more, after q time periods, the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 adjust the current priority of the node by the lowest priority i due to the timeout of the current priority counter, while the sub-network formed by the second compression control node 2, the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8 remains unchanged, at this time, and the relevant parameters of the priority of the nodes are as shown in the following table 8.3:
TABLE 8.3 priority parameter values for nodes (2)
After that, the first synchronization source node 4 and the second synchronization source node 5 send synchronization messages, the priority in the messages is equal to the local priority j of the nodes, and the third synchronization source node 6 and the fourth synchronization source node 7 send synchronization messages, and the priority in the messages is equal to the local priority k of the nodes.
The first compression control node 1 receives the synchronous messages sent by the first synchronous source node 4 and the second synchronous source node 5, sends the synchronous message with the priority of j after compression, and the second compression control node 2 receives the synchronous messages sent by the third synchronous source node 6 and the fourth synchronous source node 7, and sends the synchronous message with the priority of k after compression. For the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5, the priority j of the synchronization message sent by the first compression control node 1 is greater than the current priority i of the node, so that the current priorities of the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 become j, and the current priorities k of the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8 are maintained unchanged, and at this time, the priority related parameters of the nodes are as shown in the following table 8.4:
table 8.4 priority parameter values for nodes (3)
After that, the first synchronization source node 4 and the second synchronization source node 5 send synchronization messages, the priority in the messages is equal to the local priority j of the nodes, and the third synchronization source node 6 and the fourth synchronization source node 7 send synchronization messages, and the priority in the messages is equal to the local priority k of the nodes. The first compression control node 1 receives the synchronous messages sent by the first synchronous source node 4 and the second synchronous source node 5, and sends the synchronous message with the priority of j after compression; the second compression control node 2 receives the synchronous messages sent by the third synchronous source node 6 and the fourth synchronous source node 7, and sends the synchronous message with the priority of k after compression. The first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 all receive the synchronization message sent by the first compression control node 1, and the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8 all receive the synchronization message sent by the second compression control node 2.
Therefore, the network composed of the first compression control node 1, the first synchronization slave node 3, the first synchronization source node 4 and the second synchronization source node 5 is synchronized with the first synchronization source node 4 and the second synchronization source node 5 of the synchronization source node with the priority of j, and the network composed of the second compression control node 2, the third synchronization source node 6, the fourth synchronization source node 7 and the second synchronization slave node 8 is synchronized with the third synchronization source node 6 and the fourth synchronization source node 7 of the synchronization source node with the priority of k. This enables adaptation of the multi-priority network in network topology separation and merging.
According to the scheme, describing the priority control logic design by using a Verilog HDL language, and completing logic synthesis and layout wiring; the proposal is used in the synchronous module of each node of the time-triggered Ethernet, and the function test is carried out by networking, and the test result shows that the invention has good feasibility, and the adoption of priority control can lead the nodes of the whole network to automatically realize the self-adaption of the synchronous priority in the process of changing the nodes of the synchronous source of the network, and the function meets the expectations.
Claims (7)
1. A time-triggered Ethernet clock synchronous control method supporting multiple priority is characterized in that three parameters of local priority, current priority and lowest priority are adopted to carry out priority control on a synchronous source node, a compression control node and a synchronous slave node, and the larger the value of the local priority parameter is, the higher the priority of the node is;
the synchronous source node is used for maintaining three parameters of local priority, current priority and lowest priority; the synchronous messages sent by the synchronous source nodes all contain the local priority of the synchronous source nodes; after receiving the synchronous message, the synchronous source node analyzes the message, extracts the priority in the message and compares the current priority of the synchronous source node, and receives the synchronous message when the priority in the message and the current priority of the synchronous source node are the same, otherwise does not receive the synchronous message; when the priority of the received synchronous message is greater than the current priority of the synchronous source node, the node assigns the message priority to the current priority, and when the priority of the received synchronous message is not greater than the current priority of the synchronous source node, the node maintains the current priority unchanged;
the compression control node is used for maintaining the parameter of local priority; the synchronous messages sent by the compression control nodes all contain local priority of the compression control nodes; after receiving the synchronous message, the compression control node analyzes the message, extracts the priority in the message and compares the priority with the local priority of the node, and receives the synchronous message when the priority in the message is the same as the local priority of the node, otherwise, does not receive the synchronous message;
the synchronous slave node is used for maintaining two parameters of the current priority and the lowest priority; after receiving the synchronous message, the synchronous slave node analyzes the message, extracts the priority in the message and compares the current priority of the synchronous slave node, and receives the synchronous message when the priority in the message is the same as the current priority, otherwise does not receive the synchronous message; when the priority of the received synchronous message is greater than the current priority of the synchronous slave node, the node assigns the message priority to the current priority, and when the priority of the received synchronous message is not greater than the current priority of the synchronous slave node, the node maintains the current priority unchanged.
2. A method of clock synchronization control in a time triggered ethernet network supporting multiple priorities as claimed in claim 1, wherein a current priority timeout counter of length Q is maintained in the synchronization source node, the current priority timeout counter counts up from 0 to Q, the counter counts again from 0 when a message of the same priority as the current priority is received, and the node assigns the lowest priority to the current priority when the counter count increases to Q.
3. The method for clock synchronization control of a time triggered ethernet supporting multiple priorities as recited in claim 1, wherein the compression control node does not process the priorities in the synchronization message.
4. The method for controlling clock synchronization of a time triggered ethernet supporting multiple priorities as recited in claim 1, wherein the priority in the synchronization message forwarded by the synchronization slave node is synchronized, and the synchronization slave node does not process the priority in the synchronization message.
5. A time triggered ethernet clock synchronization control method supporting multiple priorities as claimed in claim 1, wherein a current priority timeout counter of length Q is maintained in the synchronization slave node, the counter counts up from 0 to Q, the counter counts up again from 0 when a message of the same priority as the current priority is received, and the node assigns the lowest priority to the current priority when the counter value increases to Q.
6. A time triggered ethernet clock synchronization control method supporting multiple priorities as recited in claim 1, wherein local priority values of the synchronization source node and the compression control node are unchanged during operation.
7. A time triggered ethernet clock synchronization control method supporting multiple priorities as recited in claim 1, wherein the lowest priority values of the synchronization slave node and the synchronization source node are unchanged during operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111258576.4A CN113904993B (en) | 2021-10-27 | 2021-10-27 | Multi-priority time-triggered Ethernet clock synchronous control method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111258576.4A CN113904993B (en) | 2021-10-27 | 2021-10-27 | Multi-priority time-triggered Ethernet clock synchronous control method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113904993A CN113904993A (en) | 2022-01-07 |
| CN113904993B true CN113904993B (en) | 2023-06-27 |
Family
ID=79026550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111258576.4A Active CN113904993B (en) | 2021-10-27 | 2021-10-27 | Multi-priority time-triggered Ethernet clock synchronous control method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113904993B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012000257A1 (en) * | 2010-06-28 | 2012-01-05 | 中兴通讯股份有限公司 | Method and system for distributing clock servers based on network |
| CN103166750A (en) * | 2011-12-14 | 2013-06-19 | 中兴通讯股份有限公司 | Clock time synchronous resource distribution method and device |
| WO2013189536A1 (en) * | 2012-06-20 | 2013-12-27 | Nokia Siemens Networks Oy | Synchronization in computer network |
| CN105281884A (en) * | 2014-07-24 | 2016-01-27 | 北京信威通信技术股份有限公司 | Method for time synchronization between nodes in network without center |
| CN107070578A (en) * | 2017-04-02 | 2017-08-18 | 北京航空航天大学 | A kind of master-salve clock synchronous method suitable for many synchronization field time triggered Ethernets |
| CN107342833A (en) * | 2017-06-15 | 2017-11-10 | 西安微电子技术研究所 | A kind of time triggered Ethernet exchanging controller and its control method |
| CN108777660A (en) * | 2018-05-29 | 2018-11-09 | 电子科技大学 | A method of the traffic scheduling in time triggered FC networks |
| CN109600187A (en) * | 2018-11-28 | 2019-04-09 | 山东航天电子技术研究所 | A kind of time trigger Unified Network transmission end system scheduling method and device |
| CN110120846A (en) * | 2018-02-05 | 2019-08-13 | 大唐移动通信设备有限公司 | A kind of clock synchronizing method and system |
| CN111385051A (en) * | 2018-12-29 | 2020-07-07 | 华为技术有限公司 | Clock synchronization method, device and storage medium |
| CN112512113A (en) * | 2015-08-12 | 2021-03-16 | 华为技术有限公司 | Synchronous communication method and terminal |
| CN113411242A (en) * | 2021-05-25 | 2021-09-17 | 中国航空无线电电子研究所 | Asynchronous multi-priority scheduling processing method under time trigger mechanism |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017057321A1 (en) * | 2015-10-02 | 2017-04-06 | 株式会社Ｎｔｔドコモ | User equipment and synchronization method |
| FI130347B (en) * | 2020-01-31 | 2023-06-30 | Cumucore Oy | System and method for isochronous data transmission in industrial network |
-
2021
- 2021-10-27 CN CN202111258576.4A patent/CN113904993B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012000257A1 (en) * | 2010-06-28 | 2012-01-05 | 中兴通讯股份有限公司 | Method and system for distributing clock servers based on network |
| CN103166750A (en) * | 2011-12-14 | 2013-06-19 | 中兴通讯股份有限公司 | Clock time synchronous resource distribution method and device |
| WO2013189536A1 (en) * | 2012-06-20 | 2013-12-27 | Nokia Siemens Networks Oy | Synchronization in computer network |
| CN105281884A (en) * | 2014-07-24 | 2016-01-27 | 北京信威通信技术股份有限公司 | Method for time synchronization between nodes in network without center |
| CN112512113A (en) * | 2015-08-12 | 2021-03-16 | 华为技术有限公司 | Synchronous communication method and terminal |
| CN107070578A (en) * | 2017-04-02 | 2017-08-18 | 北京航空航天大学 | A kind of master-salve clock synchronous method suitable for many synchronization field time triggered Ethernets |
| CN107342833A (en) * | 2017-06-15 | 2017-11-10 | 西安微电子技术研究所 | A kind of time triggered Ethernet exchanging controller and its control method |
| CN110120846A (en) * | 2018-02-05 | 2019-08-13 | 大唐移动通信设备有限公司 | A kind of clock synchronizing method and system |
| CN108777660A (en) * | 2018-05-29 | 2018-11-09 | 电子科技大学 | A method of the traffic scheduling in time triggered FC networks |
| CN109600187A (en) * | 2018-11-28 | 2019-04-09 | 山东航天电子技术研究所 | A kind of time trigger Unified Network transmission end system scheduling method and device |
| CN111385051A (en) * | 2018-12-29 | 2020-07-07 | 华为技术有限公司 | Clock synchronization method, device and storage medium |
| CN113411242A (en) * | 2021-05-25 | 2021-09-17 | 中国航空无线电电子研究所 | Asynchronous multi-priority scheduling processing method under time trigger mechanism |
Non-Patent Citations (2)
| Title |
|---|
| "一种基于时间触发的CAN发送机制";纪宏岩;《汽车电器》(10);全文 * |
| "基于IEEE1588的智能变电站时钟同步网络研究";黎锐烽;《万方数据库》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113904993A (en) | 2022-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101299749B (en) | Method and apparatus for transferring clock between networks | |
| US11228520B2 (en) | Distributed database for synchronizing the accessibility of nodes and shared devices | |
| JP5266705B2 (en) | Communications system | |
| US11394480B2 (en) | Systems and methods for synchronizing device clocks | |
| CN104022861A (en) | Master clock competition method and master clock competition system | |
| CN112929117B (en) | Compatible definable deterministic communication Ethernet | |
| CN103607270B (en) | Method for improving synchronous performance of Powerlink Ethernet | |
| CN104410170A (en) | SDN (software definition network) technology applicable to power communication | |
| CN103428086A (en) | PTP protocol-based transparent clock passive port voting method and apparatus | |
| CN102457346A (en) | Time synchronization realizing method and clock node | |
| JPWO2008120382A1 (en) | Network equipment | |
| CN113904993B (en) | Multi-priority time-triggered Ethernet clock synchronous control method | |
| CN114584246B (en) | FPGA-based wireless ad hoc network time synchronization method, system and medium | |
| CN109271433A (en) | A kind of company-data synchronous method | |
| CN105636022A (en) | RSSI-based low-power consumption passive wireless node networking method | |
| US9641268B2 (en) | Method, system and device for synchronizing clocks | |
| CN102195996A (en) | Time synchronization method for stacking system, stacking system and member equipment | |
| CN107483134B (en) | A kind of inter-network clock synchronous communication device and method between heterogeneous networks | |
| CN106301647B (en) | A kind of method and device for realizing alternately BMC | |
| CN103580845B (en) | A kind of clock synchronizing method based on virtual switch cluster and device | |
| JP6566205B2 (en) | Communication apparatus and communication system | |
| JPH08503343A (en) | Network configuration | |
| Aristova | Ethernet in industrial automation: Overcoming obstacles | |
| CN109548056A (en) | Communication method and system based on ROS master-slave node manager | |
| CN105099646A (en) | Synchronization link determination method and apparatus |
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 |