Information processing device, information processing method, and information processing program

Abstract

To quickly determine whether a detour is feasible without calculating alternative routes. [Solution] The information processing device comprises an acquisition unit, a search unit, and an execution unit. The acquisition unit acquires real-time status information in a network configured in which multiple communication devices are connected in a hierarchical structure. The search unit searches for other communication devices among the multiple communication devices that are located in a position related to the target communication device, based on the information of the hierarchical structure. The execution unit performs a bypass feasibility determination to determine whether it is possible to communicate by bypassing the communication path that goes through the target communication device, based on the status information in the network within a part of the hierarchical structure that includes the target communication device and other communication devices.

Description

Technical Field

[0001] The present invention relates to an information processing apparatus, an information processing method, and an information processing program.

Background Art

[0002] Conventionally, a method for optimizing the communication path of a flow flowing through a network has been proposed. For example, Patent Document 1 calculates, for each link between transfer devices constituting a network, a cost corresponding to the unused communication rate of the link each time the used communication rate changes, and uses the cost to search for an alternative route.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Means for Solving the Problems

[0004] An information processing device according to the present invention includes an acquisition unit that acquires real-time status information in a network configured in which a plurality of communication devices are connected in a hierarchical structure, the hierarchical structure being a network structure in which each of the plurality of communication devices is connected in layers according to the network topology, the information of the hierarchical structure including topology information for each of the plurality of communication devices, and a search unit that searches for other communication devices among the plurality of communication devices that are located in a position related to the target communication device, and that belong to a layer that has a predetermined relationship with the layer to which the target communication device belongs, and a part of the hierarchical structure including the target communication device and the other communication devices. The system includes an execution unit that performs a bypass feasibility determination to determine whether communication is possible by bypassing the communication path that passes through the target communication device, based on the state information in the network within the surrounding hierarchical structure, wherein the search unit searches for a first other communication device belonging to the hierarchy to which the target communication device belongs, as the other communication device, from among the plurality of communication devices, a second other communication device adjacent to the target communication device and the first other communication device, respectively, from among the plurality of communication devices, and for the hierarchy to which the target communication device, the first other communication device, and the second other communication device each belong, it searches for a third other communication device belonging to that hierarchy, as the other communication device.

[0005] An information processing method according to the present invention is an information processing method performed by an information processing device, comprising: an acquisition step of acquiring real-time status information in a network configured in which a plurality of communication devices are connected in a hierarchical structure; the hierarchical structure is a network structure in which each of the plurality of communication devices is connected in layers according to the network topology, the information of the hierarchical structure includes topology information for each of the plurality of communication devices, and based on the topology information, a search step of searching for other communication devices among the plurality of communication devices that are located in a position related to the target communication device, and that belong to a layer that has a predetermined relationship with the layer to which the target communication device belongs; and the hierarchical structure, the relationship between the target communication device and the other The search step includes an execution step of performing a bypass feasibility determination, which determines whether communication is possible by bypassing the communication path that passes through the target communication device, based on the state information in the network within a certain range of hierarchical structures including the communication device, wherein the search step searches for a first other communication device belonging to the hierarchy to which the target communication device belongs, which is the hierarchy to which the target communication device belongs, among the plurality of communication devices, as the other communication device, a second other communication device adjacent to the target communication device and the first other communication device, among the plurality of communication devices, and for the hierarchy to which the target communication device, the first other communication device and the second other communication device each belong, the search for a third other communication device belonging to that hierarchy as the other communication device.

[0006] An information processing program in one embodiment of the present invention includes an acquisition procedure for acquiring real-time status information in a network configured in which a plurality of communication devices are connected in a hierarchical structure, the hierarchical structure being a network structure in which each of the plurality of communication devices is connected in layers according to the network topology, the information of the hierarchical structure including topology information for each of the plurality of communication devices, and a search procedure for searching for other communication devices among the plurality of communication devices that are located in a position related to the target communication device, and that belong to a layer that has a predetermined relationship with the layer to which the target communication device belongs, and a search procedure for a part of the hierarchical structure including the target communication device and the other communication devices The computer is instructed to perform an execution procedure to determine whether it is possible to bypass the communication path that passes through the target communication device, based on the state information in the network within the layer structure, and the search procedure searches for a first other communication device belonging to the layer to which the target communication device belongs, as the other communication device, from among the plurality of communication devices, a second other communication device adjacent to the target communication device and the first other communication device, respectively, from among the plurality of communication devices, and for the layer to which the target communication device, the first other communication device and the second other communication device each belong, the computer is instructed to perform an execution procedure to determine whether it is possible to bypass the communication path that passes through the target communication device. [Brief explanation of the drawing]

[0007] [Figure 1] Figure 1 shows an example of a redundant network. [Figure 2] Figure 2 illustrates the different types of network topologies. [Figure 3] Figure 3 illustrates the hierarchical structure formed according to the pairing status. [Figure 4] Figure 4 shows an example of the configuration of an information processing system according to the embodiment. [Figure 5] Figure 5 shows an overview of the information processing used to determine whether a detour is possible. [Figure 6] Figure 6 shows an example of the configuration of an execution device according to the embodiment. [Figure 7] Figure 7 is a diagram (1) illustrating the search method according to the embodiment. [Figure 8] Figure 8 is a diagram (2) illustrating the search method according to the embodiment. [Figure 9] Figure 9 is a diagram (3) illustrating the search method according to the embodiment. [Figure 10] Figure 10 is a diagram (4) illustrating the search method according to the embodiment. [Figure 11] Figure 11 is a flowchart (1) showing the search process procedure according to the embodiment. [Figure 12] Figure 12 is a flowchart (2) showing the search process procedure according to the embodiment. [Figure 13] Figure 13 shows the network structure as determined by the execution device based on the grouping results. [Figure 14] Figure 14 is a flowchart showing the information processing procedure for determining whether a detour is possible according to the embodiment. [Figure 15] Figure 15 is a diagram (1) showing a specific example of how to determine whether a detour is permissible. [Figure 16] Figure 16 is Figure (2), which shows a specific example of how to determine whether a detour is permissible. [Figure 17] Figure 17 is a hardware configuration diagram showing an example of a computer that implements the functions of the execution device according to the embodiment. [Modes for carrying out the invention]

[0008] Embodiments of this disclosure will be described in detail below with reference to the attached drawings. In this specification and the drawings, components having substantially the same functional configuration are denoted by the same reference numerals, and redundant descriptions will be omitted.

[0009] One or more embodiments (including examples, modifications, and application examples) described below can each be implemented independently. On the other hand, at least some of the multiple embodiments described below may be implemented in appropriate combination with at least some of other embodiments. These multiple embodiments may include different novel features. Therefore, these multiple embodiments can contribute to solving different purposes or problems and can exhibit different effects.

[0010] In the following embodiments, the "communication device" shall refer to network devices constituting a network. Network devices are called nodes, and a communication path, which is a line connecting nodes to each other, is called a link.

[0011] Examples of network devices include routers, firewalls, switches, hubs, and PCs. In this embodiment, the "communication device" will be described as a router.

[0012] (Embodiment) [1. Introduction] Currently, as the network infrastructure has become important for business operations, redundancy of communication devices is being carried out. However, in the redundancy of communication devices, the network configuration and related technologies may become complex.

[0013] For example, before redundancy, the communication devices are connected in a simple configuration in a line, but after redundancy, a network is configured based on various types of network structures, that is, network topologies (hereinafter abbreviated as "topologies"), and they are multi-staged or deformed.

[0014] FIG. 1 is a diagram showing an example of a redundant network NW. The network NW shown in FIG. 1 is a large-scale network including a large number (for example, 10,000 or more) of communication devices (nodes). As a result of redundancy, the communication paths (links), which are the lines connecting the communication devices to each other, become intricate as shown in FIG. 1, so the network configuration of the network NW becomes complex.

[0015] Also, as will be described in detail later, there are various types of topology such as tree type (tree structure) and ring type (ring structure). However, when network devices are made redundant, as shown in FIG. 1, various topologies are intertwined, so the network configuration of the network NW becomes complicated.

[0016] Also, the situation of the network NW may change sequentially. For example, the network configuration of the network NW is not fixed but has the property of changing according to various events. For example, when a communication failure (e.g., some trouble in a communication device or communication path) or work (e.g., maintenance work) occurs in the network NW, the network configuration may change.

