JP2011221625A - Communication device and shared information updating method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To achieve an efficient update of shared information even in a largely scaled network.SOLUTION: In case of updating shared information to be shared by node devices included in a network, each of node device stores the node device which has transmitted the shared information in case of updating the shared information in the past as the other party of update, and in case of newly updating the shared information, transmits the updated shared information only to the node device stored as the other party of update. A node device A stores node devices B, C, and D as the other parties of update, and transmits the updated shared information only to the node devices B, C and D in case of newly updating the shared information. In the same way, the node devices B, C, and D respectively transmit the shared information received from the node device A only to the node devices stored as the other parties of update. Afterwards, the similar processing is repeated by every node device, and the shared information is thoroughly transmitted to all the node devices of the network.

Description

The present invention efficiently distributes updated shared information to all communication devices when shared information shared between communication devices (hereinafter also referred to as node devices) included in a communication network is updated. Related to technology.
More specifically, the present invention relates to the distribution of shared information between communication devices included in an overlay network using a distributed hash table (hereinafter referred to as DHT).

In an information sharing system in which node devices are configured in a peer-to-peer type, when a large-scale network is configured, an overlay network using DHT may be constructed.
By using an overlay network, each node device does not recognize link information (for example, IP address, host name, etc.) to all node devices participating in the network, but links to some node devices. Recognize information only.
Then, the node device that makes the data inquiry transmits the data inquiry to some of the node devices that recognize the link information.
After that, the node device that has received the data inquiry repeatedly transmits the data inquiry to some of the node devices for which the link information has been recognized, and inquires the data inquiry to all the node devices. Can be done.
The overlay network is a very effective means when the number of node devices increases explosively.

In a conventional peer-to-peer type information sharing system, in order to update commonly used information such as firmware, application software and various setting files stored in each node device, so-called version upgrade or update One or more servers having the latest shared information are always set.
In such an information sharing system, each node device makes an inquiry about the latest shared information to this server, and if there is the latest shared information, it is to be downloaded from this server. .
However, with this method, when the system scale increases, access from all the node devices concentrates on the server, and an excessive load is applied to the server and the network. As a result, it is difficult to smoothly update. There is a problem.

  In response to this problem, in the technique of Patent Document 1, each node device does not individually access the server on the overlay network, but instead takes advantage of data communication that is regularly performed between the node devices in the system. Distributes centralized access to servers.

  More specifically, Patent Document 1 discloses the following update method.

  (1) The “version information of shared information” is added to the header part of the message data for notifying the message, and the message data is transmitted, so that the side that has received the message data owns S The / W (software) version is compared with the version embedded in the header part of the received message data. If the version is older, the latest version is obtained from another node device having a newer version than itself. Get shared information.

  (2) In the above (1), a means for storing version information of shared information (corresponding to a file etc.) is prepared, and the version embedded in the header part of the received message data at the time of data communication as in the above (1) Compared with the version (1), the version of the shared information owned by itself is not directly confirmed but compared with the version information stored in the “version information storage means”. ing.

(3) In the node device that plays a role of relay in data communication in (2), the information stored in the version information storage means described in (2) is also added to the header portion of the message data, Transfer to the next node device.
As a result, the node device that has received the message data can be compared with the S / W version of the node device that is located not in the transmission source node but in the vicinity and that has performed the last transfer.

(4) In the above (2) and (3), the version information embedded in the header part of the received message data is compared with the version of the shared information owned by itself at the time of data communication. If the version notified in the header part is a newer version than its own, the update process is not performed immediately, and after confirming that a new version exists a certain number of times, the update process is not performed. Try to get started.
By performing such confirmation work, the update process is not immediately performed, so that the system network load can be reduced, and even if a malicious person intentionally transmits an unauthorized version, there is an effect that can be avoided.

(5) In the above (4), in summary, the data communication is received a plurality of times, and the update procedure is carried out when it is found that the own S / W is older than the S / W of other nodes by a predetermined number of times. It was something to take.
On the other hand, in (5), in a single data communication, each relayed node device passes the version number one after another in a header portion of the message data.
The receiving node device compares the version number embedded in the header part of the message data with a large number, and here also uses a determination method similar to the above (4).
That is, if there is a node device having a newer version than a certain number, the update process is performed.

(6) In the above (1) to (5), when it is possible to determine that the version of its own S / W is old, the latest version is used for a specific node device determined in advance by using the inquiry means. If it is determined that it is out of date, an update information request can be made to a specific node device.
By doing this, centralized access to the server can be distributed and a specific node device can be specified, thereby preventing cracking and the like.

