CN103428088B - A kind of distribution of tree root, the method for Message processing and route-bridge - Google Patents

A kind of distribution of tree root, the method for Message processing and route-bridge Download PDF

Info

Publication number
CN103428088B
CN103428088B CN201210148395.0A CN201210148395A CN103428088B CN 103428088 B CN103428088 B CN 103428088B CN 201210148395 A CN201210148395 A CN 201210148395A CN 103428088 B CN103428088 B CN 103428088B
Authority
CN
China
Prior art keywords
group
gdrb
route
tree
bridge
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.)
Expired - Fee Related
Application number
CN201210148395.0A
Other languages
Chinese (zh)
Other versions
CN103428088A (en
Inventor
廖婷
翟洪军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201210148395.0A priority Critical patent/CN103428088B/en
Publication of CN103428088A publication Critical patent/CN103428088A/en
Application granted granted Critical
Publication of CN103428088B publication Critical patent/CN103428088B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of distribution of tree root, the method for Message processing and route-bridges, apply in multi-link transparent interconnection (TRILL) network, the tree root distribution method includes:In route-bridge group, by one of route-bridge (RB) as the specified node (GDRB) of group, tree root is distributed for each RB in group according to choosing tree strategy, then notifies allocation result to each RB in group.Correspondingly, the route-bridge includes:Choosing tree unit, for when the RB is used as GDRB in route-bridge group, tree root to be distributed for each RB in group according to choosing tree strategy;Notification unit is notified for the allocation result that unit is each RB distribution tree roots to be set in the choosing to each RB in group.It can be abandoned after applying the present invention to avoid the mistake of message, and tree distribution is flexibly used, group member can specify node to carry out sufficient information sharing, flexible network configuration and the guarantee for providing network application by group.

Description

A kind of distribution of tree root, the method for Message processing and route-bridge
Technical field
The present invention relates to the communications fields more particularly to a kind of in tree root distribution, the method for Message processing and route-bridge.
Background technology
TRILL (Transparent Interconnection over Lots of Links, multi-link transparent interconnection) It is the articulamentum that Internet Engineering Task group (Internet Engineering Task Force, referred to as IETF) is recommended (L2) standard of network.TRILL is by Intermediate System-to-Intermediate System (Intermediate System to Intermediate System, referred to as IS-IS) Routing Protocol is introduced into L2 networks, it is realized as control plane.In TRILL network, operation The equipment of TRILL protocol is known as route-bridge (Router Bridge, referred to as RBridge or RB), wherein connect with terminal RB is known as Edge RB (edge RB, referred to as ERB), and entrance RB is known as Ingress RB, and outlet RB is known as Egress RB.? The initial data frame of end equipment (End Station) is packaged into TRILL formats (i.e. in initial data by the entrance of TRILL network TRILL and external frame head are added before frame, include mainly TRILL network entrance and exit route-bridge in TRILL Nickname and hop count), this data frame for just forming TRILL transmits in TRILL network.Other are responsible for TRILL data frames The route-bridge that Egress RB are transmitted to from Ingress RB hop-by-hops is known as transmission route bridge.It can be incited somebody to action on Egress RB Data message is decapsulated, and is reduced into after original message to terminal transmission, while Egress RB can also learn the primitive frame and be It is being imported from which Ingress RB and form corresponding MAC (Medium Access Control, medium access control) information Table:{ D_MAC, Ingress Nickname ... ... }.
In order to avoid loop, on the boundary of TRILL network, in any one VLAN (Virtual Local Area Network, virtual LAN) in can only provide service by a RBridge for an end system, this RBridge is known as this The ISP of a end system, for example, VLAN-x on shared link it is specified turn originator (Appointed Forwarder, Referred to as AF).Although this regulation can effectively avoid loop, some problems are also brought, such as:AF on shared link After switching, the variation of Ingress Nickname in certain MAC address entries on the Egress RB of distal end is brought;When end system passes through Point-to-point link mostly ownership (Multi-homing) (such as:Pass through more device link aggregation groups (Multi Chassis Link Aggregation Group, referred to as MCLAG)) on multiple RBridge when, there are two above for same source Ingress RB nodes are to text of delivering newspaper on it, for the RB where destination address, receive and are sent up on different Ingress RB Message, can be to ceaselessly refreshing comprising source MAC and the MAC information tables of node nickname mapping relations, this will lead MAC Address is caused to redirect (flip-flop) problem.In order to avoid causing the flip-flop problems of MAC Address on the RBridge of distal end, These links can only operate in Active-Standby (activation-standby) pattern, from causing bandwidth waste, it is difficult to meet high property It can the high-throughput of data center and the demand of high reliability.
For this purpose, TRILL working groups propose route-bridge group (RBridge Group, referred to as RBG) or are virtual road By the concept of bridge (Virtual RBridge, referred to as RBv).Member node in route-bridge group often has some phases Same attribute, such as:A LAN (Local Area Network, LAN) is belonged to, meets the relationship of MCLAG or belongs to In area (region) etc..In a RBG, group membership shares a Nickname, referred to as organizes Nickname, all uses below RBv identifies this group of Nickname.Each group membership can notice the group Nickname organized where oneself in TRILL network, To help other RBridge to calculate the path towards the RBv.Member inside same group is when carrying out message up sending, Ingress The Nickname of this group may be used to carry out the encapsulation of message in RB.Since RBv is the group divided in logic, it is not The node of concrete facticity, therefore the node carried below group membership is considered when specific control plane is realized. For data surface, it is understood that there may be the RBv messages encapsulated are gone out to distal end from group membership's RB1 nodes, and what distal end was replied to RBv The case where message is back to group membership RB2 may not identify the reply for RB2, this may result in message and exists It is dropped on RB2 and the case where RB1 can not receive the reply message always.
The problem of group membership selects tree distribution is especially also related in a multicast case, specifically:In TRILL network, group It is to check (Reverse Path Forwarding, referred to as RPF) along tree forwarding, and by reverse path forwarding to report text Etc. technologies avoid loop.RPF refers to,, can only be from a port on a given tree for route-bridge RB1 Receive the multicast message that another route-bridge RB2 is sent.If other ports of the RB1 except this interface receive the edges RB2 It this and sets the multicast message sent, then will be considered that rpf check fails, to abandon the message.By noticing which oneself uses A little distribution trees, route-bridge can notify other bridges to calculate RPF information for it.When route-bridge has more trees can be used, The preferred root distance tree nearest from oneself can be given tacit consent to when E-Packeting, to improve forward efficiency.Due to RPF it is simple for, i.e., Think that a leaf node can only be hung over above a father node on one tree, if different group memberships are carried out with RBv simultaneously Encapsulation, then this leaf of RBv will be considered as being articulated in simultaneously behind these member nodes.If there are two group memberships It oneself is RBv to be noticed on same one tree simultaneously, is equivalent to RBv while being articulated in behind two father nodes, can not be examined by RPF It looks into.The distribution of tree when therefore being encapsulated using RBv to the group membership inside same group, as group membership RB1 RBv When Tree1 being selected to carry out message forwarding, other group membership's nodes cannot be encapsulated on Tree1 using RBv.Thus it is related to RBv encapsulates the problem of being selected with tree, that is, different trees must be distributed when requiring group membership to be encapsulated using RBv.
Invention content
The object of the present invention is to provide a kind of distribution of tree root, the method for Message processing and route-bridges, to solve group membership The problem of middle message accidentally abandons and tree is distributed.
To solve the above problems, the present invention provides a kind of method of tree root distribution, apply in TRILL network, including:
In route-bridge group, by one of route-bridge (RB) as the specified node (GDRB) of group, plan is set according to choosing Slightly each RB distributes tree root in group, then notifies allocation result to each RB in group.
Further,
GDRB in the route-bridge group is by administrator's specified configuration, or by each RB in the route-bridge group It is elected from all RB in this group according to identical election regulation.
Further,
In the case where the GDRB is by administrator's specified configuration, the GDRB is judging itself to be configured as GDRB When, into group other RB send for indicate itself be GDRB GDRB identification messages;
RB has RB to be elected as GDRB where knowing after receiving the GDRB identification messages in group in described group.
Further,
The GDRB is selected from all RB in this group according to identical election regulation by each RB in the route-bridge group It enumerates, specifically includes:
Before not receiving the GDRB identification messages, each RB in the route-bridge group is advised according to identical election Then elect a RB as the GDRB from all RB in this group.
Further,
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Or Person,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
Further,
It is described to distribute tree root according to choosing tree strategy for each RB in group, it specifically includes:
The GDRB is ranked up all RB in organizing, and is then that each RB is sequentially allocated tree in group according to the sequence of sequence Root;For each RB in group, the GDRB is in current all unappropriated tree roots, and the link cost of selection and the RB are most The maximum tree root of short or link bandwidth distributes to the RB.
Further, the method further includes:
When the route-bridge group inside points RB detects configured distribution tree information ready for use in this equipment, then should GDRB where the distribution tree information is sent to by RB in route-bridge group;
It is described to distribute tree root according to choosing tree strategy for each RB in group, it specifically includes:
The GDRB is correspondingly preferential by the tree after receiving the configured distribution tree information that other RB are sent in group Distribute to the RB;For each RB of distribution tree information is not configured in group, the GDRB is in current all unappropriated tree roots In, the link cost of selection and the RB are most short or the maximum tree root of link bandwidth distributes to the RB.
Further,
The GDRB is correspondingly preferential by the tree after receiving the configured distribution tree information that other RB are sent in group The RB is distributed to, is specifically included:
The GDRB is after receiving the configured distribution tree information that other RB are sent in group, for the distribution of pre-configuration It sets information identical more than two RB, the GDRB and the distribution tree of the pre-configuration is preferentially distributed into wherein tree root priority The link cost of high RB, and from current all unappropriated tree roots, selection and RB is most short or the maximum tree root of link bandwidth Distribute to other RB.
Further,
It is described to notify, to each RB in group, to specifically include by allocation result:
In a local network, the allocation result is sent to by each RB in group by the HELLO message in TRILL network, or Person is extended by terminal address interaction protocol (ESADI) is sent to each RB in group by the allocation result, or passes through link shape State data packet (LSP) is flooded to TRILL network, or is passing through the intra- between more device link aggregation group (MCLAG) members The allocation result is sent to each RB in group on portal link;
In point to point network, the allocation result is sent to by each RB in group by ESADI extensions, or pass through link shape State data packet (LSP), which is flooded, ties the distribution on the intra-portal link to TRILL network, or between MCLAG member Fruit is sent to each RB in group.
In addition, the present invention also provides a kind of method of Message processing, apply in TRILL network, including:
In route-bridge group, by one of route-bridge (RB) as the specified node (GDRB) of group;
After a certain member's route-bridge (RB) receives the message that distal end is sent, such as judge that the message is itself and cannot locate Manage and destination address is the message of the route-bridge group, the then GDRB being sent to the message in this group;
The GDRB is routing network as described in use that itself sends out after receiving the message, judged the message not The message, then be transmitted to respectively except the member for sending the message by the corresponding response message of message of the Nickname encapsulation of bridge group Other member RB except RB.
Further,
GDRB in the route-bridge group is by administrator's specified configuration, or by each RB in the route-bridge group It is elected from all RB in this group according to identical election regulation.
Further,
In the case where the GDRB is by administrator's specified configuration, the GDRB is judging itself to be configured as GDRB When, into group other RB send for indicate itself be GDRB GDRB identification messages;
RB has RB to be elected as GDRB where knowing after receiving the GDRB identification messages in group in described group.
Further,
The GDRB is selected from all RB in this group according to identical election regulation by each RB in the route-bridge group It enumerates, specifically includes:
Before not receiving the GDRB identification messages, each RB in the route-bridge group is advised according to identical election Then elect a RB as the GDRB from all RB in this group.
Further,
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Or Person,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
Correspondingly, it the present invention provides a kind of route-bridge, applies in TRILL network, including:
Choosing tree unit, when being used to be used as specified node (GDRB) of group in route-bridge group in the route-bridge (RB), According to choosing tree strategy tree root is distributed for each RB in group;
Notification unit is notified for the allocation result that unit is each RB distribution tree roots to be set in the choosing to each RB in group.
Further,
The notification unit is additionally operable to when judging that this route-bridge is configured as GDRB, and into group, other RB, which are sent, uses In indicate itself be GDRB GDRB identification messages.
Further, the route-bridge further includes:
Unit is elected, for before not receiving the GDRB identification messages, according to election regulation from this route-bridge Elect a RB as the GDRB in all RB in the route-bridge group of place.
Further,
The election unit elects the GDRB according to following election regulation:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Or Person,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
Further,
The choosing tree unit is used to distribute tree root according to choosing tree strategy for each RB in group, specifically includes:
Choosing tree unit is used to be ranked up all RB in organizing, and is then that each RB is successively in group according to the sequence of sequence Distribute tree root;The choosing is set unit and is used for for each RB in group, in current all unappropriated tree roots, selects and is somebody's turn to do The link cost of RB is most short or the maximum tree root of link bandwidth distributes to the RB.
Further,
Notification unit is additionally operable to the configured distribution tree information ready for use on detecting this equipment, by the distribution tree GDRB where information is sent to this route-bridge in route-bridge group;
The choosing tree unit is used to distribute tree root according to choosing tree strategy for each RB in group, specifically includes:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, correspondingly will The tree preferentially distributes to the RB;It is additionally operable to each RB for distribution tree information is not configured in group, current all unallocated Tree root in, selection and the link cost of the RB are most short or the maximum tree root of link bandwidth distributes to the RB.
Further,
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, correspondingly will The tree preferentially distributes to the RB, specifically includes:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, for prewired The identical more than two RB of distribution tree information set, preferentially distribute to wherein tree root priority by the distribution tree of the pre-configuration The link cost of high RB, and from current all unappropriated tree roots, selection and RB is most short or the maximum tree root of link bandwidth Distribute to other RB.
Further,
The notification unit is used to notify, to each RB in group, to specifically include by allocation result:
The notification unit is in a local network, being sent out the allocation result by the HELLO message in TRILL network Each RB in group is given, or the allocation result is sent to by each RB in group by terminal address interaction protocol (ESADI) extension, Or by link state data packet (LSP) flood to TRILL network, or by more device link aggregation groups (MCLAG) at The allocation result is sent to each RB in group on intra-portal link between member;
The notification unit is additionally operable in point to point network, is extended by ESADI the allocation result being sent to group Interior each RB, or flooded to TRILL network by link state data packet (LSP), or the intra-portal between MCLAG member Link is upper to be sent to each RB in group by the allocation result.
Correspondingly, it the present invention also provides a kind of route-bridge, applies in TRILL network, including:
Receiving unit is sent out for receiving other route-bridges (RB) in the message or place route-bridge group that distal end is sent The message come;
Judging unit, for after the message that the receiving unit receives that distal end is sent, judging whether the message is itself Cannot handle and destination address is the message of the route-bridge group;It is additionally operable in the route-bridge road where as itself When specifying node (GDRB) by the group in bridge group, judge that other RB that the receiving unit receives send from distal end Message whether be route-bridge group described in the use that itself sends out Nickname encapsulation the corresponding response message of message;
Transmission unit, for the judging unit judge the message that the distal end is sent be it is that itself cannot be handled and Destination address is the GDRB where being sent to the message in route-bridge group after the message of the route-bridge group;Also use Where in the route-bridge as itself when GDRB in route-bridge group, the reception is judged in the judging unit The message from distal end that other RB that unit receives are sent is not route-bridge group described in the use that itself sends out When the corresponding response message of message of Nickname encapsulation, which is transmitted to respectively in addition to the member RB for sending the message Other member RB.
Further,
The transmission unit is additionally operable to when judging that this route-bridge is configured as GDRB, and into group, other RB, which are sent, uses In indicate itself be GDRB GDRB identification messages.
Further,
Unit is elected, for before not receiving the GDRB identification messages, according to election regulation from this route-bridge Elect a RB as the GDRB in all RB in the route-bridge group of place.
Further,
The election unit elects the GDRB according to following election regulation:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Or Person,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
It can be abandoned after applying the present invention to avoid the mistake of message, and tree distribution is flexibly used, group member can be with Node is specified to carry out sufficient information sharing, flexible network configuration and the guarantee for providing network application by group.
Description of the drawings
Fig. 1 is the topological diagram of TRILL network in the embodiment of the present invention;
Fig. 2 is the method flow diagram for carrying out tree root distribution in the embodiment of the present invention in TRILL network;
Fig. 3 is the present invention using TRILL network LAG group membership's structure charts in example one;
Fig. 4 is the present invention using a kind of content example figure of notification message in example one;
Fig. 5 is content example figure of the present invention using another notification message in example one;
Fig. 6 is the present invention using TRILL network LAN group membership's structure charts in example two.
Specific implementation mode
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention Embodiment be described in detail.It should be noted that in the absence of conflict, in the embodiment and embodiment in the application Feature mutually can arbitrarily combine.
In the present embodiment, a method of carrying out Message processing in TRILL network, including:
Step 10:In route-bridge group, by one of RB as the specified node (GDRB) of group;
When a certain member RB receive distal end send message after, such as judge the message be itself cannot handle, purpose Address is the message of route-bridge group where itself, then the message is sent to the group in this group specifies node (Distribute RB, hereinafter referred to as GDRB);
Step 20:For GDRB after receiving above-mentioned message, it is that the use RBv itself sent out is encapsulated such as to judge the message not The corresponding response message of message, then the message is transmitted to other members in addition to the member RB for sending the message respectively RB。
As shown in Figure 1, RB1, RB2 and RB3 belong to the same route-bridge group, the RBv1 encapsulated messages that RB1 is sent out reach After the RB5 of distal end, response message is replied to RB2 by RB5.RB2 is not due to identifying this message, such as OAM (Operations Administration and Maintenance, operation, management and safeguard) etc. messages, then RB2 the message is preferentially issued into group Specified node R B3 (it is assumed herein that RB3 is the specified node of group in this group);RB3 is in the message for being sent to RBv1 for receiving RB2 and sending Afterwards, it is that oneself is to be treated such as to judge the message not, then is transmitted to other member nodes other than RB2 in group, It is transmitted to RB1 processing;After RB1 receives the response message, can correctly it handle.
In addition, in the present embodiment, a method of tree root distribution is carried out in TRILL network, as shown in Fig. 2, including:
Step 10:In route-bridge group, by one of RB as GDRB, distributed for each RB in group according to choosing tree strategy Tree root.Group membership is ranked up according to tree root priority or other principles, then according to choosing tree strategy by clooating sequence according to It is secondary for each RB in group to carry out that tree is selected to calculate.Wherein:Strategy is set in choosing:The small excellent principles of cost (cost) or other strategies are (such as Bandwidth) etc..
Assuming that with the small excellent principles of cost be choosing tree strategy, then GDRB for group membership select set when, can according to the group membership with Link cost between each tree root selects tree root for calculation basis, namely when to some group membership's allocation tree, can in current institute There is the tree point that link cost most short (i.e. link cost of the tree root apart from group membership's node is minimum) is selected in unappropriated tree root The dispensing group membership.
When being using RBv manual configurations certain tree in advance on certain group membership, which need to be by the pre-configuration Tree information issues the GDRB in this group;After GDRB receives the configuration information, re-starts choosing tree and calculate, it is preferential for the group membership Distribute the tree of the pre-configuration;The group membership clashed for pre-configuration on more than two group memberships (as being pre-configured same Tree carries out the encapsulation of RBv), which is distributed into the high group membership of tree root priority, the node low to tree root priority is separately counted Point counting is matched, and the group membership for not being pre-configured with tree distributes according to the calculating that choosing tree strategy is set inside remaining tree root.
Step 20:GDRB notifies allocation result to each member in group.
Wherein, allocation result can select to be carried in different messages according to different scenes.If it is LAN nets Network can preferentially select to carry in the HELLO message of TRILL, or can pass through LSP (Link State Packet, chain Line state data packet) flooding TRILL network, extension ESADI (End Station Address can also be used Distribution Information, terminal address interaction protocol) carrying that carries out notice message, or between MCLAG member Intra-portal link (MCLAG equipment rooms link) on noticed;If it is the group of point to point network, such as the side MCLAG The group of formula can flood TRILL network by LSP, can also use and extend the carrying that ESADI carries out notice message, or It is noticed on intra-portal link between MCLAG member.If being allocated the notice of result using LSP modes, In the case of knowing that group exterior node cannot identify the message, group membership RB is sent out accordingly after receiving allocation result according to result Affinity TLV (Affinity Tag Length Value, approximate label length value) are locally sealed using RBv wherein carrying Allocation result when dress;If know that the outer other nodes of group such as can recognize that the message, organizing exterior node can be according to receiving Allocation result carries out RPF calculating, and the RBv that group membership need to only be forwarded face according to the tree for its distribution is encapsulated, it is no longer necessary into Row Affinity TLV notices.
Hereafter, group membership carries out RBv encapsulation according to the tree allocation result received to data message, and it is optional realize whether It needs to carry out control plane Affinity TLV notices.Other nodes outside group are according to the allocation result of each member in the group received Carry out the rpf check of RBv.
It should be noted that in route-bridge group, the GDRB for carrying out tree distribution and transfer message can be the same RB, RB can also be different.
In specific implementation, GDRB can be specified by administrator, can also be elected by certain rule, such as:? Tree root highest priority can be preferentially elected in LAG (Link Aggregation Group, link aggregation group) network in group RB is as GDRB;When in group there are when the RB of more than two tree root highest priorities, can according to system id come select (such as from It selects system id maximum in the RB of multiple tree root highest priorities or minimum RB is as GDRB, it is, of course, also possible to according to System id are conducted an election using other rules);When the system id of the RB selected according to certain rule are also identical, then may be used also Further to be selected according to Nickname;Preferential in group interface priority can be elected highest in lan network RB is as GDRB;When in group there are when the RB of more than two tree root highest priorities, can according to system id come select (such as from It selects system id maximum in the RB of multiple tree root highest priorities or minimum RB is as GDRB, it is, of course, also possible to according to System id are conducted an election using other rules);When the system id of the RB selected according to certain rule are also identical, then may be used also Further to be selected according to Nickname;It, can be according to Nickname come preferred GDRB in area.
It is further described below with several examples of the present invention.
Using example one:The LAG application scenarios of point-to-point
Due in the personal draft draft-tissa-trill-cmt-00 of TRILL working groups, it is proposed that a kind of Affinity TLV, for by group membership when being encapsulated using RBv be which tree notice away.But the document divides tree The scheme that method of completing the square is taken is:Tree root sequencing numbers and the sequencing numbers of group membership are subjected to modulo operation, if there is n Tree is ordered as 1-n, and it is i, i+j, i+2j...i in n tree that, which there are j group membership, the blaze of i-th of group membership distribution in group the inside, + xj, wherein i+xj < n < i+ (x+1) j.This method of salary distribution does not have completely with the physical location of specific node and root vertex Relationship, it is assumed that the tree root for member RB1 distribution is RBi in this way, be the tree root that member RB2 is distributed is RBj, and in object When RB1 is close from RBj on reason position, RB2 is close from RBi, the waste of intermediate line link bandwidth can be caused.And if there is group membership wants When separately configuring certain tree, this method can not meet this demand.
In view of this, small according to cost between group membership to the tree used needed for the relatively reasonable distribution of group membership, to need Excellent principle or other tactful (such as bandwidth) carry out calculating negotiation.Because of chain road situations such as there may be congestions of cost minimums, So other strategies can be selected as bandwidth considerations account for.Group membership is ranked up calculating according to principles such as priority, Group membership is more and when tree root is also more, each member node will calculate the tree of oneself, it is necessary to which group membership follows one by one Ring calculating can just obtain, this be equivalent to all group memberships all calculated all nodes respectively will tree, implement and compare It is complicated.
As shown in figure 3, in point to point network, RB1~RBk inside a route-bridge group, the group Nickname is RBv, if the tree root priority of RB1~RBk sort from high to low (can also be ranked up according to other principles, Such as when tree root priority is consistent, it can be ranked up by system id height, if system id are consistent, then it is big press nickname It is small to be ranked up) it is RB1~RBk, it is assumed that according to configuring or elect RB1 as GDRB in RB1~RBk.
Assuming that there is 3 trees in current TRILL network, the tree roots of this 3 trees be sequentially inside Tree id RBm, RBj, RBi.If the specified tree all not configured on all group memberships, according to COST minimum priority principles, RB1 is highest priority , then RB1 can be preferably oneself first to select one tree.According to the choosing tree strategy of selection shortest tree root with a distance from RB1, calculate RBi is first tree root of RB1;Then RB1 be RB2 distribute tree root, calculated in remaining tree root in addition to RBi RBj be from Tree root nearest RB2, then choose RBj to distribute to RB2;Selecting the when of calculating that can only select last remaining tree root for RB3 RBm。
If there is k+1 tree in current TRILL network, this k+1 tree root is followed successively by RB1+m, RB2+m, RB3+m, RBk+1 + m (wherein, m is the positive integer more than k).In the selection distribution set, the tree root that RB1 is distributed to RB1 to RBk-2 is successively For RB1+m to RBk+m-2, then when carrying out choosing tree for RBk-1, also not selected tree root has RBk+m-1, RB k+m and RBk+ m+1.If that nearest from RBk-1 is RB k+m+1, then the tree root to RBk-1 distribution is RBk+m+1;When carrying out choosing tree for RBk, Distance RBk it is nearest be RB k+m-1, then the tree root for distributing to RBk is RB k+m-1, and the one tree having more is recycled to RB1 again Choosing, carries out calculating distribution in this way, that is, being assigned with two trees for RB1.
After being assigned, RB1 sends out result of calculation in a manner of notification message, as shown in figure 4, the notice disappears The correspondence of group membership and the blaze distributed is carried in breath.Because this partial information is not complete, do not have to other groups of interior nodes Use, therefore the notification message need to be only transmitted in group can be (such as by the intra-portal link links biography between group membership It is defeated or an ESADI example is all added by group member, group membership is carried to transmission in group by ESADI and is distributed The corresponding informance of blaze), group membership sends out related AFF TLV floodings TRILL network after receiving above-mentioned allocation result, thus complete The distribution and rpf check of Cheng Shu.
And if carrying the correspondence of RBv, group membership and the blaze for the tree distributed in notification message, as shown in figure 5, Then can GDRB selections the notification message is flooded in the domains TRILL or group through intra-portal link link transmissions, if flooding When the extension information group outside other nodes can also identify that then group membership no longer needs to send out related AFF TLV, group exterior node is direct Effective information, which can be extracted, according to the notification message carries out rpf check;If there is group exterior node that cannot identify or only select in group It is interior by intra-portal link link transmissions, then after group membership receives the notification message, send out related AFF TLV flooding Thus TRILL network completes the distribution and rpf check of tree.
Using example two:LAN application scenarios
As shown in fig. 6, RB1~RBk, inside a route-bridge group, the nickname of the route-bridge group is RBv, if The tree root priority of RB1~RBk sorts from high to low (can also be ranked up according to other principles, such as work as tree root priority one When cause, can be ranked up by system id height, if system id are consistent, be then ranked up by nickname sizes) it is RB1 ~RBk, it is assumed that according to configuring or elect RB2 as GDRB in RB1~RBk.According to using one the method for example by RB2 into Row choosing tree calculates, and tree allocation result is distributed to other group memberships.
Notification information containing allocation result can select to carry in the HELLO messages on LAN, message structure such as Fig. 4 Shown, remaining node can not have to the presence for perceiving the message in this way, carry allocation result after the notified message of group membership It is sent in such as Affinity TLV.Remaining group exterior node carries out corresponding rpf check according to the message information.Certainly, If what is sent out is notification message as shown in Figure 5, if wanting that group exterior node can be received and identifying, can select to pass through LSP is flooded, and such group membership can not have to another text of transmitting messages after receiving message, remaining group exterior node is according to the information energy received Carry out corresponding rpf check.If it is desired to being notified with ESADI and intra-portal link links under certain LAN scenes The transmission of message, is also allowed.
Using example three:The specified of GDRB, election and crash handling
Above application example one and the specified of the GDRB in application example two, election and crash handling can be specially:
When there is specified GDRB in group, the election priority of oneself can be arranged automatically according to automatic election rule by GDRB For highest, and it is simultaneously emitted by that oneself to be the identification message of GDRB (can be passed by the intra-portal link links in group It is defeated), other group memberships stop election after receiving the GDRB identification messages that other member sends, and wait for peacefully GDRB publication distribution knots Fruit.When other group memberships know GDRB failures (such as DBR delay machines), if there is other node to be configured for GDRB in this group, Then the election priority of oneself is set to highest by the node, and sends GDRB identification messages, is thus organized interior nodes and will appreciate that into Member assumes responsibility for GDRB role, waits for peacefully allocation result.When not receiving GDRB identification messages, then it represents that without specified GDRB, group in group Interior each member can automatically conduct an election according to unified election regulation, i.e.,:In the network environment of point-to-point, tree root can be relied on The election regulation such as priority height, system id sizes, nickname sizes are elected, and GDRB can be followed in lan environment Election principle (conducted an election according to the priority of interface, interface MAC etc., naturally it is also possible to in above-mentioned point to point network Election principle), each group membership conducts an election in accordance with wherein a certain unified rule in a word.Elected GDRB sends out one and shows Oneself it is the GDRB identification messages (can be transmitted by the intra-portal link links in group) of GDRB in group, it is other Group membership know there is member to undertake GDRB role after just no longer carry out GDRB elections, wait for peacefully GDRB and allocation result be sent to this End.Therefore, it once detecting that GDRB fails, has new GDRB and is elected, the election of the new GDRB configures then according to having Configuration is elected, and the mode that no configuration is then elected to according to election regulation carries out;After elected GDRB failures, continue by mentioned above principle at it It is elected in remaining group member, when group member receives new GDRB identification messages, then it represents that elect successfully.It is more when receiving simultaneously When the GDRB identification messages that the different nodes of part are sent out, then selected by preset rules by the multiple nodes for sending out GDRB identification messages It lifts, elects unique consequence, GDRB identification messages are sent out by the GDRB elected, and after for group member's allocation tree, the period Allocation result is sent, maintenance is thus updated.
Using example four:If there is tree distribution when specified tree configuration to calculate on group membership
As shown in figure 3, it is respectively RBj, RBm, RBi that if tree used has been respectively configured above RB1, RB2, RBk, and this The notice of a little tree information is noticed away by Tree Used ID, and rpf check at this time is with respective node Nickname is RPF's.And distributed by the tree carried out with RBv encapsulation that node calculates, it is that RPF is carried out with RBv to check , so there is no conflicts.And if configuration is the tree specified configuration presence when tree is encapsulated using RBv, when in member node When above for using RBv manual configurations certain tree, which can issue GDRB by the distribution tree information of configuration.GDRB is collected To after the distribution tree information of configuration, calculating is re-started, the tree of the configuration is preferentially distributed for the node of configured distribution tree, it is right It is high by tree root priority if the node (as configuration uses the encapsulation for carrying out RBv with one tree above two nodes) of configuration conflict Node occupy the tree of the configuration, the low node of tree root priority in conflict is passed through to calculate and is distributed.It needs to calculate distribution Member node can be according to the calculation in application example one, the calculating point set inside remaining tree root according to choosing tree strategy Match.If subsequent node continuation selects the tree root nearest from oneself successively in unappropriated tree root, as long as then ensureing distributing to Tree in each member node does not repeat, and realizes tree on group membership in the case where taking into account the specified tree of manual configuration and distributing Unique distribution uses.
Using example five:GDRB is responsible for the OAM message transfer between group membership
Assuming that RB1, RB2, RB3 belong to the same route-bridge group, wherein RB3 is GDRB, and the RBv that RB1 is sent out encapsulates number After reaching distal end RB5 according to message, RB5 has found message encapsulation, and there may be problems, need to return to an OAM and report an error to RBv.Pass through The local list item information of inquiry finds that the optimal routing for reaching RBv is the path between RB2, then RB5 passes through the OAM messages that report an error The path in the directions RB2, which is sent out, has replied to RB2.Because RB2 do not send out OAM report an error message description in message, this message It is sent out by RB1, then report an error message and when cannot identify when RB2 receives OAM, the OAM messages that report an error is passed through Intra-portal link issue the specified node R B3 of group.RB3 receives the OAM that the destination address that RB2 is sent is RBv and reports an error message Afterwards, first judge that the message is that oneself is to be treated, removed if it is not, then being transmitted to by intra-portal link Other member nodes except message sender, in this example other member node i.e. RB1.RB1 is received The OAM reports an error after message, correctly handles the message.
In addition, in the present embodiment, a kind of route-bridge is applied in TRILL network, including:
Choosing tree unit, when being used to be used as specified node (GDRB) of group in route-bridge group in the route-bridge (RB), According to choosing tree strategy tree root is distributed for each RB in group;
Notification unit is notified for the allocation result that unit is each RB distribution tree roots to be set in the choosing to each RB in group.
Preferably,
The notification unit is additionally operable to when judging that this route-bridge is configured as GDRB, and into group, other RB, which are sent, uses In indicate itself be GDRB GDRB identification messages.
Preferably, the route-bridge further includes:
Unit is elected, for before not receiving the GDRB identification messages, according to election regulation from this route-bridge Elect a RB as the GDRB in all RB in the route-bridge group of place.
Preferably,
The election unit elects the GDRB according to following election regulation:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Or Person,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
Preferably,
The choosing tree unit is used to distribute tree root according to choosing tree strategy for each RB in group, specifically includes:
Choosing tree unit is used to be ranked up all RB in organizing, and is then that each RB is successively in group according to the sequence of sequence Distribute tree root;The choosing is set unit and is used for for each RB in group, in current all unappropriated tree roots, selects and is somebody's turn to do The link cost of RB is most short or the maximum tree root of link bandwidth distributes to the RB.
Preferably,
Notification unit is additionally operable to the configured distribution tree information ready for use on detecting this equipment, by the distribution tree GDRB where information is sent to this route-bridge in route-bridge group;
The choosing tree unit is used to distribute tree root according to choosing tree strategy for each RB in group, specifically includes:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, correspondingly will The tree preferentially distributes to the RB;It is additionally operable to each RB for distribution tree information is not configured in group, current all unallocated Tree root in, selection and the link cost of the RB are most short or the maximum tree root of link bandwidth distributes to the RB.
Preferably,
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, correspondingly will The tree preferentially distributes to the RB, specifically includes:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, for prewired The identical more than two RB of distribution tree information set, preferentially distribute to wherein tree root priority by the distribution tree of the pre-configuration The link cost of high RB, and from current all unappropriated tree roots, selection and RB is most short or the maximum tree root of link bandwidth Distribute to other RB.
Preferably,
The notification unit is used to notify, to each RB in group, to specifically include by allocation result:
The notification unit is in a local network, being sent out the allocation result by the HELLO message in TRILL network Each RB in group is given, or the allocation result is sent to by each RB in group by terminal address interaction protocol (ESADI) extension, Or by link state data packet (LSP) flood to TRILL network, or by more device link aggregation groups (MCLAG) at The allocation result is sent to each RB in group on intra-portal link between member;
The notification unit is additionally operable in point to point network, is extended by ESADI the allocation result being sent to group Interior each RB, or flooded to TRILL network by link state data packet (LSP), or the intra-portal between MCLAG member Link is upper to be sent to each RB in group by the allocation result.
Correspondingly, in the present embodiment, a kind of route-bridge is applied in TRILL network, including:
Receiving unit is sent out for receiving other route-bridges (RB) in the message or place route-bridge group that distal end is sent The message come;
Judging unit, for after the message that the receiving unit receives that distal end is sent, judging whether the message is itself Cannot handle and destination address is the message of the route-bridge group;It is additionally operable in the route-bridge road where as itself When specifying node (GDRB) by the group in bridge group, judge that other RB that the receiving unit receives send from distal end Message whether be route-bridge group described in the use that itself sends out Nickname encapsulation the corresponding response message of message;
Transmission unit, for the judging unit judge the message that the distal end is sent be it is that itself cannot be handled and Destination address is the GDRB where being sent to the message in route-bridge group after the message of the route-bridge group;Also use Where in the route-bridge as itself when GDRB in route-bridge group, the reception is judged in the judging unit The message from distal end that other RB that unit receives are sent is not route-bridge group described in the use that itself sends out When the corresponding response message of message of Nickname encapsulation, which is transmitted to respectively in addition to the member RB for sending the message Other member RB.
Preferably,
The transmission unit is additionally operable to when judging that this route-bridge is configured as GDRB, and into group, other RB, which are sent, uses In indicate itself be GDRB GDRB identification messages.
Preferably,
Unit is elected, for before not receiving the GDRB identification messages, according to election regulation from this route-bridge Elect a RB as the GDRB in all RB in the route-bridge group of place.
Preferably,
The election unit elects the GDRB according to following election regulation:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Or Person,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
One of ordinary skill in the art will appreciate that all or part of step in the above method can be instructed by program Related hardware is completed, and described program can be stored in computer readable storage medium, such as read-only memory, disk or CD Deng.Optionally, all or part of step of above-described embodiment can also be realized using one or more integrated circuits.Accordingly Ground, the form that hardware may be used in each module/unit in above-described embodiment are realized, the shape of software function module can also be used Formula is realized.The present invention is not limited to the combinations of the hardware and software of any particular form.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the scope of the present invention.According to The invention content of the present invention, can also there is other various embodiments, without deviating from the spirit and substance of the present invention, be familiar with Those skilled in the art makes various corresponding change and deformations in accordance with the present invention, all in the spirit and principles in the present invention Within, any modification, equivalent replacement, improvement and so on should all be included in the protection scope of the present invention.

Claims (24)

1. a kind of method of tree root distribution, is applied in multi-link transparent interconnection (TRILL) network, including:
In route-bridge group, by one of route-bridge (RB) as the specified node (GDRB) of group, it is according to choosing tree strategy Each RB distributes tree root in group, then notifies allocation result to each RB in group;
When the route-bridge group inside points RB detects configured distribution tree information ready for use in this equipment, then the RB will GDRB where the distribution tree information is sent in route-bridge group;
It is described to distribute tree root according to choosing tree strategy for each RB in group, it specifically includes:
The GDRB correspondingly preferentially distributes the tree after receiving the configured distribution tree information that other RB are sent in group Give the RB;For each RB of distribution tree information is not configured in group, the GDRB is in current all unappropriated tree roots, choosing It selects most short or the maximum tree root of link bandwidth distributes to the RB with the link cost of the RB.
2. the method as described in claim 1, it is characterised in that:
GDRB in the route-bridge group be by administrator's specified configuration, or by each RB in the route-bridge group according to What identical election regulation was elected from all RB in this group.
3. method as claimed in claim 2, it is characterised in that:
In the case where the GDRB is by administrator's specified configuration, the GDRB when judging that itself is configured as GDRB, Into group other RB send for indicate itself be GDRB GDRB identification messages;
RB has RB to be elected as GDRB where knowing after receiving the GDRB identification messages in group in described group.
4. method as claimed in claim 3, it is characterised in that:
The GDRB is elected from all RB in this group according to identical election regulation by each RB in the route-bridge group Come, specifically includes:
Before not receiving the GDRB identification messages, each RB in the route-bridge group according to identical election regulation from Elect a RB as the GDRB in all RB in this group.
5. the method as described in claim 2 or 4, it is characterised in that:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Alternatively,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
6. the method as described in claim 1, it is characterised in that:
It is described to distribute tree root according to choosing tree strategy for each RB in group, it specifically includes:
The GDRB is ranked up all RB in organizing, and is then that each RB is sequentially allocated tree root in group according to the sequence of sequence;It is right In each RB in group, the GDRB in current all unappropriated tree roots, the link cost of selection and the RB it is most short or The maximum tree root of link bandwidth distributes to the RB.
7. the method as described in claim 1, it is characterised in that:
The GDRB correspondingly preferentially distributes the tree after receiving the configured distribution tree information that other RB are sent in group The RB is given, is specifically included:
The GDRB believes the distribution tree of pre-configuration after receiving the configured distribution tree information that other RB are sent in group Identical more than two RB are ceased, it is high that the distribution tree of the pre-configuration is preferentially distributed to wherein tree root priority by the GDRB RB, and from current all unappropriated tree roots, the link cost of selection and RB are most short or the maximum tree root of link bandwidth distributes Give other RB.
8. the method as described in claim 1, it is characterised in that:
It is described to notify, to each RB in group, to specifically include by allocation result:
In a local network, the allocation result is sent to by each RB, Huo Zhetong in group by the HELLO message in TRILL network It crosses terminal address interaction protocol (ESADI) extension and the allocation result is sent to each RB in group, or pass through link state number It is flooded to TRILL network according to packet (LSP), or is passing through the intra-portal between more device link aggregation group (MCLAG) members Link is upper to be sent to each RB in group by the allocation result;
In point to point network, the allocation result is sent to by each RB in group by ESADI extensions, or pass through link state number It floods according to packet (LSP) and sends out the allocation result on the intra-portal link to TRILL network, or between MCLAG member Give each RB in group.
9. a kind of method of Message processing is applied in multi-link transparent interconnection (TRILL) network, including:
In route-bridge group, by one of route-bridge (RB) as the specified node (GDRB) of group;
After a certain member's route-bridge (RB) receives the message that distal end is sent, it cannot be handled as judged that the message is itself And the message that destination address is the route-bridge group, then the GDRB being sent to the message in this group;
The GDRB is route-bridge group as described in use that itself sends out after receiving the message, judged the message not Nickname encapsulation the corresponding response message of message, then by the message respectively be transmitted to except send the message member RB it Other outer member RB;
The GDRB correspondingly preferentially distributes the tree after receiving the configured distribution tree information that other RB are sent in group Give the RB;For each RB of distribution tree information is not configured in group, the GDRB is in current all unappropriated tree roots, choosing It selects most short or the maximum tree root of link bandwidth distributes to the RB with the link cost of the RB;
When the route-bridge group inside points RB detects configured distribution tree information ready for use in this equipment, then the RB will GDRB where the distribution tree information is sent in route-bridge group.
10. method as claimed in claim 9, it is characterised in that:
GDRB in the route-bridge group be by administrator's specified configuration, or by each RB in the route-bridge group according to What identical election regulation was elected from all RB in this group.
11. method as claimed in claim 10, it is characterised in that:
In the case where the GDRB is by administrator's specified configuration, the GDRB when judging that itself is configured as GDRB, Into group other RB send for indicate itself be GDRB GDRB identification messages;
RB has RB to be elected as GDRB where knowing after receiving the GDRB identification messages in group in described group.
12. method as claimed in claim 11, it is characterised in that:
The GDRB is elected from all RB in this group according to identical election regulation by each RB in the route-bridge group Come, specifically includes:
Before not receiving the GDRB identification messages, each RB in the route-bridge group according to identical election regulation from Elect a RB as the GDRB in all RB in this group.
13. the method as described in claim 10 or 12, it is characterised in that:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Alternatively,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
14. a kind of route-bridge is applied in multi-link transparent interconnection (TRILL) network, including:
Choosing tree unit, when being used to be used as specified node (GDRB) of group in route-bridge group in the route-bridge (RB), according to Choosing tree strategy distributes tree root for each RB in group;
Notification unit is notified for the allocation result that unit is each RB distribution tree roots to be set in the choosing to each RB in group;
Notification unit is additionally operable to the configured distribution tree information ready for use on detecting this equipment, by the distribution tree information GDRB where being sent to this route-bridge in route-bridge group;
The choosing tree unit is used to distribute tree root according to choosing tree strategy for each RB in group, specifically includes:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, correspondingly by the tree Preferentially distribute to the RB;It is additionally operable to each RB for distribution tree information is not configured in group, in current all unappropriated trees In root, the link cost of selection and the RB are most short or the maximum tree root of link bandwidth distributes to the RB.
15. route-bridge as claimed in claim 14, it is characterised in that:
The notification unit is additionally operable to when judging that this route-bridge is configured as GDRB, and into group, other RB, which are sent, is used for table Show itself be GDRB GDRB identification messages.
16. route-bridge as claimed in claim 15, which is characterized in that further include:
Unit is elected, for before not receiving the GDRB identification messages, according to election regulation where this route-bridge Elect a RB as the GDRB in all RB in route-bridge group.
17. route-bridge as claimed in claim 16, it is characterised in that:
The election unit elects the GDRB according to following election regulation:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Alternatively,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
18. route-bridge as claimed in claim 14, it is characterised in that:
The choosing tree unit is used to distribute tree root according to choosing tree strategy for each RB in group, specifically includes:
The choosing tree unit is used to be ranked up all RB in organizing, and is then that each RB is sequentially allocated in group according to the sequence of sequence Tree root;The choosing tree unit is used for for each RB in group, and in current all unappropriated tree roots, selection is with the RB's Link cost is most short or the maximum tree root of link bandwidth distributes to the RB.
19. route-bridge as claimed in claim 14, it is characterised in that:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, correspondingly by the tree The RB is preferentially distributed to, is specifically included:
The choosing tree unit is used for after receiving the configured distribution tree information that other RB are sent in group, for pre-configuration It is high preferentially to be distributed to wherein tree root priority by the identical more than two RB of distribution tree information for the distribution tree of the pre-configuration RB, and from current all unappropriated tree roots, the link cost of selection and RB are most short or the maximum tree root of link bandwidth distributes Give other RB.
20. route-bridge as claimed in claim 14, it is characterised in that:
The notification unit is used to notify, to each RB in group, to specifically include by allocation result:
The allocation result in a local network, being sent to by the notification unit by the HELLO message in TRILL network Group in each RB, either by terminal address interaction protocol (ESADI) extend by the allocation result be sent to group in each RB or It is flooded to TRILL network, or by between more device link aggregation group (MCLAG) members by link state data packet (LSP) Intra-portal link on by the allocation result be sent to group in each RB;
The notification unit is additionally operable in point to point network, is sent to the allocation result in group respectively by ESADI extensions RB, or flooded to TRILL network by link state data packet (LSP), or the intra-portal between MCLAG member Link is upper to be sent to each RB in group by the allocation result.
21. a kind of route-bridge is applied in multi-link transparent interconnection (TRILL) network, including:
Receiving unit is sent for receiving other route-bridges (RB) in the message sent of distal end or place route-bridge group Message;
Judging unit, for after the message that the receiving unit receives that distal end is sent, judging whether the message is that itself cannot Handle and destination address is the message of the route-bridge group;It is additionally operable in the route-bridge routing network where as itself When group in bridge group specifies node (GDRB), the message from distal end that other RB that the receiving unit receives are sent is judged Whether be route-bridge group described in the use that itself sends out Nickname encapsulation the corresponding response message of message;It is additionally operable to work as The route-bridge group inside points RB detects configured distribution tree information ready for use in this equipment, then the RB will be described point GDRB where hair tree information is sent in route-bridge group;
Transmission unit, for judging that the message that the distal end is sent is that itself cannot be handled and purpose in the judging unit Address is the GDRB where being sent to the message in route-bridge group after the message of the route-bridge group;It is additionally operable to When the route-bridge is as GDRB in route-bridge group where itself, the receiving unit is judged in the judging unit The message from distal end that other RB received are sent is not the Nickname of route-bridge group described in the use that itself sends out When the corresponding response message of the message of encapsulation, by the message be transmitted to respectively in addition to the member RB for sending the message other at Member RB;It is additionally operable to after receiving the configured distribution tree information that other RB are sent in group, correspondingly preferentially distributes the tree Give the RB;For each RB of distribution tree information is not configured in group, the GDRB is in current all unappropriated tree roots, choosing It selects most short or the maximum tree root of link bandwidth distributes to the RB with the link cost of the RB.
22. route-bridge as claimed in claim 21, it is characterised in that:
The transmission unit is additionally operable to when judging that this route-bridge is configured as GDRB, and into group, other RB, which are sent, is used for table Show itself be GDRB GDRB identification messages.
23. route-bridge as claimed in claim 22, which is characterized in that further include:
Unit is elected, for before not receiving the GDRB identification messages, according to election regulation where this route-bridge Elect a RB as the GDRB in all RB in route-bridge group.
24. route-bridge as claimed in claim 23, it is characterised in that:
The election unit elects the GDRB according to following election regulation:
In link aggregation group network, the election regulation is the RB conducts of the preferential election tree root highest priority in group GDRB;Alternatively,
In a local network, the election regulation is preferentially to elect the highest RB of interface priority as GDRB in group;Alternatively,
In region, the election regulation is to select a RB as GDRB according to the Nickname of each RB in group.
CN201210148395.0A 2012-05-14 2012-05-14 A kind of distribution of tree root, the method for Message processing and route-bridge Expired - Fee Related CN103428088B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210148395.0A CN103428088B (en) 2012-05-14 2012-05-14 A kind of distribution of tree root, the method for Message processing and route-bridge

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210148395.0A CN103428088B (en) 2012-05-14 2012-05-14 A kind of distribution of tree root, the method for Message processing and route-bridge

