JP6269238B2 - Network management method, network management system, and network management apparatus - Google Patents

Description

  The present invention relates to path management in a network.

  For example, in a network including a plurality of nodes, such as a mesh network, even if one node or link fails, the link between other nodes is not affected. high.

  Known network monitoring systems include a lower monitoring device and a higher monitoring device. The lower monitoring apparatus includes a route inquiry unit that makes a route inquiry to each device connected to a predetermined server, a network monitor unit that monitors a response result to the route inquiry, and a network management database that stores the response result as route information And. If the previously stored path information is different from the path information of the response result, the upper monitoring apparatus receives the path change information from the lower monitoring apparatus that transmits the path change information and stores the change information. It has a host network management database. The host monitoring device further calculates the route change information stored in the host network management database from the plurality of lower monitoring devices, and if the calculation result exceeds a predetermined reference value, the relationship of the route exceeding the reference value is calculated. A data control unit for outputting information is provided. As a result, the network monitoring system can know the connection status of multiple routes connecting each device to be inspected, especially between the server and the client terminal, grasp the operating status of the system, and prevent serious failures in advance. .

  A known dynamic route control method estimates a link in which congestion is most likely to occur in a network, and sets a congestion monitoring point in a switch constituting the link. In the dynamic route control method, an optimum route and a route when the link is disconnected are calculated in advance, and these routing tables are distributed and arranged in each node. The congestion notification is performed by a network manager in the case of a packet network, and is performed by a congestion notification cell in the case of an ATM network. Thereby, even if the number of nodes in the network increases, the dynamic route control method can perform optimal route control within an allowable time.

JP 2006-148376 A JP-A-9-270801

  In a network, when a route is suddenly switched during network work or construction, a packet loss may occur on the route through which the packet is transmitted, which may affect the communication service.

  The inventors have recognized that it is desirable to minimize the impact on communication and reduce the processing load of network control when performing network work.

In one aspect, an object of the present invention is to suppress an influence on communication in switching a communication path.
In another aspect, an object of the present invention is to suppress the processing load of network control in switching communication paths.

According to one aspect of the embodiment, information on a plurality of routes including node devices from each ingress node device to an egress node device is managed, and based on information on three or more operations each including stopping of the node device. , One or more operations including stoppage of node devices not included in any of the plurality of routes are assigned to a first time zone that is one time zone, and the node devices included in any of the plurality of routes Two or more operations including a stop are assigned to a second time zone which is one time zone after the first time zone, and the node device is stopped in the work assigned to the second time zone. A process of determining a plurality of routes including node devices from each ingress node device to an egress node device so as not to include any of them, and resetting the determined plurality of routes before the second time zone The network management method to be executed by the information processing apparatus is provided.

  According to the embodiment, in switching the communication path, it is possible to suppress the influence on communication and to suppress the processing load of network control.

FIG. 1 shows an example of a network to which a server device for network management and a communication device are connected according to the embodiment. FIG. 2 shows an example of a schematic configuration of the server device. FIG. 3 shows an example of a schematic configuration of the processor of the server device. FIG. 4 shows an example of the link cost value between a plurality of nodes of the network before the path switching before the work. FIG. 5 shows an example of a flowchart of processing executed by the server device for optimizing the work sequence of the network and obtaining a switching destination route for detouring the route affected by the work and applying it to the network. ing. FIG. 6 shows an example of a route management table before route switching before work. FIG. 7 shows an example of a work management table before the work order is optimized. FIG. 8 shows an example of a table indicating the presence or absence of the influence of each work on a plurality of routes. FIG. 9 shows an example of an optimized work order table. FIG. 10 shows an example of a work management table obtained by changing the work order of the work management table of FIG. FIG. 11 shows an example of a specific flowchart of step 516 in FIG. FIG. 12 shows an example of a cost value after change between a plurality of nodes in the network of FIG. FIG. 13 shows an example of an application route table as a switching destination route for each route including a stop node. FIG. 14 shows an example of a path management table after path switching.