(7) In the above (1) to (5), the transmitting node device not only enters the version number of the shared information in the data but also includes its own identification number in the header portion of the message data.
In the receiving side node device, not only the version number included in the header part of the received data but also this identification information is compared (the identification held by the node on which the node device has great trust at hand). By substituting a number, it is determined whether the transmitted data is reliable.
If the version number of the own node apparatus is older than the node that places the trust, the node that has placed the trust is accessed and updated.

(8) In the above (2) to (4), the node device that performs the transmission is not only the version information stored in the version storage means of the own node in the header portion of the data, but also the index value indicating the own network environment The network environment information to be included is also transmitted.
The network environment information is the level of the effective bandwidth of the node device, the number of HOPs from a fixed point, or segment information of an IP address.
The received node device uses the version determination unit of its own node to select the one with the best network environment information from the candidate candidates for obtaining update information, and updates the shared information for that node device. .

JP 2007-58275 A

  The S / W update method described in Patent Document 1 described above is considered to have the following problems.

(1) In Patent Document 1, the trigger for updating is the necessity of data communication, which is from one node device to another node device.
This is suitable for advancing the update work so that it does not impose much load on the network and interfere with normal communication, but all the node devices connected to the network can communicate (communication) equally. It is based on the assumption.
Actually, since it is rare that all node devices on the network communicate equally, it is assumed when the S / W update will be completed on all node devices on the network. Difficult to do.
(2) Also, in Patent Document 1, the version information of each node device serving as a communication path is assigned to the header portion of the communication data in a daisy chain, which may cause communication overhead.
(3) Also, in Patent Document 1, even if it is determined that the version of the own node is old, in order to increase security, it is necessary to compare the versions for a certain node and recognize that the version of the own node is old. If it does, it cannot move to the update work. For this reason, quick update cannot be performed.
(4) Many S / W updates require a reboot of the H / W (whole device). However, in the S / W update method of Patent Document 1, since there is no such consideration, a reboot occurs sequentially from the updated version, so even if it is an overlay network using DHT, it is locally If reboots in different areas occur at the same time, the system may not be completely repaired (another network will be generated), which is not practical.

  One of the main objects of the present invention is to solve the above-mentioned problems, and the main object of the present invention is to efficiently update shared information even in a large-scale network.

The communication device according to the present invention is
Multiple communication devices are included, included in a communication network that shares shared information updated from time to time between communication devices,
A communication device that transmits the updated shared information to any other communication device when the shared information is updated,
An information storage unit that stores update target device information indicating a communication device that has transmitted the updated shared information as an update target device when the shared information is updated in the past;
A device extraction unit that extracts an update target device from the update target device information when the shared information is newly updated;
And a shared information updating unit that transmits newly updated shared information to the update target device extracted by the device extraction unit.

  According to the present invention, the update target device information indicating the update target device that has transmitted the shared information at the time of the past update of the shared information is stored, and when the shared information is newly updated, the update target device is newly updated. Since the updated shared information is transmitted to the communication network, it is possible to distribute the shared information to the entire communication network efficiently and reliably as compared with the case based on the accidental data communication between the communication devices.

FIG. 3 is a diagram illustrating an example of an update dependency relationship between node devices according to the first embodiment. The figure which shows the example of the update other party list | wrist which the node apparatus A which concerns on Embodiment 1 holds. The figure which shows the example of the update other party list | wrist which the node apparatus B which concerns on Embodiment 1 holds. FIG. 3 is a diagram illustrating a configuration example of a node device according to the first embodiment. FIG. 3 is a flowchart showing an operation example of the node device according to the first embodiment. FIG. 3 is a flowchart showing an operation example of the node device according to the first embodiment. FIG. 6 shows a configuration example of a node device according to the second embodiment. FIG. 10 is a diagram showing an example of connection between node devices according to the second embodiment. The figure which shows the example of the plane graph which divides | segments the network which concerns on Embodiment 2. FIG. FIG. 6 is a diagram illustrating an example of color coding for dividing a network according to the second embodiment. FIG. 9 is a flowchart showing an operation example of the node device according to the second embodiment. FIG. 3 is a diagram illustrating a hardware configuration example of a node device according to the first and second embodiments.

Embodiment 1 FIG.
In this embodiment, each node device is provided with a list of partner node devices that have been updated (update partner list), so that when a new update is performed at a short interval, the latest version can be quickly updated. It is possible to deliver.
Hereinafter, description will be given with reference to the drawings.

FIG. 1 is an example showing dependency of update of node devices A to S included in a communication network 10 (for example, an overlay network) according to the present embodiment.
FIG. 1 shows an example in which shared information (update file name “bios.dat”, file with version number “1.01”) is given from the node device A and is gradually transmitted to other node devices.
Arrows indicate the direction of transmission of shared information.
The shared information is information shared by each node device included in the communication network 10 and is updated as needed.
The shared information is, for example, application software, and the updated shared information can be identified by, for example, a version number (version value).
Each node device is an example of a communication device.

