| 摘要 |
The present invention discloses a method for processing non-unicast routes information in a TRILL network and a corresponding RBridge, wherein the RBridge has a neighbor relation with a plurality of other RBridges in the TRILL network, and the RBridge is the RBridge which computes non-unicast routes information in the neighbor relation, and in the method, the RBridge executes steps of: sending an acknowledgement message to the plurality of other RBridges, wherein the acknowledgement message acknowledges that the RBridge is the RBridge which computes the non-unicast routes information; obtaining a network topology related to the non-unicast routes information in the TRILL network; computing the non-unicast routes information based on the network topology; and distributing the computed non-unicast routes information to the plurality of other RBridges. The method and the corresponding RBridge are capable of reducing consumption of CPU resource of RBridges in the TRILL network. |
| 主权项 |
1. A method for processing non-unicast routes information in a Transparent Interconnection of Lots of Links (TRILL) network, wherein a Routing Bridge (RBridge) having a routing forwarding feature and a plurality of other RBridges have a neighbor relation in the TRILL network, and the RBridge is a RBridge which computes non-unicast routes information in the neighbor relation, and in the method, the RBridge executes steps of:
sending an acknowledgement message to the plurality of other RBridges, wherein the acknowledgement message acknowledges that the RBridge is the RBridge which computes the non-unicast routes information; obtaining a network topology related to the non-unicast routes information in the TRILL network; computing the non-unicast routes information based on the network topology; and distributing the computed non-unicast routes information to the plurality of other RBridges; wherein: the RBridge is appointed by a Designated RBridge (DRB) with a routing forwarding feature in the neighbor relation as the RBridge which computes the non-unicast routes information, and the appointment is encoded by the DRB in a packet and propagated to the plurality of other RBridges; in the TRILL network, in response to that the neighbor relation includes at least three RBridges, the RBridge included in the neighbor relation is a first master computing RBridge, the neighbor relation further includes a first slave computing RBridge and the plurality of other RBridges; and wherein the first slave computing RBridge computes the non-unicast routes information, and in case that the first master computing RBridge is working, the first slave computing RBridge does not send the non-unicast routes information to the plurality of other RBridges; in the TRILL network, in response to that the first master computing RBridge is unavailable, the first slave computing RBridge sends the non-unicast routes information to the plurality of other RBridges; and in the TRILL network, in response to that only the first master computing RBridge or only the first slave computing RBridge is unavailable, a second slave computing RBridge is appointed; and in response to that both the first master computing RBridge and the first slave computing RBridge are unavailable, a second master computing RBridge and a second slave computing RBridge are appointed. |
