JP4829911B2 - Network design apparatus, network design method, and network design system - Google Patents

Description

  The present invention relates to a network design device, a network design method, and a network design system.

  In a data network with multiple nodes and multiple links connecting the nodes, if a request to add a new path to the data network occurs in addition to the existing path, the network designer must specify the path of the path. It is necessary to determine how to set, and how to design the equipment layout position and the amount of equipment extension in consideration of the design cost. The determination of these path routes, equipment layout positions, and equipment expansion amounts is conventionally based on judgments based on the experience and intuition of network designers. Therefore, it is necessary to always have a network designer having design skills, and the design criteria may be different for each network designer. In order to solve these problems, it is desirable to realize a network design tool by calculation based on a predetermined design algorithm.

  In a situation where a request to add a new path to the data network has occurred, if there is not enough free bandwidth to satisfy the requested bandwidth on the route that is the shortest distance from the requested bandwidth of the newly requested path, the new path Cannot be set for that route. In this case, a network design method for accommodating a path by adding equipment to secure a bandwidth that can be accommodated by the new path on the shortest path, and a space that satisfies the required bandwidth of the path that is not the shortest path but is newly required There is a network design method in which a path is accommodated by routing to a detour route having a bandwidth.

  FIG. 14 is a diagram for explaining the two network design methods. Here, as shown in FIG. 14A, in a data network having nodes A, B, C, and D, it is assumed that a 10G path has been set between nodes A, D, and C. If an attempt is made to set a new path of 10G between the nodes A and D of this data network, the maximum bandwidth 10G that can be accommodated is already used between the nodes A and D. Cannot accommodate a new path (FIG. 14B). In this case, as shown in FIG. 14 (c), the shortest path is prioritized and a 10G band is added between the nodes A and D (design method with shortest path priority), and FIG. 14 (d). As shown in Fig. 2, there are two methods of designing a new path by detouring to the route of nodes A, B, C, and D (priority of the minimum extension facility). There is a method (for example, refer nonpatent literature 1).

According to the shortest route priority design method, if there is a demand for a new path between nodes, a path is set between the nodes, so that the accommodation efficiency is generally low at the time of initial setting. However, as the facilities are added to other paths, the available bandwidth of the existing link is effectively used, so that the accommodation efficiency is improved. In addition, according to the design method with the least priority for expansion equipment, the amount of equipment expansion is minimized when a new path is set, but in the long term there are many paths with long routes, and it is expected that the network will be wasteful. The
Tsuyoshi Kanae and two others, “Semi-dynamic design in multi-layer photonic networks”, IEICE Technical Report, IEICE, August 2006, PN 2006-18, p. 45-50

  However, a design method with the shortest path priority or a design method with the least priority for additional equipment has been used, and no clear design standards have been established in the conventional network design. Conventionally, only the size of the required bandwidth of a newly required path is determined, and a determination is made as to whether to use the shortest path priority design method or the additional equipment minimum priority design method. It was. For this reason, network design has not been performed in consideration of the network information of the existing path at the setting start time when the actually required path is set. In addition, if the time until the new path setting start time is short and the equipment expansion is not in time, or the new path setting period is short, after the path setting period ends, the added equipment will not be used and the usage efficiency will decrease. The case was not taken into consideration.

  The present invention has been made in view of such a background, and when designing a newly required path, the present invention adopts a design method that gives priority to the shortest route or a design method that gives priority to the minimum extension equipment. Establish design criteria to determine whether or not In addition, a network design device that performs network design using network information of an existing path at a newly requested path setting start time and information including temporal elements such as a newly requested path setting start time and a setting period It is an object of the present invention to provide a network design method and a network design system.

In order to solve the above-mentioned problem, the network design apparatus according to claim 1 is a network for setting a newly required path on a data network including a plurality of nodes and a plurality of links connecting the nodes. A network design device for performing design, including identification information of a start node and an end node of a newly requested path, and a requested bandwidth of the newly requested path, and the newly requested path An input / output unit that receives new path request information that can include at least one of a setting start time and a setting period, and (1) topology information indicating a connection relationship between each node of the data network and each link (2) For each link connected to each node of the data network, the maximum bandwidth of the link, and the link Link information indicating the remaining bandwidth obtained by subtracting the total value of the set bandwidth of each path passing through the link from the maximum bandwidth, and (3) a link accommodating the path for each path established between the nodes. Network information storage unit storing network information including the path information, the set bandwidth of the path, and the existing path information including the setting start time of the path, and the requested bandwidth of the newly requested path , and one set start time and the setting time sac lichen Zureka parameters, or the shortest path in preference to design a path required for the new, or additional to accommodate the path required for the new An algorithm storage unit that stores an algorithm for determining whether to design the newly required path in preference to minimizing equipment, and the received Using the required path request information and the network information, the path that is newly requested is designed with priority on the shortest path, or the path that is newly requested with priority on minimizing additional equipment. Is determined by the algorithm stored in the algorithm storage unit, and on the basis of the determination, the path of the newly required path, the equipment arrangement position and the equipment extension when the path is accommodated in the path A controller for calculating the amount, and when the parameter is the required bandwidth, the algorithm gives priority to the minimum of the additional equipment when the required bandwidth is smaller than a predetermined threshold x, and the request When the bandwidth is equal to or greater than the threshold value x, the shortest path is prioritized and the time until the setting start time is predetermined when the parameter is the setting start time. If the minimum of the additional equipment is prioritized, and if the time until the setting start time is equal to or greater than the threshold y, the shortest path is prioritized and the parameter is the setting period. When the set period is shorter than a predetermined threshold z, priority is given to the minimum of the additional equipment, and when the set period is equal to or greater than the threshold z, the shortest path is given priority. .

