CN105591940B - TRILL network distribution tree selection method and TRILL network node - Google Patents
TRILL network distribution tree selection method and TRILL network node Download PDFInfo
- Publication number
- CN105591940B CN105591940B CN201410655093.1A CN201410655093A CN105591940B CN 105591940 B CN105591940 B CN 105591940B CN 201410655093 A CN201410655093 A CN 201410655093A CN 105591940 B CN105591940 B CN 105591940B
- Authority
- CN
- China
- Prior art keywords
- distribution tree
- trill
- node
- trill network
- tree selection
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A TRILL network distribution tree selection method and a TRILL network node, the method comprising: a first TRILL node configures a distribution tree selection strategy of a TRILL network, and the first TRILL node floods the distribution tree selection strategy to all nodes in the TRILL network so as to indicate all nodes in the TRILL network to select a used distribution tree according to the distribution tree selection strategy; the TRILL network node comprises a policy configuration unit and a transmission unit.
Description
Technical Field
The invention relates to a computer network technology, in particular to a TRILL network distribution tree selection method and a TRILL network node.
Background
The Transparent transmission of multiple Links (Transparent Interconnection of Links, TRILL) protocol is an international standard protocol at present, and a three-layer routing technology is applied to two-layer transmission, so that a large-scale two-layer cloud is realized, the requirements of an increasing converged network or an ultra-large data center are met, and an excellent and efficient two-layer broadcast domain is constructed. TRILL networks use an Intermediate system to Intermediate system routing protocol (ISIS) as its dynamic routing protocol to complete topology and routing computations for the network.
TRILL-ISIS is a dynamic link state-based Interior Gateway Protocol (IGP), after an adjacency is established by hello message interaction negotiation, each Routing Bridge (RB) generates a link-state protocol packet (LSP) to describe link state information of the RB, and sends the link-state packet (LSP) to the network, and also stores the LSP sent by all RBs on the network topology, so as to form a link-state database (LSDB).
The multicast topology calculation of the TRILL-ISIS is to uniformly negotiate a nickname from the TRILL network topology as a tree root and execute SPF to calculate a distribution tree which is consistent with the whole network. The multicast distribution tree in a TRILL network may have multiple trees, and different nicknames are used as tree roots respectively for load sharing of multicast and broadcast. The Nickname is a Nickname of the RB, the nicknames of the RBs are different, and each RB can be configured with multiple nicknames.
In a TRILL network with multiple distribution trees in different network application scenarios, in order to meet different user needs, the RB requires to forward using distribution trees with different characteristics. For example: under the network application scene requiring small time delay, any RB in the TRILL network needs to select the distribution tree with the minimum maximum hop number to forward the multicast stream; in a network application scenario requiring high throughput, any RB in the TRILL network needs to use the distribution tree with the maximum MTU to forward the multicast stream.
Disclosure of Invention
The invention aims to provide a method for selecting a TRILL network distribution tree and a TRILL network node, so that the selected distribution tree meets the network requirement.
In order to solve the above problem, the present invention provides a TRILL network distribution tree selection method, including:
the first TRILL node configures a distribution tree selection policy of the TRILL network,
the first TRILL node floods the distribution tree selection strategy to all nodes in the TRILL network to indicate all nodes in the TRILL network to select the used distribution tree according to the distribution tree selection strategy.
Optionally, flooding the distribution tree selection policy to all nodes in the TRILL network, including:
and carrying the distribution tree selection strategy in a link state data packet LSP.
Optionally, the LSP includes a type-length-value (TLV) parameter that includes the distribution tree selection policy.
Optionally, the first tip node is a node with the highest tree root priority.
Optionally, the first TRILL node configures the distribution tree selection policy according to network requirements.
Optionally, the distribution tree selection policy includes: a distribution tree maximum hop count minimum policy, or a distribution tree Maximum Transmission Unit (MTU) maximum policy.
Optionally, when there are a plurality of nodes with the highest tree root priority, all nodes in the TRILL network select the distribution tree to be used according to the distribution tree selection policy configured by the node with the largest device identifier.
The present invention also provides a TRILL network node, comprising:
the policy configuration unit is used for configuring a distribution tree selection policy of the TRILL network;
a transmission unit, configured to flood the distribution tree selection policy to all nodes in the TRILL network, so as to instruct all nodes in the TRILL network to select a used distribution tree according to the distribution tree selection policy.
Optionally, the transmission unit is configured to carry the distribution tree selection policy in a link state packet LSP.
Optionally, the policy configuration unit is configured to configure a distribution tree selection policy of the TRILL network when the current node is a node with the highest tree root priority;
optionally, the policy configuration unit is configured to configure the distribution tree selection policy according to network requirements.
The present invention also provides another TRILL network node, comprising:
the receiving unit is used for receiving a distribution tree selection strategy flooded by a first TRILL network node in the TRILL network;
and the distribution tree selection unit is used for selecting the used distribution tree according to the distribution tree selection strategy.
Optionally, the receiving unit is configured to receive a link state packet LSP sent by the first TRILL network node, and acquire the distribution tree selection policy from the LSP.
Optionally, the first tip node is a node with the highest tree root priority.
Optionally, when the receiving unit receives a distribution tree selection policy sent by a plurality of nodes with the highest tree root priority, the distribution tree selection unit is configured to select, by a point, a used distribution tree according to the distribution tree selection policy configured by the node with the largest device identifier.
The embodiment of the invention can uniformly configure the distribution tree selection strategy by utilizing one node in the TRILL network according to the network requirement, so that all nodes in the TRILL network can select the distribution tree by using the strategy to meet the network requirement.
Drawings
FIG. 1 is a flow chart of a distribution tree selection method according to an embodiment of the present invention;
FIG. 2 is a sub-TLV diagram of a configuration distribution tree policy;
fig. 3 is a schematic structural diagram of a TRILL network node according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of another TRILL network node according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a TRILL network topology in an exemplary application of the present invention;
FIG. 6 is a schematic diagram of a distribution tree with nickname4 as the root;
fig. 7 is a schematic diagram of a distribution tree with nickname3 as a tree root.
Detailed Description
The technical solution of the present invention will be described in more detail with reference to the accompanying drawings and examples.
It should be noted that, if not conflicting, the embodiments of the present invention and the features of the embodiments may be combined with each other within the scope of protection of the present invention. Additionally, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.
As shown in fig. 1, an embodiment of the present invention provides a method for selecting a TRILL network distribution tree, including:
the first TRILL node may be a node with the highest tree root priority; the first TRILL node can configure a distribution tree selection strategy according to network requirements, set a distribution tree maximum hop count minimum strategy under the scene that the network requirements are small in time delay, and set a distribution tree MTU maximum strategy under the scene that the network requirements are large in throughput.
Step 11, the first TRILL node floods the distribution tree selection policy to all nodes in the TRILL network to instruct all nodes in the TRILL network to select the used distribution tree according to the distribution tree selection policy.
The first TRILL node may configure the distribution tree selection policy in one TLV, as shown in fig. 2, where the policy is configured in Value. Optionally, the sub TLV type of the distribution tree policy is 14, the minimum maximum hop count policy of the distribution tree is defined as 1, and the maximum MTU policy of the distribution tree is defined as 2.
The first TRILL node may include the TLV of the configuration policy as a sub-TLV in the router capability TLV, and then flood out the LSP packet carried by the router capability TLV.
And when a plurality of nodes with the highest tree root priority exist, all the nodes in the TRILL network select the used distribution tree according to the distribution tree selection strategy configured by the node with the largest equipment identification.
As shown in fig. 3, the TRILL network node according to the embodiment of the present invention includes:
the policy configuration unit is used for configuring a distribution tree selection policy of the TRILL network;
a transmission unit, configured to flood the distribution tree selection policy to all nodes in the TRILL network, so as to instruct all nodes in the TRILL network to select a used distribution tree according to the distribution tree selection policy.
Wherein the transmitting unit may configure the distribution tree selection policy in one TLV. Further, the TLV of the configuration policy may be included in the router capability TLV as a sub-TLV, and then the transmission unit floods the generated LSP packet carried by the router capability TLV.
The policy configuration unit is configured to configure a distribution tree selection policy of the TRILL network when the node is a node with the highest tree root priority.
The policy configuration unit may configure a distribution tree selection policy according to network requirements, where the distribution tree selection policy may include: a distribution tree maximum hop count minimum policy, or a distribution tree Maximum Transmission Unit (MTU) maximum policy.
As shown in fig. 4, another TRILL network node provided in an embodiment of the present invention includes:
the receiving unit is used for receiving a distribution tree selection strategy flooded by a first TRILL network node in the TRILL network;
and the distribution tree selection unit is used for selecting the used distribution tree according to the distribution tree selection strategy.
Optionally, the receiving unit is configured to receive a link state packet LSP sent by the first TRILL network node, and acquire the distribution tree selection policy from the LSP.
Optionally, the first tip node is a node with the highest tree root priority.
Optionally, when the receiving unit receives a distribution tree selection policy sent by a plurality of nodes with the highest tree root priority, the distribution tree selection unit is configured to select, by a point, a used distribution tree according to the distribution tree selection policy configured by the node with the largest device identifier.
The TRILL network node of the embodiment of the invention is a device supporting TRILL, and comprises an RB, a switch, a computer host and the like.
The scheme of the embodiment of the invention is illustrated by two application examples.
Application example 1:
as shown in fig. 5, RB1, RB2, RB3, and RB4 form a TRILL network, and the distribution tree root priorities of nicknames 1, nicknames 2, nicknames 3, and nicknames 4 are assumed to be 1, 2, 3, and 4 for nicknames 1, nicknames 2, nicknames 3, and nicknames 4.
Suppose that the TRILL network has two distribution trees, the tree roots of the distribution trees are nickname3 and nickname4, and the topological structures are respectively shown in fig. 6 and fig. 7. The TRILL network requires minimum transmission delay of multicast traffic.
In general, the number of hops determines the amount of delay of data packets transmitted in the network, and is particularly significant in large networks.
The maximum hop count of the distribution tree shown in fig. 6 is two hops, and one multicast data packet needs two hops at most to be transmitted throughout the entire TRILL network, so that all RBs of the TRILL network receive the traffic. If RB1 needs to send a single multicast traffic, then all RBs in the TRILL network are received via multicast propagation, requiring at most two hops. RB1 sends RB4 as the first hop, and RB4 sends this traffic to RB2 and RB3 as the second hop.
The maximum hop count of the distribution tree shown in fig. 7 is three hops, and one multicast data packet needs three hops at most to spread throughout the entire TRILL network, so that all RBs of the TRILL network receive the traffic. If RB1 needs to send a multicast stream, then all RBs in this TRILL network receive the multicast stream, requiring three hops at most. RB1 sends RB3 as the first hop, RB3 sends the multicast stream to RB4 as the second hop, and RB4 sends the multicast stream to RB2 as the third hop.
For RB1, transmitting a multicast data traffic, the distribution tree of fig. 6 has the smallest number of transmission hops and the smallest required delay compared to the distribution tree of fig. 7, so the distribution tree of fig. 6 is the best choice for forwarding data traffic.
According to the method provided by the embodiment of the invention, the distribution tree selection strategy of the TRILL network is configured on the RB4 with the highest nickname tree root priority as the maximum hop count minimum strategy of the distribution tree. RB4 carries a router capability TLV (routeracapability TLV) in the LSP packet, where the router capability TLV includes a distribution tree policy sub-TLV, and the policy is set to a distribution tree maximum hop count minimum policy.
After receiving the LSP sent by RB4, RB1 finds that it carries a router capability TLV (route capability TLV), where the router capability TLV includes a distribution tree policy sub-TLV, and sets the policy as a distribution tree maximum hop count minimum policy. Then, the RB1 selects nickname4 from the two distribution trees nickname4 and nickname3 calculated by itself as the distribution tree of the multicast traffic to send the multicast traffic, so as to meet the requirement of minimizing the transmission delay of the user multicast traffic.
Application example 2:
in this example, RB1, RB2, RB3, RB4(RB1 and RB3 belong to one network, and RB2 and RB4 belong to another network) originally belonging to different networks form a TRILL network as shown in fig. 5, and the root priorities of the distribution trees of nickname1, nickname2, nickname3, and nickname4 are 1, 2, 3, and 3. The system-ids of RB1, RB2, RB3 and RB4 are 1111.1111.1111, 2222.2222.2222, 3333.3333.3333 and 4444.4444.4444 respectively. The TRILL network is calculated by two distribution trees, the tree roots of the distribution trees are nickname3 and nickname4 respectively, and the topological structures are respectively shown in fig. 6 and fig. 7.
The nicknames 3 and 4 have the same priority and are the highest priority, and since RB3 and RB4 respectively belong to different TRILL networks before, RB3 and RB4 respectively configure different distribution tree selection strategies, RB3 configures a minimum maximum hop count strategy, and RB4 configures a maximum MTU strategy.
After receiving the LSP sent by RB3, RB1 finds that it carries a router capability TLV (route capability TLV), where the router capability TLV includes a distribution tree policy sub-TLV, and sets the policy as a distribution tree maximum hop count minimum policy. After receiving the LSP sent by RB4, RB1 finds that it carries a router CAPABILITY TLV (router CAPABILITY TLV), where the router CAPABILITY TLV includes a sub-TLV using a distribution tree policy, and sets the policy as a maximum policy of a distribution tree MTU. RB1 finds that the root priorities of the nickname trees of RB3 and RB4 are the same through calculation, and selects the distribution tree selection strategy sent by RB4 with the largest sysme-id, namely, the MTU maximum strategy of the distribution tree which is uniform in the whole network is executed. Then, when RB1 sends a multicast traffic, it selects the distribution tree with the largest distribution tree MTU, nickname3, to forward the traffic.
It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing the relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a magnetic or optical disk, and the like. Alternatively, all or part of the steps of the above embodiments may be implemented using one or more integrated circuits. Accordingly, each module/unit in the above embodiments may be implemented in the form of hardware, and may also be implemented in the form of a software functional module. The present invention is not limited to any specific form of combination of hardware and software.
The present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof, and it should be understood that various changes and modifications can be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (9)
1. A method for selecting a TRILL network distribution tree of multilink transparent transmission is characterized by comprising the following steps:
the plurality of first TRILL nodes are each configured with a distribution tree selection policy for the TRILL network,
the plurality of first TRILL nodes flood the distribution tree selection strategy to all nodes in the TRILL network respectively so as to indicate all nodes in the TRILL network to select the used distribution tree according to the distribution tree selection strategy; and receiving the nodes of the distribution tree selection strategy sent by the plurality of first TRILL nodes, and selecting the distribution tree selection strategy sent by the first TRILL node with the largest equipment identifier.
2. The method of claim 1,
flooding the distribution tree selection policy to all nodes in the TRILL network, including:
and carrying the distribution tree selection strategy in a link state data packet LSP.
3. The method of claim 2,
the LSP includes a type-length-value, TLV, parameter that includes the distribution tree selection policy.
4. The method of claim 1,
the first TILL node is the node with the highest tree root priority.
5. The method of claim 1,
the first TRILL node configures the distribution tree selection policy according to network requirements.
6. The method of claim 5,
the distribution tree selection strategy comprises: a maximum hop count minimum strategy of the distribution tree, or a maximum transmission unit MTU maximum strategy of the distribution tree.
7. A transparent transport for multilink TRILL network node, comprising:
the receiving unit is used for receiving distribution tree selection strategies flooded by the plurality of first TRILL nodes in the TRILL network respectively;
and the distribution tree selection unit is used for selecting a distribution tree selection strategy sent by the first TRILL node with the largest equipment identifier and selecting the used distribution tree according to the distribution tree selection strategy.
8. The TRILL network node of claim 7,
the receiving unit is configured to receive a link state packet LSP sent by the first TRILL node, and acquire the distribution tree selection policy from the LSP.
9. The TRILL network node of claim 7,
the first TILL node is the node with the highest tree root priority.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410655093.1A CN105591940B (en) | 2014-11-17 | 2014-11-17 | TRILL network distribution tree selection method and TRILL network node |
| PCT/CN2015/077841 WO2016078347A1 (en) | 2014-11-17 | 2015-04-29 | Trill network distribution tree selection method and trill network node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410655093.1A CN105591940B (en) | 2014-11-17 | 2014-11-17 | TRILL network distribution tree selection method and TRILL network node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105591940A CN105591940A (en) | 2016-05-18 |
| CN105591940B true CN105591940B (en) | 2020-03-31 |
Family
ID=55931174
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410655093.1A Active CN105591940B (en) | 2014-11-17 | 2014-11-17 | TRILL network distribution tree selection method and TRILL network node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105591940B (en) |
| WO (1) | WO2016078347A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107609913B (en) * | 2017-09-19 | 2020-06-19 | 上海恺英网络科技有限公司 | Data analysis tracking method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800692A (en) * | 2009-12-10 | 2010-08-11 | 浙江工业大学 | Wireless sensor network geographic location route addressing method based on Hull tree |
| CN103428088A (en) * | 2012-05-14 | 2013-12-04 | 中兴通讯股份有限公司 | Tree root allocation and message processing method and routing network bridge |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8755383B2 (en) * | 2011-03-21 | 2014-06-17 | Avaya, Inc. | Usage of masked ethernet addresses between transparent interconnect of lots of links (TRILL) routing bridges |
-
2014
- 2014-11-17 CN CN201410655093.1A patent/CN105591940B/en active Active
-
2015
- 2015-04-29 WO PCT/CN2015/077841 patent/WO2016078347A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800692A (en) * | 2009-12-10 | 2010-08-11 | 浙江工业大学 | Wireless sensor network geographic location route addressing method based on Hull tree |
| CN103428088A (en) * | 2012-05-14 | 2013-12-04 | 中兴通讯股份有限公司 | Tree root allocation and message processing method and routing network bridge |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105591940A (en) | 2016-05-18 |
| WO2016078347A1 (en) | 2016-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2548341B1 (en) | Alternate down paths for directed acyclic graph (dag) routing | |
| US9325626B2 (en) | Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks | |
| US11050657B2 (en) | Method, device and node for message transmission, and computer storage medium | |
| US10791053B2 (en) | Service function chain SFC-based communication method, and apparatus | |
| US8799510B2 (en) | Managing host routes for local computer networks with a plurality of field area routers | |
| JP6510115B2 (en) | Method, apparatus, and network system for realizing load distribution | |
| US20150200842A1 (en) | Method for determining a packet forwarding path, network device, and control device | |
| US9166903B2 (en) | System, method and apparatus to resolve RPF-vector attribute conflicts | |
| CN113285876B (en) | Routing method, routing device and computer readable storage medium | |
| WO2017084448A1 (en) | Network system and network operating method | |
| WO2015117412A1 (en) | Isis-based flooding method and device | |
| CN103220217B (en) | A kind of route generating method and equipment | |
| CN105591940B (en) | TRILL network distribution tree selection method and TRILL network node | |
| CN103560956A (en) | Route generation method and device | |
| WO2020021558A1 (en) | Methods, apparatus and machine-readable media relating to path computation in a communication network | |
| CN104821918B (en) | A kind of multicast message retransmission method and device | |
| CN117014356A (en) | Processing method and device of route notification message, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |