CN102959909B - Method and apparatus for generating distribution trees, and routing bridge - Google Patents
Method and apparatus for generating distribution trees, and routing bridge Download PDFInfo
- Publication number
- CN102959909B CN102959909B CN201180000752.2A CN201180000752A CN102959909B CN 102959909 B CN102959909 B CN 102959909B CN 201180000752 A CN201180000752 A CN 201180000752A CN 102959909 B CN102959909 B CN 102959909B
- Authority
- CN
- China
- Prior art keywords
- distribution tree
- root node
- cost
- rbridge
- distribution
- 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
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/48—Routing tree calculation
- H04L45/484—Routing tree calculation using multiple routing trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a method and an apparatus for generating distribution trees, and a Routing Bridge (RBridge). The method comprises the following steps: according to the communication requirements between RBridges in the Transparent Interconnection of Lots of Links (TRILL) network, the whole network forwarding cost of each candidate distribution tree whose root node is each RBridge respectively in the TRILL network is obtained; the root node of the candidate distribution tree which matches the predetermined conditions is determined as a first target root node according to the whole network forwarding cost of each candidate distribution tree, wherein the predetermined conditions include at least that the whole network forwarding cost of the distribution tree is minimum; a first distribution tree whose root node is the first target root node is established. In the method for generating distribution trees disclosed in the embodiments of the present invention, by obtaining the whole network forwarding cost of each candidate distribution tree beforehand, the root node of the candidate distribution tree which matches the predetermined conditions is determined as a first target root node, and a distribution tree is established according to the first target root node, so that the requirements that the whole multicast delay cost of the TRILL network is minimum and the forwarding scheme is optimum are satisfied.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of distribution tree generation method, device and route-bridge.
Background technology
TRILL (Transparent Interconnection of Lots of Links, multilink transparent interconnection agreement) is IETF just two layers of (as Ethernet) multirouting solution in standardized the Internet.
TRILL protocol replaces STP (Spanning Tree Protocol in the past in the IS-IS route that two layers are introduced three layers, Spanning-Tree Protocol), thus data retransmission can be carried out according to shortest path, and make Multi-path route become possibility, make the utilization of bandwidth more abundant.TRILL protocol encapsulates hop count (jumping figure) field in the packet, for solving interim route loop problem.
In TRILL network, RBridge (Routing Bridge, route-bridge) does not use spanning tree algorithm to calculate distribution tree, the substitute is and calculates distribution tree based on link-state information.With ISIS (Intermediate System To Intermediate System Routing Protocol, the routing protocol of Intermediate System-to-Intermediate System) under router-level topology similar, RBridge stores the topology information of the whole network, thus can shortest path in computing network between any two points.The computational process of distribution tree is such: in TRILL network, select certain RBridge as tree root.After tree root is specified, each RBridge in network calculates the shortest path from tree root to other each RBridge according to SPF method, and all these shortest paths are combined and just constituted distribution tree.TRILL does not provide the selection strategy of tree root when designing, that is this tree root is arbitrarily specified.As shown in Figure 1, for convenience, each RBridge in figure is abbreviated as RB, if appointment RB2 is the distribution tree root of whole network, so set up distribution tree is as shown in Fig. 1 septal line.
Inventor finds, in the distribution tree utilizing the distribution tree computational methods under existing TRILL to generate, owing to adopting the mode of arbitrarily specifying tree root, make the distribution tree set up according to the tree root of arbitrarily specifying, cannot meeting TRILL network Overall Group, to prolong expense sowing time minimum, forwards the requirement of scheme optimum.
Summary of the invention
In view of this, the invention provides a kind of generation method of distribution tree, device and route-bridge.
One aspect of the present invention is as follows.
A kind of distribution tree generation method, comprising:
According to the communication requirement between the route-bridge RBridge in multilink transparent interconnection agreement TRILL network, obtain respectively and forward cost with the whole network of each distribution tree to be selected that is root node of each route-bridge RBridge in described TRILL network;
The whole network according to each distribution tree to be selected described forwards cost and determines that the root node meeting pre-conditioned distribution tree to be selected is first object root node, describedly pre-conditionedly at least to comprise: the whole network of distribution tree forwards Least-cost;
Set up the first distribution tree being root node with described first object root node.
Another aspect of the present invention is as follows.
A kind of distribution tree generating apparatus, comprising:
First forwards cost acquiring unit, for according to the communication requirement between the route-bridge RBridge in multilink transparent interconnection agreement TRILL network, obtain respectively and forward cost with the whole network of each distribution tree to be selected that is root node of each route-bridge RBridge in described TRILL network;
First object root node determining unit, determining that the root node meeting pre-conditioned distribution tree to be selected is first object root node for forwarding cost according to the whole network of each distribution tree to be selected described, describedly pre-conditionedly at least to comprise: the whole network of distribution tree forwards Least-cost;
First distribution tree sets up unit, for the first distribution tree that to set up with described first object root node be root node.
A kind of route-bridge RBridge, comprising: distribution tree generating apparatus as above.
As can be seen from above-mentioned technical scheme, distribution tree generation method disclosed in the embodiment of the present invention, cost is forwarded by the whole network obtaining each distribution tree to be selected in advance, determine that the root node meeting pre-conditioned distribution tree to be selected is first object root node, and set up distribution tree according to first object root node, to meet TRILL network Overall Group, to prolong expense sowing time minimum, forwards the requirement of scheme optimum.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the structural representation of the distribution tree adopting prior art to set up;
The flow chart of Fig. 2 a kind of distribution tree generation method disclosed in the embodiment of the present invention;
Fig. 3 determines the flow chart of target root node disclosed in the embodiment of the present invention;
Fig. 4 is the disclosed flow chart obtaining traffic matrix of the embodiment of the present invention;
Fig. 5 is network topology structure schematic diagram disclosed in the embodiment of the present invention;
Fig. 6 sets up the flow chart of follow-up distribution tree disclosed in the embodiment of the present invention;
The structural representation of Fig. 7 distribution tree disclosed in the embodiment of the present invention;
The structural representation of Fig. 8 another distribution tree disclosed in the embodiment of the present invention;
The flow chart of Fig. 9 method for forwarding multicast message disclosed in the embodiment of the present invention;
The structural representation of Figure 10 a kind of distribution tree generating apparatus disclosed in the embodiment of the present invention;
The structural representation of Figure 11 another distribution tree generating apparatus disclosed in the embodiment of the present invention;
The structural representation of Figure 12 another distribution tree generating apparatus disclosed in the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
The flow process of the generation method of a kind of distribution tree disclosed in the embodiment of the present invention as shown in Figure 2, comprising:
Step S21, according to the communication requirement between the RBridge in TRILL network, obtain respectively and forward cost with the whole network of each distribution tree to be selected that is root node of each RBridge in TRILL network.
Can calculate many distribution trees in TRILL network, and the root of each distribution tree can be specified by having in network the RBridge of greatest priority, management equipment or central control unit.Before calculate first distribution tree for TRILL network, the forwarding cost of whole network is infinitely great, when go out first distribution tree for network calculations after and only there is an available distribution tree, the source RBridge of distribution multicast message will forward its multicast message according to this distribution tree, thus forwarding cost will be determined by this distribution tree.Before selection distribution tree, determine that each RBridge is as the whole network forwarding cost of the distribution tree to be selected of root node in network.It should be noted that, when determining the forwarding cost of each RBridge described as the distribution tree to be selected of root node, only need the forwarding cost calculating each distribution tree to be selected, do not need to configure distribution tree in transmitting, namely do not need actually to set up distribution tree.
Step S22, forward cost according to the whole network of each distribution tree to be selected and determine that the root node meeting pre-conditioned distribution tree to be selected is first object root node, pre-conditionedly at least to comprise: the whole network of distribution tree forwards Least-cost;
In this step, the root node meeting pre-conditioned distribution tree to be selected is defined as first object root node, avoids adopting in prior art, the mode of any designated root node.Pre-conditioned the whole network except comprising distribution tree forwards except Least-cost, can also comprise other conditions.
Further, this step idiographic flow as shown in Figure 3, comprising:
Step S221, determine that the RBridge that the whole network forwards the distribution tree to be selected of Least-cost corresponding is alternate root node;
Step S222, judge that alternate root node is whether unique, if so, then perform step S223, if not, then perform step S224;
Step S223, determine that alternate root node is first object root node;
It is first object root node that step S224, certainty annuity number minimum alternate root node.
When the whole network forward the distribution tree to be selected of Least-cost only have one time, so the root node of its correspondence only has one, then now, the whole network only can be utilized to forward Least-cost as pre-conditioned, determine that the root node that distribution tree to be selected with this is corresponding is first object root node.But, when the distribution tree to be selected that the whole network forwards Least-cost is many, need further to determine, as noted above, it is first object root node that certainty annuity numbers minimum alternate root node, or determine that the root node that the shortest distribution tree of forward-path is corresponding is first object root node, concrete definition base can set according to actual conditions.
Step S23, set up the distribution tree corresponding with first object root node.
After determining first object root node, set up the first distribution tree.
In distribution tree generation method disclosed in the present embodiment, cost is forwarded by the multicast message obtaining network in advance, determine that the tree root of distribution tree to be selected forwarding Least-cost is first object root node, and set up the first distribution tree according to first object root node, to meet TRILL network Overall Group, to prolong expense sowing time minimum, forwards the requirement of scheme optimum.
Alternatively, described step S21-S23 is performed by the RBridge of in TRILL network, or, perform described step S21-S23 respectively by RBridge each in TRILL network.
In such scheme, communication requirement between often pair of node can be obtained according to the mode of existing use survey tool (Netflow as Cisco), also can obtain communication requirement described in TRILL network between source RBridge and object RBridge according to the fan-in bandwidth of the fan-out bandwidth of source RBridge, object RBridge and scale factor.Afterwards, just can according to the traffic matrix of communication requirement determination network.
Alternatively, when not disposing similar flow collection agreement in network, also can according to step in such as Fig. 4, the internodal communication requirement obtained in TRILL network comprises:
Step S41, obtain the communication requirement in TRILL network between source RBridge and object RBridge according to the fan-out bandwidth of source RBridge, the fan-in bandwidth of object RBridge and scale factor.Gravitation (Gravity) model that the present invention adopts industry conventional is to obtain network traffics matrix.Gravity model estimates the communication requirement between described two nodes by fan-in fan-out (fan-in/fan-out) bandwidth of two nodes.Communication flows between source to object is directly proportional to the amassing of the fan-in bandwidth of the fan-out bandwidth sum destination in source.Alternatively, the present invention provides a computing formula of the communication requirement between source and destination:
The fan-in bandwidth (formula-1) of the fan-out bandwidth × destination in scale factor × source
Such as, network topology structure as shown in Figure 5, for convenience, is abbreviated as RB by each RBridge in figure.Suppose that the bandwidth of every bar link is 10Gbps, the scale factor in (formula-1) is 0.001.As shown in Figure 5, RB1 has 2 links, and RB5 has 4 links, therefore can determine that the fan-out bandwidth of RB1 be the fan-in bandwidth of 10Gbps × 2=20Gbps, RB5 is 10Gbps × 4=40Gbps.Therefore, the communication requirement of RB1 to RB5 is 0.001 × 20 × 40=0.8Gbps.According to the method, just can draw the communication requirement between any two RB, correspondingly, the traffic matrix that can obtain network is as shown in table 1.
The traffic matrix that table 1 utilizes Gravity model to calculate
Utilize said method to obtain traffic matrix, avoid in order to the communication requirement between measured node and node, do not need periodic statistical and the traffic between memory node and node, avoid bringing calculating and storage overhead to node, thus reduce the difficulty of deployment.
Alternatively, described step S41 is performed by the RBridge of in TRILL network, or, perform described step S41 respectively by RBridge each in TRILL network.Preferably, the RBridge performing described step S41 is identical with the RBridge performing described step S21-S23.
Another distribution tree generation method disclosed in the embodiment of the present invention, when many distribution trees set up by needs in network, after setting up out first distribution tree according to flow process shown in Fig. 1, can be by the following method, set up follow-up distribution tree successively, until meet preset value, idiographic flow as shown in Figure 6, comprising:
Internodal communication requirement in step S61, foundation TRILL network, determine that the whole network of the multiple distribution tree groups in TRILL network forwards cost respectively, wherein, each distribution tree group in multiple distribution tree group comprises described first distribution tree and at least one distribution tree to be selected, and each distribution tree in same distribution tree group is different;
In the present embodiment, the first distribution tree and distribution tree to be selected are formed multiple distribution tree group respectively, distribution tree in this distribution tree group is different, for topological structure shown in Fig. 5, suppose that the first distribution tree is the distribution tree set up with RB1, then distribution tree to be selected comprises respectively with the distribution tree that RB1, RB2, RB3, RB4, RB5, RB6 are root node, then the first distribution tree and the distribution tree taking RB2 as root node are formed the first distribution tree group, first distribution tree and the distribution tree taking RB3 as root node are formed the second distribution tree group, the like set up other distribution tree groups.Because each distribution tree in same distribution tree group is different, namely each distribution tree group comprises the first distribution tree, and a distribution tree to be selected except the distribution tree that RB1 is root node, therefore now needs to set up five distribution tree groups.
Step S62, determine that the root node of distribution tree to be selected that the whole network forwards in the distribution tree group of Least-cost is the second target root node;
The whole network obtaining above-mentioned five distribution tree groups respectively forwards cost.It should be noted that, now only need the forwarding cost calculating each distribution tree group, do not need the distribution tree configured in transmitting in distribution tree group, namely do not need actually to set up distribution tree.Suppose to be wherein that the whole network that distribution tree and the distribution tree taking RB3 as root node of root node forms the second distribution tree group forwards Least-cost with RB1, then determine that RB3 is the second target root node.
Step S63, the second distribution tree that to set up with the second target root node be root node.
According to above-mentioned steps, suppose that preset value is 5, then all select a distribution tree making current the whole network forward Least-cost, until pick out 5 at every turn.According to TRILL protocol, the tree roots of 5 trees needing to set up are communicated to the whole network by RB1, and before distribution tree calculates, the quantity of the distribution tree oneself can supported has been communicated to other RBridge of the whole network by each RBridge.Suppose that k represents in the whole network the number of the distribution tree that the RBridge supporting distribution tree minimum supports, s is the number needing the distribution tree set up.Like this, the minimum value min{s by s and k, k} determine by the quantity of the distribution tree that the whole network can be supported.After the notice receiving RB1, each RBridge only calculates min{s, k} tree.According to TRILL protocol, namely the order of calculating is the order that these tree roots are advertised usually.
Alternatively, described step S61-S62 is performed by the RBridge of in TRILL network, or, perform described step S61-S62 respectively by RBridge each in TRILL network.Preferably, the RBridge performing described step S61-S62 is identical with the RBridge performing described step S21-S23.
In the present embodiment, flow process as shown in Figure 3 can be adopted equally to determine the second target root node, and method as shown in Figure 4, obtain internodal communication requirement.
Below, the present invention is described in detail said method by a specific embodiment:
Suppose that the traffic matrix shown in Fig. 5 corresponding to network topology structure is as shown in table 2.
Table 2 traffic matrix
As can be seen from Table 2, the distance of RB3 and RB2, RB3 and RB5 is all 1, and the distance of RB4 and RB2, RB4 and RB5 is all 2.When with RB3 be root node set up distribution tree time, the structure of the distribution tree of its correspondence is as shown in Fig. 7 chain lines, it is to be noted, now really do not set up distribution tree as illustrated in the drawing, now the forwarding cost of whole network drops to (1 × 1+1 × 1)+(2 × 1+2 × 1)=6 by infinity, wherein, the Section 1 of product represents time delay, and Section 2 represents communication requirement.By similar method, can determine when with RB1 be root node set up distribution tree time, the structure of the distribution tree of its correspondence, as shown in solid line in Fig. 7, does not now also really set up distribution tree as illustrated in the drawing, and now the numerical value of the forwarding cost of whole network is 8.The forwarding cost of the whole network that distribution tree all to be selected in network is corresponding can be determined by said method.Now suppose to take RB3 as the forwarding Least-cost that the distribution tree of root node is corresponding, then select RB3 to be that root node sets up first distribution tree, thus make the forwarding Least-cost of the whole network, namely the forwarding cost decrease speed of network is the fastest.。
After establishing first distribution tree, next target root node can be selected according to above-mentioned thought, then set up next distribution tree.For Fig. 7, suppose now to have established the first distribution tree in network, this distribution tree take RB3 as root node.Need for network sets up the 2nd distribution tree, now except the first distribution tree that RB3 is root node, also comprise respectively with RB1, RB2, RB4, RB5, RB6 is five distribution trees of root node, first distribution tree is combined with above-mentioned five distribution trees respectively, obtain five groups of distribution tree groups, first distribution tree and the distribution tree taking RB1 as root node are formed the first distribution tree group, first distribution tree and the distribution tree taking RB2 as root node are formed the second distribution tree group, first distribution tree and the distribution tree taking RB4 as root node are formed the 3rd distribution tree group, the like set up other distribution tree groups, then the whole network calculating each distribution tree group forwards cost.Wherein, first distribution tree and RB4 are that to forward cost be (1 × 1+1 × 1)+(1 × 1+1 × 1)=4 to the whole network of the 3rd distribution tree group that the distribution tree of root node forms, wherein the Section 1 of product represents time delay, Section 2 represents flow transmission rate, forwards cost and drops to 4 by 6.Determine that the whole network of each distribution tree group forwards cost respectively, find that the whole network of the 3rd distribution tree group forwards Least-cost.Therefore, RB4 is defined as the second target root node, with this second target root node for root node, sets up the second distribution tree.The schematic diagram of two distribution trees now set up as shown in Figure 8.Its chain lines represents the first distribution tree, and dotted line represents the second distribution tree.
Distribution tree generation method disclosed in the embodiment of the present invention can be applied to and anyly need to set up in the network configuration of distribution tree, such as VLAN (Virtual Local Area Network, VLAN).
Alternatively, after setting up out many distribution trees, when utilizing distribution tree to carry out multicast message distribution, in order to make to transmit data message Least-cost between each node, according to method as shown in Figure 9, the process that the present embodiment carries out the selection of distribution tree specifically comprises:
Step S91, search multiple distribution trees set up at RBridge place, source of distribution multicast message;
Step S92, obtain the forwarding cost of multiple distribution tree set up for multicast message to be forwarded respectively;
Step S93, determine that forwarding the distribution tree of Least-cost is target distribution tree;
Step S94, source RBridge utilize target distribution tree forwarding multicasting message.
The specific implementation of above-mentioned steps for: suppose to set up distribution tree according to shown in Fig. 8, its chain lines represents with RB3 to be the distribution tree that root is set up, and dotted line represents with RB4 to be the distribution tree that root node is set up.RB2 in network to multicast member RB1, RB4 respectively transmission rate be the multicast message of 1Gbps.This time, search distribution multicast message the distribution tree corresponding to the RBridge of source, the distribution tree finding RB2 corresponding is two distribution trees shown in figure, respectively with RB3, RB4 for root node.RB2 is equal with the distance of root RB3, RB4, if can select any distribution tree as a VLAN in both according to the principle of " root nearby ".But, by calculating the forwarding cost of two distribution tree forwarding multicasting messages, take RB3 as root, forwarding cost is 4, take RB4 as root, and forwarding cost is 2, determine to forward Least-cost with RB4 be the distribution tree of root as target distribution tree, it take RB4 as the distribution tree forwarding multicasting message of root that RB2 utilizes.
Alternatively, described step S91-S93 is performed by the RBridge of in TRILL network, or, perform described step S91-S93 respectively by RBridge each in TRILL network.Preferably, the RBridge performing described step S91-S93 is identical with the RBridge performing described step S21-S23.
Further, the present invention discloses a kind of distribution tree generating apparatus, its structure as shown in Figure 10, comprising: first forwards cost acquiring unit 101, first object root node determining unit 102 and the first distribution tree sets up unit 103, wherein:
First forwards cost acquiring unit 101 for according to the communication requirement between the RBridge in TRILL network, obtains respectively and forwards cost with the whole network of each distribution tree to be selected that is root node of each route-bridge RBridge in TRILL network; For forwarding cost according to the whole network of each distribution tree to be selected, first object root node determining unit 102 determines that the root node meeting pre-conditioned distribution tree to be selected is first object root node, pre-conditionedly at least comprise: the whole network of distribution tree forwards Least-cost; First distribution tree sets up unit 103 for the first distribution tree that to set up with first object root node be root node.
Alternatively, as shown in figure 11, described distribution tree generating apparatus also comprises: second forwards cost acquiring unit 104, for the internodal communication requirement in foundation TRILL network, determine that the whole network of the multiple distribution tree groups in TRILL network forwards cost respectively, wherein, each distribution tree group in multiple distribution tree group comprises the first distribution tree and at least one distribution tree to be selected, and each distribution tree in same distribution tree group is different; Second target root node determining unit 105, for determining that the root node of the distribution tree to be selected that the whole network forwards in the distribution tree group of Least-cost is the second target root node; Second distribution tree sets up unit 106, for the second distribution tree that to set up with the second target root node be root node.
Alternatively, first object root node determining unit 102 comprises:
Alternate root node first determines subelement, for determining that the RBridge that the distribution tree of the whole network forwarding Least-cost is corresponding is alternate root node;
Alternate root node second determines subelement, and for judging that whether alternate root node is unique, if not, then certainty annuity numbers minimum alternate root node is target root node, if so, then determines that alternate root node is target root node.
Alternatively, as shown in figure 12, this device also comprises:
Search unit 107, for searching multiple distribution trees set up at the RBridge place, source of distribution multicast message;
3rd forwards cost acquiring unit 108, for obtaining the forwarding cost of multiple distribution tree set up for multicast message to be forwarded respectively;
Distribution tree determining unit 109, for determining that the distribution tree forwarding Least-cost is target distribution tree;
Retransmission unit 1010, utilizes target distribution tree forwarding multicasting message for source RBridge.
The course of work in distribution tree generating apparatus disclosed in the embodiment of the present invention between unit is as follows:
When setting up first distribution tree, first forwards cost acquiring unit according to the communication requirement between the RBridge in TRILL network, obtains respectively and forwards cost with the whole network of each distribution tree to be selected that is root node of each RBridge in TRILL network; First object root node determining unit forwards cost according to the whole network of each distribution tree to be selected and determines that the root node meeting pre-conditioned distribution tree to be selected is first object root node, pre-conditionedly at least to comprise: the whole network of distribution tree forwards Least-cost; First sets up unit sets up the distribution tree corresponding with first object root node.When needs continue to set up distribution tree, second forwards cost acquiring unit according to the internodal communication requirement in TRILL network, determine that the whole network of the multiple distribution tree groups in TRILL network forwards cost respectively, wherein, each distribution tree group in multiple distribution tree group comprises described first distribution tree and at least one distribution tree to be selected, and each distribution tree in same distribution tree group is different; The root node of the distribution tree to be selected that second target root node determining unit determination the whole network forwards in the distribution tree group of Least-cost is the second target root node; Second distribution tree is set up unit and is set up the second distribution tree being root node with the second target root node.In addition, when needing to select distribution tree to carry out multicast message distribution from many distribution trees set up, multiple distribution trees set up that unit searches the RBridge place, source of distribution multicast message are searched; 3rd forwards cost acquiring unit obtains the forwarding cost of multiple distribution tree set up for multicast message to be forwarded respectively; Distribution tree determining unit determines that the distribution tree forwarding Least-cost is target distribution tree; Source RBridge utilizes target distribution tree forwarding multicasting message by retransmission unit.
The present invention discloses a kind of RBridge, comprising: the generating apparatus of distribution tree disclosed in above-described embodiment.RBridge disclosed in the present embodiment utilizes distribution tree generating apparatus to set up distribution tree, the multicast message by obtaining network is in advance made to forward cost, determine that the tree root of distribution tree to be selected forwarding Least-cost is target root node, and set up distribution tree according to target root node, to meet TRILL network Overall Group, to prolong expense sowing time minimum, forwards the requirement of scheme optimum.
In this specification, each embodiment adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, between each embodiment identical similar portion mutually see.For device disclosed in embodiment, because it corresponds to the method disclosed in Example, so description is fairly simple, relevant part illustrates see method part.
Professional can also recognize further, in conjunction with unit and the algorithm steps of each example of embodiment disclosed herein description, can realize with electronic hardware, computer software or the combination of the two, in order to the interchangeability of hardware and software is clearly described, generally describe composition and the step of each example in the above description according to function.These functions perform with hardware or software mode actually, depend on application-specific and the design constraint of technical scheme.Professional and technical personnel can use distinct methods to realize described function to each specifically should being used for, but this realization should not thought and exceeds scope of the present invention.
The software module that the method described in conjunction with embodiment disclosed herein or the step of algorithm can directly use hardware, processor to perform, or the combination of the two is implemented.Software module can be placed in the storage medium of other form any known in random asccess memory (RAM), internal memory, read-only memory (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field.
To the above-mentioned explanation of the disclosed embodiments, professional and technical personnel in the field are realized or uses the present invention.To be apparent for those skilled in the art to the multiple amendment of these embodiments, General Principle as defined herein can without departing from the spirit or scope of the present invention, realize in other embodiments.Therefore, the present invention can not be restricted to these embodiments shown in this article, but will meet the widest scope consistent with principle disclosed herein and features of novelty.
Claims (8)
1. a distribution tree generation method, is characterized in that, comprising:
According to the communication requirement between the route-bridge RBridge in multilink transparent interconnection agreement TRILL network, obtain respectively and forward cost with the whole network of each distribution tree to be selected that is root node of each route-bridge RBridge in described TRILL network;
The whole network according to each distribution tree to be selected described forwards cost and determines that the root node meeting pre-conditioned distribution tree to be selected is first object root node, describedly pre-conditionedly at least to comprise: the whole network of distribution tree forwards Least-cost;
Set up the first distribution tree being root node with described first object root node;
Also comprise:
According to the internodal communication requirement in TRILL network, determine that the whole network of the multiple distribution tree groups in described TRILL network forwards cost respectively, wherein, each distribution tree group in described multiple distribution tree group comprises described first distribution tree and distribution tree to be selected described at least one, and each distribution tree in same distribution tree group is different;
Determine that the root node of distribution tree to be selected that the whole network forwards in the distribution tree group of Least-cost is the second target root node;
Set up the second distribution tree being root node with described second target root node.
2. method according to claim 1, is characterized in that, also comprises:
Search multiple distribution trees set up at the RBridge place, source of distribution multicast message;
Obtain the forwarding cost of described multiple distribution tree set up for multicast message to be forwarded respectively;
Determine that the distribution tree forwarding Least-cost is target distribution tree;
Described source RBridge utilizes described target distribution tree to forward described multicast message.
3. the method according to any one of claim 1 to 2, is characterized in that, the method obtaining the internodal communication requirement in described TRILL network comprises:
The communication requirement described in TRILL network between source RBridge and object RBridge is obtained according to the fan-out bandwidth of source RBridge, the fan-in bandwidth of object RBridge and scale factor.
4. method according to claim 3, is characterized in that, described communication requirement is the product of scale factor described in the fan-in bandwidth sum of the fan-out bandwidth of described source RBridge, described object RBridge.
5. the method according to claim 1,2 or 4, is characterized in that, described communication requirement is expressed as traffic matrix.
6. a distribution tree generating apparatus, is characterized in that, comprising:
First forwards cost acquiring unit, for according to the communication requirement between the route-bridge RBridge in multilink transparent interconnection agreement TRILL network, obtain respectively and forward cost with the whole network of each distribution tree to be selected that is root node of each route-bridge RBridge in described TRILL network;
First object root node determining unit, determining that the root node meeting pre-conditioned distribution tree to be selected is first object root node for forwarding cost according to the whole network of each distribution tree to be selected described, describedly pre-conditionedly at least to comprise: the whole network of distribution tree forwards Least-cost;
First distribution tree sets up unit, for the first distribution tree that to set up with described first object root node be root node;
Also comprise:
Second forwards cost acquiring unit, for the internodal communication requirement in foundation TRILL network, determine that the whole network of the multiple distribution tree groups in described TRILL network forwards cost respectively, wherein, each distribution tree group in described multiple distribution tree group comprises described first distribution tree and distribution tree to be selected described at least one, and each distribution tree in same distribution tree group is different;
Second target root node determining unit, for determining that the root node of the distribution tree to be selected that the whole network forwards in the distribution tree group of Least-cost is the second target root node;
Second distribution tree sets up unit, for the second distribution tree that to set up with described second target root node be root node.
7. device according to claim 6, is characterized in that, also comprises:
Search unit, for searching multiple distribution trees set up at the RBridge place, source of distribution multicast message;
3rd forwards cost acquiring unit, for obtaining the forwarding cost of described multiple distribution tree set up for multicast message to be forwarded respectively;
Distribution tree determining unit, for determining that the distribution tree forwarding Least-cost is target distribution tree;
Retransmission unit, utilizes described target distribution tree to forward described multicast message for described source RBridge.
8. a route-bridge RBridge, is characterized in that, comprising: as the distribution tree generating apparatus in claim 6-7 as described in any one.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2011/074649 WO2011144079A2 (en) | 2011-05-25 | 2011-05-25 | Method and apparatus for generating distribution trees, and routing bridge |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102959909A CN102959909A (en) | 2013-03-06 |
| CN102959909B true CN102959909B (en) | 2015-06-03 |
Family
ID=44992109
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201180000752.2A Active CN102959909B (en) | 2011-05-25 | 2011-05-25 | Method and apparatus for generating distribution trees, and routing bridge |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102959909B (en) |
| WO (1) | WO2011144079A2 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103209132B (en) * | 2012-01-16 | 2017-06-27 | 华为技术有限公司 | In the interconnection of transparent multilink（TRILL）Method, the apparatus and system of multicast are realized in network |
| CN104052671B (en) * | 2013-03-13 | 2018-01-12 | 新华三技术有限公司 | The processing method and routing bridge of multicast forwarding list item in TRILL network |
| CN104243321A (en) * | 2014-09-05 | 2014-12-24 | 杭州华三通信技术有限公司 | Selection method and routing bridge (RB) devices for distribution tree root |
| CN104639344B (en) * | 2015-02-10 | 2017-12-15 | 新华三技术有限公司 | A kind of user multicast file transmitting method and device |
| CN114531623B (en) * | 2020-10-31 | 2023-04-28 | 华为技术有限公司 | Information transmission method, device and network node |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060109801A1 (en) * | 2004-11-23 | 2006-05-25 | Nortel Networks Limited | Method and apparatus for implementing multiple portals into an Rbridge network |
| US20080089246A1 (en) * | 2006-10-16 | 2008-04-17 | Anoop Ghanwani | Method and apparatus for selecting spanning tree root |
| CN101494583A (en) * | 2008-01-24 | 2009-07-29 | 华为技术有限公司 | Route bridging method, network bridge equipment and bridging network |
| US20090257365A1 (en) * | 2008-04-11 | 2009-10-15 | Tae In Hwang | Method of distributing files over network |
| CN101572674A (en) * | 2009-06-12 | 2009-11-04 | 杭州华三通信技术有限公司 | Routing computation method and device thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1167229C (en) * | 2003-03-21 | 2004-09-15 | 清华大学 | Service quality routing estimated method based on linear energy function |
-
2011
- 2011-05-25 WO PCT/CN2011/074649 patent/WO2011144079A2/en active Application Filing
- 2011-05-25 CN CN201180000752.2A patent/CN102959909B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060109801A1 (en) * | 2004-11-23 | 2006-05-25 | Nortel Networks Limited | Method and apparatus for implementing multiple portals into an Rbridge network |
| US20080089246A1 (en) * | 2006-10-16 | 2008-04-17 | Anoop Ghanwani | Method and apparatus for selecting spanning tree root |
| CN101494583A (en) * | 2008-01-24 | 2009-07-29 | 华为技术有限公司 | Route bridging method, network bridge equipment and bridging network |
| US20090257365A1 (en) * | 2008-04-11 | 2009-10-15 | Tae In Hwang | Method of distributing files over network |
| CN101572674A (en) * | 2009-06-12 | 2009-11-04 | 杭州华三通信技术有限公司 | Routing computation method and device thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102959909A (en) | 2013-03-06 |
| WO2011144079A3 (en) | 2012-04-26 |
| WO2011144079A2 (en) | 2011-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102037685B (en) | IP forwarding across a link state protocol controlled Ethernet network | |
| CN102150148A (en) | Differentiated services for unicast multicast frames in layer 2 topologies | |
| US7902973B2 (en) | Alarm reordering to handle alarm storms in large networks | |
| CN102959909B (en) | Method and apparatus for generating distribution trees, and routing bridge | |
| CN104335537A (en) | System and method for layer-2 multicast multipathing | |
| WO2009078427A1 (en) | Path control method and node | |
| CN102884767A (en) | Per-graph link cost assignment in layer 2 multipath networks | |
| WO2013159451A1 (en) | Method and apparatus for acquiring cross-domain end-to-end route, and child path computation entity | |
| CN101960785A (en) | Implementation of VPN over a link state protocol controlled Ethernet network | |
| CN105450447B (en) | A kind of network system and network operation method | |
| CN104518967A (en) | Routing method, equipment and system | |
| CN104901890A (en) | Route generating and coupling method and system of SDN | |
| CN102143546B (en) | Method for reducing redundant routing packet in tree ZigBee network | |
| CN102957589A (en) | Method, network node and system for service data transmission | |
| CN107623630B (en) | Bit index explicit copy information transfer method and device | |
| CN102510414A (en) | Host name transfer method and device adopting same | |
| CN103825760A (en) | Method and device for setting up neighborhood on basis of OSPF protocol | |
| CN103209132A (en) | Method, device and system for achieving multicast in transparent interconnection of lots of links (TRILL) network | |
| CN102932255B (en) | Method and device for selecting tunnel path | |
| CN105282041A (en) | Method and device of flooding on the basis of ISIS (intermediate system to intermediate system) | |
| CN106034071B (en) | Data message transmission method and edge route-bridge equipment | |
| CN104038419B (en) | For the method that transmission data is grouped in the data network being made of multiple network nodes | |
| CN105049351A (en) | Multi-link transparent interconnection algorithm based on SDN | |
| CN102316033B (en) | A kind of method and system of specified distribution tree | |
| CN102857417B (en) | The transmission method of data and system in TRILL network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |