JP5182146B2 - Route determination program, management apparatus, and network system - Google Patents

Description

  The present technology relates to a source routing technology in a computer network.

  When performing source routing, it is necessary to store information necessary for routing (hereinafter referred to as advance information since it is information that needs to be prepared in advance) in a memory. The size of this prior information increases as the network size increases, and the power consumption increases in proportion to the increase.

  In general, information of Dijkstra's shortest path graph or the like is used as prior information of source routing, and this size is proportional to the square of the number of routers. A large network with a large number of routers requires a large amount of memory. When the network scale increases, the size of the prior information becomes larger than the known routing method called hop-by-hop.

  Further, there are the following methods for reducing the calculation amount of the route determination processing by source routing. That is, when calculating a candidate route from a certain source node to each destination node in the area within the routing protocol area, the area is first divided into a plurality of virtual subareas. The candidate route is calculated. Then, a candidate route from the source node to each destination node is created by associating a candidate route in each subarea at a boundary node between the subareas with a destination node in the subarea not including the source node. However, if the destination node and the source node are changed, Dijkstra calculation must be performed again, so the amount of calculation is not sufficiently reduced. Further, route information is held in each node, and the data size problem described above has not been solved.

JP 2002-152252 A

  As described above, there is nothing in the prior art that solves the problem that the size of prior information necessary for source routing becomes large.

  Therefore, an object of the present technology is to provide a technology for suppressing the size of data necessary for source routing.

  A route determination method executed by a management device that manages nodes in a network that does not hold network route information includes a node specifying step that specifies a source node and a destination node of a packet, and a predetermined base point in the network The first route that is the shortest route from the transmission source node to the base node and the second route that is the shortest route from the destination node to the base node are identified from the route data storage unit that stores the shortest route data about the node The partial route specifying step to be performed, and the overlapping portion from the end of the first route and the second route are deleted from the first route and the second route, and the deleted second route is reversed in the reverse order. Identify the third route from the source node to the destination node by connecting to the node closest to the beginning in the first route and overlap And a step.

