JP5314729B2 - Neighboring-node communication availability detection apparatus and operation method thereof - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To generate information reflecting availability of communication between adjacent nodes in a network. <P>SOLUTION: An inter-adjacent node communication availability detection device 1 comprises: a communication part 11; a communication information storage part 12 in which communication information related to each end node is stored; a node information storage part 13 in which node information related to each node is stored; an edge information storage part 14 in which edge information related to each set of nodes adjoining each other (referred to as adjacent nodes) is stored; information processing part 15 for making the edge information include a communication-available value or a communication-unavailable value based on the communication information storage part 12 and the node information storage part 13; a determination part 16 for performing various kinds of determination by using the node information storage part 13 and the edge information storage part 14; and a graphical user interface (GUI) part 17 for prompting an action by a user of a node N5 by performing display on a display part of a node N4. <P>COPYRIGHT: (C)2013,JPO&amp;INPIT

Description

  The present invention relates to an inter-adjacent node communication availability detection device and an operation method thereof that can generate information reflecting whether or not communication is possible between adjacent nodes in a network.

  Conventionally, for example, there is a case in which a problem such as disappearing of a web page displayed on a node (first node) such as a computer included in a network may occur.

  For example, in order to investigate the cause, if an ARP packet is transmitted from a node (second node) such as another computer to the first node and there is no response, one of the causes of no response is the first A failure of the communication cable connected to the node or the first node may be considered. That is, the cause of the disappearance of the web page is also considered as the first node, and further cause investigation is performed at the first node.

RFC 826 "Ethernet (registered trademark) address resolution protocol"

  However, in some cases, a node such as a switching hub is interposed between the first node and the second node that are routes of the ARP packet. That is, the cause of no response to the ARP packet may be a switching hub.

  Therefore, even if the cause is investigated at the first node or the like as described above, the cause may not be found.

  For example, in the above example, a switching hub or the like (third node) is interposed between the access gateway (second node) that transfers the web page to the first node and the first node, and the second, second If there is information that communication is possible between the three nodes and there is information that communication is not possible between the third and first nodes, the cause of the web page disappearing is the second node (access If it turns out that the communication cable is connected to the first node or the first node, not the gateway) or the third node (such as a switching hub), and the cause is investigated using the first node or the communication cable. Is found.

  That is, if the network is considered to be composed of adjacent nodes, which are a pair of nodes interconnected without going through the nodes, provision of information reflecting whether communication is possible at each adjacent node is required.

  The present invention has been made in view of the above-described problems, and an object of the present invention is to provide an inter-adjacent node communication availability detection device that generates information reflecting whether or not communication is possible at an adjacent node of a network and an operation method thereof. It is to provide.

In order to solve the above-described problem, a first aspect of the present invention is an inter-adjacent node communication feasibility detection device provided in a terminal included in a tree-structured network, the node corresponding to the highest node of the tree-structure network. The node ID of the node is stored as node information, and for each node other than the highest node, the node ID of the node that is the node ID of the node and the node ID of the node adjacent to the node on the upper side For each node that is an end node other than the terminal in the tree-structured network, a node information storage unit that stores node information including a certain upper node ID, and a node ID of the node and between the node and the terminal A communication information storage unit for storing communication information including a flag indicating whether communication is possible, and the tree-structured network. For each of the adjacent nodes adjacent to each other, an edge information storage unit storing edge information including a node ID pair corresponding to the adjacent node, and node information including the same node ID as the node ID of the terminal are stored in the node information. Search from the storage unit, search node information including the same node ID as the upper node ID in the node information, search to node information not including the upper node ID, and node information not including the upper node ID a first processing unit to the own node ID in the node information retrieved in the top node ID or found most previously in the local node ID of the inner generates rows arranged in this order, it is possible to communicate with the terminal The communication information storage unit is searched for communication information including a flag indicating that the node ID is read out, and each node ID is the same as the node ID. Search node information including the own node ID from the node information storage unit, search node information including the same node ID as the upper node ID in the node information, and search even node information not including the upper node ID. and, until the own node ID of the own node ID node information retrieved in the top node ID or found most earlier which is in the node information that does not include the upper node ID generates a sequence arranged in order, and the sequence A second processing unit that generates a column pair including the columns generated by the first processing unit, and the column pair farthest from the respective columns of the column pair and the highest node ID of the column A third processing unit that extracts a partial sequence from a node ID common to the other party's column to a node ID farthest from the highest node ID and not common to the other party's column; For each node ID pair consisting of adjacent node IDs in each substring, edge information including the node ID pair is retrieved from the edge information storage unit, and the adjacent node corresponding to the node ID pair is searched for the edge information. The communication information storage unit is searched for communication information including a fourth processing unit for storing a communicable value indicating that communication between the terminals is possible and a flag indicating that communication with the terminal is impossible. Node information is read out, node information including the same node ID as the node ID is retrieved from the node information storage unit for each node ID, and node information including the same node ID as the upper node ID in the node information Until the node information that does not include the upper node ID is searched, and the node ID that is the own node ID in the node information that does not include the upper node ID. The up own node ID's place node ID or found most in the node information retrieved previously generates a sequence arranged in order to generate the column pair consisting of a sequence generated by the with the column first processing unit 5 From the processing unit and each column of the column pair, the node ID farthest from the highest node ID of the column and the node ID common to the partner column in the column pair is changed to the highest node ID. A node ID pair for each of a sixth processing unit that extracts a partial sequence up to a node ID that is farthest and not common to the partner column, and a node ID pair that is composed of adjacent node IDs of the partial columns. Edge information storage section is searched from the edge information storage unit, and if the communicable value is not stored in the edge information, the edge information passes between adjacent nodes corresponding to the node ID pair. And solutions with a neighboring node communication possibility detecting device, characterized in that it comprises a seventh processor for storing the communication impossible value indicating that it is impossible.