[0017] Here, redundancy means providing backup devices etc. so that services can be provided stably even if a communication failure occurs in the network NW. Therefore, for example, when a communication failure occurs in the network NW, a function is provided that executes a calculation of a bypass route, such as bypassing the obstacle causing the communication failure and securing a communication route via any device.

[0018] In the above prior art, a proposal has been made for a single function related to the calculation of such a bypass route. However, due to redundancy, the network configuration becomes complicated, and in a situation where the network configuration is variable, a lot of costs are incurred for the calculation of the bypass route. Also, the requirements for the time until the communication failure is restored are increasing further (shortening the time required for restoration).

[0019] Therefore, the inventor of the present invention has come up with a method for quickly determining whether a bypass is possible without calculating the bypass route. For example, in the conventional method, a bypass route is calculated, the states of each communication device (node) and communication path (link) in the calculated bypass route are confirmed, and based on the confirmation result, a determination of whether communication using the bypass route is possible is made, which is a determination of whether a bypass is possible.

[0020] However, the complexity of the network configuration due to redundancy, and the variability of the network configuration, pose a problem in that calculating alternative routes takes a lot of time. For this reason, a method that can quickly determine whether an alternative route is feasible without calculating alternative routes is considered a more effective method compared to conventional techniques.

[0021] Furthermore, in the past, network administrators sometimes had to manually determine whether or not a detour was possible. In such cases, network administrators were required to independently understand the network configuration and network status, and then make a decision on whether or not a detour was possible based on the results. The proposed technology according to the present invention is a means to automate such manual tasks, thereby reducing the workload and shortening the working time for network administrators.

[0022] Specifically, the proposed technology of the present invention assumes that a redundant network NW is divided into multiple layers according to its topology, and that each layer has a defined topology, i.e., a hierarchical structure. Based on this, it sequentially maintains real-time state information of the network NW in a database. As described above, the network configuration is variable, but the proposed technology of the present invention uses the state information stored in the database to reproduce the current hierarchical structure using digital twin technology, and also takes into account currently occurring communication failures and operations to perform a determination of whether or not it is possible to bypass the communication path that goes through the target communication device.

[0023] Thus, the proposed technology of the present invention collects real-time status information (e.g., fault information, configuration information, work information, etc.) in a network NW and has a general-purpose topology (hierarchical structure) recognition logic based on the collected status information. Although there are various types of topologies, such as tree type (tree structure) and ring type (ring structure), the technology is highly versatile in that no special processing is required for each type.

[0024] Furthermore, the proposed technology of the present invention is characterized by utilizing the redundancy of the network NW to check real-time status information for a part of the network NW (specifically, the range from the layer to which the target communication device belongs to to an adjacent layer adjacent to that layer) rather than the entire network NW, thereby determining whether a detour is possible without calculating a detour route.

[0025] From the above, the proposed technology of the present invention has high versatility, as it only requires searching for communication devices from the current layer to adjacent layers, and is applicable to any type of topology, even if various topologies are intricately intertwined in the network NW. Furthermore, because the proposed technology of the present invention uses a layer concept that has not been considered in conventional technologies, it eliminates the need to calculate detours and enables rapid determination of whether a detour is possible.

[0026] The following describes in detail one embodiment of the information processing according to the proposed technology of the present invention. In the information processing according to the embodiment, the target communication device is assumed to be a communication device to be bypassed. The communication device to be bypassed is, for example, a communication device that has caused a communication failure due to a malfunction or other trouble, and in the information processing according to the embodiment, a bypass feasibility determination is performed to determine whether or not it is possible to communicate by bypassing the communication path that passes through the communication device to be bypassed.

[0027] In the description of the information processing according to the embodiment, communication devices will be referred to as "communication device ND". Furthermore, if it is necessary to distinguish between individual communication devices ND, they will be referred to as "communication device NDn" (where n is an arbitrary natural number). In addition, the communication paths that connect the communication devices ND will be referred to as "communication path LN". If it is necessary to distinguish between individual communication path LN, they will be referred to as "communication path LNn" (where n is an arbitrary natural number).

[0028] [2. Regarding network topology] Before describing the information processing according to the embodiment, we will explain the different types of network topologies. Figure 2 is a diagram illustrating the types of network topologies.

[0029] Figure 2(a) shows ring topology and box topology. A ring topology is a configuration in which multiple network devices are connected in a ring shape. A box topology is a configuration in which four network devices are connected while maintaining a certain degree of redundancy. A V topology is a configuration consisting of three network devices and can be considered a part of a mesh topology (Figure 2(b)).

[0030] In a mesh topology, as shown in Figure 2(c), each network device is connected point-to-point to one or more other network devices. This type of mesh topology is also called a full mesh. On the other hand, a mesh topology in which network devices are connected only to the other network devices with which they interact most is also called a partial mesh.

[0031] So far, we have explained basic topologies, but hybrid topologies also exist that combine multiple basic topologies. For example, box topologies can be combined three-dimensionally to form a cubic topology (Figure 2(d)). Also, in the example in Figure 2(a), a ring topology and a box topology are combined.

[0032] Here, a hierarchical structure refers to a network structure in which the network NW is divided into layers according to its topology. For example, if the network NW contains a total of six topologies as shown in Figures 2(a) to 2(d), then each of the six topologies can be considered as one layer in the network NW. In other words, the network NW is configured by connecting multiple communication devices ND in a hierarchical structure.

[0033] The execution device 100, described later, can extract topology information from the configuration information of the communication device ND. The topology information includes information about the hierarchy to which the communication device ND belongs, such as identification information of the topology containing the communication device ND (e.g., the name of the topology). As a result, the execution device 100 can determine which topology (hierarchical structure), which is a component of the network NW, the communication device ND belongs to.

[0034] For example, if the topology information obtained as the configuration of the communication device ND to be bypassed includes the topology name "R1", the execution device 100 can determine that the communication device ND to be bypassed belongs to the "ring type" topology "1" hierarchy. As another example, if the topology information obtained as the configuration of the communication device ND1 to be bypassed includes the topology name "M1", the execution device 100 can determine that the communication device ND to be bypassed belongs to the "mesh type" topology "1" hierarchy.

[0035] In the information processing according to this embodiment, the hierarchical structure in which the communication device ND is searched is not limited to the type of topology described in Figure 2. For example, in a network NW, a hierarchy may be formed according to the pairing status between communication devices ND, and searches may also be performed at that hierarchy. Figure 3 illustrates the hierarchical structure formed according to the pairing status. Figure 3 shows the network NW shown in Figure 1 in a more concrete form.

[0036] In the network NW shown in Figure 3, multiple communication devices ND are connected to form a hierarchical structure consisting of "ring type" topology "1" (R1), "mesh type" topology "1" (M1), "mesh type" topology "1-1" (M1-1), "mesh type" topology "2" (M2), and "mesh type" topology "2-1" (M2-1). In other words, in the example in Figure 3, the network NW is configured by connecting multiple communication devices ND in a hierarchical structure (R1, M1, M1-1, M2, M2-1).

[0037] Furthermore, in the example shown in Figure 3, communication devices ND20 and ND21 are paired and have a paired relationship with each other. Therefore, in this example, the connection relationship between communication devices ND20 and ND21 can be considered as a single hierarchical structure corresponding to the pairing.

[0038] Furthermore, in the example shown in Figure 3, communication devices ND22 and ND23 are paired and have a paired relationship with each other. Therefore, in this example, the connection relationship between communication devices ND22 and ND23 can be considered as a single hierarchical structure corresponding to the pairing.

[0039] Furthermore, communication devices ND may be paired with each other at the central center. In the example in Figure 3, an example is shown where communication devices ND21 and ND22 are paired in relation to a pair center, separate from the paired device. In such an example, it can be considered that a hierarchical structure is formed between communication devices ND21 and ND22.

[0040] Furthermore, in the example shown in Figure 3, communication devices ND50 and ND51 are paired and have a paired relationship with each other, so the connection relationship between communication devices ND50 and ND51 can be considered as a single hierarchical structure corresponding to the pairing. Similarly, communication devices ND52 and ND53 are paired and have a paired relationship with each other, so the connection relationship between communication devices ND52 and ND53 can be considered as a single hierarchical structure corresponding to the pairing. An example is also shown in which communication devices ND51 and ND52 are paired in a pair center relationship, separate from these paired relationships. In this example, it can be considered that a single hierarchical structure is formed between communication devices ND51 and ND52.

[0041] Furthermore, as shown in the example in Figure 3, a hierarchical structure can be considered to be formed between communication device ND70 and communication device ND71 in terms of pair center relationships. A hierarchical structure can also be considered to be formed between communication device ND80 and communication device ND81 in terms of pairing relationships.