FIG. 1 is a diagram illustrating an example of a network configuration. FIG. 2 is a functional block diagram of the edge router. FIG. 3 is a functional block diagram of the relay router. FIG. 4 is a functional block diagram of the management server. FIG. 5 is a diagram illustrating an example of data stored in the node data storage unit. FIG. 6 is a diagram illustrating an example of data stored in the shortest path data table storage unit. FIGS. 7A to 7D are diagrams for explaining data stored in the shortest path data table storage unit that has been conventionally required. FIG. 8 is a diagram illustrating an example of data stored in the point-to-point connection data storage unit. FIG. 9 is a diagram showing a processing flow in the network. FIG. 10 is a diagram illustrating a processing flow of route calculation processing. FIG. 11 is a schematic diagram for explaining the route of the first case. FIG. 12 is a schematic diagram for explaining the route of the second case. FIG. 13 is a schematic diagram for explaining the processing of the route of the second case. FIG. 14 is a diagram illustrating a processing flow of route calculation processing. FIG. 15 is a schematic diagram illustrating a specific example of a route. FIG. 16 is a diagram illustrating an example of the entire connection data. FIG. 17 is a diagram showing a processing flow in the network. FIG. 18 is a diagram illustrating an example of a packet transmitted from the edge router “3” to the relay router “6”. FIG. 19 is a diagram illustrating an example of a packet transmitted from the relay router “6” to the edge router “4”. FIG. 20 is a diagram illustrating an example of a packet transmitted from the edge router “4” to the user terminal. FIG. 21 is a functional block diagram of a computer.

  FIG. 1 shows a system outline diagram according to an embodiment of the present technology. In this embodiment, for easy understanding, as shown in FIG. 1, the router 101 is connected to the routers 102 and 105, the router 105 is connected to the router 106, and the router 106 is connected to the routers 103 and 104. Such a network is assumed. Of course, this is an example of a simple network, and the network configuration is not limited to this. Here, the routers 101 to 104 are connected to the user terminals 151 to 154. The routers 101 to 104 connected to other IP networks such as the user terminals 151 to 154 are called edge routers or edge nodes, and the routers 105 and 106 not connected to other IP networks are called relay routers. A router is also called a node.

  In the present embodiment, these edge routers 101 to 104 are connected to a management server 111 that performs a main process in the present embodiment, that is, a process for determining a route, by a control line (dotted line in FIG. 1). Yes.

  The configuration of the edge router will be described with reference to FIG. For example, the edge router 101, for example, a packet buffer 1012 for temporarily storing a packet received from the user terminal 151, and connection data representing specific data about a route previously received from the management server 111 (described in detail below). Is an acquired connection data storage unit 1013 for storing interface data to be output and one or more combinations of destination addresses), and processing for acquiring connection data of received packets from the management server 111 or the like, A connection data processing unit 1011 that performs processing for adding necessary connection data to a packet to be transmitted, processing for specifying an interface to which a packet is to be output, and the like. The connection data processing unit 1011 includes, among the acquired connection data, a connection data adding unit 1021 that adds connection data necessary for a packet to be transmitted, and a local node data acquisition unit that performs a process of specifying an interface to output the packet 1022. As described above, the connection data acquired once in the management server 111 is accumulated for reuse, but the connection relation between routers and the route data to the node are not held in the edge router.

  The configuration of the relay router will be described with reference to FIG. For example, the relay router 105 includes a connection data processing unit 1051, and the connection data processing unit 1051 includes a local node data acquisition unit 1052 that performs processing for specifying an interface to which a received packet is to be output. In addition, if it can be used as a relay router or an edge router, it has the function of an edge router as shown in FIG. Thus, the connection relationship between the routers and the route data to the node are not held in the relay router.

  Next, the configuration of the management server 111 will be described with reference to FIG. The management server 111 specifies a route from the transmission source node to the destination node in response to a request from the edge router, and performs a process of extracting connection data for the route, and a predetermined base node The shortest path data table storage unit 1112 for storing the shortest path data table for determining the shortest path to (which may be any node in the network, but the node with the most connections is preferable), and between a specific two nodes It has a point-to-point connection data storage unit 1113 for storing connection data, and a node data storage unit 1114 for storing the correspondence between IP address ranges and node numbers (also referred to as node IDs). The route calculation unit 1111 includes a node specification processing unit 1121 that specifies a transmission source node and a destination node, a route specification processing unit 1122 that specifies a route from the transmission source node to the destination node, and connection data regarding the specified route. A connection data extraction unit 1123 for extraction.

  The node data storage unit 1114 stores data as shown in FIG. 5, for example. In the example of FIG. 5, the correspondence between the destination IP address range (for example, 64 bits) and the destination node number (for example, 16 bits) is registered. For example, if the destination IP address is in the range of 10.0.1.0/24, it can be seen that the destination node number is “1”. In this embodiment, in order to make the following explanation easy to understand, the node number of the router 101 is “1”, the node number of the router 102 is “2”, and the node number of the router 103 is “3”. Yes, the node number of the router 104 is “4”, the node number of the router 105 is “5”, and the node number of the router 106 is “6”.

  An example of data stored in the shortest path data table storage unit 1112 is shown in FIG. The shortest path data table storage unit 1112 stores data for specifying the shortest path from any node in the network to the base node by the Dijkstra method or the like, and a sequence of node numbers for any node (For example, 16 bits) and a string of previous node numbers (for example, 16 bits) that are node numbers near the base node of the arbitrary node on the shortest path. In the present embodiment, the node having the node number “1” is set as the base node. For example, the route from the node “6” to the base node “1” specifies the row of the node number “6” in the node number column, obtains the corresponding previous node number “5”, and then the node number The row of the node number “5” is specified in the column, and the corresponding previous node number “1” is acquired. Thus, the shortest path from the node “6” to the node “1” is the node number series “6-5-1”. That is, in order to obtain the shortest path, processing is performed in which the table of the shortest path data table storage unit 1112 is sequentially traced from the node number of the target node to the base node. Note that the node number of the base node is stored in a data storage device (not shown) of the management server 111 and used in the processing.

  In general source routing, as shown in FIGS. 7A to 7D, it is necessary to hold the same data as in FIG. 6 in each edge node. That is, the edge node 101 (node number “1”) holds data as shown on the left side of FIG. 7A, and as shown on the right side, heads from any node to the node with the node number “1”. Search is possible. Similarly, in the edge node 102 (node number “2”), data as shown on the left side of FIG. 7B is held, and as shown on the right side, the node is directed from the arbitrary node to the node with the node number “2”. Such a search is possible. Further, the edge node 103 (node number “3”) holds data as shown on the left side of FIG. 7C, and, as shown on the right side, goes from any node to the node with the node number “3”. Search is possible. Further, the edge node 104 (node number “4”) holds data as shown on the left side of FIG. 7D, and, as shown on the right side, goes from any node to the node with the node number “4”. Search is possible. Thus, four times as many data (number of edge nodes) as in FIG. 6 are required.

  Furthermore, data as shown in FIG. 8 is stored in the point-to-point connection data storage unit 1113. In the table example of FIG. 8, the column of the output source node A (for example, 16 bits), the column of the output destination node B (for example, 16 bits), and the interface for outputting a packet from the output source node A to the output destination node B (I / F) data columns (for example, 32 bits) and destination address columns (for example, 32 bits) when a packet is output from the output source node A to the output destination node B. For example, when a packet is output from the node “1” to the node “2”, interface data “20.0.0.1” (may be a port number or the like) and “20.0.0.2” The connection data that is a combination with the destination address is extracted. In addition, if each router gives interface data and a destination address, a well-known mechanism for specifying which destination (for example, MAC address) should be sent to which port (that is, interface) should be used. It shall have. In the table of FIG. 8, “(dest)” represents that the destination address of the packet is used.

  Next, processing contents of the network system shown in FIG. 1 will be described with reference to FIGS. First, for example, a user terminal connected to an edge router transmits a packet including a source IP address and a destination IP address in a packet header to the connected edge router (step S1). The edge router receives the packet from the user terminal and stores it in the packet buffer 1012 (step S3). Then, the connection data processing unit 1011 of the edge router searches the acquired connection data storage unit 1013 with the destination IP address to determine whether or not the corresponding connection data is registered, thereby determining whether the route has been generated. Judgment is made (step S5). If the route has been generated, the connection data processing unit 1011 reads out the corresponding connection data from the acquired connection data storage unit 1013 (step S9). Then, the processing shifts to the processing in FIG.

  On the other hand, when the path has not been generated, that is, when the corresponding connection data is not stored in the acquired connection data storage unit 1013, the connection data processing unit 1011 stores the own router ID and the packet stored in the memory or the like. A route generation request including the destination IP address is transmitted to the management server 111 (step S7). The route calculation unit 1111 of the management server 111 receives a route generation request including its own router ID and the destination IP address of the packet, and stores it in a storage device such as a main memory (step S11). Then, the route calculation unit 1111 performs route calculation processing (step S13). The route calculation process will be described with reference to FIGS.

  The node specification processing unit 1121 of the route calculation unit 1111 reads the destination node number corresponding to the destination IP address of the packet from the node data storage unit 1114 (step S21). Then, the route identification processing unit 1122 determines whether the destination node number or the transmission source node number is equal to the base node number (step S23).

  If the destination node number or the source node number is equal to the base node number, no special processing is necessary. That is, the route specification processing unit 1122 specifies the shortest route X from the transmission source node to the destination node using the shortest route data table storage unit 1112 and stores it in a storage device such as a main memory (step S25). When the destination node number is equal to the base node number, the shortest path X is obtained by searching the shortest path data table storage unit 1112 sequentially from the transmission source node number and reaching the base node number. If the source node number is equal to the base node number, the shortest path data table storage unit 1112 is searched from the start node number using the source node number as the end node number and the destination node number as the start node number, and the end node When the number is reached, the shortest path X from the base node to the destination node can be obtained by switching the order in reverse order. The processing shifts to the processing in FIG.

  On the other hand, when the destination node number or the transmission source node number is not equal to the base node number, the route specification processing unit 1122 transmits the shortest route A from the transmission source node to the base node and the shortest route data table storage unit 1112. It is specified by searching from the original node number to the base node number, and stored in a storage device such as a main memory (step S27). Further, the route specification processing unit 1122 specifies the shortest route B from the destination node to the base node by searching the shortest route data table storage unit 1112 from the destination node number to the base node number. (Step S29).

  For example, in the network of FIG. 1, when the transmission source node is the node “2” and the destination node is the node “3”, the route A1 is “2-1” as shown in FIG. A series is obtained, and a node series of “3-6-5-1” is obtained as the route B1. On the other hand, when the transmission source node is the node “3” and the destination node is the node “4”, a node series “3-6-5-1” is included as the route A2, as shown in FIG. As a result, a node series of “4-6-5-1” is obtained as the route B2.

  Then, the route identification processing unit 1122 extracts one unprocessed node from the end of the routes A and B (step S31). Then, it is determined whether the numbers of the two extracted nodes are equal (step S33). In the case of FIG. 11, the node number “1” is taken out and determined to match. In the case of FIG. 12, the node number “1” is extracted and determined to match. When the node numbers of the two extracted nodes are equal, the common node is deleted from the paths A and B, and is substituted and held in the common node number C (step S35). Then, the process returns to step S31.

  In the case of FIG. 11, the node number “1” is deleted from the routes A1 and B1 and substituted for the common node number C. After that, since a matching node number cannot be obtained, “1” is assigned to the common node number C, the route A1 is “2”, and the route B1 is “3-6-5”. On the other hand, in the case of FIG. 12, since the next node “5” is also common, the node “5” is deleted from the routes A2 and B2, and the common node number C is changed to “5”. Further, since the next node “6” is also common, the node “6” is deleted from the routes A2 and B2, and the common node number C is changed to “6”. Since the next node does not match, the route A2 is “3”, the route B2 is “4”, and the common node number C is “6”.

  When the node numbers of the two extracted nodes do not match, the route specification processing unit 1122 rearranges the deleted routes B in reverse order (step S37). That is, in the case of FIG. 11, the route B1 after deletion is rearranged to the reverse route B1a “5-6-3”. In the example of FIG. 12, the route B2 after deletion is already composed of one node, so the route B2a “4” in the reverse order remains even if rearranged. Further, the route specification processing unit 1122 generates the route X in the order of the route A after the deletion-the node of the common node number C-the route B after the deletion in the reverse order, and stores it in a storage device such as a main memory (for example). Step S39). In the case of the example in FIG. 11, the route A1 “2” after deletion—the node “1” of the common node number C—the route B1a “5-6-3” after deletion in the reverse order. A route X of “-5-6-3” is obtained. On the other hand, in the case of FIG. 12, as shown in FIG. 13, the route A2a “3” after deletion—the node “6” of the common node number C—the route B2a “4” after deletion in the reverse order. , “3-6-4” is obtained. The processing shifts to the processing in FIG.

  By carrying out such processing, one base point node is arbitrarily determined, and even if the shortest path data table is held only in the management server 111, the path can be determined without any problem. Become. The route determined in this way may not necessarily be optimal, but there is no major problem in the practical range.

  Shifting to the description of the processing in FIG. 14, the connection data extraction unit 1123 sets the head of the path X as a processing target (step S <b> 41). Then, the next node of the processing target and the processing target on the route X is specified (step S43). Thereafter, the point-to-point connection data corresponding to the processing target and the next node is read from the point-to-point connection data storage unit 1113 (step S45). For example, in the case of FIG. 12, when the route is shown linearly and schematically, a state as shown in FIG. 15 is obtained. In such a case, the processing target is first the node “3” and the next node is the node “6”. Accordingly, the data in the eighth row of the point-to-point connection data storage unit (FIG. 8) is read. That is, the interface data is “21.0.0.3” and the destination address is “21.0.0.6”.

  Then, the connection data extraction unit 1123 determines whether the next node specified in step S43 is the tail node of the route X (step S47). If it is not the end node, the processing target is set to the next node (step S49), and the process returns to step S43. In the example of FIG. 15, the processing target is the node “6”, and the next node is the node “4”. Therefore, the 17th line data in the point-to-point connection data storage unit 1113 is read. That is, the interface data is “21.0.0.6” and the destination address is “21.0.0.4”. Here, since the node “4” is the end node of the route X, the process does not move to step S49.

  When the next node specified in step S43 is the end node of the route X, the connection data extraction unit 1123 uses the next node specified in step S43 and the data in the row corresponding to “e” between the two points. Read from the connection data storage unit 1113 (step S51). In the example of FIG. 15, the 12th row of the nodes “4” and “e” is read. That is, the interface data is “10.4.4.4” and there is no destination address, but the destination IP address received from the edge router is set.

  Then, the connection data extraction unit 1123 generates the entire connection data by arranging the read connection data in the order of the path X, and stores it in a storage device such as a main memory (step S53). In the example of FIG. 15, connection data as shown in FIG. 16 is generated. The data mentioned above is linked.

  By performing the processing as described above, connection data for enabling each router that does not hold the shortest path data table to easily specify the packet transmission destination can be obtained.

  Returning to the description of the processing in FIG. 9, the route calculation unit 1111 of the management server 111 transmits the generated connection data to the requesting edge router (step S15). The requesting edge router receives the connection data from the management server 111 and stores it in the acquired connection data storage unit 1013 (step S17). The processing shifts to the processing in FIG.

  The connection data adding unit 1021 of the connection data processing unit 1011 of the edge router adds other than the connection data for the own node to the packet header, and the own node data acquiring unit 1022 of the connection data processing unit 1011 is the connection data for the own node. And transmits a packet according to the connection data (FIG. 17: step S61). In the example of FIG. 16, since the head is connection data for the edge router “3”, other connection data is added to the packet header. That is, in the example of FIG. 16, data as shown in FIG. 18 is transmitted from the edge router “3” to the relay router “6”. In this embodiment, the connection data for the own node is cut off. However, the invalidation bit may be added to the packet header as it is. Note that what destination packet is specifically transmitted to which port from the connection data is the same as in the prior art, and thus the description thereof is omitted.

  The relay router receives the packet from the edge router (step S63), and the own node data acquisition unit 1052 in the connection data processing unit 1051 of the relay router cuts out the connection data for the own node from the packet and transmits the packet according to the connection data. Transmit (step S65). That is, data as shown in FIG. 19 is transmitted from the relay router “6” to the edge router “4” in the example of FIG. Depending on the route, it may be further transmitted to the relay router.

  In the example of FIG. 16, the edge router “4” receives the packet from the relay router “6” (step S67), and the own node data acquisition unit 1022 of the connection data processing unit 1011 extracts the connection data for the own node, A packet is transmitted according to the connection data (step S69). As shown in FIG. 20, a packet with no connection data is transmitted. Here, the user terminal 154 receives a packet from the edge router “4” (step S71).

  As described above, each edge router or relay router can transmit a packet to a target node without holding a shortest path data table (that is, a routing table). That is, power consumption for data retention can be reduced.

  Specifically, for example, in the conventional Hop-by-Hop, the average number of routing tables is 2.73, for example, the total number of routers is 15, the number of edge routers is 9 (60%), and the total number of links is 37 (246%). ), The subnet mask information is 41 × 64 bits and the next hop information is 41 × 64 bits, which requires a total of 5248 bits. Assuming that such a configuration grows as it is, the subnet mask information is the total number of routers x * 2.73 * 64 bits, the next hop information is the total number of routers x * 2.73 * 64 bits, and the total x * 349.4. A bit.