2nd this invention is the operation | movement method of the communication availability detection apparatus between adjacent nodes provided in the terminal contained in a tree structure network, Comprising: The said communication detection apparatus between adjacent nodes is the highest node of the said tree structure network The node ID of the node is stored as node information, and for each node other than the highest node, the node ID of the node and the node adjacent to the node on the upper side A node information storage unit that stores node information including a higher-level node ID that is a node ID of the node, and for each node that is an end node other than the terminal in the tree-structured network, the node ID of the node and the node and the node A communication information storage unit storing communication information including a flag indicating whether communication between terminals is possible; An edge information storage unit that stores edge information including a node ID pair corresponding to the adjacent node for each adjacent node in the tree-structured network, and the operation method includes the inter-adjacent node communication availability detection device. The first processing unit searches the node information storage unit for node information including the same node ID as the node ID of the terminal, and searches for node information including the same node ID as the higher node ID in the node information. and continue to search to the node information excluding upper node ID, own in this node ID node information retrieved in the top node ID or found most earlier which is in the node information that does not include the upper node ID The step of generating a sequence in which the node IDs are arranged in order, and the second processing unit of the inter-adjacent node communication availability detecting device can communicate with the terminal. Communication information including a flag indicating that the node ID is retrieved from the communication information storage unit, the node ID is read, and for each node ID, node information including the same node ID as the node ID is retrieved from the node information storage unit. The node information including the same node ID as the upper node ID in the node information is searched, the node information not including the upper node ID is searched, and the own node in the node information not including the upper node ID is searched. until the own node ID in the node information retrieved in the top node ID or found most previously generate rows arranged in the order that is a ID, column pair consisting of a sequence generated by the with the column first processing unit And the third processing unit of the inter-adjacent node communication availability detection device is farthest from the respective columns of the column pairs with respect to the highest node ID of the column and Extracting a partial column from a node ID common to the partner column in the column pair to a node ID farthest from the highest node ID and not common to the partner column; The fourth processing unit of the inter-node communication availability detecting device searches the edge information storage unit for edge information including the node ID pair for each of the node ID pairs composed of adjacent node IDs of the partial columns, and A step of storing a communicable value indicating that communication between adjacent nodes corresponding to the node ID pair is communicable with respect to the edge information; and a fifth processing unit of the inter-adjacent node communication enable / disable detecting device includes: The communication information storage unit is searched for communication information including a flag indicating that communication with the node is impossible, the node ID is read, and for each node ID, the node ID and Node information including the own node ID is searched from the node information storage unit, node information including the same node ID as the upper node ID in the node information is searched, and node information not including the upper node ID is also searched. search, until the own node ID of the own node ID node information retrieved in the top node ID or found most earlier which is in the node information that does not include the upper node ID generates a sequence arranged in order, the sequence And a sixth processing unit of the inter-adjacent node communication availability detection device, from each column of each column pair, generating a column pair consisting of the column generated by the first processing unit and the column generated by the first processing unit. no not common to the farthest and the counterpart of the column with respect to the furthest and the top node ID from the common node ID for the column of the other in the column pairs for the top node ID An edge including the node ID pair for each of the node ID pairs composed of the adjacent node IDs of the partial columns, wherein the step of extracting the partial columns up to the ID and the seventh processing unit of the inter-adjacent node communication availability detection device Information is searched from the edge information storage unit, and if the communicable value is not stored in the edge information, communication between adjacent nodes corresponding to the node ID pair is impossible for the edge information. And a step of storing an incommunicable value indicating a communication means for detecting the availability of communication between adjacent nodes.

  According to the present invention, it is possible to generate information that reflects whether or not communication is possible in an adjacent node of the network.

