KR102074704B1 - Distributed upgrade Method used daisy chain and system thereof - Google Patents

Abstract

The present invention provides a distributed daisy chain upgrading method, in which, in an upgrade of various kinds of industrial automatic control equipment connected in a daisy chain scheme, a server placed at the uppermost position selects the number and location of seed nodes for receiving an upgrade image among the nodes and each seed node performs upgrade on the remaining nodes adjacent to both sides thereof when the upgrade image is transmitted to the selected seed node through a controller, thereby efficiently managing and using resources of each device; and a system thereof. According to the present invention, the method comprises the steps of: allowing a server to transmit an upgrade image to a controller; allowing the controller to calculate the number of seed nodes to transmit the upgrade image from all nodes; calculating the number of times of upgrade through the calculated number of seed nodes; selecting the location of the seed node for performing the upgrade corresponding to the calculated number of times of the upgrade; transmitting the upgrade image to the selected seed node; and allowing the seed node to transmit the transmitted upgrade image to other nodes. The node receiving the upgrade image from the seed node repetitively transmits the upgrade image to other nodes which are not upgraded.

Description

Distributed upgrade method used daisy chain and system

The present invention relates to a daisy chain, and more particularly, a seed selected by a controller after selecting a number and location of seed nodes to receive an upgrade image among each node by a server located at the top when upgrading various industrial automatic control equipment. The present invention relates to a daisy chain distributed upgrade method and system according to which upgrades are performed by sending an upgrade image to nodes, and upgraded seed nodes are in charge of upgrading the remaining nodes adjacent thereto.

In general, various industrial automatic control equipment is connected to a communication network through a server (Server) is built as a central control system.

The plurality of devices are interconnected in a daisy chain topology structure in which a plurality of devices are connected to each other in series.

Here, the daisy chain is not connected to a hub but is connected in series like a bus topology, and wiring is less complicated, and thus, the daisy chain is applied to upgrade of various equipments.

As described above, the general devices through the daisy chain method are shown in FIG. 1, and a plurality of devices are configured in a chain and connected in series, and a connection period between a server and a controller is used when using the devices. It is a general internet connection section where billing occurs. The controller and each node of the device are configured as a local network that does not incur billing when used, and is connected by Ethernet (RJ45) cable.

In this way, the server and the controller, the controller and all nodes are communicatively connected to the node neighboring the node or to both nodes.

As described above, the remote upgrade method through the existing daisy chain method, which is communicatively connected, connects each node to 1: 1 in such a manner that a server located at the top is directly involved in the upgrade. The upgrade process was performed or the controller upgraded the upgrade image from the server located at the top.

However, when the remote upgrade in the manner described above, the server directly upgrades each node to 1: 1 so that the total upgrade progress time is considerable.

In other words, when the network size increases, that is, as the number and quantity of nodes increase, there is a problem that the upgrade time of each node in the server increases proportionally.

Since the connection section connecting the server and the controller is a general Internet connection section that incurs a cost, there is a problem that excessive communication cost may be generated when each node is directly upgraded to 1: 1 through the server. .

In addition, since the server or controller is dedicated to the upgrade of each node, the load on the server and the controller increases, which makes it difficult to effectively distribute the load.

As the load is concentrated on the server and the controller, a problem may occur in the entire system communication, which requires efforts to secure communication stability.

Republic of Korea Patent Publication No. 10-2007-0005291

The present invention has been made to solve the problems described above, the number and location of the seed node to receive the upgrade image of each node, the server located at the top when upgrading the various industrial automatic control equipment connected in a daisy chain method If you send the upgrade image to the selected seed nodes through the controller, the daisy chain can efficiently manage and use the resources of each device by in charge of upgrading the remaining nodes so that each seed node is adjacent to both sides. An object of the present invention is to provide a distributed upgrade method and system accordingly.

