WO2018127943A1 - 転送装置および経路追加方法 - Google Patents
転送装置および経路追加方法 Download PDFInfo
- Publication number
- WO2018127943A1 WO2018127943A1 PCT/JP2017/000031 JP2017000031W WO2018127943A1 WO 2018127943 A1 WO2018127943 A1 WO 2018127943A1 JP 2017000031 W JP2017000031 W JP 2017000031W WO 2018127943 A1 WO2018127943 A1 WO 2018127943A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- failure
- route
- transfer device
- transfer
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Definitions
- the present invention relates to a transfer apparatus and a route addition method for transferring a frame in a mesh network.
- One type of network is a mesh network.
- communication paths that is, path redundancy
- SPB Shortest Path Bridging
- SPB is a technology that enables high-speed path switching, redundant path configuration, traffic distribution, etc. when a failure occurs by configuring ECMP (Equal Cost Multi Path).
- the present invention has been made in view of the above, and an object thereof is to obtain a transfer apparatus capable of improving the reliability of communication in a mesh network.
- the transfer device of the present invention is based on the first topology information that is the topology information of the network constituted by the plurality of transfer devices, and the transfer device
- a redundant path calculation unit that calculates a plurality of shortest paths from the first transfer apparatus to the second transfer apparatus and generates redundant path information that is information of the plurality of shortest paths, and information holding that stores the redundant path information
- a single point of failure detection unit that detects a single point of failure based on redundant path information and generates second topology information that is topology information obtained by removing the single point of failure from the first topology information; Is provided.
- the redundant path calculation unit calculates an additional path candidate to be added as a path from the first transfer apparatus to the second transfer apparatus based on the second topology information, and adds an additional path candidate as additional path candidate information. Generate information.
- the single failure point detection unit is characterized in that an additional route is determined based on the additional route candidate information, and additional route information that is information on the additional route is generated and registered in the information holding unit.
- the transfer device according to the present invention has an effect of improving the reliability of communication in a mesh network.
- Diagram showing an example of mesh network configuration Block diagram showing a configuration example of a transfer device
- movement of the route calculation process of a transfer apparatus The figure which shows the example of the mesh network for demonstrating the process in which a single failure point detection part detects a single failure point
- the figure which shows the structural example of the hardware of a transfer apparatus The figure which shows the other structural example of the hardware of a transfer apparatus
- FIG. 1 is a diagram showing a configuration example of a mesh network 30 according to an embodiment of the present invention.
- the mesh network 30 is a network composed of transfer devices 10-1 to 10-6 that transfer frames.
- the mesh network 30 is connected to terminal devices 20-1 to 20-7 that are frame transmission sources or frame destinations.
- transfer devices 10-1 to 10-6 when they are not distinguished, they may be referred to as transfer devices 10.
- terminal devices 20-1 to 20-7 when terminal devices 20-1 to 20-7 are not distinguished, they may be referred to as terminal devices 20.
- the transfer device 10 is a switch device that can be connected to one or more other transfer devices 10 and one or more terminal devices 20. Each transfer device 10 exchanges connection information with other transfer devices 10 constituting the mesh network 30, and generates and holds topology information of the mesh network 30 from the connection information collected from the other transfer devices 10. .
- the connection information is information about the transfer device 10 to which another transfer device 10 is connected.
- the topology information of the mesh network 30 is defined as first topology information.
- Each transfer device 10 determines a communication path to each of the other transfer devices 10, that is, a route for communicating with each of the other transfer devices 10 by SPB. In the following description, a route may be referred to as a path.
- the terminal device 20 can be connected to one transfer device 10.
- the terminal device 20 communicates with other terminal devices 20 via one or more transfer devices 10, that is, transmits and receives frames.
- the connection relationship between each transfer device 10 and each terminal device 20 is indicated by a solid line, and the solid line corresponds to a communication path.
- a communication path between adjacent transfer apparatuses 10 may be referred to as a link.
- FIG. 2 is a block diagram illustrating a configuration example of the transfer apparatus 10 according to the present embodiment.
- the transfer apparatus 10 includes a link state database 11, a redundant path calculation unit 12, a forwarding database 13, a single failure point detection unit 14, and a virtual link state database 15.
- the redundant route calculation unit 12 includes a shortest route calculation unit 121 and a tie breaker 122.
- FIG. 2 the main part of the transfer apparatus 10 related to the characteristic operation in the present embodiment, specifically, functional blocks necessary for setting a path for communicating with another transfer apparatus 10 are shown. The other functional blocks included in a general transfer device are not shown.
- the link state database 11 is a first information holding unit.
- the link state database 11 holds first topology information that is topology information of the mesh network 30 configured by the plurality of transfer apparatuses 10.
- the first topology information includes connection relationship information between the transfer apparatuses 10 and a link cost.
- the link cost is, for example, the bandwidth of each link.
- the redundant path calculation unit 12 Based on the first topology information held in the link state database 11, the redundant path calculation unit 12 has the shortest path, ie, the shortest path, for all combinations of pairs of the plurality of transfer apparatuses 10 constituting the mesh network 30. Calculate one or more routes.
- the redundant path calculation unit 12 uses the SPB when calculating the shortest path.
- the SPB is realized by the operations of the shortest route calculation unit 121 and the tie breaker 122.
- the shortest path in the combination of adjacent transfer apparatuses 10 is one.
- the shortest path calculation unit 121 of the redundant path calculation unit 12 can be combined in a plurality of transfer devices 10 constituting the mesh network 30 based on the first topology information held in the link state database 11.
- the shortest path between the transfer devices 10 of each pair is calculated.
- the shortest path calculation unit 121 uses, for example, the Dijkstra algorithm described in “A Note on Two Problems in Connexion with Graphs (“ Numewitz Mathematik ”Volume 1, 1959, p.269-271)” as the shortest path calculation algorithm. use.
- the shortest path calculation unit 121 notifies the tie breaker 122 of selection information that is information such as the link cost of each path calculated for each pair of the transfer apparatuses 10.
- the tie breaker 122 of the redundant route calculation unit 12 uses the selection information from the shortest route calculation unit 121 when there are a plurality of shortest routes from the transfer device 10 at the start point to the transfer device 10 at the end point in each pair of transfer devices 10. Based on this, one of a plurality of shortest paths is selected by a tie break algorithm.
- the transfer device 10 at the starting point may be referred to as a first transfer device, and the transfer device 10 at the end point may be referred to as a second transfer device.
- the tie breaker 122 notifies the shortest path calculation unit 121 of the selection result.
- the shortest path calculation unit 121 generates redundant path information that is information on the shortest path based on the selection result from the tie breaker 122 and registers the redundant path information in the forwarding database 13. For example, when there are a plurality of shortest paths, the shortest path calculation unit 121 generates the shortest path selected by the tie breaker 122 as one of the redundant path information. For convenience of explanation, even when there is one shortest path that can be calculated by the redundant path calculation unit 12, the shortest path information registered in the forwarding database 13 by the shortest path calculation unit 121 and the shortest path calculation unit 121 is a single failure.
- the shortest path information output to the point detection unit 14 is redundant path information. The details of the redundant route calculation procedure by the shortest route calculation unit 121 and the tie breaker 122 of the redundant route calculation unit 12 are described in Non-Patent Document 1.
- the forwarding database 13 is a second information holding unit.
- the forwarding database 13 is a database generally owned by a device having a frame transfer function, and corresponds to, for example, a VLAN (Virtual Local Area Network) table.
- the forwarding database 13 holds redundant path information, which is information on a plurality of shortest paths calculated by the redundant path calculation unit 12, and determines to which transfer apparatus 10 the frame received by the transfer apparatus 10 should be transferred. Holds the information shown.
- the forwarding database 13 may be simply referred to as an information holding unit.
- the single failure point detection unit 14 determines whether there is a transfer device 10 or a link that is a single point of failure in the route between the two transfer devices 10. Determine whether.
- a single failure point has a plurality of shortest paths indicated by redundant path information. However, when a failure occurs in a certain transfer device 10 or one link, a fault occurs in all the shortest paths and the redundant path information is applied. It is a location that causes a communication failure between a pair of transfer devices 10. As the single point of failure, either the transfer device 10 or the link may be applicable.
- the single point of failure detection unit 14 detects a single point of failure, that is, when there is a single point of failure, topology information obtained by removing the single point of failure from the first topology information held in the link state database 11. That is, the second topology information, which is the topology information about the network in which the transfer device 10 or the link that is a single failure point is removed from the mesh network 30, is generated and registered in the virtual link state database 15. As described above, the single failure point detection unit 14 generates the second topology information based on the redundant path information and the first topology information. Details of the operation of the single point of failure detection unit 14 will be described later.
- the virtual link state database 15 is a third information holding unit.
- the virtual link state database 15 is the same as the link state database 11 in the type of data to be held, but the content of the held data is the second topology information generated by the single failure point detector 14 as described above. is there.
- FIG. 3 is a flowchart showing an example of the operation of the route calculation process of the transfer apparatus 10 according to the present embodiment.
- the transfer apparatus 10 registers, in the forwarding database 13, route information that does not form a single point of failure, based on the first topology information held in the link state database 11.
- An example of the operation up to is shown.
- the transfer device 10 has a prescribed condition such as when an instruction is received from an external network administrator.
- the transfer device 10 performs the processing of the flowchart shown in FIG. 3 for each combination of all pairs of the plurality of transfer devices 10 constituting the mesh network 30.
- the redundant path calculation unit 12 first sets a pair of transfer devices 10 constituting a mesh network as a target based on the first topology information held in the link state database 11. One or more shortest paths between the transfer apparatuses 10 are calculated (step S11). As described above, in the case of a combination of adjacent transfer apparatuses 10 in the mesh network, there is one shortest path. Therefore, including such a case, the redundant path calculation unit 12 also calculates a redundant path for the process of step S11. The redundant path calculation unit 12 registers the redundant path information, which is the calculated redundant path information, in the forwarding database 13 (step S12). Further, the redundant path calculation unit 12 outputs the redundant path information to the single failure point detection unit 14. Steps S11 and S12 are first calculation steps.
- the single point of failure detection unit 14 determines whether or not there is a single point of failure in the path between the two transfer devices 10 based on the redundant path information from the redundant path calculation unit 12 (step S13).
- FIG. 4 is a diagram illustrating an example of the mesh network 31 for explaining a process in which the single failure point detection unit 14 according to the present embodiment detects a single failure point.
- the mesh network 31 includes transfer devices 10-1 to 10-11. For example, when the shortest path from the transfer device 10-1 to the transfer device 10-11 is calculated by the SPB, the single failure point detection unit 14 detects the transfer device 10-5 as a single failure point.
- the transfer device 10-1 is a first transfer device
- the transfer device 10-11 is a second transfer device.
- the shortest path from the transfer device 10-1 to the transfer device 10-11 is the transfer device 10-1, the transfer device 10-2, the transfer device 10-5, and the transfer device.
- Route information excluding the transfer device 10-1 as the starting point and the transfer device 10-11 as the end point from the four route information that is, “10-2 ⁇ 10-5 ⁇ 10-9”, “10-2” ⁇ 10-5 ⁇ 10-10 ”,“ 10-3 ⁇ 10-5 ⁇ 10-9 ”, and“ 10-3 ⁇ 10-5 ⁇ 10-10 ”
- the transfer device 10 included in the information is the transfer device 10-5.
- the single point of failure detection unit 14 detects the transfer device 10-5 as a single point of failure by the above method.
- the single point of failure detection unit 14 detects a single point of failure, that is, when there is a single point of failure (step S13: Yes), the single point of failure is detected from the first topology information held in the link state database 11. Second topology information from which the failure point has been removed is generated, and the generated second topology information is registered in the virtual link state database 15 (step S14). For example, in the mesh network 31 shown in FIG. 4, when the single point of failure formed on the shortest path from the transfer device 10-1 to the transfer device 10-11 is removed, the topology shown in FIG. 5 is obtained.
- FIG. 5 is a diagram illustrating an example of the mesh network 31 in which the single point of failure detection unit 14 according to the present embodiment detects a single point of failure in the mesh network 31 illustrated in FIG. 4 and removes the single point of failure. is there.
- the second topology information held in the virtual link state database 15 is a state in which the transfer device 10-5 is removed from the first topology information held in the link state database 11.
- Step S13: No If no single point of failure is detected, that is, there is no single point of failure (step S13: No), the transfer device 10 ends the process. Steps S13 and S14 are first detection steps.
- the redundant path calculation unit 12 targets the same pair of transfer apparatuses 10 as in step S ⁇ b> 11 as the shortest path between the pair of transfer apparatuses 10. Is calculated (step S15). Further, the redundant path calculation unit 12 determines whether or not there is a shortest path, that is, whether or not there is a path connected from the transfer device at the starting point to the transfer device at the end point (step S16). This is because the mesh network 31 may be separated by removing the single point of failure.
- the redundant path calculation unit 12 removes the single failure point, that is, the transfer apparatus 10-5 formed on the shortest path from the transfer apparatus 10-1 to the transfer apparatus 10-11 in the mesh network 31 shown in FIG.
- the shortest path is calculated as much as possible based on the topology information, the two shortest paths indicated by arrows in FIG. 5 are calculated.
- FIG. 6 is a diagram illustrating an example of the mesh network 32 for explaining the process in which the single failure point detection unit 14 according to the present embodiment detects a single failure point.
- FIG. 7 shows an example of the mesh network 32 in which the single point of failure detection unit 14 according to the present embodiment detects a single point of failure in the mesh network 32 shown in FIG. 6 and removes the single point of failure.
- the single failure point on the shortest path from the transfer apparatus 10-1 to the transfer apparatus 10-11 is the transfer apparatus 10-5.
- step S14 when the single failure point detector 14 removes the transfer device 10-5 from the mesh network 32, the mesh network 32 is separated as shown in FIG. In this case, there is no path connected from the transfer apparatus 10-1 to the transfer apparatus 10-11.
- the redundant route calculation unit 12 determines whether or not there is a shortest route in step S16, that is, there is a route connected from the transfer device 10-1 at the start point to the transfer device 10-11 at the end point. It is determined whether or not.
- the redundant path calculation unit 12 determines that the calculated shortest path is included in the forwarding database 13 when there is a path connected from the transfer apparatus 10-1 at the starting point to the transfer apparatus 10-11 as the end point (step S16: Yes). As additional route candidates to be added to the route, additional route candidate information that is additional route candidate information is generated and output to the single failure point detection unit 14. When there is no route connected from the transfer device 10-1 at the starting point to the transfer device 10-11 at the end point (No in step S16), the redundant route calculation unit 12 checks that the shortest route could not be calculated. Notify the exit unit 14. Steps S15 and S16 are second calculation steps.
- the single point of failure detection unit 14 determines whether or not a single point of failure exists in the route between the two transfer devices 10 based on the additional route candidate information (step S17).
- the method for determining whether or not there is a single point of failure in step S17 in the single point of failure detector 14 is the same as in step S13.
- the single point of failure detection unit 14 does not detect a single point of failure, that is, when there is no single point of failure (step S17: No), the additional route candidate having the shortest route length among the additional route candidates, and the distance thereof Remember.
- the single point of failure detection unit 14 stores the shortest additional route candidate and its distance for each pair of the transfer device 10 at the start point and the transfer device 10 at the end point. Taking the mesh network 31 shown in FIG.
- the single failure point detector 14 includes information on the shortest additional route candidate from the transfer device 10-1 to the transfer device 10-11 and its distance (hereinafter referred to as information 1). ), The shortest additional route candidate from the transfer device 10-11 to the transfer device 10-1 and the distance information (hereinafter referred to as information 2) are stored separately.
- the single point of failure detection unit 14 does not compare information 1 and information 2.
- the single point of failure detection unit 14 compares the distance of the newly stored additional route candidate and the distance of the stored additional route candidate. When the distance of the newly stored additional route candidate is smaller than the distance of the stored additional route candidate, that is, the newly stored additional route candidate is the shortest among the additional route candidates. (Step S18: Yes), the newly stored additional route candidate is stored as the latest additional route candidate, and the additional route candidate is updated (step S19). Note that the single point of failure detection unit 14 may perform step S19 by omitting step S18 when there is no stored additional route candidate, that is, for the first operation.
- step S16 When the single failure point detection unit 14 receives a notification from the redundant route calculation unit 12 that there is no route connected from the transfer device 10-1 at the start point to the transfer device 10-11 at the end point (step S16: No)
- step S17: Yes When a single point of failure is detected, that is, when a single point of failure exists (step S17: Yes), the distance of the stored additional route candidate ⁇ the distance of the newly stored additional route candidate, that is, the newly stored additional route If the candidate is not the shortest among the additional route candidates (step S18: No), and after the process of step S19, whether there is a single point of failure that has not been removed in step S14 in the process so far Is determined (step S20). This is because there may be a plurality of single points of failure in one route.
- step S20 If there is a single point of failure that has not yet been tried for removal (step S20: Yes), the single point of failure detection unit 14 returns to step S14 and removes it from the first topology information in the link state database 11 in step S14. The second topology information from which the single point of failure that has not been tried is removed is generated. The subsequent processing is as described above. As described above, the single failure point detection unit 14 determines an additional route based on the additional route candidate information, generates additional route information, and registers it in the forwarding database 13.
- the single failure point detection unit 14 determines the transfer device 10 included in all the shortest paths of the redundant route information or the communication path between the transfer devices 10 as a single failure point, and the first topology information
- the second topology information is generated by removing one of the single points of failure determined from the above. When there are a plurality of single failure points, the single failure point detection unit 14 changes the single failure point to be removed and generates the second topology information.
- the single point of failure detection unit 14 When the single point of failure detection unit 14 tries to remove all the single points of failure (step S20: No), the single point of failure detection unit 14 generates additional route information using the additional route candidate stored in the process of step S19 as an additional route.
- the additional route information is registered in the forwarding database 13 (step S21).
- the single failure point detection unit 14 is connected from the transfer device 10 at the starting point to the transfer device 10 at the end point, and when there are a plurality of additional route candidates for which no single failure point has been detected, The additional route candidate with the shortest route length is determined as the additional route, and additional route information is generated.
- Steps S17 to S21 are second detection steps.
- step S13 to step S20 for example, a specific route designated by the administrator of the mesh network 31 shown in FIG. 4, for example, from the transfer apparatus 10-1 to the transfer apparatus 10-11 is performed. It is possible to carry out the above-mentioned route, or it may be carried out over the route between all the transfer apparatuses 10 constituting the mesh network 31.
- FIG. 8 is a diagram illustrating a hardware configuration example of the transfer apparatus 10 according to the present embodiment.
- the transfer device 10 can be realized by the processor 91, the memory 92, and the data transfer hardware 93 shown in FIG. These processor 91, memory 92, and data transfer hardware 93 are connected via a bus 94.
- the processor 91 is a CPU (Central Processing Unit, central processing unit, processing unit, arithmetic unit, processor, microprocessor, microcomputer, DSP (Digital Signal Processor)), system LSI (Large Scale Integration), or the like.
- the memory 92 is a nonvolatile or volatile semiconductor memory such as RAM (Random Access Memory), ROM (Read Only Memory), flash memory, EPROM (Erasable Programmable Read Only Memory), EEPROM (Electrically Erasable Programmable Read Only Memory), Magnetic disk, flexible disk, optical disk, compact disk, mini disk, DVD (Digital Versatile Disc), etc.
- the link state database 11, the forwarding database 13, and the virtual link state database 15 of the transfer device 10 are realized by the memory 92.
- the redundant path calculation unit 12 and the single failure point detection unit 14 of the transfer device 10 are realized by software, firmware, or a combination of software and firmware. Software and firmware are described as programs and stored in the memory 92.
- the redundant path calculation unit 12 and the single failure point detection unit 14 are configured such that the processor 91 reads a program for operating as the redundant path calculation unit 12 and the single failure point detection unit 14 from the memory 92 and executes them. Realized. That is, the transfer device 10 executes a program that results in the steps of executing the operations of the redundant path calculation unit 12 and the single failure point detection unit 14 being executed by the processor 91.
- a memory 92 for storing is provided. These programs can also be said to cause the computer to execute various processes performed by the redundant path calculation unit 12 and the single failure point detection unit 14.
- the redundant path calculation unit 12 and the single failure point detection unit 14 may be realized by dedicated hardware.
- FIG. 9 is a diagram illustrating another configuration example of hardware of the transfer device 10 according to the present embodiment.
- the redundant path calculation unit 12 and the single failure point detection unit 14 are realized by a processing circuit 95 as dedicated hardware.
- Dedicated hardware includes single circuits, composite circuits, programmed processors, parallel programmed processors, ASIC (Application Specific Integrated Circuit), FPGA (Field Programmable Gate Array), or a combination of these.
- One of the redundant path calculation unit 12 and the single failure point detection unit 14 may be realized by dedicated hardware, and the rest may be realized by the processor 91 and the memory 92 described above.
- the data transfer hardware 93 is used when the transfer device 10 receives data from another transfer device 10 or the terminal device 20 and when the received data is transferred to the other transfer device 10 or the terminal device 20. .
- the data transfer hardware 93 is also used when receiving information stored in the link state database 11 from the outside.
- the transfer device 10 uses the first topology information of the mesh network.
- An additional route is determined based on the second topology information from which the single point of failure has been removed, and is held together with information on the redundant route obtained from the first topology information.
- the transfer apparatus 10 can hold
- the configuration described in the above embodiment shows an example of the contents of the present invention, and can be combined with another known technique, and can be combined with other configurations without departing from the gist of the present invention. It is also possible to omit or change the part.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
図1は、本発明の実施の形態にかかるメッシュネットワーク30の構成例を示す図である。メッシュネットワーク30は、フレームの転送を行う転送装置10-1~10-6により構成されるネットワークである。また、メッシュネットワーク30には、フレームの送信元またはフレームの宛先となる端末装置20-1~20-7が接続されている。以降の説明において、転送装置10-1~10-6を区別しない場合、転送装置10と称することがある。また、端末装置20-1~20-7を区別しない場合、端末装置20と称することがある。
Claims (5)
- 複数の転送装置によって構成されるネットワークのトポロジ情報である第1のトポロジ情報に基づいて、前記複数の転送装置のうちの第1の転送装置から第2の転送装置までの1つ以上の最短経路を算出し、前記1つ以上の最短経路の情報である冗長経路情報を生成する冗長経路算出部と、
前記冗長経路情報を保持する情報保持部と、
前記冗長経路情報に基づいて単一障害点を検出し、前記第1のトポロジ情報から前記単一障害点を除去したトポロジ情報である第2のトポロジ情報を生成する単一障害点検出部と、
を備え、
前記冗長経路算出部は、前記第2のトポロジ情報に基づいて、前記第1の転送装置から前記第2の転送装置までの経路として追加する追加経路の候補を算出し、追加経路候補の情報である追加経路候補情報を生成し、
前記単一障害点検出部は、前記追加経路候補情報に基づいて前記追加経路を決定し、前記追加経路の情報である追加経路情報を生成して前記情報保持部に登録する、
ことを特徴とする転送装置。 - 前記単一障害点検出部は、前記冗長経路情報の全ての最短経路に含まれている転送装置、または転送装置間の通信路を前記単一障害点に決定し、決定した前記単一障害点の1つを前記第1のトポロジ情報から除去した第2のトポロジ情報を生成する、
ことを特徴とする請求項1に記載の転送装置。 - 前記単一障害点検出部は、前記単一障害点が複数ある場合、除去する単一障害点を変えて第2のトポロジ情報を生成する、
ことを特徴とする請求項2に記載の転送装置。 - 前記単一障害点検出部は、単一障害点が検出されなかった追加経路候補が複数あった場合、複数の追加経路候補のうち経路長が最短の追加経路候補を前記追加経路として前記追加経路情報を生成する、
ことを特徴とする請求項2または3に記載の転送装置。 - 冗長経路算出部が、複数の転送装置によって構成されるネットワークのトポロジ情報である第1のトポロジ情報に基づいて、前記複数の転送装置のうちの第1の転送装置から第2の転送装置までの複数の最短経路を算出し、前記複数の最短経路の情報である冗長経路情報を生成し、情報保持部に登録する第1の算出ステップと、
単一障害点検出部が、前記冗長経路情報に基づいて単一障害点を検出し、前記第1のトポロジ情報から前記単一障害点を除去したトポロジ情報である第2のトポロジ情報を生成する第1の検出ステップと、
前記冗長経路算出部が、前記第2のトポロジ情報に基づいて、前記第1の転送装置から前記第2の転送装置までの経路として追加する追加経路の候補を算出し、追加経路候補の情報である追加経路候補情報を生成する第2の算出ステップと、
前記単一障害点検出部が、前記追加経路候補情報に基づいて前記追加経路を決定し、前記追加経路の情報である追加経路情報を生成して前記情報保持部に登録する第2の検出ステップと、
を含むことを特徴とする経路追加方法。
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2017/000031 WO2018127943A1 (ja) | 2017-01-04 | 2017-01-04 | 転送装置および経路追加方法 |
KR1020197018628A KR102024515B1 (ko) | 2017-01-04 | 2017-01-04 | 전송 장치 및 경로 추가 방법 |
US16/346,624 US10999186B2 (en) | 2017-01-04 | 2017-01-04 | Transfer device and route addition method |
CN201780081376.1A CN110115005B (zh) | 2017-01-04 | 2017-01-04 | 传送装置和路径追加方法 |
JP2018560273A JP6501992B2 (ja) | 2017-01-04 | 2017-01-04 | 転送装置および経路追加方法 |
DE112017006045.1T DE112017006045B4 (de) | 2017-01-04 | 2017-01-04 | Übertragungsvorrichtung und verfahren zum hinzufügen einer route |
TW106115588A TWI646806B (zh) | 2017-01-04 | 2017-05-11 | 轉送裝置及路徑追加方法 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2017/000031 WO2018127943A1 (ja) | 2017-01-04 | 2017-01-04 | 転送装置および経路追加方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018127943A1 true WO2018127943A1 (ja) | 2018-07-12 |
Family
ID=62790822
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2017/000031 WO2018127943A1 (ja) | 2017-01-04 | 2017-01-04 | 転送装置および経路追加方法 |
Country Status (7)
Country | Link |
---|---|
US (1) | US10999186B2 (ja) |
JP (1) | JP6501992B2 (ja) |
KR (1) | KR102024515B1 (ja) |
CN (1) | CN110115005B (ja) |
DE (1) | DE112017006045B4 (ja) |
TW (1) | TWI646806B (ja) |
WO (1) | WO2018127943A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2020141261A (ja) * | 2019-02-28 | 2020-09-03 | 富士通株式会社 | 情報処理プログラム、情報処理装置、および、情報処理方法 |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20220224638A1 (en) * | 2021-01-08 | 2022-07-14 | Hewlett Packard Enterprise Development Lp | Preventing generation of duplicate network routes in a software defined wide area network |
US11425034B1 (en) * | 2021-03-30 | 2022-08-23 | Juniper Networks, Inc. | Determining shielded backup paths |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2003005725A2 (en) * | 2001-07-03 | 2003-01-16 | Hewlett-Packard Company | Method and system for streaming media with multiple description |
WO2014074541A2 (en) * | 2012-11-12 | 2014-05-15 | Alcatel Lucent | System and method for a pass thru mode in a virtual chassis system |
Family Cites Families (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE69735084T2 (de) * | 1997-02-18 | 2006-08-31 | Matsushita Electric Industrial Co., Ltd., Kadoma | Leitwegumlenkungsverfahren in hierarchischen strukturierten Netzwerken |
CN1571301A (zh) * | 2003-07-16 | 2005-01-26 | 深圳市中兴通讯股份有限公司 | 光网络中通过显示路由实现信令并发优收的装置及方法 |
US9491084B2 (en) * | 2004-06-17 | 2016-11-08 | Hewlett Packard Enterprise Development Lp | Monitoring path connectivity between teamed network resources of a computer system and a core network |
US7630298B2 (en) * | 2004-10-27 | 2009-12-08 | Cisco Technology, Inc. | Method and apparatus for forwarding data in a data communications network |
US7856001B2 (en) * | 2005-06-15 | 2010-12-21 | U4Ea Wireless, Inc. | Wireless mesh routing protocol utilizing hybrid link state algorithms |
JP2008160385A (ja) * | 2006-12-22 | 2008-07-10 | Nec Corp | ネットワーク経路制御システム、経路制御装置および経路制御方法 |
US7808888B2 (en) * | 2008-02-25 | 2010-10-05 | Cisco Technology, Inc. | Network fault correlation in multi-route configuration scenarios |
CN101710359B (zh) * | 2009-11-03 | 2011-11-16 | 中国科学院计算技术研究所 | 一种集成电路故障诊断系统及方法 |
US8488608B2 (en) * | 2010-08-04 | 2013-07-16 | Alcatel Lucent | System and method for traffic distribution in a multi-chassis link aggregation |
US9813257B2 (en) | 2010-09-10 | 2017-11-07 | Extreme Networks, Inc. | Access network dual path connectivity |
US8949385B2 (en) | 2011-09-27 | 2015-02-03 | Avaya, Inc. | Method and apparatus for resolving conflicting unicast advertisements in a transport network |
CN102801596B (zh) * | 2012-06-11 | 2015-01-21 | 华为技术有限公司 | 环网中业务处理方法及网络设备 |
US9185022B2 (en) * | 2012-06-15 | 2015-11-10 | Cisco Technology, Inc. | Dynamically triggered traffic engineering routing advertisements in stateful path computation element environments |
US9369387B2 (en) * | 2013-10-24 | 2016-06-14 | Cisco Technology, Inc. | Segment routing based wide area network orchestration in a network environment |
US9602387B2 (en) * | 2014-12-29 | 2017-03-21 | Juniper Networks, Inc. | Network topology optimization |
CN105490935A (zh) | 2015-12-08 | 2016-04-13 | 国网浙江省电力公司宁波供电公司 | 多点间路径分析方法及系统 |
US10009254B2 (en) * | 2016-05-10 | 2018-06-26 | Netscout Systems, Inc. | Calculation of a lowest cost path |
US10148564B2 (en) * | 2016-09-30 | 2018-12-04 | Juniper Networks, Inc. | Multiple paths computation for label switched paths |
-
2017
- 2017-01-04 US US16/346,624 patent/US10999186B2/en active Active
- 2017-01-04 JP JP2018560273A patent/JP6501992B2/ja active Active
- 2017-01-04 KR KR1020197018628A patent/KR102024515B1/ko active IP Right Grant
- 2017-01-04 DE DE112017006045.1T patent/DE112017006045B4/de active Active
- 2017-01-04 WO PCT/JP2017/000031 patent/WO2018127943A1/ja active Application Filing
- 2017-01-04 CN CN201780081376.1A patent/CN110115005B/zh active Active
- 2017-05-11 TW TW106115588A patent/TWI646806B/zh active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2003005725A2 (en) * | 2001-07-03 | 2003-01-16 | Hewlett-Packard Company | Method and system for streaming media with multiple description |
WO2014074541A2 (en) * | 2012-11-12 | 2014-05-15 | Alcatel Lucent | System and method for a pass thru mode in a virtual chassis system |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2020141261A (ja) * | 2019-02-28 | 2020-09-03 | 富士通株式会社 | 情報処理プログラム、情報処理装置、および、情報処理方法 |
JP7208060B2 (ja) | 2019-02-28 | 2023-01-18 | 富士通株式会社 | 情報処理プログラム、情報処理装置、および、情報処理方法 |
Also Published As
Publication number | Publication date |
---|---|
US20190319877A1 (en) | 2019-10-17 |
JPWO2018127943A1 (ja) | 2019-04-18 |
DE112017006045T5 (de) | 2019-10-24 |
US10999186B2 (en) | 2021-05-04 |
CN110115005A (zh) | 2019-08-09 |
TW201826763A (zh) | 2018-07-16 |
DE112017006045B4 (de) | 2020-09-10 |
KR102024515B1 (ko) | 2019-09-24 |
TWI646806B (zh) | 2019-01-01 |
JP6501992B2 (ja) | 2019-04-17 |
CN110115005B (zh) | 2021-07-09 |
KR20190082322A (ko) | 2019-07-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR102450096B1 (ko) | 네트워크에서의 패킷을 송신하기 위한 방법 및 노드 | |
US10211987B2 (en) | Transport mechanism for carrying in-band metadata for network path proof of transit | |
US9225629B2 (en) | Efficient identification of node protection remote LFA target | |
JP5966001B2 (ja) | Mplsでのldpを用いた高速再ルーティング(ldp−frr) | |
EP2883334B1 (en) | Techniques for flooding optimization for link state protocols in a network topology | |
WO2018127943A1 (ja) | 転送装置および経路追加方法 | |
US9769066B2 (en) | Establishing and protecting label switched paths across topology-transparent zones | |
US11595441B2 (en) | Systems and methods for securing network paths | |
EP2697944A1 (en) | System and Method for Computing Inter-Domain Shortest Constrained Path in a Computer Network | |
WO2018095095A1 (zh) | 建立分离路径的方法和装置 | |
US9515918B2 (en) | Computing forwarding tables for link failures | |
US8842543B2 (en) | Trap-free shortest link-disjoint paths | |
CN108390780B (zh) | 用于处理信息的方法和装置 | |
JP6407489B2 (ja) | 転送装置、調整装置およびパラメータ調整方法 | |
US20180212860A1 (en) | Automatically detecting potential microloop conditions associated with network convergence | |
US9143399B2 (en) | Minimizing the number of not-via addresses | |
US10965589B2 (en) | Fast receive re-convergence of multi-pod multi-destination traffic in response to local disruptions |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 17890100 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2018560273 Country of ref document: JP Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 20197018628 Country of ref document: KR Kind code of ref document: A |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 17890100 Country of ref document: EP Kind code of ref document: A1 |