FIG. 2 shows an update partner list held by the node device A in the example of FIG. 1, and here shows an example in which records of two types of update file names are written.
First, the update file name (100A) is “bios.dat” (101A), the version number (110A) is “1.01” (111A), and the partner (120A) that sent the update file is B ( 121A), C (122A), and D (123A) node devices.
In addition, the update file name (130A) is “device.dat” (131A), and the version number (140A) is “2.01” (141A). ), C (152A), D (153A), and E (154A) node devices.
In addition, the node devices C (171A) and D (173A) are described as counterparts (170A) to which the update file is transmitted when the version number (160A) is “2.02” (161A).

Similarly, FIG. 3 shows an example of the update partner list held by the node device B. Here, “bios.dat” (101B) is added to the version number (110B) in the update file name (100B). "1.01" (111B) sends the update file to the other party (120B), E (121B), F (122) B, G (123B), H (124B), I (125B) The node device is entered.
The update partner list held by the remaining node devices is omitted, but the node device at the tip of the arrow shown in FIG. 1 has an update partner list in the same format as in FIGS. 2 and 3 in each node device. To do.

  In the situation where there is an update dependency as shown in FIG. 1, the update file “bios.dat” and the version number “1.02”, which are updated shared information, arrive at the node device A as an example. The configuration and operation of the node device according to the embodiment will be described with reference to FIG.

In FIG. 4, 400a is a node device on the transmission side. In this example, node device A is assumed.
Reference numeral 400b denotes a receiving-side node device. For example, the node device B.

401a and 401b are shared information update units.
402a and 402b are shared information.
The shared information update unit 401a transmits the shared information 402a to the node device 400b via the communication unit 405a described later.
Further, the shared information update unit 401b receives the shared information 402a from the node device 400a via the communication unit 406b described later, and stores it as the shared information 402b in the information storage unit 410b.
In FIG. 4, the shared information 402a is not shown to be transmitted from the communication unit 405a, and the shared information 402a is not shown to be received by the communication unit 406b. The shared information 402a is transmitted from the communication unit 405a, and the shared information 402a is received by the communication unit 406b.
In the following description, the description that the shared information update unit 401a transmits the shared information 402a and the description that the shared information update unit 401b receives the shared information 402a are respectively transmitted via the communication unit 405a and the communication unit 406b. It means to send and receive.
Also,

403a is transmission data transmitted by the node device 400a on the transmission side.
404a and 404b are version numbers (version values) of (shared information).
A communication unit 405a transmits transmission data 403a in the node device 400a on the transmission side.
Reference numeral 406b denotes a communication unit that receives the transmission data 403a in the receiving-side node device 400b.
Reference numeral 407b denotes reception data (contents coincide with transmission data 403a) received by the communication unit 406b.

Reference numerals 408a and 408b denote version discrimination units.
The version determination unit 408b of the node device 400b on the receiving side compares the version number of the shared information notified from the other node device with the version number of the shared information held in the own node.
The version determination unit 408a of the node device 400a on the transmission side performs the same operation as the version determination unit 408b when notified of the version number of the shared information from another node device.

420a and 420b are update monitoring units.
Since the shared information 402a has been updated, the update monitoring unit 420a of the transmission-side node device 400a performs an update process on the other node devices.
More specifically, when the shared information 402a is updated, the node device of the update partner is extracted from the update partner list 430a described later, and the version number 404a (of the shared information) is included for the extracted node device. Transmission data 403a is generated, and the transmission data 403a is transmitted to the extracted node device via the communication unit 405a.
The update monitoring unit 420b of the receiving-side node device 400b performs the same operation as the update monitoring unit 420a when the node device 400b notifies the other node device of the version number 404b (of shared information).
The update monitoring units 420a and 420b are examples of device extraction units.

Reference numerals 430a and 430b denote update partner lists having a list of counterpart node apparatuses that have updated the shared information 402a and 402b of the own node apparatus.
The update partner lists 430a and 430b are the information shown in FIGS. 2 and 3, and are information indicating the node device that has transmitted the updated shared information as the update partner (update target device) when updating the past shared information. is there.
As apparent from FIGS. 2 and 3, the contents of the update partner lists 430a and 430b are different.
The update partner lists 430a and 430b are examples of update target device information.

Reference numerals 410a and 410b denote information storage units.
The information storage unit 410a stores shared information 402a, a version number 404a (of shared information), and an update partner list 430a.
The information storage unit 410b stores shared information 402b, a version number 404b (of shared information), and an update partner list 430b.

The remaining components other than the update monitoring units 420a and 420b and the update partner lists 430a and 430b may all be elements described in Patent Document 1.
For this reason, the update operation of the shared information may be performed between the transmitting-side node device 400a and the receiving-side node device 400b using these components in the form of piggybacking on data transmission.