In addition, in the present invention, the server located at the top of the node directly proceeds with the upgrade of each node or the controller does not proceed with the upgrade of each node through the upgrade image received from the server, and set some nodes as seed nodes, The set seed node upgrades the remaining nodes, but by setting the number and location of seed nodes in proportion to the size of the network, the number and number of nodes, the upgrade progress time of each node can be shortened. It can effectively reduce the load of servers and controllers as the upgrade progress of each node, calculate the number of seed nodes to minimize the upgrade time by minimizing the number of upgrades, and optimize the seed nodes for upgrading the remaining nodes. In place By minimizing the communication cost that can be upgraded by each node connected in the daisy-chain method, and performing the delay-free communication of data to provide a daisy chain distributed upgrade method and system that can ensure the stability of the communication For the purpose of

In addition, the technical problems to be achieved by the present invention are not limited to the technical problems mentioned above, other technical problems not mentioned are clearly understood by those skilled in the art from the following description. Could be.

In order to achieve the object as described above, the present invention comprises a server, a controller and at least one or more nodes, in the upgrade method of automatic control equipment interconnected in a daisy chain by a network, the server to the controller Transmitting the upgrade image; Calculating, by the controller, the number of seed nodes to transmit the upgrade image in all nodes; Calculating the number of upgrades through the calculated number of seed nodes; Selecting a location of a seed node to be upgraded to correspond to the calculated number of upgrades; Transmitting the upgrade image to the selected seed node; And transmitting, by the seed node, the upgrade image transmitted to another node. Included, the node receiving the upgrade image from the seed node is characterized in that it is made to repeatedly transmit the upgrade image to another node that has not been upgraded.

Preferably, in calculating the number of seed nodes to transmit the upgrade image in all nodes, the number of seed nodes is calculated by the following formula.

Then, in the step of selecting the position of the calculated number of seed nodes, the selection of the position of the first seed node is calculated by the following formula.

In addition, the positioning of the next seednode at the position of the first seednode is calculated by the following formula.

In the calculating of the number of seed nodes to which the upgrade image is to be transmitted in all nodes, the number of times that the controller transmits the upgrade image to each seed node is considered as one, and the number of times that the upgrade image is transmitted from the seed node to the remaining nodes. Is considered to be one time because it dedicates network bandwidth, and the calculated number of seed nodes and the position of the seed nodes are calculated and selected as the minimum number of upgrades for upgrading the entire node.

On the other hand, in the upgrade system of the automatic control equipment configured to include a server, a controller and at least one node, which are interconnected in a daisy chain by a network, the controller is seeded from the entire node when upgrading the entire node connected to the network A seed node counting unit calculating a number of nodes, an upgrade count calculating unit calculating a number of upgrades to seed nodes calculated through the seed node counting unit, and a seed node corresponding to the upgrade count calculated through the upgrade count calculating unit. And a seed node arranging unit which selects a position at all nodes, and an upgrade execution unit which transmits an upgrade image to the seed nodes arranged through the seed node arranging unit and executes the upgrade.

Preferably, the seednode arrangement includes a first seednode selector for selecting a location of the first seednode, a next seednode and / or a next seednode at a first seednode positioned through the first seednode selector. It further comprises a seed node interval determiner for sequentially determining the interval of.

As described above, the present invention having the configuration as described above, the upgrade of the various industrial automatic control equipment is performed through some selected seed node first, then the selected seed node is made to upgrade the remaining nodes by the upgrade progress of each node Time can be shortened, and by adjusting the number of seed nodes in proportion to the size of the network, that is, the number and number of nodes, the upgrade progress time of each node can be shortened.

In addition, the present invention calculates the number of seed nodes so as to shorten the upgrade progress time and arranges the calculated seed nodes at an optimal position, thereby minimizing the number of upgrades of each node connected in a chain and upgrading the upgrade time. It can minimize the upgrade through the Internet connection section where charging is added, and most upgrades are made through the Ethernet connection section without charging. have.

In addition, the present invention reduces the load on the server and the controller by delegating to each node the existing burden that the server or the controller is responsible for all upgrades, such as the node is responsible for the upgrade of other nodes, not the server and the controller. Can be effectively distributed, manage and use the resources of each device more efficiently, and ensure the stability of the system-wide communication.