The network design method according to claim 6 is a network design apparatus for performing a network design for setting a newly required path on a data network including a plurality of nodes and a plurality of links connecting the nodes . In the network design method, the network design device includes (1) topology information indicating a connection relationship between each node of the data network and each link, and (2) for each link connected to each node of the data network. Link information indicating the maximum bandwidth of the link and the remaining bandwidth obtained by subtracting the total value of the set bandwidth of each path passing through the link from the maximum bandwidth of the link, and (3) for each path established between the nodes The path information indicating the link accommodating the path, the set bandwidth of the path, and the setting of the path The existing path information including the time, the network information storage unit which network information is stored including the new path is required, the required bandwidth, setting start time and the setting time sac lichen Zureka one parameter Designing the newly required path giving priority to the shortest path, or requesting the new one with priority given to minimizing additional equipment for accommodating the newly required path An algorithm storage unit in which an algorithm for determining whether to design a path is stored, and identification information of a start node and an end node of the newly requested path and the newly requested New path request information including a requested bandwidth of the path and further including at least one of a setting start time and a setting period of the newly requested path. Using the received new path request information and the network information, design the newly required path with priority on the shortest path, or prioritize minimizing additional equipment. Whether or not to design a newly required path is determined by the algorithm stored in the algorithm storage unit, and based on the determination, the path of the newly required path and when the path is accommodated in the path The equipment arrangement position and the equipment expansion amount are calculated, and when the parameter is the required bandwidth, the algorithm gives priority to the minimum of the additional equipment when the requested bandwidth is smaller than a predetermined threshold x, and the request When the bandwidth is equal to or greater than the threshold value x, the time until the setting start time is given when the shortest path is given priority and the parameter is set as the setting start time. When shorter than a predetermined threshold value y, the minimum of the additional equipment is given priority, and when the time until the setting start time is equal to or greater than the threshold value y, the shortest path is given priority, and the parameter is set as the setting period. In addition, when the set period is shorter than a predetermined threshold z, priority is given to the minimum of the additional equipment, and when the set period is equal to or more than the threshold z, the shortest path is given priority. did.

  The network design system according to claim 7, wherein a data network including a plurality of nodes and a plurality of links connecting the nodes is connected to the data network and a network operator terminal via a communication line, and the data network A network design system including the network design apparatus according to any one of claims 1 to 5 that performs network design for setting a newly required path on the network.

  By doing so, the network design device, the network design method, and the network design system according to the present invention provide a required bandwidth, a setting disclosure time, and a setting disclosure time of a newly required path in a network design of a newly required path. Using at least one of the set periods as a parameter, it can be determined using a predetermined algorithm whether the design method prioritizes the shortest route or the design method prioritized with the minimum extension facility. It is possible to design a network using network information of existing paths at the start time of newly requested paths and information including time-dependent elements such as the start time and setting period of newly requested paths. It becomes.

  The network design device according to claim 2 is the network design device according to claim 1, wherein the control unit requests the new request from one or more new path request information received by the input / output unit. One of the paths to be selected, and for the selected path, the algorithm stored in the algorithm storage unit uses the new path request information and the network information to prioritize the shortest path and the new path. Determine the design policy of whether to design the path required for the new path, or to prioritize minimizing additional facilities to accommodate the newly required path A new design policy determination unit that uses the new path request information and the network information based on the design policy determined by the design policy determination unit. A calculation unit that calculates a route of the required path, a facility arrangement position and a facility expansion amount when accommodating the path based on the route, and the newly requested path calculated by the calculation unit Based on the route, the equipment arrangement position, and the equipment expansion amount, a remaining bandwidth update unit that updates the remaining bandwidth of each link of the link information is provided.

  According to such a configuration, the network design apparatus selects one of the newly required paths, the design policy determination unit determines the design policy, and the calculation unit newly determines based on the determination result. It is possible to calculate a required path, an equipment layout position, and an equipment expansion amount. Then, using the calculation result, the remaining bandwidth update unit updates the remaining bandwidth of each link of the link information, so that the network design apparatus reflects the calculation result of the new path request information calculated earlier, It becomes possible to design a network in consideration of a plurality of newly required paths.

  The network design device according to claim 3 is the network design device according to claim 2, wherein the design policy determination unit is configured to select the new path request information received from the input / output unit from the one or more new path request information. When one of the required paths is selected, one of the newly requested paths is selected in descending order of the required bandwidth.

  According to such a configuration, the newly requested path can be accommodated in the remaining bandwidth of the link in descending order of the requested bandwidth. Therefore, before accommodating the path with the large required bandwidth, the path with the small requested bandwidth is accommodated, and the remaining bandwidth of the link that should have been able to accommodate the path with the large required bandwidth originally becomes insufficient. It is possible to avoid a case where additional equipment is required to accommodate a large path.

  Further, the network design device according to claim 4 is the network design device according to claim 2 or claim 3, wherein the calculation unit is configured to request the new design policy in preference to the shortest path. When there are a plurality of routes for setting the newly requested path calculated by the calculation unit when it is determined that the path to be designed is designed, the newly requested path is accommodated among the routes. For this reason, the route for minimizing the amount of equipment to be installed is selected.

  According to such a configuration, when the design policy determination unit determines to set a newly required path in preference to the shortest path, when there are a plurality of shortest paths, it is necessary to add equipment among these paths. The route with the smallest amount can be selected. Therefore, the network design apparatus can perform the network design with the minimum number of additional facilities after performing the network design with priority on the shortest path.

  The network design device according to claim 5 is the network design device according to claim 2 or 3, wherein the calculation unit accommodates the newly requested path by the design policy determination unit. Equipment required to accommodate the newly required path calculated by the calculation unit when it is determined that the newly required path is designed with priority given to minimizing the additional equipment for When there are a plurality of routes with the smallest amount of expansion, the route that is the shortest route among the routes is selected.

  According to such a configuration, when the design policy determination unit determines to design a newly required path in preference to minimizing the extension equipment, there are a plurality of paths that minimize the equipment extension amount. Sometimes, the shortest path among these paths can be selected. Therefore, the network design apparatus can perform the network design of the shortest path after performing the network design with the minimum number of additional facilities.

  According to the present invention, whether a newly required path is designed with priority on the shortest path or a newly required path is designed with priority on minimizing additional equipment is determined according to a predetermined design criterion. It can be judged based on. Furthermore, it is possible to design a network by using network information of an existing path at a newly requested path setting start time and information including temporal factors such as a newly requested path setting start time and a setting period. . As a result, it is possible to design a network in consideration of reduction in equipment cost and improvement in path accommodation efficiency.

  Next, the best mode for carrying out the present invention (hereinafter referred to as “embodiment”) will be described in detail with reference to the drawings as appropriate.

  FIG. 1 is a diagram illustrating a configuration of a network design system according to the present embodiment. As shown in FIG. 1, a network design system 1 according to the present embodiment includes a data network 30 including a plurality of nodes 40 and a plurality of links 50 connecting the nodes 40, a network information management server 20, and a network design apparatus 10. A network operator terminal 90, a first communication path 70, and a second communication path 80.

  The data network 30 includes a plurality of nodes 40 and a plurality of links 50 connected to the nodes 40, and a path 60 is set between arbitrary nodes 40. Here, the node 40 is, for example, an SDH (Synchronous Digital Hierarchy) switch or an MPLS (Multi-Protocol Label Switching) router, and the path 60 is an SDH path or an MPLS path. In the present embodiment, the SDH path will be described. Each node 40 of the data network 30 is connected to the network information management server 20 via the first communication path 70.

  The network information management server 20 manages network information regarding the data network 30. The network information managed by the network information management server 20 includes topology information indicating the connection relationship between each node 40 and each link 50 on the data network, the maximum bandwidth of each link 50 and the maximum bandwidth of each link 50. The link information indicating the remaining bandwidth obtained by subtracting the total value of the set bandwidths of the paths passing through 50, and the existing path information indicating the path route, the set bandwidth, the setting start time, and the like. An example of the data structure of the network information will be described later (see FIGS. 4 to 8). Further, the network information management server 20 has a function of receiving this request from the network design apparatus 10 and transmitting this network information.

  The network administrator terminal 90 is connected to the network design device 10 via a second communication path 80 such as a LAN (Local Area Network), for example, and gives various instructions to the network design device 10. Also, new path request information, which is information about a newly requested path, is transmitted to the network design apparatus 10. An example of the data structure of the new path request information will be described later (see FIG. 3).

  Next, the network design apparatus 10 will be described. The network design device 10 is connected to the network information management server 20 and the network operator terminal 90 via the second communication path 80. FIG. 2 is a functional block diagram illustrating a configuration example of the network design apparatus according to the present embodiment.

  As illustrated in FIG. 2, the network design device 10 includes a control unit 110, an input / output unit 120, a temporary storage unit 130, and a storage unit 140.

  The input / output unit 120 inputs / outputs data to / from the network operator terminal 90 (see FIG. 1), and obtains network information from the network information management server 20 (see FIG. 1). Is provided. The input / output unit 120 includes an IF for a network operator terminal and an IF for a network information management server.

  The control unit 110 controls the entire network design apparatus 10, and includes a new path request information acquisition unit 111, a network information acquisition unit 112, a design policy determination unit 113, a calculation unit 114, a remaining bandwidth update unit 115, And a calculation result information report unit 116. The control unit 110 and the input / output unit 120 are realized by, for example, a CPU (Central Processing Unit) developing and executing a program stored in the hard disk of the network design device 10 in a RAM (Random Access Memory).

  The new path request information acquisition unit 111 has a function of acquiring new path request information 200 (see FIG. 3) that is a request for a new path requested by the network operator from the network operator terminal 90. FIG. 3 is a diagram showing a data structure of new path request information according to the present embodiment. As shown in FIG. 3A, the new path request information 200 includes a new path ID of a newly requested path, identification information of a start node, identification information of an end node, and a requested bandwidth 201. Furthermore, at least one of the newly requested path setting start time 202 and the setting period 203 can be included as a data item. An example of a specific data structure is shown in FIG. For example, in the new path request information 200 with the new path ID “1”, the start point node of the newly requested path is “node A”, the end point node is “node E”, and the requested bandwidth 201 of the path is “2488 Mbps”. The path setting start time 202 is “April 2008” and the setting period 203 is “April”. The new path request information acquisition unit 111 has a function of acquiring one or more new path request information 200 from the network operator terminal 90 via the input / output unit 120 and storing it in the temporary storage unit 130.

  Returning to FIG. 2, the network information acquisition unit 112 acquires the network information 300 (see FIG. 4), which is information about the data network 30, from the network information management server 20 of FIG. 140 has a function of storing in the network information storage unit 141 in 140.

  FIG. 4 is a diagram showing a data structure of network information according to the present embodiment. The network information 300 is information regarding the node 40 and the link 50 constituting the data network 30 of FIG. 1 and the path 60 set between the nodes 40. As shown in FIG. 4, the topology information 310 and the link information 320 and existing path information 330 are included.

  First, the topology information 310 will be described. FIG. 5 is a diagram for conceptually explaining an example of topology information indicating a connection relationship between each node and each link illustrated in FIG. 1. As shown in FIG. 5A, a case will be described where nodes A to I are arranged in a 3 (row) × 3 (column) grid and are connected by links 50. FIG. 5B shows the connection relationship of each node 40 corresponding to m rows and n columns with values of “0”, “1”, and “M”. Here, “0” means that the node m and the node n are the same node. “1” means that the node m and the node n are adjacent nodes. “M” means that the node m and the node n are not adjacent to each other.

  For example, in FIG. 5B, when looking at the connection relationship between the node D (m = 4) and another node, pay attention to the column in which the value of 4 rows and n columns is “1”, and 1 column, 5 Since the column is “1” in the seventh column, it indicates that the node D is adjacent to the node A, the node E, and the node G. In addition, in 4 rows and n columns, node B, node C, node F, node H, and node I corresponding to the second column, the third column, the sixth column, the eighth column, and the ninth column whose value is “M” are the node D indicates that they are not adjacent. As described above, the topology information 310 indicates whether or not a certain node and another node are adjacent to each other and are directly connected by a link.

  Next, the link information 320 will be described. As shown in FIG. 4, the link information 320 includes a maximum bandwidth 321 set for each link 50 (see FIG. 1) and a residual bandwidth 322 as data items. Here, the remaining bandwidth 322 refers to a bandwidth obtained by subtracting the total set bandwidth of each path 60 from the maximum bandwidth 321 of each link 50 via the link 50. FIG. 6 shows the maximum bandwidth of each link when the nodes shown in FIG. 1 are arranged in a 3 × 3 grid as shown in FIG. 5A, corresponding to the topology information in FIG. 5B. FIG. Here, it is shown that all the maximum bandwidths 321 of each link 50 are 10,000 Mbps (10 Gbps). FIG. 7 is a diagram showing the remaining bandwidth of each link in correspondence with the topology information of FIG. For example, the remaining bandwidth 322 between the node A and the node B is 9000 Mbps indicated at the position of 1 row and 2 columns.

  Next, as shown in FIG. 4, the existing path information 330 includes a path ID, path route information, a path setting bandwidth, and a path start time, and a path end time is already set. If it is, the end time is also included as a data item. FIG. 8 shows an example of a specific data structure of the existing path information. For example, the existing path information 330 of the path ID “1” is the path of the path “Node G → Node D → Node A”, the set bandwidth of the path is “2488 Mbps”, and the start time of the path is “2007 April "and the end time is" August 2008 ".

  Returning to FIG. 2, the design policy determination unit 113 selects one of one or more newly requested paths based on the new path request information 200 of FIG. At this time, the design policy determination unit 113 may select the new path request information 200 in descending order of the requested bandwidth 201. Then, the design policy determination unit 113 uses, as a parameter, at least one of the requested bandwidth, the setting start time, and the setting period stored in the algorithm storage unit 142 in the storage unit 140, or a design method with the shortest path priority, or A new path design policy is determined by using an algorithm that determines whether the extension facility has the least priority design method.

  The calculation unit 114 calculates the path of the newly requested path based on the design policy determined by the design policy determination unit 113. The route can be calculated using, for example, the Dijkstra method (Dijkstra method).

  Further, when the design policy determination unit 113 determines that the design policy determination unit 113 preferentially designs a path that is newly requested with priority given to the shortest path, if there are a plurality of the shortest paths, the amount of equipment expansion in the path Has a function of selecting a route that minimizes. Further, when the design policy determination unit 113 selects a route with priority given to minimizing the additional equipment, if there are a plurality of routes with the smallest additional equipment, the calculation unit 114 selects the shortest route among the routes. Has the function of selecting