It is a figure which shows an example of the communication network in which the communication availability detection apparatus between adjacent nodes which concerns on this Embodiment is used. It is a block diagram which shows schematic structure of the communication possibility detection apparatus between adjacent nodes comprised by the node N8. 3 is a diagram illustrating an example of a configuration of a communication information storage unit 12. FIG. 3 is a diagram illustrating an example of a configuration of a node information storage unit 13. FIG. 3 is a diagram illustrating an example of a configuration of an edge information storage unit 14. FIG. It is a figure which shows an example of a structure of the XML file containing the node information storage part 13 and the edge information storage part 14. It is a sequence diagram which shows an example of operation | movement of the communication possibility detection apparatus 1 between adjacent nodes. It is a flowchart of the process of including the communicable value “YES” or the communicable value “NO” in the edge information. It is a 1st figure which shows the data produced | generated in the process of the process of FIG. It is a 2nd figure which shows the data produced | generated in the process of the process of FIG. It is a 3rd figure which shows the data produced | generated in the process of the process of FIG. FIG. 8 is a first sequence diagram illustrating an operation following the operation illustrated in FIG. 7. FIG. 8 is a second sequence diagram illustrating an operation following the operation illustrated in FIG. 7.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is a diagram illustrating an example of a communication network in which the inter-adjacent node communication availability detection apparatus according to the present embodiment is used.

  The node N1 is, for example, an access gateway, that is, the highest node in the tree structure network TN provided in the house.

  Here, the tree-structure network TN is configured as follows.

  The node N2 is a switching hub, for example, and is connected to the node N1 via a communication cable without going through the node. That is, the node N2 is adjacent to the node N1 on the lower side.

  The nodes N3 and N4 are switching hubs, for example, and are connected to the node N2 via communication cables without going through the nodes. That is, the nodes N3 and N4 are adjacent to the node N2 on the lower side.

  The nodes N5 and N6 are terminals such as personal computers, for example, and are connected to the node N3 via communication cables without going through the nodes. That is, the nodes N5 and N6 are adjacent to the node N3 on the lower side.

  The node N7 is a switching hub, for example, and is connected to the node N4 via a communication cable without going through the node. That is, the node N7 is adjacent to the node N4 on the lower side.

  The node N8 is a terminal such as a personal computer, for example, and is connected to the node N4 via a communication cable without going through the node. That is, the node N8 is adjacent to the node N4 on the lower side.

  The nodes N9 and N10 are terminals such as personal computers, for example, and are connected to the node N7 via communication cables without going through the nodes. That is, the nodes N9 and N10 are adjacent to the node N7 on the lower side.

  In the tree structure network TN, each of the nodes N1, N5, N6, N8, N9, and N10 is adjacent to only one node. Such nodes N1, N5, N6, N8, N9, and N10 are called end nodes.

  For example, the node N1 is connected to the access network NET1 outside the home.

  A server (not shown) is connected to the access network NET1, and for example, connected to a wide area network NET2 such as the Internet.

  A video server, a web server, and a name resolution server (not shown) are connected to the wide area network NET2.

  FIG. 2 is a block diagram illustrating a schematic configuration of the inter-adjacent node communication availability detecting device configured in the node N8.

  The inter-adjacent node communication availability detection device 1 is configured, for example, at a node N5.

  The inter-adjacent node communication availability detection device 1 includes a communication unit 11 that communicates with nodes and servers other than the node N5, a communication information storage unit 12 that stores communication information related to end nodes other than the node N8, and a node related to each node. Edge information storage for storing edge information related to each of a node information storage unit 13 in which information is stored and a set of nodes adjacent to each other in the tree-structured network TN (a pair of nodes forming the set is hereinafter referred to as an adjacent node) An information processing unit 15 that includes a communicable value or an incommunicable value in the edge information based on the communication unit 14, the communication information storage unit 12, and the node information storage unit 13, and the node information storage unit 13 and the edge information storage unit 14. By using the determination unit 16 for performing various determinations and displaying on the display unit of the node N4, a user of the node N5 (hereinafter referred to as a user). Graphical user interface prompting the operation of that THE) (hereinafter, includes a GUI) unit 17.

  The information processing unit 15 is divided for each type of processing, that is, includes first to seventh processing units 151 to 157.

  FIG. 3 is a diagram illustrating an example of the configuration of the communication information storage unit 12.

  The communication information storage unit 12 has, for each of the nodes N1, N6, N8, N9, and N10, which are end nodes other than the node N8, a flag indicating whether or not communication between the node and the node N8 is possible. For storing communication information including

  The node ID is identification information indicating the corresponding node (for example, the MAC address of the corresponding node), and in this embodiment, the reference code (such as “N1”) of the node is the node ID.

  In the present embodiment, the flag “OK” indicates that communication is possible, and the flag “NG” indicates that communication is not possible.

  FIG. 4 is a diagram illustrating an example of the configuration of the node information storage unit 13.

  The node information storage unit 13 stores node information including its own node ID, which is the node ID of the node N1, and node information for each node other than the node N1.

  The node information of each node other than the node N1 includes the own node ID that is the node ID of the node and the upper node ID that is the node ID of the node adjacent to the node on the upper side.

  That is, the node information storage unit 13 corresponds to a so-called map MP indicating the tree structure network TN of FIG.

  FIG. 5 is a diagram illustrating an example of the configuration of the edge information storage unit 14.

  For each pair of nodes (adjacent nodes) adjacent to each other in the tree-structured network TN, the edge information storage unit 14 sets a pair of node IDs corresponding to the adjacent node (a pair of node IDs forming such a group is referred to as a node ID below) Edge information including a pair) is stored.

  Each piece of edge information indicates that a communicable value “YES” indicating that communication between adjacent nodes corresponding to the node ID pair in the edge information can be performed later or communication between the adjacent nodes is impossible. The communication impossible value “NO” shown is included.

  That is, the edge information storage unit 14 corresponds to the portion of the line E of the map MP in FIG. 1, the communicable value is such that a circle is marked on the line E, and the incommunicable value is It is like marking the line E with a cross.

  That is, the inter-adjacent node communication availability detecting device 1 creates a map MP with or without a circle as shown in FIG. 1 based on the node information storage unit 13 and the edge information storage unit 14, Can be displayed.

  Now, an example of a method of configuring the node information storage unit 13 as shown in FIG. 4 and the previous edge information storage unit 14 as shown in FIG.

  The node N1 periodically acquires these node IDs (MAC addresses) from the nodes N5, N6, N8, N9, and N10, and notifies the node N5 together with the port number of the acquired port.

  The node N2 periodically acquires these node IDs (MAC addresses) from the nodes N5, N6, N8, N9, and N10, and notifies the node N5 together with the port number of the acquired port.

  Also, the node N3 periodically acquires these node IDs (MAC addresses) from the nodes N5 and N6 and notifies the node N5 together with the port number of the acquired port.

  Further, the node N4 periodically acquires these node IDs (MAC addresses) from the nodes N8, N9, and N10, and notifies the node N5 together with the port number of the acquired port.

  The node N7 periodically acquires these node IDs (MAC addresses) from the nodes N9 and N10, and notifies the node N5 together with the port number of the acquired port.

  The node N5 constitutes a node information storage unit 13 and an edge information storage unit 14 based on these node IDs and port numbers.

  For example, when a new node is connected to the node N4, the node N4 acquires these node IDs from the nodes N8, N9, N10 and the new node, and notifies the node N5 together with the port number of the acquired port. To do.

  The node N5 adds node information and edge information related to the node N4 to the node information storage unit 13 and the edge information storage unit 14 based on these node IDs and port numbers.

  On the other hand, for example, the node N10 is not activated, and the node N7 may acquire the node ID only from the node N9 and notify the node N5 together with the port number of the acquired port.

  In this case, the node N5 does not delete the node information and edge information related to the node N10 but leaves them. For example, the node N5 associates information indicating that the corresponding node is not functioning for some reason with the node information and the edge information.

  When the inter-adjacent node communication availability detecting device 1 displays the map MP, the node such as the node 10 is displayed in a different color, so that the user is informed that the node is not functioning for some reason. be able to.

  FIG. 6 is a diagram illustrating an example of the configuration of an XML file including the node information storage unit 13 and the edge information storage unit 14.

  The node information storage unit 13 and the edge information storage unit 14 may be configured as a database, but may instead be included in the XML file.

  Such an XML file includes a portion 101 that substantially includes the node information storage unit 13 and a portion 102 that substantially includes the edge information storage unit 14.

  In the portion 101, for example, the node information including the own node ID “N5” and the upper node ID “N3” includes the area AN3 including the node ID “N3” and the node ID “N5 nested in the area AN3. ”And the area AN5 including“