1 is a configuration diagram schematically showing how various devices are connected through a general daisy chain topology;
2 is a configuration diagram schematically showing a daisy chain upgrade method according to the prior art;
3 is a configuration diagram schematically showing a daisy chain distributed upgrade method according to the present invention;
4 is a block diagram schematically illustrating an algorithm for selecting seed nodes in a daisy chain distributed upgrade method according to the present embodiment;
5 is a configuration diagram schematically showing the number of upgrades through a seed node selected in the daisy chain distributed upgrade method according to the present embodiment;
6 is a flowchart schematically illustrating a daisy chain distributed upgrade method according to the present invention;
Figure 7 is a block diagram schematically showing a daisy chain distributed upgrade system according to the present invention.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another element in between. . In addition, when a part is said to "include" a certain component, which means that it may further include other components, without excluding other components, unless specifically stated otherwise, one or more other features It is to be understood that the present disclosure does not exclude the possibility of adding or presenting numbers, steps, operations, components, parts, or combinations thereof.

As used throughout the specification, the terms "about", "substantially", and the like, are used at, or in close proximity to, numerical values when manufacturing and material tolerances inherent in the meanings indicated are intended to aid the understanding of the invention. Accurate or absolute figures are used to assist in the prevention of unfair use by unscrupulous infringers. As used throughout the specification of the present invention, the term "step of" or "step of" does not mean "step for".

In the present specification, the term 'unit' includes a unit realized by hardware, a unit realized by software, and a unit realized by both. In addition, one unit may be realized using two or more pieces of hardware, and two or more units may be realized by one piece of hardware.

Some of the operations or functions described as being performed by the terminal, the apparatus, or the device may be performed instead in the server connected to the terminal, the apparatus, or the device. Similarly, some of the operations or functions described as being performed by the server may be performed by the terminal, apparatus or device connected to the server.

In the present specification, some of the operations or functions described as mapping or matching with the terminal mean that the identification number of the terminal or identification information of the individual, which is identification data of the terminal, is mapped or matched. Can be interpreted as

In this specification, the word "at least one" is defined as a term that can refer to the singular and plural. In addition, the term "at least one" may be used but may be omitted, and the meaning is as described above.

Hereinafter, with reference to the accompanying drawings will be described a preferred embodiment of the present invention. 3 is a block diagram schematically illustrating a daisy chain distributed upgrade method according to the present invention, FIG. 4 is a block diagram schematically illustrating an algorithm for selecting seed nodes in a daisy chain distributed upgrade method according to the present embodiment, and FIG. 5. Is a block diagram schematically illustrating the number of upgrades through a seed node selected in the daisy chain distributed upgrade method according to the present embodiment, FIG. 6 is a flowchart schematically showing a daisy chain distributed upgrade method according to the present invention, and FIG. The daisy chain distributed upgrade system according to the present invention is a schematic block diagram.

As shown in the drawings, the daisy chain distributed upgrade system according to the present invention comprises a server (not shown) and the controller 100 and at least one node (not shown) in various industrial automatic control equipment. They are daisy chained together.

Here, each component is connected through a general network, the server and the controller 100 is connected to a general Internet line including a wide area network (WAN), the controller 100 and each node is a local area It is connected to a local area network (LAN).

In this case, the connection section of the server and the controller 100 is a billing section in which a cost is incurred, and the connection section of the controller 100 and each node is a billing section in which no cost is incurred.

When the upgrade occurs, the server transmits the upgrade image to the controller 100.

The controller 100 calculates the number of seed nodes to transmit the upgrade image transmitted from the server, selects the position of the calculated number of seed nodes, and transmits the upgrade image to the selected seed node.

To this end, the controller 100 uses the seed node number calculating unit 110, the upgrade count calculating unit 130, the seed node arranging unit 150, and the upgrade execution unit 170 to upgrade all nodes connected to the network. It is configured to include.

Here, the seed node number calculator 110 calculates the number of seed nodes to transmit the upgrade image for the first time through the controller 100.