The objects and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims.
It is understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not intended to limit the invention.

  Non-limiting embodiments of the present invention will be described with reference to the drawings. In the drawings, similar components and elements have the same reference numerals.

  In a mesh network, even if one node or link fails, the other nodes or other links are not affected, so that it is easy to form a detour path or detour path or route, and has high fault tolerance. Therefore, the mesh type network tends to obtain high user trust and tends to be preferred by the user. However, since the mesh network includes a large number of nodes and a large number of links, it is costly for the communication carrier to operate, maintain and manage the mesh network.

  In a mesh network, when a failure or failure occurs in a link with the next node on the route, each node automatically searches for and forms a bypass route if there is another available link. Self-healing. However, in this case, packet loss (loss) may occur when the path is switched. On the other hand, when performing network work or construction, if a work section or a construction section route is suddenly switched or stopped, a packet loss may occur as well. Such packet loss causes a reduction in the quality of the communication service.

  The inventors set the path switching in advance using the work management function of the network operation system so that packet loss does not occur at the time of path switching when switching the path on the network due to scheduled work or construction. I realized that it was desirable. In addition, the inventors have recognized that, when a route on a network is switched due to scheduled work or construction, the influence on the communication service can be suppressed by setting the route switching in advance. In addition, the inventors can suppress the processing load of network control by optimizing the switching procedure and minimizing the number of times of switching when switching the route on the network for scheduled work or construction. Recognized that it was possible.

  The network operation system includes a work management function for managing work schedules for the network. The inventors have recognized that route switching for scheduled network work or construction can be preset using an improved work management function. In addition, the inventors have recognized that the improved work management function can be used to confirm the effect of planned network work or construction on path switching communication services. Furthermore, the inventors can use the improved work management function to minimize the number of scheduled network work or route switching for construction, thereby enabling the network using the work management function. Recognized that the processing load for control can be minimized.

  An object of the embodiment is to be able to preset route switching due to planned network work or construction. Another object of the embodiment is to make it possible to confirm the influence of the path switching on the communication service due to the planned network operation or construction. Yet another object of the embodiment is to minimize the number of times of route switching due to planned network work or construction, thereby minimizing the processing load in network control. These objects can be achieved by the embodiments.

  FIG. 1 shows an example of a network 5 to which a server device 20 for network management and communication devices 32 and 42 are connected according to the embodiment. In this case, the network 5 may be a mesh type network.

  In FIG. 1, a network 5 includes a plurality of nodes or node devices A to J52 and a plurality of links 54 connected between the nodes A to J52. The node 52 and the link 54 include a main node and a main link that are normally used, and may further include a backup node and a link used for a failure or work or construction. The setting of the main node and the main link, and the backup node and the backup link can be determined by the cost value of each link.

  A terminal device and / or a server device may be connected to a certain node among the plurality of nodes 52 via respective communication devices. For example, the terminal device 30 may be connected to the node A 52 via the communication device 32, and the server device 40 such as a web server may be connected to the node D 52 via the communication device 42. For example, the terminal device 30 communicates with the server device 40 via the communication device 32, a series of nodes 52 and links 54 from the start node or entry node A 52 to the end node or exit node D 52, and the communication device 42. Data may be sent and received. In this case, the series of nodes 52 and links 54 include relay nodes or intermediate nodes B and C.

  The nodes A to J52 include, for example, a layer 2 (data link layer) switch and / or a layer 3 (network layer) switch of the OSI reference model as node equipment (node equipment). The layer 2 switch is a device that stores a destination MAC address and a port of a communication partner in association with each other and transfers a frame, and may be a switching hub, for example. In addition to the function of the layer 2 switch, the layer 3 switch is an apparatus that associates an IP address with a port, and forwards a packet using a layer 3 protocol such as IP based on the IP address. The layer 3 switch may be, for example, an IP switch, a multilayer switch, or a routing switch.

  Further, one or more work management server apparatuses 10 are connected to the server apparatus 20 via a LAN (local area network) or a dedicated line. Further, the server device 20 for operation and management is connected to the node device 52 and the like via a dedicated communication path of an out-of-band network different from the network 5.

  The network operator registers, for example, work management information scheduled for future construction work in the server device 20 using the work management system on the work management server device 10. The server device 20 is an information processing device, a network management device, or a network management system, and is used by the operator to operate and manage the network 5. For example, the server device 20 monitors, controls, and manages the plurality of nodes 52 and the plurality of links 54 based on the work management information registered by the work management server device 10. The administrator manages network configuration information and all communication path (path, route) information on the network 5 by using a network operation management system implemented on the server device 20. The communication route information includes information on the current route and the priority route or the default route. The network operation management system can determine the switching destination path or the switching path by optimizing the work order in cooperation with the work management system on the work management server apparatus 10 having the future work information.

  FIG. 2 shows an example of a schematic configuration of the server device 20.

  The server device 20 includes, for example, a processor 202, a storage unit 204, a communication unit 210, an input unit 222, a display unit 224, and an acoustic unit 226. The server device 20 can be connected to an external drive 332.

  The processor 202 may be a CPU (Central Processing Unit) for a computer. The storage unit 204 includes a main storage device and an auxiliary storage device. The main storage device includes a storage device such as a semiconductor memory. The auxiliary storage device includes, for example, a hard disk drive (HDD) and / or a semiconductor memory such as a flash memory. The drive 332 may be for reading a recording medium 334 such as an optical disk or a magnetic disk in which software is recorded. The software may include, for example, an OS, a database management system (DBMS), an application program, and the like. The application program may include an application for a network operation management system.

  The processor 202 may be a dedicated processor implemented as an integrated circuit, for example. Further, the processor 202 may operate according to an application program stored in the storage unit 204. The application program may be stored in the recording medium 334, read from the recording medium 334 by the drive 332, and installed in the server device 20.

  The input unit 222 may include, for example, a plurality of keys, a touch pad, a numeric keypad, a keyboard, a touch panel, and / or a pointing device. The display unit 224 may be, for example, a liquid crystal display device or a liquid crystal display device with a touch panel. The acoustic unit 226 may include a speaker, for example.

  FIG. 3 shows an example of a schematic configuration of the processor 202 of the server device 20.

  The processor 202 includes a control unit 2020, an application unit 2024, an information collection management unit 2030, a priority route calculation unit 2032, a work optimization unit 2034, a switching route calculation unit 2036, a route application unit 2038, a bandwidth control unit 2040, and other processing. Part 2050 is included. The control unit 2020 supplies control signals to the application unit 2024, the information collection management unit 2030, the priority route calculation unit 2032, the work optimization unit 2034, the switching route calculation unit 2036, and the route application unit 2038. The operation may be controlled. The control unit 2020 may further supply control signals to the band control unit 2040 and the processing unit 2050 to control operations of these elements.

  The storage unit 204 includes, for example, a route information management database, a work information database, and an application route database (not shown).

  The route information management database includes a route management table for managing routes on the network 5. The route management table includes, as communication route information, fields of route name or route identification information, identification information of a start or entry node device, identification information of a termination or exit node device, and information related to the route node device. The information regarding the route node device includes information on the current route and the priority route. Each of the current route and the priority route includes identification information of a series of node devices from the start node device to the end node device forming the current route or the priority route, respectively. The node device identification information (NEID) may be a value such as “0001”, “0002”, and “000A”, for example.

  The work information database includes a work management table including work information registered by the work management system of the server device 10 and an optimized work order table. The work management table includes fields of work name or work identification information, work start date and time, work end date and time, and stop node device identification information as work management information. The optimized work order table includes fields of work name or work identification information, work date, presence / absence of influence on a route, and work order.

  The application route database includes an application route table obtained by calculating the cost value of the network 5. The application route table includes the route name or route identification information, the identification information of the start or entry node device, the identification information of the termination or exit node device, the identification information of the stop node device, and the application route information as the application route information of each work day. , And application date and time fields. The application path information includes identification information of a series of node devices from the start node to the end node forming the application path.

  The information collection management unit 2030 collects network configuration information from all the node devices 52 via a dedicated communication path, and saves and manages it in the database of the storage unit 204. The network configuration information includes, for example, routing information, interface information, and LSA information (Link-State Advertisement, link state information) of each node. The routing information includes the IP address of the opposite node device ahead of the port. The LSA information includes, as link information, the number of links (number of connections), the interface IP address of each link (not including port information), and a cost value. The interface information includes an IP address corresponding to each port.

  Based on the network configuration information, the priority route calculation unit 2032 sums a series of cost values of one or more possible routes between a specific start node device and a specific end node device of each registered route name. Calculate The priority route calculation unit 2032 sets, for each route name, one route having a minimum total cost value as a priority route, and sets a series of node devices from the start node device to the end node device via the relay node device. Identification information (NEID) is stored in the route management table. Further, the priority route calculation unit 2032 normally stores identification information of a series of node devices of the priority route of each route name currently applied to the network 5 as a current route in the route management table. On the other hand, when a failure or failure occurs in any node device 52 or link 54 of the network 5, the current route of a certain route name may be changed from a priority route to a detour route.

  The work optimization unit 2034 optimizes the work order for each day based on the work information in the work management table and the priority route information in the route management table, and presents the optimized work order on the display unit 224. To do. For this purpose, the work optimization unit 2034 checks whether or not there is a node device scheduled to stop in each path, and determines whether or not there is an influence of work on each path. Furthermore, the work optimization unit 2034 optimizes or changes the daily work order according to whether there is an influence on the route, and stores the optimized work order in the optimized work order table.

  The switching route calculation unit 2036 does not have to calculate the switching destination route when there is no route affected by each work in the daily work order. On the other hand, when there is a path affected by each work in the daily work order, the switching path calculation unit 2036 calculates, as a cost value of the link of the stop node device in the path affected by the work, A cost value higher than other cost values around is temporarily used. Next, the switching route calculation unit 2036 re-calculates the total cost value of the link between a series of node devices that can be applied routes from the specific start node device to the specific end node device of each route name. calculate. The switching route calculation unit 2036 stores, in the application route table, one route that minimizes the total recalculated cost value for each route name as the application route in the work period. Here, the path is represented by identification information of a series of node devices from a specific start node device to a specific end node device. When applied to the network 5, the application route is an alternative detour route for the priority route that is affected by the work in each one-day work period.

  The route application unit 2038 actually sets the high cost value temporarily used by the switching route calculation unit 2036 to the adjacent link 54 of each node device 52 in order to apply the application route to the network 5. The actually set cost value is considered to be different for each network, and the administrator may predetermine a high cost value after changing to the adjacent link of each node device 52.

  The route application unit 2038 can apply the switching destination route to the network 5 as an application route all at once before the start of the work period. Further, the route application unit 2038 can reapply the priority route to the network 5 and return it to the priority route after the work period ends. As an alternative, the route application unit 2038 switches, for each route affected by one or more tasks per day, the current route from the preferred route to the switch destination route before the start of the one or more tasks, The switching destination route may be switched to the original priority route after completion of the one or more operations. Accordingly, in one day's work, it is possible to prevent one route affected by one or more tasks from being switched over and over again from one detour route to another. Accordingly, the processing load of the switching route calculation unit 2036 for calculating the detour route is reduced, and the processing load of the route application unit 2038 is also reduced. This also prevents the node device 52 or the link from being suddenly cut off during the work, enables path switching without packet loss, and prevents deterioration in the quality of communication services.

  When each path is switched before and after the work, the bandwidth control unit 2040 determines the link of each link according to the communication load or communication status of each link of the switch destination path based on the variable transmission bandwidth of each link. Increase or decrease the transmission bandwidth.

  FIG. 4 shows an example of the link cost value 62 between the plurality of node devices A to L52 of the network 5 before the path switching before the work.

  In FIG. 4, for example, each link or path between nodes A-B, B-C, C-D, BF, FG, C-J, and HI. The cost value 62 is a value “1”. Further, for example, the cost value 62 of the link or path between the nodes A and H is the value “5”. For example, the series of node devices 52 in which the total of the cost values 62 of the links between the series of nodes 52 from the start node A to the end node D is the minimum in this case are node devices A-B-C-D. Accordingly, the priority path from the start node A to the end node D is the node device A-B-C-D. Here, the node devices B and C are the relay node devices 52.

  Next, the operation or processing of the server device 20 for optimizing the work order for the network 5 will be described.

  FIG. 5 is a flowchart of processing executed by the server device 20 for optimizing the work order of the network 5 and obtaining a switching destination route for detouring the route affected by the work and applying it to the network 5. An example is shown. This process is executed before the work of the network 5.

  Referring to FIG. 5, in step 502, the processor 202 (or its information collection management unit 2030) acquires communication path information from the path management table in the storage unit 204. The processor 202 (information collection management unit 2030) further acquires or collects network configuration information from the database in each node device 52 and / or the storage unit 204 of the network 5.

  In step 504, the processor 202 (or its priority route calculation unit 2032) calculates or obtains a priority route from the start node device to the end node device of each route for each route name of the registered communication route information. . For this purpose, the processor 202 (priority route calculation unit 2032) first sets a series of cost values on each route that may be a preferred route between the start node device and the end node device based on the network configuration information. Find the sum of Next, the processor 202 (priority route calculation unit 2032) determines, as a priority route, a route having a minimum total of a series of cost values from the start node device to the end node device, and identification information of the node device of the priority route Are stored in the route management table.

  For example, the total cost value (62) of the possible path node devices A-B-C-D between the start node device A and the end node device D in FIG. 4 is “3”. On the other hand, for example, the total of the cost values (62) of other possible path node devices A-E-F-G-D between the start node device A and the end node device D is large at “4”. Accordingly, the path node device A-B-C-D having a small total cost value is given higher priority.

  Further, the processor 202 (priority route calculation unit 2032) stores the identification information of the node device of the current route in the network 5 in the route management table. At this stage, the current route matches the preferred route.

  FIG. 6 shows an example of a route management table before route switching before work.

  In the path management table of FIG. 6, the start node apparatus A and the end node apparatus D are registered in the path name PATH_1, and the start node apparatus A and the end node apparatus G are registered in the path name PATH_2. Further, the start node device A and the end node device J are registered in the path name PATH_3, and the start node device A and the end node device I are registered in the path name PATH_4.

  In the route management table of FIG. 6, the priority route between the start node A and the end node D of the route name PATH_1 of the network 5 of FIG. 4 is the route node device “whose total cost value on the route is the minimum (3)” A-B-C-D ". The priority route between the start node device A and the end node device G of the route name PATH_2 is the route node device “A-B-F-G” whose total cost value on the route is the minimum (3). . Further, the priority route between the start node device A and the end node device J of the route name PATH_3 is the route node device “ABCJ” whose total cost value on the route is the minimum (3). . In addition, the priority route between the start node device A and the end node device I of the route name PATH_4 is the route node device “AHI” whose total cost value on the route is the minimum (6). In the route management table of FIG. 6, the current routes of the route names PATH_1 to PATH_4 coincide with the respective priority routes, that is, the priority route is applied to the network 5.

  Referring back to FIG. 5, in step 506, the processor 202 (or its work optimization unit 2034) determines the work order of the work management table in the form described below based on the priority route of the route management table. Perform optimization.

  FIG. 7 shows an example of a work management table before the work order is optimized.

  In FIG. 7, the work management table includes, as work management information, fields of network construction work name or work identification information, work start date and time, end date and time, and stop node device identification information (ID). For example, for the work name a, the work start date and time is December 1, 2013, 10:00, the work end date and time is December 1, 2013, 13:00, and the identification information of the stop node device is “B”. is there. For example, for the work name b, the work start date and time is 11:00 on December 1, 2013, the work end date and time is 12:00 on December 1, 2013, and the identification information of the stop node device is “E ".

  In order to optimize the work order, the processor 202 (work optimization unit 2034) is stopped at the work of the work management table as shown in FIG. 7, for example, in each priority route of the route management table as shown in FIG. It is determined whether there is a node device to be scheduled. Each task is determined as “has an effect on the route” when it affects one or more routes, and is determined as “no effect on the route” when it does not affect any route at all. The In general, since one day's work is performed on some node devices 52 of the network 5, there are work that does not affect the route and work that affects the route. Next, the processor 202 (work optimizing unit 2034) stores the determination result in a table on the presence / absence of work influence on the route.

  FIG. 8 shows an example of a table of presence / absence of the influence of each work on the plurality of paths PATH_1 to PATH_4, which is created by the processor 202 (work optimization unit 2034). Next, FIG. 8 will be described.

  For example, in the work management table of FIG. 7, the work a includes the stop node apparatus B, and therefore affects the paths PATH_1, PATH_2, and PATH_3 including the stop node apparatus B in the path management table of FIG. Therefore, in the table of presence / absence of work influence on the route in FIG. 8, for the work a, the route names PATH_1, PATH_2, and PATH_3 are recorded as “influenced”, and the route name PATH_4 is recorded as “no influence”.

  Further, although the operation b includes the stop node device E, since there is no route including the stop node device E in the route management table of FIG. 6, it does not affect any route. Therefore, in the table of the presence / absence of the influence of work on the route in FIG. 8, the route names PATH_1 to PATH_4 are recorded as “no influence” for the work b.

  Further, the operation c includes the stop node device C, and therefore affects the route names PATH_1 and PATH_3 including the stop node device C in the route management table of FIG. 6, but does not include the stop node device C. It does not affect PATH_2 and PATH_4. Therefore, in the table of presence / absence of the influence of work on the route in FIG. 8, the route names PATH_1 and PATH_3 are recorded as “influenced” and the route names PATH_2 and PATH_4 are recorded as “no influence” for the operation c.

  Further, the operation d includes the stop node apparatus F, and thus affects the path name PATH_2 including the stop node apparatus F in the path management table of FIG. 6, but does not include the stop node apparatus F. PATH_3 and PATH_4 are not affected. Therefore, in the table of presence / absence of work influence on the route in FIG. 8, the route name PATH_2 is recorded as “influenced” and the route names PATH_1, PATH_3, and PATH_4 are recorded as “no effect” for the operation d.

  Next, the processor 202 (work optimization unit 2034) performs work that does not affect the route in the first time period for the work order for one day in the work management table, and performs work that affects the route thereafter. The work order is re-determined or rearranged in the form performed in the second time zone. Here, the first time zone and the second time zone are selected so as to be separated from each other in time and do not overlap. Thereby, for example, the work order of the work management table as shown in FIG. 7 is optimized, and an optimized work order table (eg, FIG. 9) is formed.

  FIG. 9 shows an example of an optimized work order table.

  The processor 202 (work optimizing unit 2034) assigns a work order to the work for one day in the table of FIG. 8 in such a form that the work without influence is executed first and the remaining work is executed thereafter. 9 is displayed on the display unit 224. In FIG. 9, the work sequence number (1) is assigned to the work (b) that does not affect the route in ascending order, and then the remaining work (a, c, d) that affects the route is assigned to the work order number (1). The next work order number (2, 3, 4) is assigned in ascending order. Thereby, work that does not affect the route is assigned to the first time zone of the day with a relatively small work sequence number, and work that affects the route is assigned to the day with a relatively large work sequence number. Assigned to the second time zone. At this stage, the specific time ranges of the first time zone and the second time zone are not determined.

  Whether the operator actually changes the work order (FIG. 7) or not according to the optimized work order by referring to the optimized work order table as shown in FIG. 9 on the display unit 224. Are selected and input by the input unit 222. Therefore, the processor 202 (work optimization unit 2034) may display the buttons “change work order” and “do not change work order” on the screen of the display unit 224 and allow the operator to select them. The reason why the person determines whether or not to actually change the work order (FIG. 7) in this way is, for example, that it is not desirable to change the work order for reasons such as the cooperation of a plurality of works. Because.

  Referring to FIG. 5 again, in step 510, the processor 202 (work optimization unit 2034) determines whether there is a change in the work order. If the change of work order is selected, the procedure proceeds to step 512. On the other hand, if there is no change in the work order in the optimized work order table as shown in FIG. 9 or it is selected not to change the work order, the procedure exits the routine of FIG.

  In step 512, the processor 202 (work optimization unit 2034) changes or adjusts the work start time and end time (FIG. 7) according to the operator's input. The change or adjustment is performed in such a manner that there is no overlap between the first time zone for work that does not affect the route and the second time zone for work that affects the route. Is called. At that time, the processor 202 (work optimization unit 2034) sets the start time and end time of the second time zone of “work affecting the route” according to the operation of the operator as “work that does not affect the route”. It may be changed or assigned to be later than the first time zone. Further, the processor 202 (work optimization unit 2034) sets the start time and end time of the first time zone of “work that does not affect the route” according to the operation of the operator as “work that affects the route”. It may be changed or assigned to be before the second time period. This prevents a time overlap between the first time zone of “work that does not affect the route” and the second time zone of “work that affects the route”. In addition, when a detour route is formed due to an increase in cost value, it is prevented that the cost value is unnecessarily increased on a route that is not affected by the work, and the quality of communication service is reduced due to the increase in cost value. Can be prevented.

  The screen of the work management table (FIG. 7) displayed on the display unit 224 is displayed for changing or adjusting the start time and end time of the work described above. On the screen of the work management table, the processor 202 (work optimizing unit 2034) starts and ends “work that affects the route” within or before the “work that does not affect the route” time zone. The time may be highlighted with a first color (dashed frame). The first color may be red, for example. Further, the processor 202 (work optimization unit 2034) sets the start time and end time of the “work that does not affect the route” within the time zone of “work that affects the route” or after that as the second time. It may be highlighted with a color (broken line frame). The second color may be blue, for example. Thereafter, the processor 202 (work optimizing unit 2034) ends the highlight display of the start time and end time of “work that affects the route” changed after the “work that does not affect the route” time zone. May be. In addition, the processor 202 (work optimization unit 2034) highlights the start time and end time of “work that does not affect the route” changed before the “work that affects the route” time zone. You may end.

  FIG. 10 shows an example of a work management table obtained by changing the work order of the work management table of FIG.

  The processor 202 (work optimization unit 2034) changes the work management table in FIG. 7 according to the operation of the operator as described above, and as a result, forms a work management table after the change as shown in FIG. 10, for example. In FIG. 10, the start time “10 o'clock” and the end time “13 o'clock” of work a that affects the route in FIG. 7 are the time zone (11:00 to 12:00) of work b that does not affect the route. The times are changed to “13:00” and “15:00” after the latest end time “12:00”. Alternatively and / or additionally, the start time “11 o'clock” and end time “12 o'clock” of operation b that does not affect the route in FIG. 7 are the times of operations a, c, and d that affect the route. It may be changed to “8 o'clock” and “9 o'clock” before the band (10 o'clock to 17 o'clock) or the earliest start time “10 o'clock”.

  The processor 202 (the work optimization unit 2034) sets the work start time in a form in which the time zone of “all work that does not affect the route” is before the time zone of “all work that affects the route”. If the end time is not changed, a warning may be generated and displayed on the display unit 224. In this case, the processor 202 (work optimization unit 2034) may not execute the process of the next step 516 as long as the warning continues.

  In step 516, the processor 202 (or its switching path calculation unit 2036) obtains a switching destination path as a bypass path by calculation when the changed work management table as shown in FIG. 10 is applied to the network 5. . Therefore, the processor 202 (switching route calculation unit 2036) calculates the cost value 62 of the link 54 adjacent to the stop node device 52 on the route affected by the work to a value higher than the other surrounding cost values 62 in the calculation. Change temporarily.

  Further, the processor 202 (switching route calculation unit 2036) sets the switching destination route as the application route instead of the priority route affected by the work, and the cost value (62) on the route that may become the switching destination route. Obtained by calculating the total. In this case, the application route is selected so as not to include the stop node device in the priority route that is affected by the work assigned in the second time zone. Therefore, the processor 202 (switching path calculation unit 2036) switches the cost so that the sum of the cost values between a series of node devices from the starting node device to the ending node device in the path is minimized, as in step 504. The previous route is determined as the applicable route. The switching destination path can bypass all the stop node devices on the priority path when the currently applied priority path is switched all at once. Next, the processor 202 (switching route calculation unit 2036) stores the identification information of a series of node devices of the determined application route in the application route table of the application route database in the storage unit 204.

  FIG. 11 shows an example of a specific flowchart of step 516 in FIG.

  Referring to FIG. 11, in step 602, the processor 202 (switching path calculation unit 2036) determines whether or not there is a work schedule that affects the path in the work management table as shown in FIG. 10. If it is determined that there is no scheduled work affecting the route, the procedure proceeds to step 612. If it is determined that there is a work schedule that affects the route, the procedure proceeds to step 604.

  In step 612, the processor 202 (switching path calculation unit 2036) maintains the current cost value 62 of the network 5, maintains the work management table as shown in FIG. 7 without changing, and does not obtain a switching destination path. . Thereafter, the procedure exits the routine of FIG.

  In step 604, the processor 202 (switching path calculation unit 2036) calculates the cost value 62 of the adjacent link 54 of the stop node device 52 (for example, B, C, F) in the path affected by the work, Increase temporarily.

  FIG. 12 shows an example of the cost value 62 after the change between the plurality of node devices A to L52 of the network 5 of FIG.

  In the network 5 of FIG. 12, the cost values “1”, “3”, “5”, and “10” of the adjacent links 54 of the node apparatuses B, C, and F affected by the work in FIG. The cost value is changed to “50”.

  In step 606, the processor 202 (switching path calculation unit 2036) determines the switching destination path between the start node and the end node for the paths PATH_1 to PATH_4 in the path management table (FIG. 6) based on the changed network information. Calculate by calculation. Here, the network information includes a cost value. Therefore, the processor 202 (switching path calculation unit 2036) performs switching so that the sum of the cost values 62 between a series of node devices from the start node device to the end node device is minimized, as in step 504. Determine the destination path. Next, the processor 202 (switching path calculation unit 2036) stores the determined switching destination path as an application path in the application path table of the storage unit 204. After step 606, the procedure proceeds to step 518 in FIG.

  FIG. 13 shows an example of an application route table as a switching destination route for each route including the stop node device.

  In the application route table of FIG. 13, an application route (switch destination route) that bypasses the stop node devices B, C, and F is created for each route.

  For example, the applicable route (switch destination route) of the route PATH_1 is the route node device A-HI-J-D. Further, the application route of the route PATH_2 is the route node device AHIJJDG. Further, the applicable route of the route PATH_3 is the route node device A-HIJ. As an alternative, the application route of the route PATH_2 may be, for example, a route node device A-E-K-LG including the stop node device E that is not included in any route. However, the application path of the path PATH_2 may not include the stop node device E of the work b that does not affect the path in order to widen the allowable range for changing or extending the end time of the work b.

  Further, for example, the application route of the route PATH_4 that does not include the stop node device and is not affected by the work remains the same route node device A-H-I as the priority route, and is not changed. As in the case of the routes PATH_1, PATH_2, and PATH_3, the application route of the route PATH_4 is preferably obtained by recalculating the total of the series of cost values 62. Instead, the original priority route may be applied.

  Referring to FIG. 5 again, in step 518, the processor 202 (or its route application unit 2038) applies the switching destination route to the network 5 as the application route. The application route is applied immediately before the start time of the earliest work in the work time zone that affects the route (for example, 1 to 8 minutes before). For this purpose, the processor 202 (route application unit 2038) actually applies or sets the changed cost value temporarily used in step 516 to the network 5. Thereby, the link adjacent to the stop node device 52 is not suddenly cut off, and path switching without packet loss can be realized. For example, in the node apparatus C, the packet being transferred that has started the transfer to the node apparatus D before the increase of the cost value 62 is not lost, and the cost value 62 is increased in a short time, for example, less than 1 second. Via the link 54, the node device D can be reached before the node device B stops.

  FIG. 14 shows an example of a path management table after path switching. In this case, the current paths of the paths PATH_1, PATH_2, and PATH_3 affected by the work are changed from the priority paths in FIG. 6 to the application paths in FIG. On the other hand, the route PATH_4 that is not affected by the work is the same as the priority route, and maintains the current route of FIG.

  In step 518 of FIG. 5, the processor 202 (or its bandwidth controller 2050) refers to the variable bandwidth of the transmission bandwidth of the link in the network configuration information, and is in the switching destination route during the switching destination route application period. The transmission bandwidth of a certain link 54 may be increased. The certain link 54 may be a link 54 between the node device H and the node device I, for example. The reason for such increase or adjustment of the transmission bandwidth is that communication traffic is sent to a certain node device 52 or a certain link 54 on the switching destination route due to an increase in the cost value in the application period of the switching destination route. This is because there is a possibility that congestion or packet retention may occur. In this case, the processor 202 (band control unit 2050) restores the transmission bandwidth of the link 54 after application of the switching destination path is completed or at the last time (24:00) of the work day.

  In addition, after all the operations affecting the route are completed, the processor 202 (route applying unit 2038) returns the changed cost value to the cost value before the change. As an alternative form, the processor 202 (route application unit 2038) is a node device that has completed the work except for the link 54 of the stop node device 52 that is affected by the remaining work every time each work affecting the path is completed. The cost value of the link may be returned to the cost value before the change.

  In the above example, the work order is changed or assigned so that the first time zone of “work that does not affect the route” is before the second time zone of “work that affects the route”. . As an alternative, the work sequence may be changed or assigned so that the first time zone of “work that does not affect the route” is later than the second time zone of “work that affects the route”. Good. In this case, the cost value is changed before the second time zone of “work affecting the route” and returned before the first time zone of “work not affecting the route”. That's fine.

  As described above, according to the embodiment, it is possible to preset route switching due to planned network work or construction. In addition, according to the embodiment, it is possible to confirm the influence on the communication service of the route switching due to the planned network work or construction. In addition, according to the embodiment, it is possible to minimize the number of times of planned network work or path switching due to construction, and the processing load in network control can be minimized.

  All examples and conditional expressions given here are intended to help the reader understand the inventions and concepts that have contributed to the promotion of technology, such examples and It is understood that the present invention is not limited to the conditions, and that the organization of such examples in the specification is not related to the superiority or inferiority of the present invention. Although embodiments of the present invention have been described in detail, it will be understood that various changes, substitutions and variations can be made thereto without departing from the spirit and scope of the invention.

