WO2014071729A1

WO2014071729A1 - Method and network device for selecting multicast root node in trill network

Info

Publication number: WO2014071729A1
Application number: PCT/CN2013/076059
Authority: WO
Inventors: 谢银桥; 谢莹
Original assignee: 华为技术有限公司
Priority date: 2012-11-12
Filing date: 2013-05-22
Publication date: 2014-05-15
Also published as: CN103812781A; CN103812781B

Abstract

Published are a method and network device for selecting a multicast root node in a TRILL network. When the absolute priority level of an RB is the highest, and in the case where the number of RBs having the same priority level as that of the RB in a TRILL network in which the RB is located is n, it is judged whether n is less than or equal to the number m of root nodes set in advance, and if so, the RB notifies the TRILL network in which the RB is located that the number of multicast root nodes is n. By means of the present invention, in the TRILL network in which the RB is located, important or most services are processed by the RB with best performance all the time, thereby being able to avoid the performance of the TRILL network in which the RB is located being affected due to the fact that the RB with a poor capability is selected as a multicast root node.

Description

Method for selecting multicast root node in TRILL network and network device The application claims to be submitted to the Chinese Patent Office on November 12, 2012, the application number is 201210450447.X, and the invention name is "a multicast root node selection in a TRILL network" The priority of the Chinese Patent Application, the entire disclosure of which is hereby incorporated by reference. Technical field

The present invention belongs to the field of communications, and in particular, to a method and network device for selecting a multicast root node in a TRILL network. Background technique

After the completion of the network deployment of the Transparent Interconnection of Lots of Links (TRILL), the routing bridge (RB) is first based on the Intermediate System-Intermediate System (ISIS) protocol, and The other RBs connected to the RB establish a neighbor relationship. Finally, each RB has a whole network topology, and the RB synchronizes the information in the link state database LSDB. The RB calculates the absolute priority according to the configuration priority and the nickname. The number of multicast root nodes (roots) to be elected by the device with the highest priority is broadcasted to the TRILL network. Each RB is based on the same root. Shortest Path First (SPF) calculation, calculate the same shared tree; calculated shared tree is a bidirectional tree, multicast traffic can be from leaf to root node, from root node to leaf; Ingress RB node ( Here, the packet enters the TRILL network from the normal Ethernet. Select the root that is closer to itself to forward.

In a typical dual-core+access scenario, the core and access layers usually use devices with different processing capabilities, and the core devices have better capabilities. Generally, two RBs with the highest absolute priority are selected from the RB devices in the TRILL network. As root, dual-core devices enable device and link redundancy to address single points of failure and improve reliability. When one of the two RBs as the root fails, the second network still needs to select two roots based on the advertisement of the device with the highest priority. Therefore, one device has access to the original root. The device is selected as the new r ₀₀ t.

If a core switch is down (indicating the status of the interface and the interface is down, the device is down). According to the existing rules, you need to select two roots on the entire network. The access device with poor capability is elected as the root. To replace the original root situation. After the access device assumes the root role, the system resources are consumed and the traffic is increased, which in turn affects the user access service. Summary of the invention The object of the embodiment of the present invention is to provide a method for selecting a multicast root node in a TRILL network, where the method can solve the problem that a poor performance device in the same network may be elected as root without changing the current TRILL protocol. problem.

In a first aspect, the present invention provides a method for selecting a multicast root node in a multi-link transparent interconnect TRILL network, where the method includes:

The routing bridge RB establishes a neighbor relationship with other RBs connected to the RB according to the intermediate system-intermediate system ISIS protocol, and synchronizes information in the link state database LSDB;

The RB counts the number of RBs having the same priority as the RB according to the information in the synchronized LSDB;

When the absolute priority of the RB is the highest, the link state protocol data unit LSPDU is advertised to the TRILL network where the RB is located, and the number of the root root node of the TRILL network is advertised as x, when n is less than or equal to the pre- When the number of multicast root nodes is set to m, X is n.

With reference to the first aspect, in a first possible implementation manner of the first aspect, the absolute priority is an absolute value calculated by the RB according to a priority of the RB and an alias nickname of the RB.

In conjunction with the first possible implementation of the first aspect, in a second possible implementation of the first aspect, the method includes:

When n is greater than or equal to m, the X is equal to m.

With reference to the first aspect, or the first possible implementation manner of the first aspect, or the second possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, the method further includes:

When the LSDB is changed, the RB recalculates the number of RBs in the LSDB that are equal to the RB priority, and updates the value of n;

When the absolute priority of the RB is the highest, and n is less than or equal to the preset number of root nodes m, then the value of x is n, and the LSPDU is re-issued to announce that the number of roots selected by the TRILL network is x.

In a second aspect, the present invention provides a network device, where the device includes:

An initial unit, used for routing bridge RB, according to the intermediate protocol ISIS protocol, establishing other connections with the RB

Neighbor relationship of the RB, and synchronize the information in the link state database LSDB;

a statistical unit, configured to calculate, according to information in the synchronized LSDB, the number of RBs having the same priority as the RB;

a processing unit, configured to: when the absolute priority of the RB is the highest, issue a link state protocol data unit LSPDU to the TRILL network where the RB is located, and notify the root number of the root node selected by the TRILL network as x, When n is less than or equal to the preset number of root nodes m, then X takes the value n.

With reference to the second aspect, in a first possible implementation manner of the second aspect, the absolute priority is a value that is calculated by the RB according to a priority of the RB and a nickname of the RB.

With reference to the first possible implementation of the second aspect, in a second possible implementation of the second aspect, when n is greater than or equal to m, the X is equal to m.

With reference to the second aspect or the first possible implementation of the second aspect or the second possible implementation of the second aspect, in a third possible implementation manner of the second aspect, the processing unit is further configured to: :

When the absolute priority of the RB is the highest, and n is less than or equal to the preset number of root nodes, the value of X is n, and the LSPDU is re-issued to announce that the number of roots selected by the TRILL network is x.

Compared with the prior art, in the embodiment of the present invention, when the absolute priority of the RB is the highest, and the number of RBs having the same priority level as the RB is n in the TRILL network where the RB is located, it is determined whether n is smaller than Or equal to the number of root nodes m set in advance. If yes, the RB is responsible for advertising the number of roots to the TRILL network where the RB is located, so that the TRILL network where the RB is located always passes the best performing RB. Or most services can prevent the RBs with poor capabilities from being elected as root and affect the performance of the TRILL network where the RBs are located. DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings to be used in the embodiments will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the present invention, Those skilled in the art can also obtain other drawings based on these drawings without paying creative labor.

1 is a flowchart of a method for selecting a multicast root node in a TRILL network according to Embodiment 1 of the present invention; FIG. 2 is a structural diagram of a network device according to Embodiment 2 of the present invention;

FIG. 3 is a structural diagram of another network device according to Embodiment 3 of the present invention. detailed description

The present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection of the present invention. Within the scope.

Embodiment 1

Referring to FIG. 1, FIG. 1 is a flowchart of a method for selecting a multicast root node in a multi-link transparent interconnection TRILL network according to Embodiment 1 of the present invention. As shown in Figure 1, the method includes the following steps:

Step 101: The routing bridge RB establishes a neighbor relationship with other RBs connected to the RB according to the intermediate system-intermediate system ISIS protocol, and synchronizes information in the link state database LSDB.

Specifically, each RB in the TRILL network establishes a neighbor relationship with other RBs connected to the RB, so that each RB can obtain the entire network topology of the TRILL network, and establish a neighbor relationship. Each RB synchronizes information in the LSDB, including the number of all RBs in the TRILL network, the topology relationship of each RB and other RBs, and the priority of each RB.

Step 102: The RB counts, according to information in the synchronized LSDB, the number of RBs having the same priority as the RB.

Specifically, the information in the synchronized LSDB includes the priority of all the RBs in the TRILL network where the RB is located, and the RB counts the number n of RBs having the same priority as the RB according to the information.

Step 103: When the absolute priority of the RB is the highest, the RB issues a link state protocol data unit LSPDU to the TRILL network, and advertises the number x of the multicast root node selected by the TRILL network, when n When it is less than or equal to the preset number of root nodes m, X is equal to n.

Preferably, the absolute priority is a value calculated by the RB according to a priority of the RB and an alias nickname of the RB. Nickname is the identifier of the two octets used to distinguish between the ingress RB and the egress RB in the TRILL network. Nickname is unique in TRILL, so the calculated absolute priority value is also unique.

In this step, if the RB has the highest absolute priority, the RB advertises the root number x of the root node selected by the TRILL network, and when n is less than or equal to the preset number of root nodes m, then x=n , when n is greater than m, x=m.

Specifically, when the RB has the highest absolute priority, and the RB count and the RB number n of the same priority level of the RB are 1, and the preset number of root nodes m is 2, where n is less than 2, The number of the root of the multicast root node that can be selected by the TRILL network is 1, instead of 2; when the RB is based on the LSDB, the n value is 3, n is greater than 2, and X is 2, and the RB is based on The LSDB counts n as 2, n equals 2, and x takes 2. That is, the step ensures that the best performing RB is always selected as the root in the TRILL network, and the selection is not selected. The secondary RB is used as the root, so that the processing service capability of the TRILL network is always implemented by the best performing RB.

When the LSDB is changed, the RB recalculates the number of RBs in the LSDB that have the same priority as the RB, and updates the value of n;

When the RB has the highest absolute priority and n is less than or equal to the preset number of root nodes, the LSPDU is re-advertised to announce the root number x of the TRILL network.

Specifically, when the RB has the highest absolute priority, and the RB counts according to the information in the LSDB, the n value is 2, if one of the RBs with the same RB priority is down, the LSDB If the information is changed, the RB recalculates and calculates the number of RBs in the LSDB with the same priority as the RB, and updates the value of n to 1. If m is 2, m>n, x=n, That is, x=n=l.

In the embodiment of the present invention, when the absolute priority of the RB is the highest, and the number of RBs having the same priority level as the RB is n in the TRILL network where the RB is located, it is determined whether n is less than or equal to the preset multicast. The number of root nodes is m. If yes, the RB is responsible for notifying the TRILL network where the RB is located that the number of multicast root nodes is n, so that the TRILL network where the RBs are located always processes the best RBs with the best performance or For most services, it can be avoided that the RB with poor ability is elected as root and affects the performance of the TRILL network where the RB is located.

Embodiment 2

Referring to FIG. 2, FIG. 2 is a structural diagram of a network device according to Embodiment 2 of the present invention. The device includes an initial unit 201, which is used to execute step 101 of FIG. 1 in Embodiment 1, and a statistical unit 202 is configured to perform implementation. In step 1 of FIG. 1, the processing unit 203 is configured to perform step 103 of FIG. 1 in the first embodiment.

A person skilled in the art can understand that each unit included in the network device in the second embodiment of the present invention is only divided according to functional logic, but is not limited to the foregoing division, as long as the corresponding function can be implemented; In addition, the specific names of the functional units are only for convenience of distinguishing from each other, and are not intended to limit the scope of protection of the present application.

The initial unit 201 is configured to: establish, by the routing bridge RB, a neighbor relationship of other RBs connected to the RB according to the intermediate system-intermediate system ISIS protocol, and synchronize information in the link state database LSDB;

Specifically, each RB in the TRILL network establishes a neighbor relationship with other RBs connected to each RB when the device is running, so that each RB can obtain the entire network topology of the TRILL network. When establishing a neighbor relationship, each RB synchronizes information in the LSDB, including the number of all RBs in the TRILL network, the topology relationship of each RB and other RBs, and the priority of each RB. Wait. The statistic unit 202 is configured to calculate, according to information in the synchronized LSDB, the number n of RBs having the same priority as the RB;

The processing unit 203 is configured to: when the absolute priority of the RB is the highest, issue a link state protocol data unit LSPDU to the TRILL network, and notify the number of root nodes selected by the TRILL network to be x, when When n is less than or equal to the preset number of root nodes m, then X is n.

Specifically, if the RB has the highest absolute priority, the RB advertises that the number of root nodes selected by the TRILL network where the RB is located is x, and when n is less than or equal to the preset number of root nodes m, x is n, and when n is greater than m, x=m.

Specifically, when the RB has the highest absolute priority, and the RB count and the RB number n of the same priority level of the RB are 1, when the number of root nodes m set in advance is 2, where n is less than 2 The number of roots of the multicast root node that can be selected by the TRILL network is 1, not 2; when the RB is based on the LSDB, the n value is 3, n is greater than 2, and X is 2, and the RB is counted according to the LSDB. The value of n is 2, n is equal to 2, and x is 2. That is, the step is to ensure that the RB with the best performance is always selected as the root in the TRILL network, and the RB of the performance is not selected as the root, so that the processing service capability of the TRILL network is always implemented by the best performing RB.

The processing unit is further configured to: when the LSDB is changed, the RB recalculates the number of RBs in the LSDB that have the same priority as the RB, and updates an n value; when the RB has the highest absolute priority, and When the number of root nodes is less than or equal to m, the number of roots x of the TRILL network is advertised by the LSPDU.

Specifically, when the RB has the highest absolute priority, and the RB calculates the n value according to the information in the LSDB.

At 2 o'clock, if one of the RBs with the same RB priority is down, the information in the LSDB is changed, and the RB recalculates and calculates the number of RBs in the LSDB with the same priority as the RB. , update n value is 1, if m is now 2, then m>n, x=n, ie x=n=l.

In the embodiment of the present invention, when the absolute priority of the RB is the highest, and the number of RBs having the same priority level as the RB is n in the TRILL network where the RB is located, it is determined whether n is less than or equal to the preset. The number of root nodes is m. If yes, the RB is responsible for advertising the number of roots to the TRILL network where the RB is located, so that the TRILL network in which the RB is located always processes the important or most services through the best performing RB. It can be avoided that the RB with poor ability is elected as root and affects the performance of the TRILL network where the RB is located.

Embodiment 3

Referring to FIG. 3, FIG. 3 is a structural diagram of a network device according to Embodiment 3 of the present invention. Referring to FIG. 3, FIG. 3 is a network device 300 according to an embodiment of the present invention. The specific implementation of the network device does not limit the specific implementation of the network device. The device 300 includes:

A processor 301, a communication interface 302, a memory 303, and a bus 304.

The processor 301, the communication interface 302, and the memory 303 complete communication with each other via the bus 304.

a communication interface 302, configured to communicate with other network devices;

The processor 301 is configured to execute program A.

In particular, program A can include program code, the program code including computer operating instructions.

The processor 301 may be a central processing unit CPU, or an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention.

The memory 303 is used to store the program A. The memory 303 may include a high speed RAM memory and may also include a non-volatile memory. Program A may specifically include:

The initial unit 201 is configured to: establish, by the RB RB, a neighbor relationship with other RBs connected to the RB according to the intermediate system-intermediate system ISIS protocol, and synchronize information in the link state database LSDB; The RB counts the number n of RBs having the same priority as the RB according to information in the synchronized LSDB;

Specifically, for the specific implementation of each unit in the program A, refer to the corresponding unit in the embodiment shown in FIG. 2, which is not described herein.

The above is only a preferred embodiment of the present invention and is not intended to limit the scope of the present invention. Any modifications, equivalent substitutions and improvements made within the principles of the invention are intended to be included within the scope of the invention.

Claims

Rights request

1. A method for selecting multicast root nodes in a multi-link transparent interconnection TRILL network, characterized in that the method includes:

The routing bridge RB establishes neighbor relationships with other RBs connected to the RB according to the intermediate system-intermediate system ISIS protocol, and synchronizes the information in the link state database LSDB;

The RB counts the number n of RBs with the same priority as the RB based on the information in the synchronized LSDB;

When the absolute priority of the RB is the highest, the link state protocol data unit LSPDU is released to the TRILL network where the RB is located, and the number of multicast root nodes of the TRILL network is x; when n is less than or equal to the preset When the number of multicast root nodes is set to m, then X is equal to n.

2. The method according to claim 1, wherein the absolute priority is a value calculated by the RB based on the priority of the RB and the nickname of the RB.

3. The method according to claim 2, characterized in that:

When n is greater than or equal to m, the X is equal to m.

4. The method according to any one of claims 1-3, characterized in that, the method further includes: when the LSDB is changed, the RB recalculates the LSDB with the same priority as the RB. The number of RBs in the level, update the n value;

When the RB has the highest absolute priority and n is less than or equal to the preset number of root nodes m, LSPDU is re-issued to notify the root number x of the TRILL network.

5. A network device, characterized in that the device includes:

The initial unit is used for the routing bridge RB to establish neighbor relationships with other RBs connected to the RB according to the intermediate protocol ISIS protocol, and to synchronize the information in the link state database LSDB;

A statistical unit, used for the RB to count the number n of RBs that have the same priority as the RB according to the information in the synchronized LSDB;

A processing unit configured to, when the absolute priority of the RB is the highest, publish a link state protocol data unit LSPDU to the TRILL network where the RB is located, and notify that the number of root nodes selected by the TRILL network is x. When n When it is less than or equal to the preset number of root nodes m, then the value of X is n.

6. The device according to claim 5, wherein the absolute priority is a value calculated by the RB based on the priority of the RB and the nickname of the RB.

7. The device according to claim 6, characterized in that, When n is greater than or equal to m, the x is equal to m.

8. The device according to any one of claims 5 to 7, characterized in that the processing unit is also used for:

When the LSDB changes, the RB recalculates the number of RBs in the LSDB that are equal to the RB priority, and updates the n value;

When the RB has the highest absolute priority and n is less than or equal to the preset number of root nodes m, then x takes the value n, and the LSPDU is re-issued to notify that the number of roots selected by the TRILL network is x.