Publications (2)

Publication Number Publication Date
CN103428088A CN103428088A (en) 2013-12-04
CN103428088B true CN103428088B (en) 2018-11-06

Family

ID=49652278

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210148395.0A Expired - Fee Related CN103428088B (en) 2012-05-14 2012-05-14 A kind of distribution of tree root, the method for Message processing and route-bridge

Country Status (1)

Country Link
CN (1) CN103428088B (en)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104702506B (en) * 2013-12-09 2018-10-19 华为技术有限公司 A kind of message transmitting method, network node and message transfer system
CN105493454B (en) * 2014-05-13 2019-04-05 华为技术有限公司 For realizing the method and apparatus at the dual-active access garden TRILL edge
CN105306613A (en) 2014-07-24 2016-02-03 中兴通讯股份有限公司 MAC address notification method and device and acquisition device for ESADI
CN104243321A (en) * 2014-09-05 2014-12-24 杭州华三通信技术有限公司 Selection method and routing bridge (RB) devices for distribution tree root
CN105591940B (en) * 2014-11-17 2020-03-31 中兴通讯股份有限公司 TRILL network distribution tree selection method and TRILL network node
CN105681204A (en) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 Transparent interconnection of lots of links (TRILL) network distribution tree calculation method and TRILL network node
CN105704257A (en) * 2014-11-28 2016-06-22 中兴通讯股份有限公司 Media access control (MAC) address election method and device
CN106941446A (en) * 2016-01-04 2017-07-11 中兴通讯股份有限公司 Locally aggregated chain processing method and device
CN108989208B (en) * 2017-05-31 2021-08-10 中兴通讯股份有限公司 Identification distribution method and device
CN109388490B (en) * 2017-08-07 2020-11-17 华为技术有限公司 Memory allocation method and server
CN109688060B (en) * 2018-12-29 2021-06-29 杭州迪普科技股份有限公司 Link grouping configuration method and device and router

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101136843A (en) * 2006-08-30 2008-03-05 华为技术有限公司 Method of generating symmetrical tree in the shortest path bridge
CN102299845A (en) * 2011-09-20 2011-12-28 神州数码网络(北京)有限公司 Multi-link transparent interconnection multicast frame transmission method and system thereof
CN102316033A (en) * 2011-09-06 2012-01-11 中兴通讯股份有限公司 Method for assigning distribution trees and system thereof

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101136843A (en) * 2006-08-30 2008-03-05 华为技术有限公司 Method of generating symmetrical tree in the shortest path bridge
CN102316033A (en) * 2011-09-06 2012-01-11 中兴通讯股份有限公司 Method for assigning distribution trees and system thereof
CN102299845A (en) * 2011-09-20 2011-12-28 神州数码网络(北京)有限公司 Multi-link transparent interconnection multicast frame transmission method and system thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Routing Bridges:Base Protocol Specification;RFC6325;《IETF》;20110731;第52-55页 *