Regarding the embodiment including the above examples, the following additional notes are further disclosed.
(Appendix 1) Managing information on a plurality of routes including node devices from each entry node device to the exit node device,
Based on information relating to one or more tasks each including a stop of a node device, the one or more work in progress including a stop of a node device not included in any of the plurality of paths is performed in a first time zone. And assigning the one or more work in progress including a stop of a node device included in any of the plurality of paths to a second time zone that does not overlap the first time zone,
Determining a plurality of paths including node devices from respective ingress node devices to egress node devices so as not to include any of the node devices stopped in the work assigned in the second time zone; A network management method for causing an information processing apparatus to execute a process of resetting the plurality of determined paths before a time period.
(Additional remark 2) The process which resets the determined several path | route includes increasing the cost value of the link of the node apparatus stopped in the operation | work allocated in the said 2nd time slot | zone. The network management method according to attachment 1.
(Supplementary Note 3) The plurality of determined paths are selected so that the sum of the cost values between the node devices from the respective entry node devices to the exit node devices is minimized. The network management method according to appendix 1 or 2.
(Supplementary note 4) Any one of Supplementary notes 1 to 3, further comprising causing the information processing apparatus to execute a process of increasing a transmission bandwidth of at least one link between node devices in the determined plurality of paths. The network management method according to the above.
(Supplementary Note 5) The plurality of determined routes are nodes from an entry node device to an exit node device in each route of a route including any one of the node devices stopped in the work assigned in the second time zone. The network management method according to any one of appendices 1 to 4, wherein the network management method includes an apparatus.
(Supplementary note 6) The plurality of determined paths do not include any node device stopped in the work assigned to the first and second time zones.
(Supplementary note 7) a management unit that manages information related to a plurality of routes including node devices from each ingress node device to egress node device;
Based on information relating to one or more tasks each including a stop of a node device, the one or more work in progress including a stop of a node device not included in any of the plurality of paths is performed in a first time zone. And an optimization unit that allocates the one or more work in progress including a stop of a node device included in any of the plurality of paths to a second time zone that does not overlap the first time zone; ,
Determining a plurality of paths including node devices from respective ingress node devices to egress node devices so as not to include any of the node devices stopped in the work assigned in the second time zone; An application unit for resetting the determined plurality of routes before the time period of
Including network management system.
(Supplementary Note 8) A management unit that manages information on a plurality of routes including node devices from each ingress node device to egress node device;
Based on information relating to one or more tasks each including a stop of a node device, the one or more work in progress including a stop of a node device not included in any of the plurality of paths is performed in a first time zone. And an optimization unit that allocates the one or more work in progress including a stop of a node device included in any of the plurality of paths to a second time zone that does not overlap the first time zone; ,
Determining a plurality of paths including node devices from respective ingress node devices to egress node devices so as not to include any of the node devices stopped in the work assigned in the second time zone; An application unit for resetting the determined plurality of routes before the time period of
A network management device.