(Operation of the adjacent node communication availability detecting device 1)
FIG. 7 is a sequence diagram illustrating an example of the operation of the inter-adjacent node communication availability detection device 1.

  Here, there are two cases, that is, (1) the node N9 displays the video received from the video server connected to the wide area network NET2, and the user who has seen this displays a problem such as video display. (2) a computer that displays a web page received from a web server connected to the wide area network NET, and a user who tried to communicate from the node N6 to the node N9 and was unable to communicate. The explanation is based on the assumption that a problem such as the disappearance of the web page occurred when the user viewed the web page.

  When the user activates the inter-adjacent node communication availability detecting device 1 in an attempt to solve the problem (S1), the GUI unit 17 displays a sentence meaning “Please activate all nodes” (S3).

  When the user activates all the nodes (S5), the GUI unit 17 displays a map MP without XX, which means “Please specify two nodes that cannot communicate with each other or nodes that cannot communicate with the server”. A sentence or the like is displayed (S7).

  Here, “two nodes” are for obtaining the nodes N6 and N9 in the case of (1) above, and “nodes that cannot communicate with the server” are for obtaining the node N6 in the case of (2) above. It is.

  When the user designates a node (S9), the determination unit 16 determines whether the node information and edge information related to the node are in the node information storage unit 13 and the edge information storage unit 14 (S11).

  If the node information and edge information are not in the node information storage unit 13 and the edge information storage unit 14 (S11: NO), the GUI unit 17 displays a sentence meaning “Is the communication cable connected?” S13).

  If the communication cable is not connected (S13: NO), that is the cause and the problem is solved.

  If a communication cable is connected, node information and edge information related to the node are added to the node information storage unit 13 and the edge information storage unit 14.

  On the other hand, if the communication cable is connected (S13: YES), the GUI unit 17 reads “Please restart the specified node and adjacent nodes and check if communication is possible”, etc. Is displayed (S15).

  If communication is possible (S15: YES), the designated node or adjacent node is the cause, and the problem is solved.

  If communication is not possible (S15: NO), it means that there is another cause, and further problem solving is achieved. In this case, misconfiguration or abnormality of other nodes may be considered.

  On the other hand, if the node information and edge information related to the designated node are in the node information storage unit 13 and the edge information storage unit 14, the determination unit 16 causes the communication unit 11 to communicate with each end node (node) (for example, ARP The communication unit 11 causes the communication information storage unit 12 to store the communication information generated based on the trial result (S21).

  Specifically, the communication unit 11 stores the communication information including the node ID of the node and the flag “OK” in the communication information storage unit 12 for each node that can be communicated. For each node, communication information including the node ID of the node and the flag “NG” is stored in the communication information storage unit 12 (S21).

  Note that it is preferable to store the manufacturer name, model number, and the like of the corresponding node in the communication information so that such information can be used for investigating the cause.

  Next, using the communication information storage unit 12 and the node information storage unit 13, the information processing unit 15 includes a communicable value “YES” or an incommunicable value “NO” in each edge information of the edge information storage unit 14. (S23).

  FIG. 8 is a flowchart of processing for including the communicable value “YES” or the incommunicable value “NO” in the edge information.

  9, FIG. 10 and FIG. 11 are diagrams showing data generated in the process of FIG.

In FIG. 8, the first processing unit 151 of the information processing unit 15 first displays node information including the same node ID as the node ID “N5” of the node N5 in which the adjacent node communication availability detecting device 1 is configured as node information. A search is performed from the storage unit 13 and node information including the same node ID as the upper node ID in the node information is searched. Thus, the node information not including the upper node ID is also searched. column L0 as shown in a), i.e., the own node ID in the node information retrieved in the top node ID "N1" or we most previously in the local node ID in the node information that does not include the upper node ID A row L0 in which “N5” is sequentially arranged is generated (T1), and the process proceeds to Step T3.