[0042] [3. System Configuration] The configuration of the information processing system Sy will be explained using Figure 4. Figure 4 is a diagram showing an example configuration of the information processing system Sy according to an embodiment. As shown in Figure 4, the information processing system Sy includes an alarm management system 20, a log collection system 40, a work management system 60, a control device 80, and an execution device 100. In the information processing system Sy, the alarm management system 20, the log collection system 40, the work management system 60, the control device 80, and the execution device 100 are connected to each other via a predetermined communication network (network N) by wired or wireless means. The information processing system Sy is a system that realizes the information processing according to the proposed technology of the present invention.

[0043] The alarm management system 20 transmits fault information to the execution device 100 at regular intervals as real-time status information for the network NW. As a result, the execution device 100 can collect fault information in the database 120 (Figure 6). The fault information includes information about the node or link experiencing the failure, such as node down / up, physical IF down / up, logical IF down / up, OSPF down / up, ISIS down / up, BGP down / up, etc.

[0044] The log collection system 40 transmits periodic log information to the execution device 100 at regular intervals as real-time status information in the network NW. As a result, the execution device 100 can collect the periodic log information in the database 120. The periodic log information includes configuration information of the communication device ND, such as OSPF metric changes and ISIS metric changes. In addition, as described above, the configuration information also includes topology information for determining the hierarchy. Topology information can also be described as information on the hierarchical structure.

[0045] The work management system 60 transmits work information to the execution device 100 at regular intervals as real-time status information on the network NW. As a result, the execution device 100 can collect work information in the database 120.

[0046] The control device 80 queries the execution device 100 to determine whether a detour is possible. Specifically, the control device 80 sends request information to the execution device 100 requesting that it perform a decision on whether a detour is possible. For example, the control device 80 may send the request information in response to instructions from the network administrator, or it may send the request information automatically on a periodic basis.

[0047] The execution device 100 performs a bypass feasibility determination as information processing according to the embodiment, which determines whether communication is possible by bypassing the communication path LN that passes through the communication device ND to be bypassed. For example, the execution device 100 uses digital twin technology to reproduce the current hierarchical structure on the network NW based on state information. Then, the execution device 100 determines the normality of the communication device ND and communication path LN included in the hierarchical structure within a portion of the reproduced hierarchical structure (specifically, the range from the hierarchical layer to which the communication device ND to be bypassed belongs to the adjacent hierarchical layer adjacent to that layer) based on real-time state information. Then, the execution device 100 determines whether communication is possible by bypassing the communication path LN that passes through the communication device ND to be bypassed based on the determination result.

[0048] [4. Overview of the decision on whether a detour is possible] The execution device 100's determination of whether or not a detour is possible will be explained in more detail. Figure 5 is a diagram illustrating the overview of the information processing for determining whether or not a detour is possible. In Figure 5, the overview of the information processing for determining whether or not a detour is possible is explained based on the network NW shown in Figure 1.

[0049] Figure 5 illustrates the hierarchical relationships in a network. According to the example in Figure 5, the network is divided into five layers. Specifically, the network is structured into five layers: topology TP1, topology TP2, topology TP3, topology TP4, and topology TP5.

[0050] Furthermore, Figure 5 shows communication device ND1 as a target for bypass. The execution device 100 monitors the state changes of each communication device ND included in the network NW based on real-time state information in the network NW, and can determine, for example, that a failure has occurred in a communication device ND where a state change has been detected. In the example in Figure 5, the execution device 100 determines that a failure has occurred in communication device ND1 and designates communication device ND1 as a target for bypass. Alternatively, the control device 80 may be configured to detect whether a failure has occurred in any of the communication devices ND included in the network NW, and if a failure is detected, send request information to determine whether or not to bypass the communication device ND in which the failure was detected.

[0051] In this state, the execution device 100 searches for other communication devices ND that belong to the same hierarchy H1 as the communication device ND1 to be bypassed. In the example in Figure 5, the hierarchy structure of hierarchy H1 is topology TP5.

[0052] Furthermore, the execution device 100 searches for communication devices ND (other communication devices ND from the perspective of the communication device ND1 to be bypassed) that belong to the adjacent layer R adjacent to the affiliated layer H1. In the example in Figure 5, there are two adjacent layers R adjacent to the affiliated layer H1, and topology TP3 and topology TP4 are the hierarchical structures of adjacent layers R.

[0053] The execution device 100 tracks changes in the status information of each communication device ND included in its own layer H1 and adjacent layer R, and determines the normality of each communication device ND. The execution device 100 also tracks changes in the status information of each communication path LN included in its own layer H1 and adjacent layer R, and determines the normality of each communication path LN. In this context, the determination of normality refers to, for example, determining whether or not a problem (e.g., a malfunction) that could cause a communication failure has occurred, or determining whether or not maintenance work is being performed.

[0054] Then, the execution device 100 performs a bypass feasibility determination to determine whether or not it is possible to bypass the communication path LN that passes through the communication device ND1 to be bypassed, based on the normality determination result. For example, if the execution device 100 determines that both the communication device ND and the communication path LN are normal, it determines that it is possible to bypass the communication path LN that passes through the communication device ND1 to be bypassed.

[0055] On the other hand, the execution device 100 determines that if even one of the communication devices ND or communication path LN is not functioning correctly, communication via the communication path LN that passes through the communication device ND1 to be bypassed is impossible. In a redundant network NW, for example, if a communication device ND fails completely as expected, a function is incorporated to maintain service provision by automatically switching to a backup communication device ND. Therefore, for example, if the communication device ND1 to be bypassed fails as expected, the bypass will not be performed in the first place, and the automatic switching function will be activated.

[0056] However, the communication device ND1 to be rerouted may not be completely broken and inoperable; for example, it may be experiencing minor problems due to quality degradation. The proposed technology of the present invention is a method that, in the event of a situation where communication is possible but minor problems are occurring, quickly reroutes traffic from the communication device ND1 to be rerouted and allows for recovery in the meantime. Therefore, it is assumed that even if it is determined that communication via the communication path LN passing through the communication device ND1 to be rerouted is impossible, a certain level of communication quality can be ensured.

[0057] Furthermore, as explained using Figure 5, in the proposed technology of the present invention, no detour calculations are performed, and by utilizing the redundancy of the network NW, it is possible to search for communication devices ND included in the range from the affiliated layer H1 to the adjacent layer R, and by simply checking the state changes of the searched communication devices ND and the state changes of the communication paths LN within this range, it is possible to determine whether or not communication is possible by bypassing the communication path LN that passes through the communication device ND1 to be bypassed.

[0058] [5. Configuration of the execution device] The execution device 100 according to the embodiment will be described with reference to Figure 6. Figure 6 is a diagram showing an example of the configuration of the execution device 100 according to the embodiment. As shown in Figure 6, the execution device 100 has a communication unit 110, a database 120, and a control unit 130.

[0059] (Communications Department 110) The communication unit 110 is implemented, for example, by a NIC (Network Interface Card). For example, the communication unit 110 transmits and receives information with the alarm management system 20, the log collection system 40, the work management system 60, and the control device 80.

[0060] (Database 120) The database 120 is implemented by, for example, semiconductor memory elements such as RAM (Random Access Memory) and flash memory, or storage devices such as hard disks and optical discs. The database 120 may store, for example, data and programs related to information processing according to the embodiment. The database 120 may also store information collected from the alarm management system 20, the log collection system 40, and the work management system 60.

[0061] (Control unit 130) The control unit 130 is implemented by a CPU (Central Processing Unit) or MPU (Micro Processing Unit), etc., which executes various programs (for example, information processing programs according to the embodiment) stored in the memory device inside the execution device 100 using RAM as the working area. Alternatively, the control unit 130 can be implemented by an integrated circuit such as an ASIC (Application Specific Integrated Circuit) or FPGA (Field Programmable Gate Array).

[0062] As shown in Figure 6, the control unit 130 includes an acquisition unit 131, a reception unit 132, a search unit 133, an execution unit 134, and a notification unit 135, and realizes or executes the information processing functions and operations described below. Note that the internal configuration of the control unit 130 is not limited to the configuration shown in Figure 6, and other configurations are also possible as long as they perform the information processing described later. Also, the connection relationships of the various processing units in the control unit 130 are not limited to the connection relationships shown in Figure 6, and other connection relationships are also possible.