Next, the operation of the node device 400 according to the present embodiment will be described using a flowchart.
FIG. 5 shows an operation example of the reception-side node device 400b, and FIG. 6 shows an operation example of the transmission-side node device 400a.
In the following, description will be given using an example in which a new update file “bios.dat” and version number “1.02” have arrived at the node device A.
In the following, the operation of the node device A will be described using the components of the node device 400a, and the operation of the node device B will be described using the components of the node device 400b.

  First, the update monitoring unit 420a in the node device A reads the update partner list 430a (S601 in FIG. 6) (information reading step).

Next, the update monitoring unit 420a in the node device A extracts an update partner indicated for the same file name as the updated file name from the update partners indicated in the update partner list 430a (S602). (Device extraction step).
The update partner list 430a of the node device A has the contents shown in FIG. 2, and the update monitoring unit 420a searches for an update file name “bios.dat” in the list.
In FIG. 2, since 101A has the same file name, the update monitoring unit 420a makes the node device B (121A), node device C (122A), node device D ( It can be seen that three of 123A) access the own node apparatus by updating the past old version, and the own node apparatus transmits the past version file to these node apparatuses.

Next, the update monitoring unit 420a of the node device A notifies the update monitoring unit of the node device (node devices B, C, and D) extracted in S602 that the shared information has a new version (S603).
Specifically, the update monitoring unit 420 generates transmission data 403a including the version number 404a (of the shared information), and transmits the transmission data 403a from the communication unit 405a to the target node device.
As described above, the version number 404a (of the shared information) may be included in the transmission data 403a for other uses as in the method disclosed in Patent Document 1.
Hereinafter, only the operation when the transmission data 403a is transmitted to the node apparatus B will be described, but the same applies to other node apparatuses.

In the node device B, the communication unit 406b receives the transmission data 403a including the updated shared information version number 404a (S501 in FIG. 5).
In the node apparatus B, the transmission data 403a is expressed as reception data 407b.
The version determination unit 408b of the node device B determines that the version number 404a (“1.02” of “bios.dat”) included in the received data 407b is greater than the version number 404b in the information storage unit 410b of the own node. Determine if it is new.
If it is determined that the version number 404a included in the received data 407b is new, the shared information update unit 401b transmits a shared information transmission request from the communication unit 406b to the shared information update unit 401a of the node device A. The shared information (version “1.02” of “bios.dat”) transmitted from the information updating unit 401a is received via the communication unit 406b, and the received shared information is stored in the information storage unit 410b as new shared information 402b. Store (S502).

  In the node device A, the shared information update unit 401a receives a transmission request from the shared information update unit 401b via the communication unit 405a (YES in S604 in FIG. 6), and the updated shared information (“bios.dat”) Is transmitted to the node apparatus B via the communication unit 405a (S605) (shared information update step).

If the processing has been completed for all the update partners notified of the version number in S603 (YES in S606), the update partner list is updated in S607.
When processing has been completed for all update partners, each node device of the update partner has received a response indicating that transmission of shared information after updating has been completed or that transmission of shared information is unnecessary. It is a case.

In S607, the shared information update unit 401a adds the updated file name, version number, and updated node device to the update partner list 430a, and updates the update partner list 430a.
For example, when the version “1.02” of the file name “bios.dat” is updated with respect to the node devices B, C, D, 111A is added between 123A and 131A in the update partner list in FIG. , 121A, 122A, 123A, four lines of “version number: 1.02”, “partner: B”, “partner: C”, and “partner: D” are added.

On the other hand, in the node apparatus B, after the shared information 402b is updated in S502 of FIG. 5, the shared information update unit 401b calls the update monitoring unit 420b, and the update monitoring unit 420b sets the file name and version number that have been updated. Tell (S503).
The update monitoring unit 420b refers to the update partner list 430b based on the information received from the shared information update unit 401b, and has updated the node device of the update partner that has accessed the node in the past in order to update the same file (In the examples of FIGS. 1 and 3, the node devices E to I) are checked, and the version number of the updated shared information 402b is transmitted to the node devices of the update partner via the communication unit 406b. Further, the shared information update unit 401b transmits the updated shared information 402b to the update partner node device (S504).
Specifically, the node device B becomes the transmission-side node device 400a, performs the processing shown in FIG. 6 on the node devices E to I, and transmits the shared information 402b updated to the node devices E to I.
Also, in the node devices E to I, the processes of FIGS. 5 and 6 are repeatedly performed.

  In the flow of FIG. 6, the node device A performs an example of performing S603 to S605 in parallel with the update partner node devices B to D, but instead, the node device B performs the processes of S603 and S604. First, after the processing to the node device B is completed, the same processing as that performed to the node device B is sequentially performed on the remaining node devices C and D in the update partner list 430a. Good.

  In the flow of FIG. 6, the version number is notified to the update partner node device, and the shared information is transmitted when a transmission request is received from the update partner node device. Alternatively, the reception of the transmission request may be omitted, and the shared information may be immediately transmitted to the update partner node device.

  Further, any method for updating the shared information for the first node device A may be used. For example, manual update, update by remote operation, or the update method disclosed in Patent Document 1 may be used.

  Further, in the node device A, when a new node device not listed in the update partner list 430a requests transmission of the shared information 402a, the shared information update unit 401a sends the shared information 402a to the new node device. The update partner list 430a is updated by including the new node device as a new update partner in the update partner list 430a.