In addition, the upgrade count calculator 130 calculates the number of times for upgrading all nodes with the number of seed nodes calculated through the seed node count calculator 110.

In addition, the seed node placement unit 150 selects whether or not to place the seed node in all nodes so as to correspond to the number of upgrades calculated through the upgrade number calculation unit 130.

In addition, the upgrade execution unit 170 transmits the upgrade image to the seed node disposed through the seed node placement unit 150 to perform the upgrade.

That is, the controller 100 calculates the number of seed nodes in all nodes in order to minimize the number of upgrades when upgrading all nodes connected to the network, the seed node number calculating unit 100 and the seed node number calculating unit 110. Calculate the number of upgrades using the calculated number of seed nodes, and the seed notes so as to correspond to the number of upgrades calculated through the upgrade count calculation unit 130 and the upgrade count calculation unit 130 to calculate the minimum number of upgrades. Upgrade execution unit 170 for executing an upgrade by transmitting an upgrade image to a seed node arranged unit 150 and a seed node arranged through the seed node placing unit 150 to select which position in the entire node. It is configured to include).

Here, the upgrade image transmitted to the seed nodes through the upgrade execution unit 170 is repeatedly and sequentially transmitted to other nodes positioned and disposed adjacent to both sides through each seed node, thereby completing the upgrade of all nodes. .

Here, the seed node arrangement unit 150 is positioned through the first seed node selection unit 151 and the first seed node selection unit 151 for selecting the position of the first seed node through the controller 100. It comprises a seed node interval determiner 153 for sequentially determining the interval with the next or / and the next seed node in the first seed node selected.

Here, each node connected to the controller 100 is based on the same operating system. If the operating system of each node is different from each other, the node is first grouped into the same operating system, and a seed node among the nodes grouped into the same operating system. The number of nodes and the location of the seed node are calculated, and the upgrade node is transmitted to the seed node first, and then the remaining nodes are upgraded. However, the present invention is not limited thereto, and various modifications can be made.

With the above structure, as shown in FIG. 3, when the total number of nodes is 5, for example, when the upgrade occurs, the server transmits the upgrade image to the controller 100 and the The controller 100 calculates the number of seed nodes to transmit the upgrade image.

When the number of seed nodes is calculated as two, the calculated positions of the two seed nodes are selected, and when the nodes 2 and 4 are selected as the seed nodes, the upgrade image is preferentially applied to the nodes 2 and 4. Transfers to complete the upgrade of Node 2 and Node 4, after which Node 2 has not yet upgraded, but upgrades the remaining Node 1 and Node 3 adjacent to both sides of Node 2, and Node 4 is still upgrading Does not proceed, but proceeds to upgrade the remaining node 5 adjacent to node 4.

In an embodiment of the present invention, the controller 100 selects node 2 and node 4 among the nodes as seed nodes, transmits the upgrade image to node 2, transmits the upgrade image to node 4, and then node 2 and node. Node 1, Node 3, and Node 5 are upgraded through Node 4, so that Node 2, which is a seed node, and Node 3 overlapping Node 4, upgrade is performed through Node 2 to which an upgrade image is first transmitted. In the case of node 3 selected as the seed node and node 3 overlapping with node 4, the upgrade is performed through node 2 or node 4, but the upgrade is performed through node 2 or node 4 transmitting the upgrade image first. It is preferable to make it as possible.

That is, in the case of the node 3, the node 2 which is a seed node is arranged and connected to the left side, and the node 4 which is a seed node is arranged and connected to the right side, so that an upgrade is possible through the node 2 or the node 4, wherein the seed node If the upgrade image is first transmitted through the in-node 2, the upgrade is performed through the node 2, and if the upgrade image is transmitted first through the node 4, the upgrade is preferably performed through the node 4, but is not limited thereto. No.

On the other hand, the controller 100 calculates the number of seed nodes according to the total number of nodes, and then selects the positions of the seed nodes for properly arranging the calculated number of seed nodes.

Here, the most important thing to consider is the minimum number of upgrades for upgrading the entire node, and the number of upgrades between nodes is regarded as one time since it is a situation of dedicating network bandwidth.