[0063] (Acquisition part 131) The acquisition unit 131 acquires information necessary for information processing according to the embodiment. For example, the acquisition unit 131 acquires real-time status information in a network NW configured in which multiple communication devices ND are connected in a hierarchical structure.

[0064] For example, the acquisition unit 131 acquires status information (e.g., fault information) that is collected in real time from the alarm management system 20 and stored in the database 120. The acquisition unit 131 also acquires status information (e.g., periodic log information) that is collected in real time from the log collection system 40 and stored in the database 120. Furthermore, the acquisition unit 131 acquires status information (e.g., work information) that is collected in real time from the work management system 60 and stored in the database 120.

[0065] (Reception desk 132) The reception unit 132 receives request information from the control device 80 as an inquiry regarding the possibility of detour, requesting that a decision be made on whether or not detour is possible. The reception unit 132 may also be configured to receive request information directly from the network administrator. The request information may include information identifying the communication device ND1 to be detouring.

[0066] (Search part 133) The search unit 133 searches for other communication devices ND among the multiple communication devices ND that are located in a position related to the communication device ND1 to be bypassed, based on the information of the hierarchical structure.

[0067] The hierarchical structure is a network structure in which multiple communication devices ND are connected to each other in layers according to their topology. Therefore, the information on the hierarchical structure includes the topology information of each of the multiple communication devices ND. Based on the topology information, the search unit 133 searches for other communication devices ND that belong to layers that have a predetermined relationship with the layer to which the communication device ND1 to be bypassed belongs.

[0068] The search unit 133 searches for a first other communication device ND from among multiple communication devices ND that belongs to the same hierarchy as the communication device ND1 to be bypassed. In other words, the search unit 133 searches for a first other communication device ND that belongs to the same hierarchy as the communication device ND1 to be bypassed from among multiple communication devices ND. The search unit 133 may further use the pairing status among the communication devices ND related to the communication device ND1 to be bypassed to search for the first other communication device ND. The hierarchy structure according to the pairing is as explained in Figure 3.

[0069] The search unit 133 searches for other communication devices ND, specifically the communication device ND1 to be bypassed and a second other communication device ND adjacent to each of the first other communication devices, from among a plurality of communication devices ND.

[0070] The search unit 133 searches for a third other communication device ND belonging to the same hierarchy as the other communication device ND for each hierarchy to which the bypass target communication device ND1, the first other communication device ND, and the second other communication device ND belong. The search unit 133 also searches for communication devices that are adjacent to each other among the third other communication devices ND and includes information on the adjacency relationship in the search results.

[0071] (Execution section 134) The execution unit 134 performs a bypass feasibility determination, which determines whether or not communication is possible by bypassing the communication path that goes through the communication device ND1, based on the status information in the network NW within a part of the hierarchical structure that includes the communication device ND1 to be bypassed and other communication devices ND.

[0072] For example, the execution unit 134 determines the normality of each of the target communication devices ND, such as the first other communication device ND, the second other communication device ND, and the third other communication device ND, based on the status information of each target communication device ND. The execution unit 134 also determines the normality of each communication path LN based on the status information of each communication path LN between the target communication devices ND that are connected to each other.

[0073] If the execution unit 134 obtains a result indicating that both the communication device ND and the communication path LN to be judged are normal, it determines that communication is possible by bypassing the communication path LN that goes through the communication device ND1 to be bypassed.

[0074] On the other hand, if the execution unit 134 obtains a result indicating that at least one of the communication devices ND and communication paths LN to be determined is not functioning correctly, it determines that communication via the communication path LN passing through the communication device ND1 to be bypassed is not possible. However, if the only result indicating that something is not functioning correctly is that the communication path LN passing through the communication device ND1 to be bypassed is not functioning correctly, the execution unit 134 determines that communication via the communication path LN passing through the communication device ND1 to be bypassed is possible.

[0075] Furthermore, if the execution unit 134 determines that it is possible to bypass the communication path LN that passes through the communication device ND1 to be bypassed, it may notify other communication devices ND within a certain range to not perform communication via the communication device ND1 to be bypassed. On the other hand, if the execution unit 134 determines that it is not possible to bypass the communication path LN that passes through the communication device ND1 to be bypassed, it may notify other communication devices ND within a certain range to perform communication via the communication device ND1 to be bypassed.

[0076] Furthermore, if the only result is that the communication path LN1 passing through the communication device ND1 to be bypassed is not functioning correctly, the communication path LN1 may have already been bypassed (referred to as "bypass U1"). However, since communication is possible by bypassing another communication path LN2 passing through the communication device ND1 to be bypassed (referred to as "bypass U2"), bypass U1 can be described as an "OK bypass". In the proposed technology of the present invention, there is a premise that communication devices ND that have experienced malfunctions or other problems should be bypassed. For example, if only the communication path LN passing through the communication device ND is not functioning correctly, there is no problem in bypassing it, and in such cases, the expression "OK bypass" may be used.

[0077] On the other hand, if it is determined that any of the communication devices ND other than the communication device ND1 to be bypassed, or any communication path LN that does not pass through the communication device ND1 to be bypassed, is not functioning correctly, then bypassing these determined devices (referred to as "Bypass U3") may have already been performed. When Bypass U3 is occurring, it is not possible to bypass the communication path LN that passes through the communication device ND1 to be bypassed (referred to as "Bypass U4"). Therefore, in such situations, Bypass U3 can be described as an "NG bypass". For example, if there is a malfunction or other problem with a communication device ND other than the communication device ND1 to be bypassed, or with a communication path LN that does not pass through the communication device ND1 to be bypassed, bypassing it would increase traffic and potentially exacerbate the impact of the communication failure. Therefore, in such scenarios, the communication path LN that passes through the communication device ND1 to be bypassed should not be bypassed; in other words, bypassing the communication path LN that passes through the communication device ND1 to be bypassed is impossible, and the expression "NG bypass" may be used to mean this.

[0078] [6. Overview of the Search Method] As described above, in this embodiment, other communication devices ND belonging to the same layer H1 as the communication device ND1 to be bypassed are searched for. In addition, in this embodiment, communication devices ND belonging to the adjacent layer R adjacent to layer H1 (other communication devices ND from the perspective of the communication device ND1 to be bypassed) are also searched for. Therefore, Figures 7 to 10 illustrate the outline of the search method executed by the search unit 133. Figures 7 to 10 show the network NW shown in Figures 1 and 5 in a more concrete form.

[0079] Figure 7 is a diagram (1) illustrating the search method according to the embodiment. First, the search unit 133 performs a same-hierarchy search to find nodes at the same hierarchy. Specifically, as shown in Figure 7, the search unit 133 searches for communication devices ND that belong to the same hierarchy as the communication device ND1 to be bypassed, and adds the search results to the grouping list L (step S1). More specifically, the search unit 133 searches for a first other communication device ND that belongs to the same hierarchy H1 as the communication device ND1 to be bypassed, and adds the information of the first other communication device ND that was found to be added to the grouping list L.

[0080] For example, the search unit 133 searches for a first other communication device ND from among the communication devices ND included in the network NW based on the topology information of each communication device ND included in the network NW and the topology information of the affiliated layer H1. The topology information may be, for example, a topology name, and the search unit 133 may search for a communication device ND among the communication devices ND included in the network NW that has the same topology name as the topology name of the affiliated layer H1 as the first other communication device ND.

[0081] Figure 7 shows an example in which the search unit 133 extracts communication devices ND2 to ND12 as the first other communication device ND through a hierarchical search. In this example, the search unit 133 adds the information (e.g., device ID) of each communication device ND2 to ND12 to the grouping list L.

[0082] Next, the search unit 133 performs an adjacency search to find nodes in the adjacent hierarchy. Figures 8 and 9 show examples of adjacency searches.

[0083] First, let's explain Figure 8. Figure 8 is a diagram (2) illustrating the search method according to the embodiment. As shown in Figure 8, the search unit 133 searches for communication devices ND adjacent to the communication device ND1 to be bypassed and adds the search results to the grouping list L (step S2). For example, the search unit 133 searches for a second other communication device ND adjacent to the communication device ND1 to be bypassed, using the search condition as a starting point up to one hop away, and adds the information of the second other communication device ND that was found to the grouping list L.

[0084] Figure 8 shows an example in which the search unit 133 extracts communication devices ND2, ND12, and ND20 as second other communication devices ND through adjacent search. Note that the search unit 133 may exclude communication devices ND2 and ND12 from the second other communication devices ND because they overlap with the search results in step S1. As a result, the search unit 133 adds the information of communication device ND20 (e.g., device ID) to the grouping list L.