In addition, the calculation unit 114, for each new requested path, stores a path based on the determined route, an equipment layout position indicating which node the equipment is to be installed, and the amount of equipment to be added. And is stored in the temporary storage unit 130 together with the route information of the new path. Subsequently, the calculation unit 114 determines whether there is a path for which a design policy has not been determined for a newly requested path. Then, the calculation unit 114 finishes the processing of all the new path request information 200, calculates the route information for each newly requested path that is finally designed, the equipment placement position, and the amount of equipment addition, as calculation result information. 400 (see FIG. 9) has a function of storing the calculation result information storage unit 143 in the storage unit 140.

  The remaining bandwidth changing unit 115 refers to the network information 300 (see FIG. 4) stored in the network information storage unit 141 in the storage unit 140, disconnects the existing path whose path end time has passed, and uses the disconnected path. It has a function of updating the remaining bandwidth 322 of each link that has been used. Further, the remaining bandwidth changing unit 115 is calculated by the calculating unit 114 and newly stored in the temporary storage unit 130, such as a newly requested path route, facility arrangement position, and facility addition amount, and network information 300 (see FIG. 4). Based on the above, the link information 320 has a function of updating the remaining bandwidth 322 (see FIG. 7) of each link.

  The calculation result information reporting unit 116 has a function of transmitting the calculation result information 400 stored in the calculation result information storage unit 143 to the network operator terminal 90 (see FIG. 1) via the input / output unit 120. . FIG. 9 is a diagram showing a data structure of calculation result information according to the present embodiment. The calculation result information 400 includes new path setting information 410 and facility expansion information 420 as shown in FIG. The new path setting information 410 is data information including the path information 411 of the new path calculated by the calculation unit 114 in addition to the information acquired as the new path request information 200. The facility expansion information 420 includes a facility arrangement position 421 and a facility expansion amount 422 for accommodating the path of the new path calculated by the calculation unit 114.

  Returning to FIG. 2, the temporary storage unit 130 includes a primary storage device such as a RAM, and temporarily stores new path request information 200 (see FIG. 3) and calculation results calculated for each new path request information 200. Have

  The storage unit 140 is a storage unit that includes a network information storage unit 141, an algorithm storage unit 142, and a calculation result information storage unit 143, and includes a hard disk or the like.

  The network information storage unit 141 stores the network information 300 (see FIG. 4) acquired by the network information acquisition unit 112 from the network information management server 20 (see FIG. 1) via the input / output unit 120. In addition, the calculation result information storage unit 143 stores new path setting information 410 and facility addition information 420 which are calculation result information 400 (see FIG. 9) calculated by the calculation unit 114.

  In addition, the algorithm storage unit 142 stores an algorithm for determining whether the design method prioritizes the shortest path or the design method prioritizing the additional equipment using at least one of the requested bandwidth, the setting start time, and the setting period as a parameter. .

  Here, in order to determine whether to design a newly required path giving priority to the shortest path, or to design a newly required path giving priority to minimizing additional equipment, the required bandwidth, For example, when the setting start time and the threshold value of the setting period are x, y, and z, respectively, the following determination is made.

  In the determination based on the required bandwidth, when the required bandwidth is smaller than the bandwidth of the additional equipment, the additional bandwidth increases and the use efficiency of the equipment deteriorates. Therefore, when the required bandwidth is relatively small, it is better to adopt the design method with the least priority of the extension equipment, not the design method with the shortest route priority. Therefore, when the required bandwidth is smaller than the threshold value x (required bandwidth <x), it is determined that the design method with the least priority of the additional equipment is performed, and when the required bandwidth is equal to or greater than the threshold value x (required bandwidth ≧ x) It is determined that the design method will be performed.

  In the determination based on the setting start time, if the time to the setting start time is short, the equipment expansion may not be in time. Therefore, when the time from the time when the new path is requested to the time when the path setting is started is short, it is better to use the design method with the least priority of the extension equipment instead of the design method with the shortest path priority. Therefore, when the time until the path setting start time is shorter than the threshold value y (time until the path setting start time <y), it is determined that the design method with the least priority of the additional equipment is performed, and the path setting start time is When the time is equal to or greater than the threshold value y (time until path setting start time ≧ y), it is determined that the shortest path priority design method is performed.

  In the determination based on the setting period, if the setting period is short, there is a possibility that the equipment will not be used after the setting period of the path even if the equipment is added, and the utilization efficiency of the equipment is deteriorated. Therefore, when the setting period is relatively short, it is better not to design with the shortest path priority, but to design with the extension facility minimum priority. Therefore, when the setting period is shorter than the threshold value z (setting period <z), it is determined that the design method with the least priority for additional equipment is performed. When the setting period is equal to or more than the threshold value z (setting period ≧ z), the shortest path priority is given It is determined that the design method will be performed.

  The design policy determination unit 113 uses at least one of the requested bandwidth, the setting start time, and the setting period stored in the algorithm storage unit 142 as a parameter, and uses the shortest path priority design method or the extension equipment minimum priority. A design policy for a newly required path is determined using an algorithm for determining whether the design method is used.

  In the present embodiment, the network design device 10 and the network information management server 20 are described as separate configurations. However, each function can be performed by one device.

  Next, the operation procedure of the network design system 1 will be described with reference to FIG. FIG. 10 is a diagram illustrating a processing flow of the network design system according to the present embodiment.

  First, one or more new path request information 200 (see FIG. 3) is transmitted from the network operator terminal 90 to the network design apparatus 10 (step S1001). In the network design device 10, the new path request information acquisition unit 111 in FIG. 2 acquires the new path request information 200 via the input / output unit 120 and stores it in the temporary storage unit 130.

  Next, in the network design device 10, the network information acquisition unit 112 in FIG. 2 requests the network information 300 (see FIG. 4) from the network information management server 20 via the input / output unit 120 (step S1002).

  Subsequently, the network information management server 20 transmits the network information 300 managed by the network information management server 20 to the network design apparatus 10 as a response to the request for the network information 300 (step S1003). In the network design device 10, the network information acquisition unit 112 in FIG. 2 acquires the network information 300 via the input / output unit 120 and stores it in the network information storage unit 141 in the storage unit 140.

  Then, the network design apparatus 10 includes the new path setting information 410 and the facility expansion information 420 shown in FIG. 9 for the newly requested path designed by the network design apparatus 10 by the calculation result information report unit 116 of FIG. Are transmitted to the network operator terminal 90 via the input / output unit 120 (step S1004).

  Next, the operation procedure of the network design apparatus 10 will be described with reference to the flowchart of FIG. 11 (see FIG. 2 as appropriate). FIG. 11 is a flowchart showing the flow of processing of the network design apparatus according to the present embodiment.

  First, the remaining bandwidth update unit 115 of the network design device 10 refers to the network information 300 (see FIG. 4) stored in the network information storage unit 141, and disconnects and disconnects the existing path whose path end time has elapsed. The remaining bandwidth 322 of each link used by the path is updated (step S1101).

  Subsequently, the design policy determination unit 113 selects one of the paths in descending order of the requested bandwidth from one or more new path request information 200 (see FIG. 3) stored in the temporary storage unit 130 (step S1102). As a result, before accommodating the path with the large required bandwidth, the path with the small requested bandwidth is accommodated, and the remaining bandwidth of the link that should have been able to accommodate the path with the large required bandwidth is insufficient. Therefore, it is possible to avoid a case where additional equipment is required to accommodate a path having a large required bandwidth.

  Next, the design policy determination unit 113 uses at least one of the requested bandwidth, the setting start time, and the setting period stored in the algorithm storage unit 142 as a parameter, and uses the shortest path priority design method or the expansion equipment minimum priority. A design policy for a newly required path is determined using an algorithm for determining whether the design method is (step S1103).

  Then, based on the design policy determined by the design policy determination unit 113, the calculation unit 114 calculates the path of the newly requested path, the equipment arrangement position necessary for accommodating the path on the path, and the equipment extension. The amount is calculated (step S1104). At this time, if it is determined by the design policy determination unit 113 that a newly required path is designed with priority given to the shortest route, and there are a plurality of shortest routes, the amount of equipment added in the route Select the route with the smallest value and calculate. On the other hand, when a route is selected with priority given to minimizing the additional equipment, if there are a plurality of routes with the smallest additional equipment, the shortest route is selected and calculated. Then, the calculation unit 114 stores the calculation result in the temporary storage unit 130.

  Next, in step S1105, the calculation unit 114 determines whether there is a path for which a design policy has not been determined for a newly requested path (step S1105). If there is a newly requested path for which the design policy is not determined (step S1105 → Yes), the remaining bandwidth update unit 115 is calculated by the calculation unit 114 and stored in the temporary storage unit 130. The remaining bandwidth 322 of each link in the link information 320 is updated on the basis of the path route, the facility arrangement position, the amount of additional equipment required, and the network information 300 (see FIG. 4) (step S1106). Subsequently, returning to step S1102, the design policy determination unit 113 selects one of the unprocessed new path request information 200 from the new path request information 200 again, and performs the same processing.

  In step S1105, when there is no newly requested path for which the design policy has not been determined (step S1105 → No), the calculation unit 114 has finished processing all the newly requested paths. As a result, the finally calculated calculation result information 400 (see FIG. 9) is stored in the calculation result information storage unit 143.

  An example of a specific data structure of the calculation result information 400 is shown in FIGS. FIG. 12 is a diagram showing an example of a specific data configuration of new path setting information included in the calculation result information shown in FIG. The new path setting information 410 illustrated in FIG. 12 includes route information 411 of a new path that is a calculation result calculated by the calculation unit 114 in addition to the information acquired as the new path request information 200 (see FIG. 3). Is done. For example, the new path setting information 410 of the new path ID “1” is the path information 411 indicating the path of “node A → node B → node E”, the required bandwidth 201 of the path is “2488 Mbps”, and the path The setting start time 202 is “April 2008”, and the setting period 203 is “April”. FIG. 13 is a diagram illustrating an example of a specific data configuration of the extension facility information included in the calculation result information illustrated in FIG. 9. The equipment expansion information 420 shown in FIG. 13 includes equipment arrangement positions 421 and equipment addition amounts 422 for accommodating the path of the new path calculated by the calculation unit 114. For example, it is indicated that it is necessary to set the equipment expansion amount 422 of “25 Gbps” in the equipment arrangement position 421 “interface from node A to node B”.

  In this way, whether to design a newly required path giving priority to the shortest path or to design a newly required path giving priority to minimizing additional equipment. Based on the reference, it is possible to calculate the path information 411 of the newly requested path, the equipment arrangement position 421, and the equipment expansion amount 422. Further, the network design is performed using the network information 300 of the existing path at the newly requested path setting start time, and information including temporal elements such as the newly requested path setting start time 202 and the setting period 203. be able to. As a result, it is possible to design a network in consideration of reduction in equipment cost and improvement in path accommodation efficiency.