After step T3, the second processing unit 152 of the information processing unit 15 processes each piece of communication information including the flag “OK”. First, for example, the node ID is one of such pieces of communication information. The communication information including “N6” is searched from the communication information storage unit 12 to read out the node ID, the node information including the same node ID as the node ID is searched from the node information storage unit 13, and the node information The node information including the same own node ID as the upper node ID is searched, and thus the node information not including the upper node ID is searched, so that the column L1 as illustrated in FIG. the own node ID "N6" of the parent node ID in the node information retrieved or found most previous top node ID "N1" on the local node ID in the node information excluding or There generates a column L1 arranged in this order, to generate the column pair LP1 consisting the lines L1 and column L0 Metropolitan as illustrated in FIG. 9 (c) (T3).

  Next, the second processing unit 152 of the information processing unit 15 determines whether there is communication information that includes the flag “OK” and has not been processed in step T3 (T5), and if there is such communication information (T5: YES). ), The process returns to step T3. On the other hand, if there is no such communication information (T5: NO), the process proceeds to step T7.

  When returning to step T3, for example, the second processing unit 152 of the information processing unit 15 reads the node ID from communication information including the node ID “N1” (including the flag “OK”), and is the same as the node ID. Node information including its own node ID is searched from the node information storage unit 13 and node information including the same node ID as the upper node ID in the node information is searched, and thus node information that does not include the upper node ID. Thus, a column L1 having only the node ID “N1” as illustrated in FIG. 10A is generated, and a column including the column L1 and the column L0 as illustrated in FIG. 10B is generated. A pair LP1 is generated (T3).

After step T7, the third processing unit 153 of the information processing unit 15 processes each column pair LP1. First, from the column L1 of the column pair LP1 as illustrated in FIG. 9 node ID "N3" as illustrated in (d) (common node ID "N3" against column L0 of the farthest and column pair LP1 for the top-level node ID "N1" in column L1 ) To the node ID “N6” (the node ID “N6” farthest from the highest node ID “N1” and not common to the partner column L0) is extracted, and FIG. From the column L0 of the column pair LP1 as illustrated in c) to the node ID “N3” (as illustrated in FIG. 9D) (the column pair LP1 farthest from the highest node ID “N1” of the column L0) Common to opponent's row L1 The partial column BL1 from the node ID “N3” to the node ID “N5” (the node ID “N5” farthest from the highest node ID “N1” and not common to the partner column L1) is extracted ( T7).

  Next, the third processing unit 153 of the information processing unit 15 determines whether or not there is a column pair LP1 that has not been processed in step T7 (T9), and if there is such a column pair LP1 (T9: YES), the process proceeds to step T7. On the other hand, if there is no such column pair LP1 (T9: NO), the process proceeds to step T11.

  When returning to step T7, the third processing unit 153 of the information processing unit 15, for example, from the column L0 of the column pair LP1 as illustrated in FIG. 10B to a node as illustrated in FIG. From node ID “N1” (node ID “N1” closest to the highest node ID “N1” in column L1 and common to column L1 of the other party in column pair LP1) to node ID “N5” (highest node) The partial column BL1 up to the node ID “N5” farthest from the node ID “N1” and not common to the partner column L1 is extracted (T7).

  In step T11 and subsequent steps, the fourth processing unit 154 of the information processing unit 15 processes each node ID pair composed of adjacent node IDs in each partial column BL1, but first, as illustrated in FIG. 9D. Edge information including the node ID pair NP1 “N3, N6” illustrated in FIG. 9E, which includes the node IDs “N3” and “N6” included in the partial sequence BL1 “N3-N6” to be processed. 14 and the communicable value “YES” is stored in the edge information (T11).

  Next, the fourth processing unit 154 of the information processing unit 15 determines whether or not there is a node ID pair NP1 not processed in step T11 (T13), and if there is such a node ID pair NP1 (T13: YES), step Returning to T11, if there is no such node ID pair NP1 (T13: NO), the process proceeds to step T15.

  When returning to step T11, for example, the fourth processing unit 154 of the information processing unit 15 includes the node ID “N1” included in the partial sequence BL1 “N1-N2-N3-N5” illustrated in FIG. Edge information including “N2” and including the node ID pair NP1 “N1, N2” illustrated in FIG. 10D is searched from the edge information storage unit 14, and the communicable value “YES” is stored in the edge information. (T11).

After step T15, the fifth processing unit 155 of the information processing unit 15 processes each piece of communication information including the flag “NG”. First, the communication information including the node ID “N9” is stored in the communication information storage unit. 12, the node ID is read out, the node information including the same node ID as the node ID is searched from the node information storage unit 13, and the node information including the same node ID as the upper node ID in the node information is retrieved. Thus, the node information that does not include the upper node ID is searched, and thereby, the column L2 as illustrated in FIG. 11A, that is, the node information that does not include the upper node ID. own node to the ID "N9" top node ID "N1" or we most in the node information retrieved previously generates a column L2 arranged in the order that is a node ID, 11 b) To generate a column pair LP2 consisting the column L2 column L0 Metropolitan exemplified (T15).

  Next, the fifth processing unit 155 of the information processing unit 15 determines whether or not there is communication information that includes the flag “NG” and is not processed in step T15 (T17), and if there is such communication information (T17: YES). ), The process returns to step T15. On the other hand, if there is no such communication information (T17: NO), the process proceeds to step T19.