[0085] Next, Figure 9 will be explained. Figure 9 is a diagram (3) illustrating the search method according to the embodiment. As shown in Figure 9, the search unit 133 searches for communication devices ND adjacent to the communication device ND that has already been added to the grouping list L, and adds them to the grouping list L (step S3).

[0086] Using the previous example, the communication devices ND currently added to the grouping list L are communication devices ND2-ND12 and communication device ND20. Therefore, the search unit 133 searches for communication devices ND2-ND12 and communication device ND20, using the search condition as a starting point and extending up to one hop away, to find communication devices ND adjacent to each of them. The search unit 133 may also search for communication devices ND adjacent to each of them as a second, other communication device ND. Then, the search unit 133 adds the information of the second, other communication device ND that it has found to the grouping list L.

[0087] Figure 9 shows an example in which the search unit 133 extracts communication devices ND20, ND21, ND22, ND23, ND30, ND31, ND40, and ND41 as second other communication devices ND through adjacent search. Note that the search unit 133 may exclude communication device ND20 from the second other communication devices ND because it overlaps with the search result in step S2. As a result, the search unit 133 adds the information (e.g., device ID) of each communication device ND21, ND22, ND23, ND30, ND31, ND40, and ND41 to the grouping list L.

[0088] Finally, the search unit 133 performs additional searches to ensure that no devices are missed in each layer. Figure 10 is a diagram (4) illustrating the search method according to the embodiment. As shown in Figure 10, the search unit 133 searches for communication devices ND belonging to each layer to which each communication device ND currently added to the grouping list belongs, and adds them to the grouping list L (step S4).

[0089] Using the previous example, the communication devices ND currently added to grouping list L are communication devices ND2-ND12, communication devices ND20-ND23, communication devices ND30, ND31, communication devices ND40, and ND41.

[0090] Since communication devices ND20 to ND23 are communication devices ND extracted by adjacent search, the hierarchy to which they belong can be said to be the adjacent hierarchy Rx to their affiliated hierarchy H1. Therefore, the hierarchy to which communication devices ND20 to ND23 belong is designated as adjacent hierarchy R2. In the example in Figure 10, adjacent hierarchy R2 includes communication devices ND20 to ND23, but the search unit 133 does not currently know whether it includes other unsearched communication devices ND. Therefore, the search unit 133 may perform same-hierarchy search to search for a third other communication device ND as a node at the same hierarchy as communication devices ND20 to ND23. The search unit 133 extracts communication devices ND20 to ND23 by same-hierarchy search, but since they have already been added to grouping list L, they are excluded from the third other communication device ND.

[0091] Furthermore, since communication devices ND30 and ND31 are also communication devices ND extracted by adjacent search, the hierarchy to which they belong can be said to be the adjacent hierarchy Rx to their respective hierarchy H1. Therefore, the hierarchy to which communication devices ND30 and ND31 belong is defined as adjacent hierarchy R3. In the example in Figure 10, adjacent hierarchy R3 also includes communication devices ND32 and ND33, but the search unit 133 has not yet found communication devices ND32 and ND33. Therefore, the search unit 133 may perform same-hierarchical search to search for a third other communication device ND as a node at the same hierarchy as communication devices ND30 and ND31. The search unit 133 extracts communication devices ND32 and ND33 by same-hierarchical search and adds the information of each communication device ND32 and ND33 (e.g., device ID) to the grouping list L.

[0092] Furthermore, since communication devices ND40 and ND41 are also communication devices ND extracted by adjacent search, the hierarchy to which they belong can be said to be the adjacent hierarchy Rx to their respective hierarchy H1. Therefore, the hierarchy to which communication devices ND40 and ND41 belong is designated as adjacent hierarchy R4. In the example in Figure 10, adjacent hierarchy R4 also includes communication devices ND42 and ND43, but the search unit 133 has not yet found communication devices ND42 and ND43. Therefore, the search unit 133 may perform same-hierarchical search to search for a third other communication device ND as a node at the same hierarchy as communication devices ND40 and ND41. The search unit 133 extracts communication devices ND42 and ND43 by same-hierarchical search and adds the information of each communication device ND42 and ND43 (e.g., device ID) to the grouping list L.

[0093] [7. Search Processing Procedure] The search method according to the embodiment has been explained using Figures 7 to 10, but below, a more detailed example of the search method will be explained based on the example in Figures 7 to 10. Therefore, Figures 11 and 12 will explain the procedure of the search process executed by the search unit 133. In the example in Figures 11 and 12, it is assumed that the execution device 100 sequentially collects status information from the alarm management system 20, the log collection system 40, and the work management system 60.

[0094] Figure 11 is a flowchart (1) showing the search processing procedure according to the embodiment. Figure 11 shows the processing procedure in same-hierarchical search, which searches for nodes at the same hierarchical level.

[0095] The reception unit 132 determines whether it has received request information from the control device 80 requesting that a detour be performed as an inquiry regarding the possibility of detour (step S1101). If the reception unit 132 has not received an inquiry regarding the possibility of detour (step S1101; No), it waits until it receives an inquiry regarding the possibility of detour.

[0096] On the other hand, if the reception unit 132 receives an inquiry regarding the possibility of bypassing (step S1101; Yes), it registers the communication device ND specified in the inquiry as a target for bypassing (step S1102).

[0097] Furthermore, the acquisition unit 131 acquires the grouping list Lx (step S1103). The grouping list Lx is currently empty. In the following explanation, it is assumed that communication device ND1 was specified in step S1101, and the explanation will be given using communication device ND1, which is the target of the bypass, as an example. In such an example, information that identifies communication device ND1 as the target of the bypass may be added to the grouping list.

[0098] The search unit 133 identifies the hierarchy H1 to which the communication device ND1 to be bypassed belongs, based on the topology information of the communication device ND1 to be bypassed (step S1104). For example, the search unit 133 identifies what type (kind) and what name of topology the communication device ND1 to be bypassed belongs to, based on the topology information of the communication device ND1 to be bypassed. Referring to Figure 7, an example is shown where the search unit 133 identifies "R1" ("ring-type" topology "1") as the hierarchy H1 information.

[0099] Next, the search unit 133 determines whether the topology type of the affiliated hierarchy H1 is of a predetermined type based on the information of the affiliated hierarchy H1 (step S1105). For example, the search unit 133 may determine whether the topology type of the affiliated hierarchy H1 is one of the following: ring type, box type, V type, mesh type, or cube type.

[0100] If the search unit 133 determines that the topology type of the affiliated layer H1 is a predetermined type (step S1105; Yes), it searches for a communication device ND belonging to the same layer as the communication device ND1 to be bypassed, based on the topology information of each communication device ND included in the network NW (step S1106a). For example, the search unit 133 searches for a first other communication device ND belonging to the affiliated layer H1 as another communication device ND located in a position related to the communication device ND1 to be bypassed (hereinafter abbreviated as "other communication device"), based on the topology information of each communication device ND included in the network NW and the topology information of the affiliated layer H1. Such a search corresponds to the example in Figure 7.

[0101] Then, the search unit 133 adds information about the first other communication device ND (e.g., device ID) to the grouping list L1 for the affiliated hierarchy H1 from the grouping list Lx (step S1107a). In this example, the search unit 133 can consider the network structure consisting of the device ND1 to be bypassed (communication device ND1) and the first other communication device ND as a single hierarchy.

[0102] Once the process has progressed to step S1107a and the search within the same hierarchical level is complete, the process transitions to an adjacency search, which searches for nodes in adjacent hierarchical levels.

[0103] On the other hand, if the search unit 133 determines that the topology type of the affiliated layer H1 is not of a predetermined type (step S1105; No), it identifies a communication device ND(P1) that is paired with the device ND1 to be bypassed, as another communication device ND, based on the pairing information in the network NW (step S1106b).

[0104] Next, the search unit 133 adds information about the communication device ND(P1) (e.g., device ID) to the grouping list L1 for the affiliated hierarchy H1 (step S1107b). In this example, the search unit 133 can consider the network structure consisting of the pair of the device to be bypassed ND1 and the communication device ND(P1) as a single hierarchy.

[0105] The search unit 133 determines, based on the pairing information, whether or not there is a communication device ND(S) that is in a pair center relationship with either the bypass target device ND1 or communication device ND(P1) (step S1108b). In other words, the search unit 133 determines whether or not there is a communication device ND(S) as another communication device ND.

