CN111698160A - Ring network system, and data processing method and device of nodes in network system - Google Patents
Ring network system, and data processing method and device of nodes in network system Download PDFInfo
- Publication number
- CN111698160A CN111698160A CN201911378798.2A CN201911378798A CN111698160A CN 111698160 A CN111698160 A CN 111698160A CN 201911378798 A CN201911378798 A CN 201911378798A CN 111698160 A CN111698160 A CN 111698160A
- Authority
- CN
- China
- Prior art keywords
- message
- processing
- node
- network system
- sending
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- 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/41—Flow control; Congestion control by acting on aggregated flows or links
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention belongs to the technical field of networking in a transformer substation, and particularly relates to a looped network system, and a data processing method and device for nodes in the network system. The method processes the messages at regular time, and processes the service in the idle time between the two message processes. Wherein, the message processing is message receiving, message sending or message forwarding. The invention utilizes the timer to trigger message processing (message receiving, message sending or message forwarding), and performs service processing at the idle time between two message processing, so that the service processing is not interrupted any more, the delay time of the service processing is reduced, and the service data is ensured to be processed in time; meanwhile, no matter which type of message is processed, a linked list storage structure is adopted for storage during storage, so that the data copying time is reduced, the CPU load in a network system is reduced, and the reliability and the stability of the operation of the network system are ensured.
Description
Technical Field
The invention belongs to the technical field of networking in a transformer substation, and particularly relates to a looped network system, and a data processing method and device for nodes in the network system.
Background
The digital substation is constructed by layering intelligent primary equipment (an electronic transformer, an intelligent switch and the like) and networked secondary equipment (a process layer, a bay layer and a station control layer), is established on the basis of IEC61850 communication standard, and can realize information sharing and interoperation between intelligent electrical equipment in the substation.
In order to cope with possible network failures, the substation communication network must be redundant. One of the redundancy methods is a high availability seamless ring network protocol (HSR) based on a ring network, the HSR has excellent fault recovery performance, meets the real-time requirements of a substation automation system, and is suitable for substations of various scales and station bus and process bus topologies, and the network structure of the redundancy method is shown in fig. 1.
As shown in fig. 1, an HSR lan is composed of six dually connected switching nodes danh (double attached node with HSR), each node having 2 ring access ports, operating with full duplex link connections. When data are transmitted from a source DANH node to a target DANH node, one path of data is transmitted from the source DANH node to the target DANH node along each node in the ring network anticlockwise, and the other path of data is transmitted from the source DANH node to the target DANH node along each node in the ring network clockwise, so that the target DANH node can also receive data from the other path when transmission problems occur in one path, and redundancy is realized.
Data transmission of the ring network needs to be forwarded through a plurality of nodes in the ring network. When the data of the nodes in the ring network is more, the local data with various priorities needs to be processed and the data of other nodes needs to be forwarded at the same time. In the prior art, data is often processed in an interrupt + FIFO (first in first out) mode, that is, various message processing interrupts ongoing service processing of a node in an interrupt form, and the interrupt has a higher priority, and interrupt processing is preferentially performed, that is, a data processing timing sequence of each node is as shown in fig. 2. As can be seen from fig. 2, the processing method has frequent interruption, context switching and data forwarding blocking, and has a relatively long data copy time consumption, which results in a relatively heavy system load, and a service processing may be completed in multiple times due to interruption of message processing, and the service processing has a relatively long delay, and service data is difficult to be processed in time, which all makes the system load of the ring network unstable.
Disclosure of Invention
The invention provides a looped network system, a data processing method and a data processing device of nodes in the network system, which are used for solving the problems of heavy load of the system and long service processing delay time caused by adopting an interrupt and first-in first-out data processing method in the prior art.
In order to solve the technical problem, the technical scheme of the invention comprises the following steps:
the invention provides a data processing method of nodes in a network system, which comprises the following steps: carrying out message processing in a timing mode, wherein the message processing is message receiving, message sending or message forwarding; the message receiving means that the received message of the node is stored according to a linked list storage structure; the message sending refers to storing and sending the message to be sent of the node according to a linked list storage structure; the message forwarding refers to storing the received message which is not the node according to a linked list storage structure, and forwarding the stored message which is not the node to the next node; and performing service processing in idle time between the two message processing, wherein the service processing comprises processing the message stored after receiving and processing the message to be sent and before storing.
The beneficial effects of the above technical scheme are: the invention utilizes the timer to trigger message processing (message receiving, message sending or message forwarding), and performs service processing at the idle time between two message processing, so that the service processing is not interrupted any more, the delay time of the service processing is reduced, and the service data is ensured to be processed in time; meanwhile, no matter which type of message is processed, a linked list storage structure is adopted for storage during storage, so that the data copying time is reduced, the CPU load in a network system is reduced, and the reliability and the stability of the operation of the network system are ensured.
As a further improvement of the method, in order to ensure that important sending messages are processed preferentially so as to ensure the optimal processing performance of the system, the messages are sent according to the set message priority when being sent.
As a further improvement of the method, different buffer areas are adopted for storing the message sending, the message receiving and the message forwarding.
As a further improvement of the method, the timing time is adjustable.
As a further improvement of the method, in order to ensure the optimal processing performance of the system, the timing time of the next time is adjusted according to the number of the last message processing, when the number is greater than the set upper limit value, the timing time is reduced, and when the number is less than the set lower limit value, the timing time is increased.
The invention also provides a data processing device of the node in the network system, which comprises a memory and a processor, wherein the processor is used for executing the instructions stored in the memory to realize the data processing method of the node in the network system, and the same effect as the method can be achieved.
The invention also provides a looped network system which comprises at least three nodes, wherein two adjacent nodes are in communication connection, at least one node performs data processing according to the data processing method of the nodes in the network system, and the same effect as the method can be achieved.
Drawings
Fig. 1 is a diagram of a typical HSR network architecture of the prior art;
FIG. 2 is a prior art exemplary network node software processing timing diagram;
FIG. 3 is a schematic diagram of receive and transmit buffer processing based on priority chain table management in accordance with the present invention;
FIG. 4 is a timing diagram of the process of the present invention based on dynamic adjustment of the timer;
fig. 5 is a schematic diagram of the networking of the local modules of the digital substation.
Detailed Description
The embodiment of the ring network system comprises:
the embodiment provides a ring network system, which is an HSR ring network system, and the ring network system includes at least three DANH nodes, and the communication connection between two adjacent DANH nodes can perform data interaction, and each node performs processing according to the following data processing method of the node in the network system when performing data processing, which is described in detail below.
Step one, configuring a network system, which mainly comprises:
1) and calculating the sizes of the network receiving buffer area and the network sending buffer area of each node according to the service processing requirement.
2) And calculating the size of a forwarding buffer area of each node according to the service processing requirement and the network networking state.
3) Each node generates a network receiving buffer area and a network sending buffer area according to the configuration, the network receiving buffer area is empty in the initial state, the network receiving buffer area is placed in a receiving idle linked list to show that the network receiving buffer area can store receiving messages in the initial state, and the network forwarding buffer area is placed in a sending idle linked list to show that the network receiving buffer area can store sending messages in the initial state.
4) Setting a priority corresponding to the type according to the type of the message, where the priority includes a priority when sending and a priority when receiving, for example, the type of the message includes an SV message and a GOOSE message, and the corresponding priority is that the SV message is higher than the GOOSE message.
5) And calculating the initial interval of the timer of the network data according to the service processing requirement, and starting the timer according to the initial interval.
And step two, after the network configuration is completed, the operation can be started. The time sequence is shown in fig. 4, the message processing is performed at regular time according to the initial time interval during the first processing, and the service processing is performed during the space-time between the two message processing. The message processing is message receiving, message sending or message forwarding, wherein the message receiving refers to storing the received message of the node according to a linked list storage structure; the message sending refers to storing and sending the message to be sent of the node according to a linked list storage structure; the message forwarding refers to storing the received message which is not the node according to a linked list storage structure, and forwarding the stored message which is not the node to the next node; the service processing comprises processing the received and stored message and processing the message to be sent and before storage. How to perform receiving processing, sending processing and forwarding processing by using the linked list storage structure is described below according to the sequence of the time processing process.
1. As shown in fig. 3, the receiving process includes message receiving and corresponding service processing.
1) Message receiving: and storing the received message of the node into a network receiving buffer area, and putting the network receiving buffer area into a receiving occupation linked list.
2) And (3) service processing: extracting the received message from the receiving occupation linked list, and submitting the message to each service receiving module (service 1 receiving, … …, service x receiving in fig. 3) for processing according to the type of the received message; after the processing is finished, the network receiving buffer area is put into a receiving idle linked list to indicate that the network receiving buffer area can store newly received messages again.
2. As shown in fig. 3, the sending process includes message sending and corresponding service processing.
1) And (3) service processing: the message to be sent by the node is delivered to the corresponding service sending module (service 1 sending, … …, service x sending in fig. 3) for processing.
2) And (3) message sending: and after the message to be sent is processed, storing the message to be sent into a sending occupation linked list. And checking the transmission occupation linked list, if the message needing to be transmitted exists, obtaining a network transmission buffer area from the transmission occupation linked list, obtaining the message to be transmitted, and starting transmission. When sending, sending is carried out according to the priority level, and the optimal performance processing of the system is ensured. After the transmission is finished, the network transmission buffer area is respectively put into the transmission idle linked list according to the different message types.
In the above process, when the network transmission buffer is obtained from the transmission idle linked list, if the transmission idle linked list is empty and there is no available idle network transmission buffer, the network transmission buffer with the lowest priority lower than the priority of the service is obtained from the transmission idle linked list, the message to be transmitted is written into the network transmission buffer, and after the corresponding service processing is performed, the network transmission buffer is written into the transmission idle linked list for transmission.
3. The forwarding processing process comprises message forwarding.
Message forwarding: as shown in fig. 3, a network receiving buffer is obtained from a receiving occupation linked list, after a forwarding packet that is not processed by the service of the node is distinguished, the forwarding packet is forwarded and received through a "ring network" and "ring network forwarding and sending" and is placed into the sending occupation linked list, when the forwarding is needed, the network sending buffer is obtained from the sending occupation linked list, the packet is forwarded to the next node, and after the forwarding is completed, the network sending buffer is placed into a network receiving buffer of an opposite port (the opposite port of the node).
Moreover, the timing time of the timer is adjustable, and the timer is not always operated according to the initial interval, and the next timing time is adjusted according to the number of the message processing at the last time. When the number is more and exceeds the set upper limit value, the timing time can be properly reduced; when the number is small and is lower than the set lower limit value, the timing time can be increased appropriately. Thereby ensuring that the processing load of the whole system is relatively stable.
In addition, it should be noted that each node in the system of this embodiment processes data according to the method described above. As another embodiment, some nodes in the system may perform data processing according to the original method in the prior art, and perform data processing according to the original interrupt method.
The system is described in detail below by taking an example of 8 node environments in which the local modules of the digital substation are networked, and the networking mode of the system is shown in fig. 5. The specific data processing steps are as follows:
and S1, calculating the initial interval of the timer of the network data according to the service requirement. The SV data with the highest frequency is sampled and sent at an interval of 250 microseconds, the transmission delay in the ring network cannot exceed 1 millisecond, the initial value of the processing interval is set to 125 microseconds in consideration of the characteristic of bidirectional transmission of the ring network, and under the condition, diagonal transmission passes through three transmission nodes under normal conditions, and the delay does not exceed 500 microseconds.
And S2, calculating the network sending buffer area of each node according to the service requirement. The network transmission buffer corresponding to the distributed transmission packet is shown in table 1 below, where priority 0 is the highest.
TABLE 1
S3, calculating the network receiving buffer of each node according to the service requirement, as shown in table 2 below.
TABLE 2
S4, calculating the forwarding buffer area of each node according to the service requirement and the network networking state: 8 nodes in the ring network system, the forwarding buffer area is set as the total number of the sending buffer areas: 4 x 8-32.
S5, the configuration data writing node, and starts a timer.
S6, receiving the message: and storing the received messages of the node into a network receiving buffer area in sequence according to the priority set in the table 2, and putting the network receiving buffer area into a receiving occupation linked list.
S7, message sending: after the message to be sent is processed, storing the message to be sent into a sending occupation linked list; and checking the transmission occupation linked list, if the message to be transmitted exists, extracting the message to be transmitted according to the transmission occupation linked list, and transmitting the message in sequence according to the priority level. And after the transmission is finished, the network transmission buffer area is put into the transmission idle linked list.
S8, timer interval adjustment: and adjusting the time interval according to the number of the processed messages, if the time interval exceeds 3, reducing the next timer interval by 1 microsecond, and if the time interval is lower than 2, increasing the next timer interval by 1 microsecond.
S9, receiving the corresponding service processing by the message: and extracting the received message from the receiving occupation linked list, if the message is an SV message or a GOOSE message, processing the SV message or the GOOSE message by a 61850 service receiving module, and if the message is a protocol stack message, submitting the protocol stack message to a TCP/IP protocol stack for processing. And after the processing is finished, the network receiving buffer area is placed into a receiving idle linked list.
S10, sending the message to corresponding service processing: and after the message to be sent is processed, storing the message to be sent into a sending occupation linked list. And checking the transmission occupation linked list, if the message to be transmitted exists, obtaining a network transmission buffer area from the transmission occupation linked list to obtain the message to be transmitted, and transmitting according to the priority level set in the table 1.
It should be noted that the steps S6 to S10 are not consecutive steps performed in time sequence, but are only steps that may occur during the operation.
The method comprises the following steps:
the embodiment provides a data processing method for nodes in a network system, which can be applied to the ring network system of the embodiment of the ring network system, so that at least one node in the ring network system performs data processing according to the method, and the method can also be applied to other network systems. Since the method is described in detail in the embodiment of the ring network system, it is not described here again.
The embodiment of the device is as follows:
the embodiment provides a data processing device of a node in a network system, which comprises a memory and a processor, wherein the memory and the processor are directly or indirectly electrically connected to realize the transmission or interaction of data. The processor may be a general-purpose processor, such as a central processing unit CPU, or may be another programmable logic device, such as a digital signal processor DSP, where the processor is configured to execute instructions stored in a memory to implement the method for processing data of a node in a network system in the embodiments of the method described in the embodiments of the ring network system, and details of the method are not described here again since the method is described in detail in the embodiments of the ring network system.
Claims (7)
1. A data processing method of a node in a network system is characterized by comprising the following steps:
carrying out message processing in a timing mode, wherein the message processing is message receiving, message sending or message forwarding; the message receiving means that the received message of the node is stored according to a linked list storage structure; the message sending refers to storing and sending the message to be sent of the node according to a linked list storage structure; the message forwarding refers to storing the received message which is not the node according to a linked list storage structure, and forwarding the stored message which is not the node to the next node;
and performing service processing in idle time between the two message processing, wherein the service processing comprises processing the message stored after receiving and processing the message to be sent and before storing.
2. The method of claim 1, wherein the message is sent according to a message priority level.
3. The method of claim 1, wherein the sending, receiving and forwarding of the message are stored in different buffers.
4. A method for processing data of a node in a network system according to any of claims 1 to 3, wherein the timing is adjustable.
5. The method according to claim 4, wherein the next timing time is adjusted according to the number of the last packet processing, and when the number is greater than the set upper limit, the timing time is decreased, and when the number is less than the set lower limit, the timing time is increased.
6. A data processing apparatus of a node in a network system, comprising a memory and a processor, wherein the processor is configured to execute instructions stored in the memory to implement the data processing method of the node in the network system according to any one of claims 1 to 5.
7. A looped network system comprising at least three nodes, wherein two adjacent nodes are connected in communication, and at least one of the nodes processes data according to the data processing method of the node in the network system as claimed in any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378798.2A CN111698160A (en) | 2019-12-27 | 2019-12-27 | Ring network system, and data processing method and device of nodes in network system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378798.2A CN111698160A (en) | 2019-12-27 | 2019-12-27 | Ring network system, and data processing method and device of nodes in network system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111698160A true CN111698160A (en) | 2020-09-22 |
Family
ID=72476205
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911378798.2A Pending CN111698160A (en) | 2019-12-27 | 2019-12-27 | Ring network system, and data processing method and device of nodes in network system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111698160A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115499359A (en) * | 2022-09-15 | 2022-12-20 | 四川灵通电讯有限公司 | Improved method for wasting link resources based on standard HSR protocol |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425977A (en) * | 2008-11-25 | 2009-05-06 | 北京航空航天大学 | Air-ground data communication control system |
| CN101488897A (en) * | 2009-02-25 | 2009-07-22 | 北京东土科技股份有限公司 | Zero packet loss technique implementing method when fast redundancy reverse occurs |
| CN102223267A (en) * | 2011-06-17 | 2011-10-19 | 北京电子科技学院 | IDS (intrusion detection system) detecting method and IDS detecting equipment |
| CN102932275A (en) * | 2012-11-20 | 2013-02-13 | 中国空间技术研究院 | Priority message forwarding method applied to allowed time delay network |
| CN103685028A (en) * | 2013-11-30 | 2014-03-26 | 许继电气股份有限公司 | Method and device allowing mutual communication of multi-type ports |
| CN103946803A (en) * | 2011-10-17 | 2014-07-23 | 凯为公司 | Processor with efficient work queuing |
| CN104933546A (en) * | 2014-09-04 | 2015-09-23 | 国网山东省电力公司应急管理中心 | Data reporting method based on customized template and system thereof |
| CN105045737A (en) * | 2015-05-25 | 2015-11-11 | 国家计算机网络与信息安全管理中心 | Data packet processing oriented buffer and application method |
| CN106254274A (en) * | 2016-09-27 | 2016-12-21 | 国家电网公司 | Transformer station's switch GOOSE message transmission reduces the method that the end of a thread blocks |
| CN106487714A (en) * | 2015-08-28 | 2017-03-08 | 国网智能电网研究院 | A kind of delay jitter control method and system of the common mouth network of transformer station's common network |
| CN107204834A (en) * | 2017-05-25 | 2017-09-26 | 复旦大学 | A kind of control method of the express network transmitting based on UDT agreements |
| CN108737378A (en) * | 2018-04-17 | 2018-11-02 | 全球能源互联网研究院有限公司 | A kind of dual mode communication network-building method and system based on media access control layer |
| CN109548165A (en) * | 2019-01-24 | 2019-03-29 | 重庆邮电大学 | A kind of intelligent substation wireless communication mechanism of low time delay |
| CN110011924A (en) * | 2018-01-04 | 2019-07-12 | 深圳市中兴微电子技术有限公司 | A kind of method and apparatus for removing cache congestion |
-
2019
- 2019-12-27 CN CN201911378798.2A patent/CN111698160A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425977A (en) * | 2008-11-25 | 2009-05-06 | 北京航空航天大学 | Air-ground data communication control system |
| CN101488897A (en) * | 2009-02-25 | 2009-07-22 | 北京东土科技股份有限公司 | Zero packet loss technique implementing method when fast redundancy reverse occurs |
| CN102223267A (en) * | 2011-06-17 | 2011-10-19 | 北京电子科技学院 | IDS (intrusion detection system) detecting method and IDS detecting equipment |
| CN103946803A (en) * | 2011-10-17 | 2014-07-23 | 凯为公司 | Processor with efficient work queuing |
| CN102932275A (en) * | 2012-11-20 | 2013-02-13 | 中国空间技术研究院 | Priority message forwarding method applied to allowed time delay network |
| CN103685028A (en) * | 2013-11-30 | 2014-03-26 | 许继电气股份有限公司 | Method and device allowing mutual communication of multi-type ports |
| CN104933546A (en) * | 2014-09-04 | 2015-09-23 | 国网山东省电力公司应急管理中心 | Data reporting method based on customized template and system thereof |
| CN105045737A (en) * | 2015-05-25 | 2015-11-11 | 国家计算机网络与信息安全管理中心 | Data packet processing oriented buffer and application method |
| CN106487714A (en) * | 2015-08-28 | 2017-03-08 | 国网智能电网研究院 | A kind of delay jitter control method and system of the common mouth network of transformer station's common network |
| CN106254274A (en) * | 2016-09-27 | 2016-12-21 | 国家电网公司 | Transformer station's switch GOOSE message transmission reduces the method that the end of a thread blocks |
| CN107204834A (en) * | 2017-05-25 | 2017-09-26 | 复旦大学 | A kind of control method of the express network transmitting based on UDT agreements |
| CN110011924A (en) * | 2018-01-04 | 2019-07-12 | 深圳市中兴微电子技术有限公司 | A kind of method and apparatus for removing cache congestion |
| CN108737378A (en) * | 2018-04-17 | 2018-11-02 | 全球能源互联网研究院有限公司 | A kind of dual mode communication network-building method and system based on media access control layer |
| CN109548165A (en) * | 2019-01-24 | 2019-03-29 | 重庆邮电大学 | A kind of intelligent substation wireless communication mechanism of low time delay |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115499359A (en) * | 2022-09-15 | 2022-12-20 | 四川灵通电讯有限公司 | Improved method for wasting link resources based on standard HSR protocol |
| CN115499359B (en) * | 2022-09-15 | 2023-12-29 | 四川灵通电讯有限公司 | Improved method for wasting link resources based on standard HSR protocol |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Clark et al. | An introduction to local area networks | |
| EP0124590B1 (en) | Duplicated network arrays and control facilities for packet switching | |
| US5165021A (en) | Transmit queue with loadsheding | |
| RU2534931C2 (en) | Data block transmission and communication network | |
| CN204089874U (en) | A kind of switch supporting packet storage | |
| US20080089245A1 (en) | Automated multiple-instance spanning tree reconfiguration | |
| CN102047619A (en) | Methods, systems, and computer readable media for dynamically rate limiting slowpath processing of exception packets | |
| JPS611146A (en) | Information communication equipment | |
| CN105743760A (en) | Flow switching method and device | |
| CN111698160A (en) | Ring network system, and data processing method and device of nodes in network system | |
| US11784929B2 (en) | Heterogeneous link data translation and distribution method, system and device, and storage medium | |
| US20150156060A1 (en) | Bidirectional packet transfer fail-over switch for serial communication | |
| CN107995315B (en) | Method and device for synchronizing information between service boards, storage medium and computer equipment | |
| WO2023184926A1 (en) | Method and apparatus for monitoring multi-path end-to-end delay, and electronic device and medium | |
| CN114726105A (en) | Power distribution network feeder automatic switching method, device and medium based on communication time delay | |
| JPH1056470A (en) | Network communication control equipment | |
| JP4901777B2 (en) | Network relay device and network relay method | |
| JPH09191321A (en) | Adaptive credit control type transfer method | |
| CN112363963A (en) | Data transmission method and device based on Powerlink bus | |
| US6694373B1 (en) | Method and apparatus for hitless switchover of a voice connection in a voice processing module | |
| JP2007272694A (en) | Communication interface device and communication method | |
| CN101083572A (en) | Bearing time division multiplex data service in ethernet | |
| KR101520250B1 (en) | High Fast Traffic Process Scheme Method and Apparatus for High Availability Distributed Embedded Network Transmission | |
| CN104078945A (en) | Busbar differential protection optimization method and busbar differential protection system for intelligent transformer substation | |
| KR20150067505A (en) | Dynamic Queue Allocation Scheme Method and Apparatus for High Availability Distributed Embedded Network Transmission |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200922 |