Moreover, you may implement the system shown in patent document 1 in parallel with the system shown to this Embodiment.
In the method disclosed in Patent Document 1, each node device is owned by itself because it takes too much time for the shared information to exist throughout the entire system if there is no data communication between the node devices. By actively informing nearby node devices of the version number of shared information being used, or by inquiring to nearby nodes on the contrary, actively promoting the penetration of the new version Also good.
Note that it is necessary to adjust the number of hops in the vicinity and how much the frequency is increased depending on the network load status of the system, and this operation is performed by the update monitoring unit in FIG.

In the present embodiment, the method described in the background art (1) and (2) (the version notified from the node device A in the node device B is compared with its own version, and the version of itself is old. For example, all the methods (3) to (8) are similarly applied to the method described in the present embodiment. It is possible to update efficiently.
The base overlay network and the node device arranged on the overlay network can be the same as those described in Patent Document 1 with respect to functions and configurations not explicitly described in this specification.

As described above, according to the present embodiment, the own node device has the update monitoring control unit that performs update monitoring and the update partner list that is a list of node devices that have requested update information from the own node device. Thus, when a new version of the shared information is injected into the system, the new version of the shared information can be quickly distributed to the entire system.
In addition, the new node device that has received the new version of the shared information voluntarily searches its own update partner list, and further updates the node device of its own update partner. Go. As a result, the entire system can be updated quickly.

In other words, in this embodiment, each node device is provided with a list of partner node devices that have been updated by itself (update partner list), so that when a new update is performed at a short interval, the latest information is promptly updated. The version can be delivered.
And according to this embodiment, when it is necessary to distribute new update files in succession after the update file starts to flow into the system, each node device can update the update file to which node device in the past. Based on the record of whether or not it has been distributed, perform communication that encourages voluntary updates (however, it may be implemented, for example, a special update check protocol), and actively perform update work Is possible.
In the conventional method, since it is necessary to rely on accidental data communication between the node devices, it is impossible to always perform the update work urgently. However, if the method of this embodiment is used, the update is quickly performed. it can.

Further, in the present embodiment, since it is not a method of performing an update operation during normal data communication, it is possible to update the network without applying a load as in the conventional method.
The load is high locally, but only near the node that needs to be updated. According to the conventional method, if there are node devices that have already been updated, they are involved and communicated, which may increase the network load as a result.
Note that, by determining the maximum value of the update partner list in the method of the present embodiment, it is possible to avoid the concentration of the update distribution load on the local node device.

  As described above, in the present embodiment, when updating the shared information held by each node device to the latest without giving an excessive load to a specific device such as a server, how many times the information is stored in a short time. Even if it is updated, or even if it has been updated once but suddenly has to be updated again, by recording who "updated to" each A method for efficiently reflecting the node device has been described.

Embodiment 2. FIG.
In the present embodiment, when the shared information is exchanged by the method described in the first embodiment, a plurality of neighboring node devices that have received the new version of the shared information are rebooted at the same time. A method for avoiding the influence will be described.

When the shared information to be updated is a basic input output system (BIOS), an operating system (OS), or some special device driver, the node device needs to be rebooted.
In the case of a large-scale system, since the reboot operation of the node device cannot be performed manually, a method is employed in which each node device restarts spontaneously.
Rebooting takes a certain amount of time, so if many node devices start rebooting almost simultaneously, there is a possibility that the system cannot be maintained with only the node devices remaining in the network. .
In the present embodiment, when a prompt machine reboot is required along with the update of shared information, ranking is performed so that the node devices that have updated the shared information do not shut down from one to the next at a time.

FIG. 7 shows a configuration example of the node device 400 according to the present embodiment.
Node device 400a on the transmission side, node device 400b on the reception side, shared information update units 401a and 401b, shared information 402a and 402b, transmission data 403a, (shared information) version numbers 404a and 404b, communication unit 405a, The communication unit 406b, received data 407b, version determination units 408a and 408b, information storage units 410a and 410b, update monitoring units 420a and 420b, and update partner lists 430a and 430b are the same as those shown in FIG. To do.
The newly added elements in FIG. 7 are a restart timing determination unit of 440a and 440b, a restart timing notification of 441a and 441b, and a restart execution unit of 450a and 450b.

The restart timing determination units 440a and 440b measure the timing when the reboot is necessary after updating the shared information.
More specifically, in the case of shared information (reboot shared information) that needs to be rebooted (rebooted) at the receiving node device 400b, the timing at which the receiving node device 400 should reboot (reboot) Timing).