[0106] If there is a communication device ND(S) that is in a pair center relationship (step S1108b; Yes), the search unit 133 further adds information about the communication device ND(S) (e.g., device ID) to the grouping list L1 for the affiliated hierarchy H1 (step S1109b). In this example, the search unit 133 can consider the network structure consisting of the device to be bypassed ND1, the communication device ND(P1), and the communication device ND(S) as a single hierarchy.

[0107] Furthermore, based on the pairing information, the search unit 133 identifies another communication device ND, which is a pair of communication device ND(S), as communication device ND(P2) (step S1109b).

[0108] The search unit 133 adds information about the communication device ND(P2) (e.g., device ID) to the grouping list L1 for the affiliated hierarchy H1 (step S1110b). In this example, the search unit 133 can consider the network structure consisting of the device to be bypassed ND1, the communication device ND(P1), the communication device ND(S), and the communication device ND(P2) as a single hierarchy.

[0109] Once the process reaches step S1110b and the search within the same hierarchical level is complete, the process transitions to an adjacency search, which searches for nodes in adjacent hierarchical levels.

[0110] Furthermore, if no communication device ND(S) exists that is in a pair center relationship (step S1108b; No), the search unit 133 simply adds information about the communication device ND(P1) (e.g., device ID) to the grouping list L1 for the affiliated layer H1, and then proceeds to an adjacency search to search for nodes in the adjacent layer.

[0111] Figure 12 is a flowchart (2) showing the search process procedure according to the embodiment. Figure 12 shows the process procedure in adjacency search, which searches for nodes in the adjacent hierarchy.

[0112] The search unit 133 determines whether there are any communication devices ND added to the grouping list L1 that have not yet undergone adjacent search (step S1201). In the example in Figure 11, the communication devices ND added to the grouping list L1 are communication devices ND (the first other communication device ND) that belong to the same hierarchical level (i.e., the same hierarchical level H1) as the communication device ND1 to be bypassed.

[0113] If there are any unprocessed adjacent devices in the search unit 133 (step S1201; Yes), the search unit 133 searches for a communication device ND adjacent to the unprocessed communication device ND (step S1202).

[0114] For example, the search unit 133 sets the search condition to one hop away from the communication device ND1 to be bypassed, and searches for a second communication device ND adjacent to the communication device ND1 to be bypassed as the other communication device ND. Such a search corresponds to the example in Figure 8.

[0115] Furthermore, the search unit 133 defines the search condition as extending one hop from the first other communication device ND, and searches for a second other communication device ND adjacent to the first other communication device ND. Such a search corresponds to the example in Figure 9.

[0116] The search unit 133 may perform the adjacency search in step S1202 sequentially for each unprocessed communication device ND. In this case, the search unit 133 identifies the hierarchy Hx to which the second other communication device ND belongs based on the topology information of the second other communication device ND extracted in the adjacency search (step S1203). For example, the search unit 133 identifies what type (kind) and what name of topology the second other communication device ND belongs to, based on its topology information.

[0117] Based on the information identified in step S1203, the search unit 133 determines the hierarchy Hx to which the second other communication device ND belongs as the adjacent hierarchy Rx to its hierarchy H1 (step S1204).

[0118] Then, the search unit 133 adds information about the second communication device ND (e.g., device ID) to the grouping list Lx for the adjacent layer Rx (step S1205). For example, if the search unit 133 extracts communication device ND20 in this adjacent search, it determines the affiliated layer H2 to be the adjacent layer R2 based on the information of the affiliated layer H2 to which communication device ND20 belongs, and adds information about communication device ND20 (e.g., device ID) to the grouping list L2 for the adjacent layer R2.

[0119] As another example, if the search unit 133 extracts communication device ND30 in this adjacent search, it determines the affiliated hierarchical H3 as the adjacent hierarchical R3 based on the information of the affiliated hierarchical H3 to which communication device ND30 belongs, and adds the information of communication device ND30 (e.g., device ID) to the grouping list L3 for adjacent hierarchical R3. Furthermore, as yet another example, if the search unit 133 extracts communication device ND40 in this adjacent search, it determines the affiliated hierarchical H4 as the adjacent hierarchical R4 based on the information of the affiliated hierarchical H4 to which communication device ND40 belongs, and adds the information of communication device ND40 (e.g., device ID) to the grouping list L4 for adjacent hierarchical R4.

[0120] On the other hand, if there are no unprocessed adjacent searches, the search unit 133 proceeds to an additional search to check for any missed searches in each adjacent hierarchy Rx.

[0121] First, the search unit 133 searches for communication devices ND belonging to each adjacent layer Rx (step S1206). Such a search corresponds to the example in Figure 10.

[0122] The search unit 133 determines whether there are any communication devices ND extracted in the search in step S1206 that have not yet been added to the grouping list Lx for the adjacent layer Rx (step S1207). Specifically, the search unit 133 determines whether there are any other communication devices ND, namely a third communication device ND that has not yet been added to the grouping list Lx.

[0123] Then, if there is a third other communication device ND that has not yet been added to the grouping list Lx (step S1207; Yes), the search unit 133 adds the information of that third other communication device ND (e.g., device ID) to the grouping list Lx (step S1208).

[0124] In the example shown in Figure 10, the search unit 133 searches the adjacent hierarchy R3 (a same-hierarchy search that searches for nodes at the same hierarchy as communication devices ND30 and ND31), determines that communication devices ND32 and ND33 have not yet been added to the grouping list L3, and adds this information to the grouping list L3. In this example, communication devices ND32 and ND33 correspond to a third other communication device ND.

[0125] Furthermore, as shown in the example in Figure 10, the search unit 133 determines that communication devices ND42 and ND43 have not yet been added to the grouping list L4 based on the results of searching the adjacent hierarchy R4 (same-hierarchy search, which searches for nodes at the same hierarchy as communication devices ND40 and ND41), and adds this information to the grouping list L4. In this example, communication devices ND42 and ND43 correspond to a third other communication device ND.

[0126] On the other hand, if there is no third communication device ND that has not been added to the grouping list Lx (step S1207; No), the search unit 133 terminates the adjacent search.

[0127] The execution device 100 can group other communication devices ND at the same hierarchy level H1 to which the communication device ND1 to be bypassed belongs, using the same-hierarchical search described in Figure 11. In previous examples, the result of this grouping is defined in grouping list L1. The execution device 100 can also group other communication devices ND belonging to adjacent hierarchy Rx adjacent to the affiliated hierarchy H1, using the adjacent search described in Figure 12. In previous examples, the result of this grouping is defined in grouping lists L2 to L4.

[0128] Here, Figure 13 shows the network structure as understood by the execution device 100 based on the grouping results. Figure 13 shows the network structure as understood by the execution device 100 based on grouping list L1 and grouping lists L2 to L4. As shown in Figure 13, the execution device 100 can understand the hierarchical structure of the affiliated hierarchical level H1 and the relationships between the communication devices ND belonging to the affiliated hierarchical level H1 based on grouping list L1.

[0129] Furthermore, the execution device 100 can understand the hierarchical structure of the adjacent hierarchical layer R2 and the relationships between the communication devices ND belonging to the adjacent hierarchical layer R2, based on the grouping list L2. The execution device 100 can understand the hierarchical structure of the adjacent hierarchical layer R3 and the relationships between the communication devices ND belonging to the adjacent hierarchical layer R3, based on the grouping list L3. The execution device 100 can understand the hierarchical structure of the adjacent hierarchical layer R4 and the relationships between the communication devices ND belonging to the adjacent hierarchical layer R4, based on the grouping list L4.

[0130] Furthermore, the execution device 100 can understand the relationships between the affiliated layer H1, adjacent layer R2, adjacent layer R3, and the communication device ND between adjacent layer R3.

[0131] In other words, the execution device 100 can grasp the network structure of network NW1, which is a part of the network NW. Specifically, the execution device 100 can grasp the network structure of network NW1, which is the range from the affiliated layer H1 to which the communication device ND1 to be bypassed belongs, to the adjacent layer Rx adjacent to the affiliated layer H1. Therefore, based on the state information in network NW1, the execution device 100 performs a bypass feasibility determination to determine whether communication is possible by bypassing the communication path that goes through the communication device ND1 to be bypassed. The following describes the processing procedure for the bypass feasibility determination performed based on the state information in network NW1.

[0132] Note that grouping lists L1, L2, L3, and L4 may each be different grouping lists Lx, or they may be a single identical grouping list Lx.

