| 摘要 |
On a network formed by multiple nodes, a shortest path is generated between an ingress node and an egress node. When a packet is transmitted from the ingress to the egress node, in addition to the packet being transmitted from the port to the shortest path, the packet is flooded from the other ports excluding the port to the shortest path, whereby nodes that are among the nodes forming the network and not on the shortest path automatically generate according to a conventional first-in, first-learned scheme, a path that is shortest in the network excluding the shortest path, i.e., a redundant path that shares no links or nodes with the shortest path. Therefore, the operator can automatically generate a redundant path by merely specifying the ingress node and the egress node. |