After step T19, the sixth processing unit 156 of the information processing unit 15 processes each column pair LP2. First, from the column L2 of the column pair LP2 as illustrated in FIG. 11 node ID "N2" as illustrated in (c) (common node ID to the counterpart row L0 at farthest and column pair LP2 for the top-level node ID "N1" in column L2 "N2" ) To the node ID “N9” (the node ID “N9” farthest from the highest node ID “N1” and not common to the partner column L0) is extracted, and FIG. From the column L0 of the column pair LP2 as illustrated in b) to the node ID “N2” (as illustrated in FIG. 11C) (the column pair LP2 farthest from the highest node ID “N1” of the column L0) In line L2 of the opponent at A common node ID “N2”) to a node ID “N5” (node ID “N5” farthest from the highest node ID “N1” and not common to the partner column L2). BL2 is taken out (T19).

  Next, the sixth processing unit 156 of the information processing unit 15 determines whether or not there is a column pair LP2 that has not been processed in step T19 (T21). If there is such a column pair LP2 (T21: YES), the process proceeds to step T19. On the other hand, if there is no such column pair LP2 (T21: NO), the process proceeds to step T23.

  After step T23, the seventh processing unit 157 of the information processing unit 15 processes each node ID pair composed of adjacent node IDs in each partial column BL2. First, as illustrated in FIG. Edge information including the node ID pair NP2 “N2, N4” illustrated in FIG. 11D, which includes the node IDs “N2” and “N4” included in the partial sequence BL2 “N2-N4-N7-N9” If the search is made from the edge information storage unit 14 and no communicable value is stored in the edge information, the communication impossible value “NO” is stored (T23).

  Next, the seventh processing unit 157 of the information processing unit 15 determines whether there is a node ID pair that has not been processed in step T23 (T25). If there is such a node ID pair (T25: YES), the process proceeds to step T23. On the other hand, if there is no such node ID pair (T25: NO), the process ends.

  Thus, as shown in FIG. 5, each edge information includes a communicable value “YES” or a communicable value “NO”.

  Returning to FIG. 7, the determination unit 16 determines whether the number of nodes specified in step S9 is 1 or 2 (S31). If the number of nodes is 2, that is, in the case of (1) above, FIG. If the number of nodes is 1, that is, in the case of (2) above, the process proceeds to step S51 in FIG.

  In FIG. 12, the determination unit 16 determines whether or not at least one edge information corresponding to the path between the two nodes N6 and N9 specified in step S9 includes an incommunicable value (S41). .

  If at least one edge information includes an incommunicable value (S41: YES), the GUI unit 17 performs the following display (S43).

  For example, if the state of XX in FIG. 1 is reflected in the edge information, that is, if communication between the nodes N4 and N9 is impossible, “the communication cable is connected from the node N4 to the node N9 and each node is connected. A sentence such as “Is it activated” is displayed (S43).

  If the communication cable is connected and each node is not activated (S43: NO), the communication cable or the node is the cause, and the problem is solved.

  If the communication cable is connected and each node is activated (S43: YES), the GUI unit 17 “restarts nodes N6 and N9 and the adjacent nodes and confirms whether communication is possible”. Is displayed (S45).

  If communication is possible (S45: YES), the problem is solved by the node N6, N9 or an adjacent node.

  If communication is not possible (S45: NO), it means that there is another cause, and further problem solving is achieved. In this case, misconfiguration or abnormality of other nodes may be considered.

  If all the edge information includes a communicable value (S41: NO), the GUI unit 17 means “restart the nodes N6 and N9 and check whether communication is possible”. A sentence or the like is displayed (S47).

  If communication is possible (S47: YES), the problem is solved by the nodes N6 and N9.

  If communication is not possible (S47: NO), it means that there is another cause, and further problem solving is achieved. In this case, a setting error or abnormality of the nodes N6 and N9 can be considered.

  In FIG. 13, the determination unit 16 determines whether or not at least one edge information corresponding to the path between the node N6 and the node N1 specified in step S9 includes an incommunicable value (S51). .

  If at least one edge information includes an incommunicable value (S51: YES), the GUI unit 17 performs the following display (S53).

  For example, if communication is not possible between the nodes N2 and N6, a text or the like indicating that “the communication cable is connected and each node is activated from the node N2 to the node N6” is displayed (S53).

  If the communication cable is connected and each node is not activated (S53: NO), the communication cable or the node is the cause, and the problem is solved.

  If the communication cable is connected and each node is activated (S53: YES), the GUI unit 17 reads “Please restart nodes N1 and N6 and check if communication is possible”. Are displayed (S55).

  If communication is possible (S55: YES), the problem is solved by the node N1 or the node N6.

  If communication is not possible (S55: NO), it means that there is another cause, and further problem solving is achieved. In this case, misconfiguration or abnormality of other nodes may be considered.

  If all the edge information includes a communicable value (S51: NO), the determination unit 16 causes the communication unit 11 to try communication with a predetermined server connected to the access network NET1, and perform communication. It is determined whether or not it was possible (S61).

  If the communication is impossible (S61: NO), the GUI unit 17 displays a sentence meaning “Is a communication cable connected to the node N1” (S63).

  If the communication cable is not connected to the node N1 (S63: NO), that is the cause and the problem is solved.

  If a communication cable is connected to the node N1 (S63: YES), the GUI unit 17 displays a sentence meaning “Please restart the node N1 and check if communication is possible” or the like ( S65).

  When communication is possible (S65: YES), the cause is the node N1, and the problem is solved.

  If communication is not possible (S65: NO), it means that there is another cause, and further problem solving is achieved.

  If communication is possible (S61: YES), the determination unit 16 causes the communication unit 11 to acquire the address on the access network NET1 side from the node N1, and determines whether the address has been acquired from the node N1 (S71).

  If the GUI unit 17 fails to acquire the address (S71: NO), the GUI unit 17 displays a sentence or the like that means “Please input user information or the like to the node N1 and check whether communication is possible” (S73). ).

  When user information or the like (DHCP setting information or the like) is input to the node N1 and communication becomes possible (S73: YES), this is the cause and the problem is solved.

  If communication is not possible even if user information is input to the node N1 (S73: NO), it means that there is another cause, and further problem solving is achieved.

  If the determination unit 16 can acquire the address (S71: YES), the communication unit 11 acquires the address for the predetermined name from the predetermined name resolution server, and whether or not the address can be acquired from the name resolution server. Is determined (S81).

  If the GUI unit 17 cannot acquire an address (S81: NO), it displays that effect (S83). In other words, the name resolution server is the cause, and the problem is solved.

  If the determination unit 16 has acquired the address (S81: YES), the determination unit 16 causes the communication unit 11 to try communication with the corresponding web server, and determines whether or not the communication is possible (S91).

  If the GUI unit 17 cannot communicate (S91: NO), the GUI unit 17 displays that effect (S93). In other words, the problem is solved because the web server or the surrounding communication environment is the cause.

  If the GUI unit 17 is able to communicate (S91: YES), the GUI unit 17 displays that effect (S95). In other words, there are other causes, and further problem solving is achieved. In this case, a setting error or abnormality of the node N6 can be considered.