It is a figure which shows an example of the network design system which concerns on this embodiment. It is a functional block diagram which shows the structural example of the network design apparatus which concerns on this embodiment. It is a figure which shows the data structure of the new path | pass request information which concerns on this embodiment. It is a figure which shows the data structure of the network information which concerns on this embodiment. It is a figure for demonstrating the data structure of the topology information which concerns on this embodiment. It is a figure which shows an example of the maximum zone | band of the path | pass which concerns on this embodiment. It is a figure which shows an example of the residual bandwidth of the path | pass which concerns on this embodiment. It is a figure which shows an example of the existing path information which concerns on this embodiment. It is a figure which shows the data structure of the calculation result information which concerns on this embodiment. It is a figure which shows the flow of a process of the network design system which concerns on this embodiment. It is a flowchart which shows the flow of a process of the network design apparatus which concerns on this embodiment. It is a figure which shows an example of the new path setting information which concerns on this embodiment. It is a figure which shows an example of the equipment expansion information which concerns on this embodiment. It is a figure for demonstrating the shortest path | route priority design method and the extension equipment minimum priority design method.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Network design system 10 Network design apparatus 20 Network information management server 30 Data network 40 Node 50 Link 60 Path 70 1st communication path 80 2nd communication path 90 Network operator terminal 110 Control part 111 New path request information acquisition part 112 Network information acquisition unit 113 Design policy determination unit 114 Calculation unit 115 Remaining bandwidth update unit 116 Calculation result information report unit 120 Input / output unit
130 temporary storage unit 140 storage unit 141 network information storage unit 142 algorithm storage unit 143 calculation result information storage unit 200 new path request information 300 network information 400 calculation result information