That is, as shown in FIG. 4, in the case where the total number of nodes is six, for example, the transmission of the upgrade image to the node 2 through the controller 100 is regarded as one time, and the controller 100 is regarded as one. Transfer the upgrade image to node 5 once again, and transfer the upgrade image from node 2 to node 1 and node 3 on both sides and from node 5 to node 4 and node 6 on both sides of the upgrade image. The transmission is devoted to the network bandwidth so that the transfer of the upgrade image from node 2 to nodes 1 and 3 and the transfer of the upgrade image from node 5 to nodes 4 and 6 are considered as one.

As described above, the upgrade image transmission to the node 2 through the controller 100 is regarded as the first time, and the upgrade image transmission to the node 5 through the controller 100 as the second time, and the node 2 The upgrade image transmission to Node 1 and Node 3 on both sides and the upgrade image transmission to Node 4 and Node 6 on both sides are considered as the third time.

In addition, as shown in FIG. 5, when the total number of nodes is 10, for example, when the number of seed nodes is calculated as two, and the calculated seed nodes are selected as nodes 3 and 8, The upgrade image transmitted to the node 3, which is the seed node through the controller 100, is transmitted to the nodes 2 and 4 on both sides thereof, and the node 2 to which the upgrade image is transmitted is transmitted to the node 1, and the node to which the upgrade image is transmitted 4 transmits this to node 5, and transmits the upgrade image transmitted to node 8 which is a seed node through the controller 100 to node 7 and node 9 on both sides, and node 7 which has transmitted the upgrade image is a node. Node 9, which has transmitted 6, and the upgrade image, has transmitted it to Node 10.

In this way, the number of times that an upgrade image is transmitted from node 3, which is a seed node, to nodes 2 and 3, and the number of times that the upgrade image is transmitted from node 8, which is a seed node, to nodes 7 and 9, is considered to be the first time, and from node 2 to node 1 The number of times to transfer the upgrade image from node 4 to node 5, the number of times to transfer the upgrade image from node 7 to node 6, and the number of times to transfer the upgrade image from node 9 to node 10. By doing this, you can complete the upgrade process for the remaining eight nodes through two seed nodes in two upgrade processes.

In this case, the number of total nodes is increased by adding one time of transmitting the upgrade image from the controller 100 to the node 3 which is the seed node and one time of transmitting the upgrade image from the controller 100 to the node 8 which is the seed node. In case of 10, upgrade of 10 nodes can be performed by performing a total of 4 upgrades.

Thus, by the daisy chain distributed upgrade method according to the present invention, when the upgrade is performed in a situation where the total number of nodes is six, the number of occurrences of the entire upgrade is completed three times, and when the upgrade is performed in the situation where the total number of nodes is ten. In this case, the total number of upgrades can be completed four times, which causes the controller 100 to upgrade each node sequentially six times from node 1 to node 6 exclusively, or the controller 100 is dedicated to node 1 at node 1. Compared to the existing upgrade method of sequentially upgrading each node 10 times up to 10 times, the number of upgrades can be significantly reduced, thereby reducing the overall upgrade progress time.

In addition, the upgraded seed node, other than the controller 100, can minimize traffic of the entire network by upgrading other nodes, and by performing upgrade by dedicating network bandwidth of a specific section of a network composed of daisy chains. Can be obtained.

Hereinafter, a daisy chain distributed upgrade method according to the present invention will be described.

First, the server transmits an upgrade image to the controller 100, and the controller 100 calculates the number of seed nodes optimized according to the number of all nodes through the seed node number calculating unit 110. That is, the number of seed nodes according to the total number of nodes constituting the network is calculated, and accordingly, the minimum number of upgrades is calculated through the upgrade count calculator 130.

To this end, the regularity was found based on the following [Table 1], and this is represented by a formula.