As described above, in the present embodiment, the first processing unit 151 stores node information including the same node ID as the node ID “N5” of the node N5 in which the inter-adjacent node communication availability detecting device 1 is configured. Search from the information storage unit 13, search for node information including the same node ID as the upper node ID in the node information, search to node information not including the upper node ID, and node information not including the upper node ID own node to the ID "N5" top node ID "N1" node from the information most are searched earlier in the own node ID to generate the column L0 arranged in order of the inner (T1).

The second processing unit 152 searches the communication information storage unit 12 for communication information including the flag “OK”, reads the node ID, and reads node information including the same node ID as the node ID. And node information including the same own node ID as the upper node ID in the node information is searched, the node information not including the upper node ID is searched, and the own node in the node information not including the upper node ID is searched. highest node ID "N1" or we most to its own node ID in the node information retrieved previously generates a column L1 arranged in this order, which is the ID, generate the column pair LP1 consisting the lines L1 and column L0 Prefecture (T3).

In addition, the third processing unit 153 sets the highest order from the node ID that is farthest from the highest node ID of the column and common to the partner column in the column pair, from each column of each column pair LP1. The partial column BL1 is extracted from the node ID farthest from the node ID to the node ID that is not common to the partner column (T7).

  In addition, the fourth processing unit 154 searches the edge information storage unit 14 for edge information including the node ID pair for each of the node ID pairs including the adjacent node IDs of the partial columns BL1, and for the edge information, A communicable value “YES” indicating that communication is possible between adjacent nodes corresponding to the node ID pair is stored (T11).

Further, the fifth processing unit 155 retrieves each communication information including the flag “NG” from the communication information storage unit 12 to read out the node ID, and reads the node information including the same node ID as the node ID into the node information storage unit. 13 is searched, node information including the same node ID as the upper node ID in the node information is searched, node information not including the upper node ID is searched, and the node information not including the upper node ID is searched. until the own node ID in the node information retrieved or found most previous top node ID "N1" generates a column L2 arranged in the order that is a node ID, and column pair LP2 consisting the column L2 column L0 Prefecture Generate (T15).

In addition, the sixth processing unit 156 determines the highest order from the node ID that is farthest from the highest order node ID of the column and is common to the partner column in the relevant pair of columns from each column of the pair LP2. A partial column BL2 is extracted from the node ID farthest from the node ID to the node ID that is not common to the partner column (T19).

  Further, the seventh processing unit 157 searches the edge information storage unit 14 for edge information including the node ID pair for each of the node ID pairs composed of adjacent node IDs of the partial columns BL2, and communicates with the edge information. If “YES” is not stored, an incommunicable value “NO” indicating that communication is not possible between adjacent nodes corresponding to the node ID pair is stored in the edge information (T23).

  Therefore, according to the present embodiment, it is possible to generate edge information that reflects whether communication is possible in adjacent nodes of the tree-structured network TN, and an effect of facilitating fault isolation in the tree-structured network TN is obtained. be able to.

  In the present embodiment, the configuration of the tree structure network TN is an example, and the present invention can be applied to a tree structure having an arbitrary configuration.

  A computer program for causing a computer to function as the inter-adjacent node communication availability detecting device 1 according to the present embodiment is stored on a computer-readable recording medium such as a semiconductor memory, a magnetic disk, an optical disk, a magneto-optical disk, or a magnetic tape. It can be recorded and transmitted through a communication network such as the Internet for wide distribution.

DESCRIPTION OF SYMBOLS 1 ... Communication availability detection apparatus between adjacent nodes 11 ... Communication part 12 ... Communication information storage part 13 ... Node information storage part 14 ... Edge information storage part 15 ... Information processing part 16 ... Determination part 17 ... GUI part 151 ... 1st process part 152 ... 2nd processing part 153 ... 3rd processing part 154 ... 4th processing part 155 ... 5th processing part 156 ... 6th processing part 157 ... 7th processing part

Claims (3)

An inter-adjacent node communication availability detection device provided in a terminal included in a tree-structured network,
For the highest node of the tree structure network, the own node ID that is the node ID of the node is stored as node information, and for each node other than the highest node, the own node ID that is the node ID of the node and A node information storage unit for storing node information including an upper node ID that is a node ID of a node adjacent to the node on the upper side;
Communication information storing communication information including a node ID of the node and a flag indicating whether communication between the node and the terminal is possible for each node that is an end node other than the terminal in the tree-structured network A storage unit;
For each adjacent node adjacent in the tree-structured network, an edge information storage unit that stores edge information including a node ID pair corresponding to the adjacent node;
Node information including the same node ID as the node ID of the terminal is searched from the node information storage unit, node information including the same node ID as the upper node ID in the node information is searched, and the upper node ID It searched to node information does not include the column until the own node ID of the own node node information retrieved in the top node ID or found most previously with the ID in the node information that does not include the upper node ID are arranged in the order A first processing unit for generating
Node information including the same node ID as the node ID for each node ID is retrieved by searching the communication information storage unit for communication information including a flag indicating that communication with the terminal is possible. Is searched from the node information storage unit, node information including the same node ID as the upper node ID in the node information is searched, node information not including the upper node ID is searched, and the upper node ID is determined. until the own node ID of node self-node in the node information retrieved in the top node ID or found most previously with the ID in the information excluding generates a column arranged in sequence, generated by the with the column first processing unit A second processing unit for generating a pair of columns composed of the processed columns;
From the respective column of the column pair, the farthest from the highest node ID of the column, and from the common node ID to the partner column in the column pair, the farthest from the highest node ID. A third processing unit that extracts a partial sequence up to a node ID that is not common to the partner column;
For each node ID pair consisting of adjacent node IDs in each substring, edge information including the node ID pair is retrieved from the edge information storage unit, and the edge information is adjacent to the node ID pair. A fourth processing unit for storing a communicable value indicating that communication between nodes is possible;
A node that retrieves communication information including a flag indicating that communication with the terminal is impossible from the communication information storage unit, reads a node ID, and includes each node ID including the same node ID as the node ID Information is searched from the node information storage unit, node information including the same node ID as the upper node ID in the node information is searched, node information not including the upper node ID is searched, and the upper node ID until the own node ID in the node information retrieved in the top node ID or found most previously in the local node ID in the node information excluding generates a sequence arranged in order, by the with the column first processing unit A fifth processing unit for generating a column pair including the generated columns;
From the respective column of the column pair, the farthest from the highest node ID of the column, and from the common node ID to the partner column in the column pair, the farthest from the highest node ID. A sixth processing unit for extracting a partial sequence up to a node ID that is not common to the partner column;
For each node ID pair consisting of adjacent node IDs in each substring, edge information including the node ID pair is searched from the edge information storage unit, and the communicable value is not stored in the edge information. An inter-adjacent node communication comprising: a seventh processing unit that stores an incommunicable value indicating that communication between the adjacent nodes corresponding to the node ID pair is impossible with respect to the edge information. Availability detector. An operation method of an inter-adjacent node communication availability detection device provided in a terminal included in a tree structure network,
The adjacent node communication availability detection device includes:
For the highest node of the tree structure network, the own node ID that is the node ID of the node is stored as node information, and for each node other than the highest node, the own node ID that is the node ID of the node and A node information storage unit for storing node information including an upper node ID that is a node ID of a node adjacent to the node on the upper side;
Communication information storing communication information including a node ID of the node and a flag indicating whether communication between the node and the terminal is possible for each node that is an end node other than the terminal in the tree-structured network A storage unit;
An edge information storage unit for storing edge information including a node ID pair corresponding to the adjacent node for each of adjacent nodes in the tree-structured network;
The operation method is as follows:
The first processing unit of the inter-adjacent node communication availability detecting device searches the node information storage unit for node information including the same node ID as the node ID of the terminal, and the same node ID as the upper node ID in the node information. continue to search for node information including the node ID, and searches to node information that does not include the upper node ID, the top node ID or found most previously in the local node ID in the node information that does not include the upper node ID Generating a sequence in which the node IDs in the searched node information are arranged in order,
The second processing unit of the inter-adjacent node communication availability detection device retrieves communication information including a flag indicating that communication with the terminal is possible from the communication information storage unit, reads a node ID, and For the ID, node information including the same node ID as the node ID is searched from the node information storage unit, node information including the same node ID as the upper node ID in the node information is searched, and the upper node searched to node information does not include the ID, to the own node ID of the own node node information retrieved in the top node ID or found most previously with the ID in the node information that does not include the upper node ID are arranged in the order Generating a column and generating a column pair including the column and the column generated by the first processing unit;
The third processing unit of the inter-adjacent node communication availability detection device is common to each column of the column pair farthest from the highest node ID of the column and the partner column of the column pair. Extracting a partial column from a node ID to a node ID farthest from the highest node ID and not common to the partner column;
The fourth processing unit of the inter-adjacent node communication availability detection device searches the edge information storage unit for edge information including the node ID pair for each node ID pair composed of adjacent node IDs of the partial columns. Storing a communicable value indicating that communication is possible between adjacent nodes corresponding to the node ID pair for the edge information;
The fifth processing unit of the inter-adjacent node communication availability detection device retrieves communication information including a flag indicating that communication with the terminal is impossible from the communication information storage unit, reads a node ID, For the node ID, the node information including the same node ID as the node ID is searched from the node information storage unit, the node information including the same node ID as the upper node ID in the node information is searched, It searched to node information does not include the node ID, to the own node ID of the own node node information retrieved in the top node ID or found most previously with the ID in the node information that does not include the upper node ID in turn Generating a column that is arranged, and generating a column pair including the column and the column generated by the first processing unit;
The sixth processing unit of the inter-adjacent node communication availability detecting device is common to each column of the column pair farthest from the highest node ID of the column and the partner column in the column pair. Extracting a partial column from a node ID to a node ID farthest from the highest node ID and not common to the partner column;
The seventh processing unit of the inter-adjacent node communication availability detection device searches the edge information storage unit for edge information including the node ID pair for each node ID pair composed of adjacent node IDs of the partial columns. If the communicable value is not stored in the edge information, a communication impossible value indicating that communication is not possible between adjacent nodes corresponding to the node ID pair is stored in the edge information. A method for operating an inter-adjacent node communication availability detecting device, comprising:   A computer program for causing a computer to function as the inter-adjacent node communication availability detecting device according to claim 1.

Images