As the simplest countermeasure, the restart timing determination unit 440b of the receiving-side node device 400b may generate a random number, wait for a predetermined time according to the random number, and then call the restart execution unit 450b.
For example, there is a method of generating a random number between 0.0 and 1.0 and waiting for a time taken by taking 1 minute.

Also in the present embodiment, the shared information update unit 401a of the transmission-side node device 400a sends a new version of the shared information 402a to the node devices on the update partner list 430a as described in the first embodiment. In this case, there is a method in which a numerical value for notifying the order of performing the reboot determined by the restart timing determination unit 440a is also sent as the restart timing notification 441a.
In such a method, in the node device 400b on the receiving side, the restart timing determination unit 440b acquires the restart timing notification 441a, and after updating the shared information, refer to the numerical value notified in the restart timing notification 441a. Then, the waiting time is calculated as appropriate, and the restart execution unit 450b is called after the waiting time has elapsed.

In the case where there are five node devices that perform updating at the same time, an example will be described in which the node device B in FIGS. 1 and 3 updates to the node devices E, F, G, H, and I.
The restart timing determination unit 440a of the node device B determines 1 for the node device E, 2 for the node device F, 3 for the node device G, 4 for the node device H, 5 for the node device I, and a restart timing notification 441a. Each value is notified to each node device.
For example, if the time required for the node device to reboot is 2 minutes, the node device E is 1 × 2 = 2 minutes and the node device F is 2 according to the value indicated in the restart timing notification 441a. × 2 = 4 minutes, similarly, the node device G reboots after 6 minutes, the node device H after 8 minutes, and the node device I after 10 minutes.
As a result, it is possible to avoid the neighboring nodes from rebooting at the same time and affecting the network communication of the system.

In addition, when there are a large number of node devices such as several tens of nodes in the update partner list 430a, the node device 400b in the latter half of the order reboots wastefully by simply incrementing the numerical value that is the order of reboot. I'll be waiting.
For this reason, the restart timing determination unit 440a repeatedly allocates numerical values of, for example, 1 to 4 to the update partner node device.
The allocation is performed so that neighboring node devices connected to the transmitting-side node device 400a do not have adjacent numerical values or the same numerical values.
In this way, by assigning 1 to 4 so that only the node devices having the same numerical value among the node devices connected to the transmitting-side node device are rebooted, each receiving-side node device is one by one. Reboot can be completed more efficiently than waiting for one reboot.

In addition, when allocating each node device to 1 to 4, all the node devices in the system are made into a plane graph with a network connection route that can actually communicate between the node devices as a boundary line, and each area As a node device, color coding is performed.
According to the four-color theorem, it is possible to separate the colors so that adjacent node devices always have different colors.
By classifying each node into 1 to 4 in this way, when the node device reboots, it is divided into four groups, and each group reboots separately (in order).
Since the groups are divided according to the four-color theorem, adjacent node devices do not reboot at the same time, that is, it is guaranteed that a path that can be avoided without fail is secured.
However, this is limited to a case where when two arbitrary node devices that are not adjacent to each other are selected, there are at least two avoidance paths by an intermediate node device sandwiched between the two node devices. This is because if there is only one point, the detour path cannot be secured if that point is rebooted.

  Using this method, even if all node devices in the system are updated to the new version at the same time, it is possible to maintain a system that can always operate without rebooting all at once. Become.

FIG. 8 shows the connection relationship between the nodes of the network that is the base of the example of FIG.
FIG. 9 is a plan graph of FIG. 8. FIG. 10 is a diagram in which each node of FIG. 8 is color-coded based on the plan graph of FIG.