Further, when the conventional source routing method is adopted, the subnet-node correspondence information (for example, FIG. 5) is 9 × 80 bits and the route search table (for example, FIG. 6) is 72 × with the same configuration. The next hop information (for example, FIG. 8) is 37 × 96 bits with 32 bits, and a total of 6576 bits are required. If such a configuration grows as it is, the subnet mask / node correspondence information is the total number of routers x * 0.6 × 80 bits, and the total number of route search tables is x (x−1) * 0.6 * 32 bits. Then, the next hop information is the total number of routers x * 2.46 * 96 bits, and the total x ² * 19.2 + x * 265.0 bits. That is, it increases in proportion to the square of the total number of routers.

  On the other hand, in this embodiment, in the same configuration, the subnet mask-node correspondence information is 9 × 80 bits, the total number of route search tables is 8 × 32 bits, and the next hop information is 37 × 96 bits. There are a total of 4528 bits. That is, it is the least. Further, if such a configuration is increased as it is, the subnet mask / node correspondence information is the total number of routers x * 0.6 × 80 bits, the route search table is the total number of routers x * 0.6 × 32 bits, and the next hop. The information is the total number of routers x * 2.46 * 96 bits, for a total of x * 303.4 bits. In this way, the amount of data only needs to increase in proportion to the total number of routers, so the amount of data is reduced. That is, the power consumption can be reduced accordingly.

  Although the present embodiment has been described above, the present technology is not limited to this. For example, the network configuration as shown in FIG. 1 is an example, and other network configurations may be used. Further, the processing flow can be changed in order or executed in parallel as long as the processing result does not change. Furthermore, the functional block diagram is an example, and may not necessarily match the actual program module configuration. The functional block is implemented by a dedicated circuit or a combination of hardware and software.

  The node data storage unit 1114 may be held in each router, and the destination node number may be transmitted from the router instead of the destination IP address. However, the total data amount increases accordingly.

  The management server 111 is a computer device. As shown in FIG. 21, the management server 111 is for a memory 2501, a CPU 2503, a hard disk drive (HDD) 2505, a display control unit 2507 connected to a display device 2509, and a removable disk 2511. The drive device 2513, the input device 2515, and the communication control unit 2517 for connecting to the network are connected by a bus 2519. An operating system (OS) and an application program for executing the processing in this embodiment are stored in the HDD 2505, and are read from the HDD 2505 to the memory 2501 when executed by the CPU 2503. If necessary, the CPU 2503 controls the display control unit 2507, the communication control unit 2517, and the drive device 2513 to perform necessary operations. Further, data in the middle of processing is stored in the memory 2501 and stored in the HDD 2505 if necessary. In an embodiment of the present technology, an application program for performing the above-described processing is stored in a computer-readable removable disk 2511 and distributed, and installed from the drive device 2513 to the HDD 2505. In some cases, the HDD 2505 may be installed via a network such as the Internet and the communication control unit 2517. Such a computer apparatus realizes various functions as described above by organically cooperating hardware such as the CPU 2503 and the memory 2501 described above, the OS, and necessary application programs.

  The router may also be realized by a computer as shown in FIG.

  The present embodiment can be summarized as follows.

  A route determination method executed by a management device that manages nodes in a network that does not hold network route information includes a node specifying step that specifies a source node and a destination node of a packet, and a predetermined base point in the network The first route that is the shortest route from the source node to the base node and the shortest route from the destination node to the base node from the route data storage unit (for example, the shortest route data table storage unit) that stores the shortest route data for the node A partial route specifying step for specifying the second route, and the second route after deleting the overlapping portion from the end of the first route and the second route from the first route and the second route. In the reverse order and connected to the node closest to the head in the first route after the deletion and the overlapping portion, From and identifying the third path to the destination node.

  Even if the management device holds the route data storage unit that stores the shortest route data based on an arbitrary base node and does not hold it in each node, the transmission is performed if the processing described above is performed. The route from the source node to the destination node can be specified. That is, the amount of data held in the router is reduced, and power consumption is reduced.

  Further, in this route determination method, for each combination of two nodes sequentially connected from the transmission source node in the third route from the point-to-point connection data storage unit that stores connection data between adjacent nodes in the network, A step of reading connection data to be transmitted and notifying the transmission source node may be further included. In this way, each router can easily specify a packet transmission destination using a conventional mechanism.

  Further, in this route determination method, a step of determining whether the transmission source node or the destination node matches the base node, a step of performing the partial route specifying step and the subsequent steps when it is determined that they do not match, If it is determined that it is correct, the method further includes a step of specifying, as a third route, the shortest route from the source node to the base node or the shortest route from the base node to the destination node from the route data storage unit. good. When the conditions as described above are satisfied, a process for connecting the first route and the second route is unnecessary, and the route can be easily specified from the data stored in the route data storage unit.

  Further, the node specifying step described above includes a step of receiving a transmission destination IP address from a transmission source node, and a node ID data storage unit in which a node ID is stored in association with the IP address of each node in the network. And specifying a node ID corresponding to the destination IP address. In this way, the amount of data held by the edge router can be further reduced.

  It is possible to create a program for causing the hardware to perform the processing described above, and the program can be read by a computer such as a flexible disk, a CD-ROM, a magneto-optical disk, a semiconductor memory, and a hard disk. It is stored in a possible storage medium or storage device. Note that data being processed is temporarily stored in a storage device such as a computer memory.

  The following supplementary notes are further disclosed with respect to the embodiments including the above examples.