5 Network 10 Work Management Server Device 52 Node or Node Device 54 Link 20 Server Device 30 Terminal Device 40 Server Device 32, 42 Communication Device

Claims (6)

Manage information about multiple routes including node devices from each ingress node device to egress node device,
Based to stop the node device on the information on the three or more work each comprising a first one or more tasks, including a stop of a node device not included in any of the plurality of paths, a single time zone Two or more operations including a stop of a node device included in any of the plurality of routes in a second time zone that is one time zone after the first time zone. allocation,
Determining a plurality of paths including node devices from respective ingress node devices to egress node devices so as not to include any of the node devices stopped in the work assigned in the second time zone; A network management method for causing an information processing apparatus to execute a process of resetting the plurality of determined paths before a time period.   The process of resetting the determined plurality of paths includes increasing a cost value of a link of a node device to be stopped in the work assigned in the second time zone. Item 4. The network management method according to Item 1.   The plurality of determined paths are selected so that a sum of cost values between node devices from each ingress node device to an egress node device is minimized. 3. The network management method according to 2.   4. The information processing apparatus according to claim 1, further comprising: causing the information processing apparatus to execute a process of increasing a transmission bandwidth of at least one link between node devices in the determined plurality of paths. Network management method. A management unit that manages information on a plurality of routes including node devices from each entry node device to the exit node device;
Based to stop the node device on the information on the three or more work each comprising a first one or more tasks, including a stop of a node device not included in any of the plurality of paths, a single time zone assigned to time zone, two or more operations including the stop of the node device included in any of the plurality of paths, to a second time period said a one time period after the first time period An assigning optimizer,
Determining a plurality of paths including node devices from respective ingress node devices to egress node devices so as not to include any of the node devices stopped in the work assigned in the second time zone; An application unit for resetting the determined plurality of routes before the time period of
Including network management system. A management unit that manages information on a plurality of routes including node devices from each entry node device to the exit node device;
Based to stop the node device on the information on the three or more work each comprising a first one or more tasks, including a stop of a node device not included in any of the plurality of paths, a single time zone Two or more operations including a stop of a node device included in any of the plurality of routes in a second time zone that is one time zone after the first time zone. An assigning optimizer,
Determining a plurality of paths including node devices from respective ingress node devices to egress node devices so as not to include any of the node devices stopped in the work assigned in the second time zone; An application unit for resetting the determined plurality of routes before the time period of
A network management device.

Images