Also Published As

Publication number Publication date
CN103428088A (en) 2013-12-04

Similar Documents

Publication Publication Date Title
CN103428088B (en) A kind of distribution of tree root, the method for Message processing and route-bridge
KR101989333B1 (en) Data forwarding method, device and system in software-defined networking
US9419817B2 (en) Stitching multicast trees
CN105871721B (en) Segment routing processing method, processing device and sending device
CN102150148B (en) Differentiated services for unicast multicast frames in layer 2 topologies
CN105812259B (en) A kind of message forwarding method and equipment
CN100502335C (en) Communication system, wireless LAN base station controller, and wireless LAN base station device
CN105376154B (en) Gradual MAC address learning
CN102415065B (en) The method and apparatus that redundant host connects in the network having route
EP2783480B1 (en) Method for multicast flow routing selection
CN100563190C (en) Realize the method and system of hierarchical virtual private switch service
CN101394361B (en) Packet transmission method, device and system
CN104798350B (en) The method and system of virtual link polymerization across multiple fabric switch
CN104348726B (en) Message forwarding method and device
CN102413059B (en) Multicast forwarding method based on SPB (Shortest Path Bridging) network and SPBM (MAC-in-MAC SPB) bridge
KR20150009550A (en) System and method for routing traffic between distinct infiniband subnets based on source routing
CN105099848A (en) Network extension groups
CN103763118A (en) Resilient attachment to provider link state bridging (PLSB) networks
US9112711B2 (en) Optimizing OTV multicast traffic flow for site local receivers
CN103780509B (en) Message forwarding method and routing forwarding device
CN114095305A (en) BIER message forwarding method, equipment and system
WO2015144018A1 (en) Information transmission method, device and communication system
CN104662850A (en) Method and apparatus for communication path selection
CN108063716A (en) For the method and apparatus of ether Virtual Private Network
TW201349803A (en) Implementing control planes for hybrid networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20181106

Termination date: 20200514