FIG. 11 shows an operation example of the transmission-side node device 400a according to the present embodiment.
In FIG. 11, the steps other than S1101 and S1102 are the same as those in FIG.
In S1101, if the shared information is to be restarted at the time of update, the restart timing determination unit 440a determines the restart timing for each update partner. In S1102, the shared information update unit 401a is restarted together with the shared information 402a. An activation timing notification 441a is transmitted.
In the node device 400b on the receiving side, as described above, the restart timing determination unit 440b acquires the restart timing notification 441a, and after updating the shared information, refers to the numerical value notified in the restart timing notification 441a, The waiting time is appropriately calculated, and the restart execution unit 450b is called after the waiting time has elapsed.
When the restart execution unit 450b is called, it restarts in a predetermined procedure.

  As described above, in the present embodiment, when the shared information is to be restarted at the time of update, the restart timing is adjusted for each node device, so that a plurality of node devices that have received the shared information It is possible to avoid a situation in which the system is affected by rebooting all at once.

  As described above, in the present embodiment, when a prompt machine reboot is required in accordance with the update of shared information, ranking is performed so that the node devices that have updated the shared information do not shut down from one to the next at a time. I explained that.

Finally, a hardware configuration example of the node device 400 shown in the first and second embodiments will be described.
FIG. 12 is a diagram illustrating an example of hardware resources of the node device 400 illustrated in the first and second embodiments.
The configuration in FIG. 12 is merely an example of the hardware configuration of the node device 400, and the hardware configuration of the node device 400 is not limited to the configuration illustrated in FIG. 12, but may be other configurations. .

In FIG. 12, the node device 400 includes a CPU 911 (also referred to as a central processing unit, a central processing unit, a processing unit, an arithmetic unit, a microprocessor, a microcomputer, and a processor) that executes a program.
The CPU 911 is connected to, for example, a ROM (Read Only Memory) 913, a RAM (Random Access Memory) 914, a communication board 915, a display device 901, a keyboard 902, a mouse 903, and a magnetic disk device 920 via a bus 912. Control hardware devices.
Further, the CPU 911 may be connected to an FDD 904 (Flexible Disk Drive), a compact disk device 905 (CDD), a printer device 906, and a scanner device 907. Further, instead of the magnetic disk device 920, a storage device such as an optical disk device or a memory card (registered trademark) read / write device may be used.
The RAM 914 is an example of a volatile memory. The storage media of the ROM 913, the FDD 904, the CDD 905, and the magnetic disk device 920 are an example of a nonvolatile memory. These are examples of the storage device.
The “information storage unit 410” described in the first and second embodiments is realized by the RAM 914, the magnetic disk device 920, and the like.
A communication board 915, a keyboard 902, a mouse 903, a scanner device 907, an FDD 904, and the like are examples of input devices.
The communication board 915, the display device 901, the printer device 906, and the like are examples of output devices.

  The communication board 915 is connected to a network as shown in FIG. For example, the communication board 915 may be connected to a LAN (local area network), the Internet, a WAN (wide area network), a SAN (storage area network), or the like.

The magnetic disk device 920 stores an operating system 921 (OS), a window system 922, a program group 923, and a file group 924.
The programs in the program group 923 are executed by the CPU 911 using the operating system 921 and the window system 922.

The RAM 914 temporarily stores at least part of the operating system 921 program and application programs to be executed by the CPU 911.
The RAM 914 stores various data necessary for processing by the CPU 911.

The ROM 913 stores a BIOS (Basic Input Output System) program, and the magnetic disk device 920 stores a boot program.
When the node device 400 is activated, the BIOS program in the ROM 913 and the boot program in the magnetic disk device 920 are executed, and the operating system 921 is activated by the BIOS program and the boot program.

  The program group 923 stores programs that execute the functions described as “˜units” (other than “information storage unit” in the following) in the description of the first and second embodiments. The program is read and executed by the CPU 911.

In the file group 924, in the description of the first and second embodiments, “determination of”, “extraction of”, “comparison of”, “collation of”, “update of”, and “setting of” are set. ”,“ Registration of ”,“ Selection of ”, etc. Information, data, signal values, variable values, and parameters indicating the results of the processing are indicated as“ ˜file ”and“ ˜database ”items. It is remembered.
The “˜file” and “˜database” are stored in a recording medium such as a disk or a memory. Information, data, signal values, variable values, and parameters stored in a storage medium such as a disk or memory are read out to the main memory or cache memory by the CPU 911 via a read / write circuit, and extracted, searched, referenced, compared, and calculated. Used for CPU operations such as calculation, processing, editing, output, printing, and display.
Information, data, signal values, variable values, and parameters are stored in the main memory, registers, cache memory, and buffers during the CPU operations of extraction, search, reference, comparison, calculation, processing, editing, output, printing, and display. It is temporarily stored in a memory or the like.
In addition, the arrows in the flowcharts described in the first and second embodiments mainly indicate input / output of data and signals, and the data and signal values are the RAM 914 memory, the FDD 904 flexible disk, the CDD 905 compact disk, and the magnetic field. Recording is performed on a recording medium such as a magnetic disk of the disk device 920, other optical disks, mini disks, DVDs, and the like. Data and signals are transmitted online via a bus 912, signal lines, cables, or other transmission media.