(Appendix 1)
A route determination program that is executed by a management device that manages nodes in the network and does not hold network route information,
A node identification step for identifying a source node and a destination node of the packet;
From the route data storage unit that stores the shortest route data for a predetermined base node in the network to the first route that is the shortest route from the source node to the base node and from the destination node to the base node A partial route specifying step for specifying the second route that is the shortest route of
The overlapping portion from the end of the first route and the second route is deleted from the first route and the second route, and the second route after the deletion is reversed and the second route after the deletion is deleted. Identifying a third route from the source node to the destination node by linking to the node closest to the beginning of the one route and the overlapping portion; and
Is a route determination program for causing the management device to execute.

(Appendix 2)
Read corresponding connection data for each combination of two nodes sequentially connected from the transmission source node in the third route from the point-to-point connection data storage unit for storing connection data between adjacent nodes in the network The route determination program according to appendix 1, for further executing the step of notifying the transmission source node.

(Appendix 3)
Determining whether the source node or the destination node matches the base node;
If it is determined that they do not match, the step of performing the partial path specifying step and the following steps;
If it is determined that they match, the shortest path from the source node to the base node or the shortest path from the base node to the destination node is specified as the third path from the path data storage unit. Steps,
The route determination program according to appendix 1 or 2, further comprising:

(Appendix 4)
The node specifying step includes:
Receiving a destination IP address from the source node;
Identifying a node ID corresponding to the destination IP address from a node ID data storage unit in which a node ID is stored in association with the IP address of each node in the network;
The route determination program according to any one of supplementary notes 1 to 3, including:

(Appendix 5)
A management device that manages nodes in the network that does not hold network route information,
Means for identifying the source and destination nodes of the packet;
A route data storage unit for storing shortest route data for a predetermined base node in the network;
Means for identifying, from the path data storage unit, a first path that is the shortest path from the source node to the base node and a second path that is the shortest path from the destination node to the base node;
The overlapping portion from the end of the first route and the second route is deleted from the first route and the second route, and the second route after the deletion is reversed and the second route after the deletion is deleted. Means for identifying a third route from the source node to the destination node by connecting to the node closest to the head in the one route and the overlapping portion;
A management device.

(Appendix 6)
Multiple nodes that do not hold network route information,
A management device capable of communicating with the router;
Have
A first node of the plurality of nodes is
When a packet to be transmitted via the network is received, the ID of the transmission source node, which is its own node ID, and the destination IP address of the packet are transmitted to the management device,
The management device
Means for receiving the source node ID and the destination IP address from the specific node, and identifying the destination node ID corresponding to the destination IP address;
A route data storage unit for storing shortest route data for a predetermined base node in the network;
Means for identifying, from the path data storage unit, a first path that is the shortest path from the source node to the base node and a second path that is the shortest path from the destination node to the base node;
The overlapping portion from the end of the first route and the second route is deleted from the first route and the second route, and the second route after the deletion is reversed and the second route after the deletion is deleted. Means for identifying a third route from the source node to the destination node by connecting to the node closest to the head in the one route and the overlapping portion;
A point-to-point connection data storage unit for storing connection data between adjacent nodes in the network;
Means for reading out the corresponding connection data for each combination of two nodes sequentially connected from the transmission source node in the third path from the point-to-point connection data storage unit, and notifying the transmission source node;
Have
The specific node receives the connection data from the management device and uses the received connection data to transmit the received packet. At least the connection data used by the other nodes on the third path is used as the connection data. Send it with a packet,
The other node on the third route sends out a received packet using the connection data for its own node among the received connection data.

DESCRIPTION OF SYMBOLS 111 Management server 1111 Path | route calculation part 1121 Node specific process part 1122 Path | route specific process part 1123 Connection data extraction part 1114 Node data storage part 1112 Shortest path | route data table storage part 1113 Point-to-point connection data storage part

Claims (5)

A path determination program executed by the management apparatus for managing a node in the network,
A node identification step for identifying a source node and a destination node of the packet;
From the route data storage unit that stores the shortest route data for a predetermined base node in the network to the first route that is the shortest route from the source node to the base node and from the destination node to the base node A partial route specifying step for specifying the second route that is the shortest route of
The overlapping portion from the end of the first route and the second route is deleted from the first route and the second route, and the second route after the deletion is reversed and the second route after the deletion is deleted. Identifying a third route from the source node to the destination node by linking to the node closest to the beginning of the one route and the overlapping portion; and
Read corresponding connection data for each combination of two nodes sequentially connected from the transmission source node in the third route from the point-to-point connection data storage unit for storing connection data between adjacent nodes in the network A route determination program for causing the management device to execute the step of notifying the transmission source node . Determining whether the source node or the destination node matches the base node;
If it is determined that they do not match, the step of performing the partial path specifying step and the following steps;
If it is determined that they match, the shortest path from the source node to the base node or the shortest path from the base node to the destination node is specified as the third path from the path data storage unit. Steps,
Further comprising Claim 1 Symbol placement path determination program of. The node specifying step includes:
Receiving a destination IP address from the source node;
Identifying a node ID corresponding to the destination IP address from a node ID data storage unit in which a node ID is stored in association with the IP address of each node in the network;
The route determination program according to claim 1 or 2 , comprising: A management apparatus for managing a node in the network,
Means for identifying the source and destination nodes of the packet;
A route data storage unit for storing shortest route data for a predetermined base node in the network;
Means for identifying, from the path data storage unit, a first path that is the shortest path from the source node to the base node and a second path that is the shortest path from the destination node to the base node;
The overlapping portion from the end of the first route and the second route is deleted from the first route and the second route, and the second route after the deletion is reversed and the second route after the deletion is deleted. Means for identifying a third route from the source node to the destination node by connecting to the node closest to the head in the one route and the overlapping portion;
Read corresponding connection data for each combination of two nodes sequentially connected from the transmission source node in the third route from the point-to-point connection data storage unit for storing connection data between adjacent nodes in the network Notification means for notifying the source node;
A management device. A route determination method executed by a management device that manages nodes in a network,
  A node identification step for identifying a source node and a destination node of the packet;
  From the route data storage unit that stores the shortest route data for a predetermined base node in the network to the first route that is the shortest route from the source node to the base node and from the destination node to the base node A partial route specifying step for specifying the second route that is the shortest route of
  The overlapping portion from the end of the first route and the second route is deleted from the first route and the second route, and the second route after the deletion is reversed and the second route after the deletion is deleted. Identifying a third route from the source node to the destination node by linking to the node closest to the beginning of the one route and the overlapping portion; and
  Read corresponding connection data for each combination of two nodes sequentially connected from the transmission source node in the third route from the point-to-point connection data storage unit for storing connection data between adjacent nodes in the network And notifying the source node;
  A route determination method including:

Images