[Table 1] shows the correlation between the number of seed nodes and the number of upgrades according to the total number of nodes. The horizontal axis indicates the number of seed nodes for receiving the initial upgrade image through the controller 100, and the vertical axis indicates the number of seed nodes. It means the total number of seeds connected to the network, and the point where the horizontal axis and the vertical axis meet indicates the number of upgrade progresses.

For example, if the value of the vertical axis is 6, the value of the horizontal axis is 2, and the value of the point where the vertical axis and the horizontal axis meet is 3, this means that the total number of nodes connected to the network is 6, and among the six nodes, the controller ( When the number of seed nodes receiving the upgrade image is 2, the total number of nodes is 6, and the number of seed nodes is 2 through 100), it can be seen that the upgrade is performed three times.

In addition, when the value of the vertical axis is 15, the value of the horizontal axis is 3, and the value of the point where the vertical axis and the horizontal axis meet is 5, this means that the total number of nodes connected to the network is 15, and among the 15 nodes, the controller 100 When the number of seed nodes receiving the upgrade image is 3, the total number of nodes is 15, and the number of seed nodes is 3, it can be seen that the upgrade is performed five times.

Here, the number indicated by the black box indicates the minimum number of upgrades by increasing the number of seed nodes when the total number of nodes is the same group.

Thus, the number of seed nodes according to the total number of nodes and the number of upgrades minimized accordingly are shown in the following [Table 2].

As shown in [Table 2], when the total number of nodes is six, the number of seed nodes is two, through which the number of upgrades can be minimized to three, and when the total number of nodes is 15, The number of seed nodes is three, which minimizes the number of upgrades to five.

On the other hand, as shown in Table 1, when the total number of nodes is 2 to 5, the number of seeds is 1, through which the number of upgrades can be minimized twice or three times, the total number of nodes Is 7 to 14, the number of seeds is two, thereby minimizing the number of upgrades four or five times.

Here, it can be seen that the number of upgrades is not minimized simply by increasing the number of seed nodes in all nodes.

That is, if the total number of nodes is four, and if the number of seed nodes is applied to three, the controller transmits the upgrade image three times sequentially to three of the four nodes, and any one of the three seed nodes. A total of four upgrades will be performed by sending the upgrade image to one remaining non-upgraded node, but the total number of nodes is four and three upgrades are applied by applying two seed nodes. It can be seen that the number of upgrades increases compared to the method of proceeding.

Therefore, an optimal number of seed nodes is required according to the total number of nodes.

To this end, the total number of nodes is represented by a constant A, the number of seed nodes is represented by n, the number of upgrades is represented by 2n-1, and this is represented by the following formula.

In other words,

to be.

For example, when the total number of nodes A connected to the network is 7, the result value of the number n of seed nodes is 2.13, where the remaining numbers 2 except the decimal point are as shown in [Table 1]. It can be seen that the number of seed nodes optimized.

As described above, the number of n seed nodes can be calculated from the number A of all nodes connected to the network through formulas (1) and (2), and the total number of seed nodes connected to the network through the calculated number of seed nodes. Find out which of the nodes should be selected as the seed node.

First, the location of the first seed node to which the upgrade image is to be transmitted through the seed node arrangement unit 150 of the controller 100 may be selected through the following formula.

Here, square brackets ([]) used in formula (3) are ceiling function symbols, and mean the following formula.

The first seed node selector 151 of the seed node arranging unit 150 may select and determine the position of the first seed node that is a reference point of the seed node through Formula (3), and the seed node spacing determiner Through (153), it is possible to know how far from the first selected seed node, the seed node is selected as the seed node through the following formula (4).

Here, square brackets ([]) used in Formula (4) are floor function symbols, and the following formulas are used, and a +0.5 value means rounding a value in square brackets.

At this time, the value derived through formula (4) is an increment added to the value derived from formula (3). That is, it increases by the value derived from formula (4) based on the value derived from formula (3), and increases by the value derived through formula (4) in the first seed node selected through formula (3). Select the node of the position as the seed node of the second or third etc.

For example, if the value derived from formula (3) is 3 and the value derived from formula (4) is 7, the node located in the third of all nodes connected to the network is the seed node, and from the seed node. The seventh spaced node must be selected as the next seed node to upgrade the entire node with the minimum number of upgrades.

As described above, after calculating the number of seed nodes through the number of seed nodes calculating unit 110 of the controller 100, the position of the seed node is selected through the seed node arranging unit 150, and the seed node arrangement is performed. The first seed node selection unit 151 of the unit 150 selects a seed node to receive the upgrade image of the controller 100 first, and the seed node interval determination unit 153 first upgrades the image. Determine the interval from the seed node to receive the next and / or next upgrade image from the seed node to be transmitted, and if the number of seed nodes and the position of the seed node is selected and determined, the upgrade of the controller 100 is executed. After transmitting the upgrade image to the seed node through the unit 170, each seed node upgrades to nodes adjacent to both sides.

As such, when the controller 100 selects the number and location of seed nodes to which the upgrade image is transmitted among all nodes connected to the network, and transmits the upgrade image to the selected seed node, each seed node is adjacent to both sides. By distributing upgrades for the remaining nodes, the resources of each device can be used efficiently.

While the invention has been shown and described in connection with particular embodiments, it will be appreciated that various modifications and variations can be made without departing from the spirit and scope of the invention as set forth in the appended claims. Anyone who owns it can easily find out.

100: controller,
110: seed node counting unit,
130: upgrade count calculation unit,
150: seed node arrangement,
151: the first seed node selection unit,
153: seed node spacing determiner,
170: upgrade execution unit.

Claims (7)

In the upgrade method of the automatic control equipment comprising a server, a controller and at least one node, which are interconnected in a daisy chain by a network,
The server transmitting an upgrade image to a controller;
Calculating, by the controller, the number of seed nodes that will transmit an upgrade image in all nodes;
Calculating the number of upgrades through the calculated number of seed nodes;
Selecting a location of a seed node to be upgraded to correspond to the calculated number of upgrades;
Transmitting an upgrade image to the selected seed node; And
Transmitting, by the seed node, the upgrade image transmitted to another node;
Including,
The node receiving the upgrade image from the seed node repeatedly transmits the upgrade image to another node that is not upgraded.
The method according to claim 1,
In the step of calculating the number of seed nodes to transmit the upgrade image in all the nodes,
Daisy chain distributed upgrade method, characterized in that the number of seed nodes is calculated by the following formula.

The method according to claim 2,
In selecting the position of the calculated number of seed nodes,
Daisy chain distributed upgrade method, characterized in that the selection of the position of the first seed node is calculated by the following formula.

The method according to claim 3,
And the positioning of the next seed node at the position of the first seed node is calculated by the following formula.

The method according to claim 1,
In the step of calculating the number of seed nodes to transmit the upgrade image in all the nodes,
Consider the number of times that the upgrade image is sent to each seed node from the controller once,
The number of times the upgrade image is transmitted from the seed node to the remaining nodes is regarded as one time because it dedicates network bandwidth.
The calculated number of seed nodes and the position of the seed node is calculated and selected as the minimum number of upgrade progress for upgrading the entire node, characterized in that the daisy chain distributed upgrade method.
In the upgrade system of automatic control equipment comprising a server, a controller and at least one node, which are interconnected in a daisy chain by a network,
The controller may include a seed node number calculating unit that calculates the number of seed nodes in all nodes when upgrading all nodes connected to a network, and an upgrade count calculating unit that calculates the number of upgrades to seed nodes calculated through the seed node number calculating unit. And a seed node arranging unit configured to select a position of the seed node at all nodes so as to correspond to the number of upgrades calculated through the upgrade number calculating unit, and an upgrade image to the seed node disposed through the seed node arranging unit. Daisy chain distributed upgrade system, characterized in that configured to include an upgrade execution unit for transmitting and performing the upgrade.
The method according to claim 6,
The seed node placement unit is configured to select a position of the first seed node, a first seed node selection unit, and a first seed node positioned through the first seed node selection unit. Daisy chain distributed upgrade system, characterized in that further comprises a seed node interval determination unit for determining the interval sequentially.

Images