[0133] [8. Processing procedure for determining whether a detour is possible] Figure 14 is a flowchart showing the information processing procedure for determining whether a detour is possible according to the embodiment. In the example of Figure 14, the execution device 100 is assumed to be sequentially collecting status information from the alarm management system 20, the log collection system 40, and the work management system 60.

[0134] The acquisition unit 131 acquires status information on the network NW1 (step S1401). The status information includes fault information, configuration information, and work information for each communication device ND included in the network NW1. The status information also includes fault information and work information for the communication path LN connected to the communication devices ND included in the network NW1.

[0135] The execution unit 134 tracks the state changes of each communication device ND included in the network NW1 based on the state information acquired in step S1401 (step S1402).

[0136] The execution unit 134 determines the normality of each communication device ND based on the state change (step S1403).

[0137] Furthermore, the execution unit 134 tracks the state changes of each communication path LN included in the network NW1 based on the state information acquired in step S1401 (step S1404).

[0138] The execution unit 134 determines the normality of each communication path LN based on the state change (step S1405).

[0139] Note that the order in which steps S1402 to S1405 are executed is not limited to the example in Figure 14. Also, the execution unit 134 may perform steps S1402 to S1405 in parallel.

[0140] Based on the normality determination result, the execution unit 134 determines whether all communication devices ND and communication paths LN included in the network NW1 are normal (step S1406).

[0141] If the execution unit 134 determines that all communication devices ND and communication paths LN included in the network NW1 are normal (step S1406; Yes), it determines that communication is possible by bypassing the communication path LN that passes through the communication device ND1 to be bypassed (step S1407a). In this case, the execution unit 134 may instruct each communication device ND not to communicate through the communication device ND1 to be bypassed. Using the example in Figure 13, the execution unit 134 may instruct communication devices ND2, ND12, and ND20, which are adjacent to the communication device ND1 to be bypassed, to route their communication flows to other communication devices ND, avoiding the communication device ND1 to be bypassed. The notification unit 135 may also notify the control device 80 that, as a result of the bypass feasibility determination, communication is possible by bypassing the communication path LN that passes through the communication device ND1 to be bypassed.

[0142] On the other hand, if not all communication devices ND and communication paths LN included in network NW1 are functioning normally, that is, if at least one of the communication devices ND and communication paths LN is not functioning normally (step S1406; No), the execution unit 134 determines whether that non-functioning device is only one of the communication paths LN that pass through the communication device ND to be bypassed (step S1407b).

[0143] If the execution unit 134 determines that only one of the communication paths LN that passes through the communication device ND to be bypassed is abnormal (step S1407b; Yes), it determines that communication is possible by bypassing the communication path LN that passes through the communication device ND1 to be bypassed (step S1408b). In this case, the notification unit 135 may notify the control device 80 that, as a result of the bypass feasibility determination, communication is possible by bypassing the communication path LN that passes through the communication device ND1 to be bypassed.

[0144] Here, we will explain a scenario in which only one of the communication paths LN that pass through the communication device ND to be bypassed is not functioning correctly, using Figure 15. Figure 15 is Figure (1) which shows a specific example of determining whether bypassing is possible. Figure 15 shows a scenario in which, among the communication paths LN2, LN12, and LN20 that pass through the communication device ND to be bypassed, only one is not functioning correctly (e.g., there is a problem or work is being done), while the other communication devices ND and communication paths LN are functioning correctly. In this case, where only one of the communication paths LN2, LN12, and LN20 is not functioning correctly, the execution unit 134 determines that communication is possible by bypassing communication paths LN2, LN12, and LN20.

[0145] Furthermore, as shown in the example in Figure 15, if the only result is that the communication path LN (one of communication paths LN2, LN12, or LN20) passing through the communication device ND1 to be bypassed is not functioning correctly, for example, if only communication path LN2 is not functioning correctly, then communication path LN2 may have already been bypassed (referred to as "bypass U1"), but since communication is possible by bypassing communication paths LN12 and LN20 (referred to as "bypass U2"), bypass U1 can be described as an "OK bypass". The expression "OK bypass" is used to mean that even if the communication device ND1 to be bypassed is bypassed, the other communication devices ND and communication paths LN are functioning correctly and no bypass has occurred, and there is no problem with bypassing the communication device ND1 to be bypassed.

[0146] If the execution unit 134 determines that there are at least some abnormalities in addition to the communication path LN that passes through the communication device ND to be bypassed (step S1407b; No), it determines that communication bypassing the communication path LN that passes through the communication device ND1 to be bypassed is impossible (step S1409b).

[0147] Figure 16 illustrates a scenario where at least one abnormal device exists in addition to the communication path LN that passes through the communication device ND targeted for bypassing. Figure 16 is Figure (2) which shows a specific example of determining whether bypassing is possible. Figure 16 shows a scenario where one of the communication devices ND8, ND32, communication path LN21, or communication device LN41 is abnormal (e.g., there is a problem or work is being performed), while the other communication devices ND and communication paths LN are normal. In this way, if the determination includes that one of the communication devices ND other than the communication device ND1 targeted for bypassing, or one of the communication paths LN that does not pass through the communication device ND1 targeted for bypassing, it is determined that communication bypassing the communication path LN that passes through the communication device ND1 targeted for bypassing is impossible.

[0148] Furthermore, as shown in the example in Figure 16, if the determination includes that either a communication device ND other than the communication device ND1 targeted for bypassing, or a communication path LN that does not pass through the communication device ND1 targeted for bypassing, is not functioning correctly, then bypassing (bypass U3) for these deemed abnormal devices may have already been performed. When bypass U3 is occurring, it is not possible to bypass (bypass U4) the communication path LN that passes through the communication device ND1 targeted for bypassing. Therefore, in such situations, bypass U3 can be described as an "NG bypass." For example, if there is a malfunction or other problem with a communication device ND other than the communication device ND1 targeted for bypassing, or with a communication path LN that does not pass through the communication device ND1 targeted for bypassing, bypassing it would increase traffic and potentially exacerbate the impact of the communication failure. Therefore, in such scenarios, the communication path LN that passes through the communication device ND1 targeted for bypassing should not be bypassed; in other words, it is determined that bypassing the communication path LN that passes through the communication device ND1 targeted for bypassing is impossible.

[0149] [9. Other Embodiments] In the above embodiment, the information processing for determining whether or not to bypass was explained using the case where there is only one communication device ND1 to be bypassed as an example. However, if problems occur among multiple communication devices ND at similar timings, the execution device 100 may receive request information corresponding to each of the multiple communication devices ND at similar timings. In such cases, the execution device 100 may perform the above information processing, which was explained for the communication device ND1 to be bypassed, for each communication device ND to be bypassed. Thus, even when it is necessary to perform a determination of whether or not to bypass at the same timing for multiple communication devices ND to be bypassed, the scope of the processing is limited to the adjacent layers for each communication device ND to be bypassed, given the premise that the network NW is redundant.

[0150] [10. Hardware Configuration] The execution device 100 according to the embodiment may be implemented by a computer 1000 having a configuration such as that shown in Figure 17. Figure 17 is a hardware configuration diagram showing an example of a computer that implements the functions of the execution device 100 according to the embodiment. The computer 1000 has a CPU 1100, RAM 1200, ROM 1300, HDD 1400, communication interface (I / F) 1500, input / output interface (I / F) 1600, and media interface (I / F) 1700.

[0151] The CPU 1100 operates based on programs stored in the ROM 1300 or HDD 1400, controlling various components. The ROM 1300 stores boot programs executed by the CPU 1100 when the computer 1000 starts up, as well as programs that depend on the computer 1000's hardware.

[0152] The HDD1400 stores programs executed by the CPU1100, as well as data used by such programs. The communication interface1500 receives data from other devices via a predetermined communication network and sends it to the CPU1100, and transmits data generated by the CPU1100 to other devices via the predetermined communication network.

[0153] The CPU 1100 controls output devices such as displays and input devices such as keyboards via the input / output interface 1600. The CPU 1100 acquires data from input devices via the input / output interface 1600. The CPU 1100 also outputs the generated data to output devices via the input / output interface 1600.

[0154] The media interface 1700 reads a program or data stored in the recording medium 1800 and provides it to the CPU 1100 via the RAM 1200. The CPU 1100 loads the program from the recording medium 1800 onto the RAM 1200 via the media interface 1700 and executes the loaded program. The recording medium 1800 is, for example, an optical recording medium such as a DVD (Digital Versatile Disc) or PD (Phase Change Rewritable Disk), a magneto-optical recording medium such as an MO (Magneto-Optical disk), a tape medium, a magnetic recording medium, or a semiconductor memory.