Claims (7)

A network design apparatus for performing network design for setting a newly required path on a data network including a plurality of nodes and a plurality of links connecting the nodes,
The identification information of the start node and the end node of the newly requested path and the requested bandwidth of the newly requested path are included, and the setting start time and setting of the newly requested path An input / output unit that receives new path request information that can include at least one of a period;
(1) Topology information indicating the connection relationship between each node of the data network and each link; (2) For each link connected to each node of the data network, the maximum bandwidth of the link and the maximum bandwidth of the link Link information indicating the remaining bandwidth obtained by subtracting the total set bandwidth of each path passing through the link, and (3) route information indicating a link accommodating the path for each path established between the nodes. A network information storage unit that stores network information including a set bandwidth of the path and existing path information including a setting start time of the path;
The new path that is required, the required bandwidth, setting start time and the setting time sac lichen Zureka one parameter, whether the shortest path in preference to design a path required for the new, or the new An algorithm storage unit that stores an algorithm for determining whether to design the newly required path in preference to minimizing additional equipment for accommodating the required path;
Using the received new path request information and the network information, the newly requested path is designed with priority on the shortest route, or the new request is given priority on minimizing additional equipment. The path to be designed is determined by the algorithm stored in the algorithm storage unit, and based on the determination, the path of the newly requested path and the facility arrangement position when the path is accommodated in the path And a control unit for calculating the amount of equipment expansion,
Equipped with a,
The algorithm is
In the case where the required bandwidth is the parameter, when the required bandwidth is smaller than a predetermined threshold x, the minimum of the additional equipment is given priority, and when the required bandwidth is equal to or higher than the threshold x, the shortest path is prioritized. age,
When the parameter is set to the setting start time and the time to the setting start time is shorter than a predetermined threshold y, the minimum of the additional equipment is given priority, and the time to the setting start time is equal to or greater than the threshold y. In this case, the shortest path is given priority,
In the case where the parameter is the setting period, when the setting period is shorter than a predetermined threshold z, priority is given to the minimum of the additional equipment, and when the setting period is equal to or more than the threshold value z, priority is given to the shortest path. To be
Network designing apparatus according to claim. The controller is
One of the newly requested paths is selected from one or more new path request information received by the input / output unit, and the selected path is selected according to an algorithm stored in the algorithm storage unit. The new path request information and the network information are used to design the newly required path giving priority to the shortest path, or to minimize the additional equipment for accommodating the newly required path A design policy determination unit that determines a design policy for designing the newly required path in preference to
Based on the design policy determined by the design policy determination unit, using the new path request information and the network information, and storing a path of the newly requested path and a path based on the path A calculation unit for calculating the equipment layout position and the amount of equipment expansion
A remaining bandwidth update unit that updates the remaining bandwidth of each link of the link information based on the path of the newly requested path calculated by the calculation unit, the facility arrangement position, and the facility expansion amount When,
The network design apparatus according to claim 1, further comprising:   The design policy determination unit, when selecting one of the newly requested paths from one or more new path request information received by the input / output unit, The network design apparatus according to claim 2, wherein one of paths required for the network is selected. The calculator is
When the design policy determination unit determines to design the newly required path in preference to the shortest path,
When there are a plurality of routes for setting the newly requested path calculated by the calculation unit, a route in which the amount of additional equipment for accommodating the newly requested path is minimized among the routes The network design device according to claim 2 or 3, wherein the network design device is selected. The calculator is
In the case where the design policy determination unit determines to design the newly required path in preference to minimizing additional facilities for accommodating the newly required path,
When there are a plurality of routes that minimize the amount of additional equipment required to accommodate the newly requested path calculated by the calculation unit, the route that is the shortest route is selected from among the routes. The network design device according to claim 2 or 3, wherein: A network design method for a network design apparatus that performs network design for setting a newly required path on a data network including a plurality of nodes and a plurality of links connecting the nodes,
The network design device includes:
(1) Topology information indicating the connection relationship between each node of the data network and each link; (2) For each link connected to each node of the data network, the maximum bandwidth of the link and the maximum bandwidth of the link Link information indicating the remaining bandwidth obtained by subtracting the total set bandwidth of each path passing through the link, and (3) route information indicating a link accommodating the path for each path established between the nodes. A network information storage unit that stores network information including a set bandwidth of the path and existing path information including a setting start time of the path;
The new path that is required, the required bandwidth, setting start time and the setting time sac lichen Zureka one parameter, whether the shortest path in preference to design a path required for the new, or the new An algorithm storage unit that stores an algorithm for determining whether to design the newly required path in preference to minimizing additional equipment for accommodating the required path. ,
The identification information of the start node and the end node of the newly requested path and the requested bandwidth of the newly requested path are included, and the setting start time and setting of the newly requested path Receiving new path request information that can include at least one of the time periods;
Using the received new path request information and the network information, the newly requested path is designed with priority on the shortest route, or the new request is given priority on minimizing additional equipment. The path to be designed is determined by the algorithm stored in the algorithm storage unit, and based on the determination, the path of the newly requested path and the facility arrangement position when the path is accommodated in the path and the equipment installed amount is calculated,
The algorithm is
In the case where the required bandwidth is the parameter, when the required bandwidth is smaller than a predetermined threshold x, the minimum of the additional equipment is given priority, and when the required bandwidth is equal to or higher than the threshold x, the shortest path is prioritized. age,
When the parameter is set to the setting start time and the time to the setting start time is shorter than a predetermined threshold y, the minimum of the additional equipment is given priority, and the time to the setting start time is equal to or greater than the threshold y. In this case, the shortest path is given priority,
In the case where the parameter is the setting period, when the setting period is shorter than a predetermined threshold z, priority is given to the minimum of the additional equipment, and when the setting period is equal to or more than the threshold value z, priority is given to the shortest path. A network design method characterized by that .   A data network including a plurality of nodes and a plurality of links connecting the nodes, and connected to the data network and a network operator terminal via a communication line, and sets a newly required path on the data network A network design system comprising: the network design apparatus according to claim 1, wherein the network design apparatus performs network design for the network.

Images