In addition, what is described as “˜unit” in the description of the first and second embodiments may be “˜circuit”, “˜device”, “˜device”, and “˜step”, It may be “˜procedure” or “˜processing”.
That is, the “shared information updating method” according to the present invention can be realized by the steps, procedures, and processes shown in the flowcharts described in the first and second embodiments.
Further, what is described as “˜unit” may be realized by firmware stored in the ROM 913. Alternatively, it may be implemented only by software, or only by hardware such as elements, devices, substrates, and wirings, by a combination of software and hardware, or by a combination of firmware. Firmware and software are stored as programs in a recording medium such as a magnetic disk, a flexible disk, an optical disk, a compact disk, a mini disk, and a DVD. The program is read by the CPU 911 and executed by the CPU 911. That is, the program causes the computer to function as “to part” in the first and second embodiments. Alternatively, the computer executes the procedure and method of “to unit” in the first and second embodiments.

  As described above, the node device 400 described in the first and second embodiments includes a CPU as a processing device, a memory as a storage device, a magnetic disk, a keyboard as an input device, a mouse, a communication board, and a display device as an output device and a communication board. As described above, the function indicated as “to part” is realized by using these processing device, storage device, input device, and output device.

  400 node device, 401 shared information update unit, 402 shared information, 403 transmission data, 404 version number, 405 communication unit, 406 communication unit, 407 received data, 408 version determination unit, 410 information storage unit, 420 update monitoring unit, 430 Update partner list, 440 restart timing determination unit, 441 restart timing notification, 450 restart execution unit.

Claims (9)

Multiple communication devices are included, included in a communication network that shares shared information updated from time to time between communication devices,
A communication device that transmits the updated shared information to any other communication device when the shared information is updated,
An information storage unit that stores update target device information indicating a communication device that has transmitted the updated shared information as an update target device when the shared information is updated in the past;
A device extraction unit that extracts an update target device from the update target device information when the shared information is newly updated;
A communication apparatus, comprising: a shared information update unit that transmits newly updated shared information to the update target device extracted by the device extraction unit. The device extraction unit includes:
Notifying the update target device extracted from the update target device information of the version value of the newly updated shared information,
The shared information update unit
When the update target device notified of the version value by the device extraction unit is requested to transmit the newly updated shared information, the newly updated shared information is transmitted to the update target device. The communication apparatus according to claim 1, wherein: The shared information update unit
The communication apparatus according to claim 2, wherein the update target apparatus information is updated with the update target apparatus that is requested to transmit the newly updated shared information as a new update target apparatus. The shared information update unit
When a communication device other than the update target device indicated in the update target device information is requested to transmit the newly updated shared information, the newly updated shared information is sent to the communication device. The communication apparatus according to claim 1, wherein the update is performed on the update target apparatus information with the communication apparatus as a new update target apparatus. The communication device further includes:
When the shared information is restart shared information that requires restart of the update target device during update processing in the update target device, a restart timing determination for determining a restart timing at which the update target device should be restarted Part
The shared information update unit
The newly updated restart shared information is transmitted to the update target device extracted by the device extraction unit, and the restart timing determined by the restart timing determination unit is set for the update target device. The communication device according to any one of claims 1 to 4, wherein notification is performed. The restart timing determination unit
6. The communication device according to claim 5, wherein when there are a plurality of update target devices, the restart timing of each update target device is determined so that restarts in the plurality of update target devices do not concentrate at a specific time. . The restart timing determination unit
The communication apparatus according to claim 6, wherein the restart timing of each update target apparatus is determined so that restarts in two or more update target apparatuses that are close to each other in a network configuration are not concentrated at a specific time. Multiple communication devices are included, included in a communication network that shares shared information updated from time to time between communication devices,
A shared information update method performed by a communication device that transmits the updated shared information to any other communication device when the shared information is updated,
When the shared information is newly updated, the communication device stores, in a predetermined storage, update target device information indicating, as an update target device, a communication device that has transmitted the updated shared information when the shared information has been updated in the past. Reading information from the area;
A device extraction step in which the communication device extracts an update target device from update target device information;
A shared information update method, comprising: a shared information update step in which the communication device transmits newly updated shared information to the update target device extracted in the device extraction step. Multiple communication devices are included, included in a communication network that shares shared information updated from time to time between communication devices,
When the shared information is updated, the communication device, which is a computer that transmits the updated shared information to any other communication device,
When the shared information is newly updated, information reading that reads update target device information indicating a communication device that has transmitted the updated shared information as an update target device from a predetermined storage area when the shared information is updated in the past. Processing,
A device extraction process for extracting the update target device from the update target device information;
A program for causing an update target device extracted by the device extraction processing to execute shared information update processing for transmitting newly updated shared information.

Images