[0155] For example, when computer 1000 functions as an execution device 100 according to the embodiment, the CPU 1100 of computer 1000 realizes the functions of the control unit 130 by executing a program loaded on RAM 1200. The CPU 1100 of computer 1000 reads and executes these programs from the recording medium 1800, but as another example, these programs may be obtained from other devices via a predetermined communication network.

[0156] [11. Other] Furthermore, among the processes described in each of the above embodiments, all or part of the processes described as being performed automatically can be performed manually, or all or part of the processes described as being performed manually can be performed automatically by known methods. In addition, the processing procedures, specific names, and information including various data and parameters shown in the above document and drawings can be changed at will unless otherwise specified. For example, the various information shown in each figure is not limited to the information shown.

[0157] Furthermore, the components of each illustrated device are functionally conceptual and do not necessarily need to be physically configured as shown. In other words, the specific forms of distribution and integration of each device are not limited to those shown, and all or part of them can be functionally or physically distributed and integrated in any unit according to various loads and usage conditions.

[0158] Furthermore, the above embodiments can be combined as appropriate, provided that the processing content is not contradictory.

[0159] Although some embodiments of the present application have been described in detail above with reference to the drawings, these are illustrative examples, and the present invention can be implemented in various other forms with modifications and improvements based on the knowledge of those skilled in the art, including the embodiments described in the section on the present invention. [Explanation of Symbols]

[0160] Sy Information Processing System 20 Alarm Management Systems 40 Log Collection System 60 Work Management Systems 80 Control device 100 Execution Units 120 databases 130 Control Unit 131 Acquisition Department 132 Reception Department 133 Search Department 134 Execution Unit 135 Notification Department

Claims

1. An acquisition unit that acquires real-time status information in a network configured in which multiple communication devices are connected in a hierarchical structure, The aforementioned hierarchical structure is a network structure in which each of the multiple communication devices is connected in layers according to the network topology. The hierarchical structure information includes topology information for each of the multiple communication devices. A search unit searches for other communication devices among the plurality of communication devices that are located in a position related to the target communication device, and that belong to a hierarchy that has a predetermined relationship with the hierarchy to which the target communication device belongs, based on the topology information. An execution unit performs a bypass feasibility determination, which determines whether communication is possible by bypassing the communication path that passes through the target communication device, based on the status information in the network within a part of the hierarchical structure that includes the target communication device and the other communication devices in the aforementioned hierarchical structure, Equipped with, The search unit, As the other communication device, a first other communication device belonging to the same hierarchy as the target communication device is searched for among the plurality of communication devices. As the other communication devices, a second other communication device adjacent to the target communication device and each of the first other communication devices is searched for from among the plurality of communication devices. For each of the layers to which the target communication device, the first other communication device, and the second other communication device belong, a third other communication device belonging to that layer is searched for as the other communication device. Information processing device.

2. The search unit further uses the pairing information between communication devices related to the target communication device to search for the first other communication device. The information processing apparatus according to claim 1.

3. The search unit searches for communication devices that are adjacent to each other among the third other communication devices, and includes the information of the adjacent relationships in the search results. The information processing apparatus according to claim 1.

4. The execution unit determines the normality of each of the communication devices to be determined, based on the status information of each of the first, second, and third communication devices, with each of them being a communication device to be determined. The information processing apparatus according to claim 3.

5. The execution unit determines the normality of each communication path based on the status information of each communication path connected to the communication device to be judged. The information processing apparatus according to claim 4.

6. If the execution unit obtains a result indicating that both the communication device and the communication path being judged are normal, it determines that communication is possible by bypassing the communication path that passes through the target communication device. The information processing apparatus according to claim 5.

7. If the execution unit determines, as a result of the normality determination, that at least one of the communication devices and communication paths being determined is not normal, it determines that communication bypassing the communication path passing through the target communication device is impossible. The information processing apparatus according to claim 5.

8. The execution unit determines that if the determination result of "not normal" is solely based on the determination that the communication path via the target communication device is not normal, then communication is possible by bypassing the communication path via the target communication device. The information processing apparatus according to claim 7.

9. An acquisition unit that acquires real-time status information in a network configured in which multiple communication devices are connected in a hierarchical structure, A search unit searches for all communication devices among the plurality of communication devices that are located in a position related to the target communication device, including all communication devices belonging to the belonging layer, which is the hierarchical structure to which the target communication device belongs, and all communication devices belonging to the adjacent layer, which is the hierarchical structure adjacent to the belonging layer, based on the information of the hierarchical structure. An execution unit performs a bypass feasibility determination, which determines whether communication is possible by bypassing the communication path that passes through the target communication device, based on the status information in the network portion of the network corresponding to the range from the affiliated layer to the adjacent layer within the aforementioned hierarchical structure. An information processing device equipped with the following features.

10. An information processing method performed by an information processing device, A process for acquiring real-time status information in a network configured by connecting multiple communication devices in a hierarchical structure, The aforementioned hierarchical structure is a network structure in which each of the multiple communication devices is connected in layers according to the network topology. The hierarchical structure information includes topology information for each of the multiple communication devices. A search step is performed to search for other communication devices among the plurality of communication devices that are located in a position related to the target communication device, and that belong to a hierarchy that has a predetermined relationship with the hierarchy to which the target communication device belongs, based on the topology information. An execution step of performing a bypass feasibility determination, which determines whether communication is possible by bypassing the communication path that passes through the target communication device, based on the status information in the network within a part of the hierarchical structure that includes the target communication device and the other communication devices, Includes, The aforementioned search process is: As the other communication device, a first other communication device belonging to the same hierarchy as the target communication device is searched for among the plurality of communication devices. As the other communication devices, a second other communication device adjacent to the target communication device and each of the first other communication devices is searched for from among the plurality of communication devices. For each of the layers to which the target communication device, the first other communication device, and the second other communication device belong, a third other communication device belonging to that layer is searched for as the other communication device. Information processing methods.

11. An information processing method performed by an information processing device, A process for acquiring real-time status information in a network configured by connecting multiple communication devices in a hierarchical structure, A search step is performed to search for all communication devices among the plurality of communication devices that are located in a position related to the target communication device, including all communication devices belonging to the belonging layer, which is the hierarchical structure to which the target communication device belongs, and all communication devices belonging to the adjacent layer, which is the hierarchical structure adjacent to the belonging layer, based on the information of the hierarchical structure. An execution step of determining whether or not it is possible to bypass the communication path that passes through the target communication device, based on the status information in the part of the network corresponding to the range from the affiliated layer to the adjacent layer within the aforementioned hierarchical structure, Information processing methods including

12. A procedure for acquiring real-time status information in a network configured by connecting multiple communication devices in a hierarchical structure, The aforementioned hierarchical structure is a network structure in which each of the multiple communication devices is connected in layers according to the network topology. The hierarchical structure information includes topology information for each of the multiple communication devices. A search procedure that searches for other communication devices among the plurality of communication devices that are located in a position related to the target communication device, and that belong to a hierarchy that has a predetermined relationship with the hierarchy to which the target communication device belongs, based on the topology information; An execution procedure for performing a bypass feasibility determination, which determines whether communication is possible by bypassing the communication path that passes through the target communication device, based on the status information in the network within a part of the hierarchical structure that includes the target communication device and the other communication devices, Have the computer run it, The aforementioned search procedure is: As the other communication device, a first other communication device belonging to the same hierarchy as the target communication device is searched for among the plurality of communication devices. As the other communication devices, a second other communication device adjacent to the target communication device and each of the first other communication devices is searched for from among the plurality of communication devices. For each of the layers to which the target communication device, the first other communication device, and the second other communication device belong, a third other communication device belonging to that layer is searched for as the other communication device. Information processing program.

13. A procedure for acquiring real-time status information in a network configured by connecting multiple communication devices in a hierarchical structure, A search procedure that searches for all communication devices among the plurality of communication devices that are located in a position related to the target communication device, including all communication devices belonging to the belonging layer, which is the hierarchical structure to which the target communication device belongs, and all communication devices belonging to the adjacent layer, which is the hierarchical structure adjacent to the belonging layer, based on the information of the hierarchical structure. An execution procedure for performing a bypass feasibility determination, which determines whether communication is possible by bypassing the communication path that passes through the target communication device, based on the state information in the part of the network corresponding to the range from the affiliated layer to the adjacent layer within the aforementioned hierarchical structure, An information processing program that causes a computer to execute something.

Images