CN102761493A - Multicast routing item updating method and device of multilink transparent internet - Google Patents
Multicast routing item updating method and device of multilink transparent internet Download PDFInfo
- Publication number
- CN102761493A CN102761493A CN2012102609053A CN201210260905A CN102761493A CN 102761493 A CN102761493 A CN 102761493A CN 2012102609053 A CN2012102609053 A CN 2012102609053A CN 201210260905 A CN201210260905 A CN 201210260905A CN 102761493 A CN102761493 A CN 102761493A
- Authority
- CN
- China
- Prior art keywords
- multicast tree
- tree root
- multicast
- lsp
- link
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a multicast routing item updating method of a multilink transparent internet. The method comprises the following steps that: when an RB (Routing Bridge) detects that a link between the RB and a multicast tree root of a multicast tree is inaccessible, an LSP (Link State Protocol Data Unit) corresponding to the multicast tree root in an LSDB (Local Link State Databank) is eliminated; an available multicast tree root is generated according to the LSDB after the corresponding LSP is eliminated; an SPF tree is generated by using the available multicast tree root; and the multicast routing item is generated and updated by using the available multicast tree root by traversing the SPF tree. Based on the same idea, the invention also provides a device with which effective multicast routing items can be calculated rapidly when the link between the present RB and the multicast routing root is inaccessible, and the normal forwarding of multipurpose messages is ensured.
Description
Technical field
The application relates to communication technical field, and particularly a kind of multichain connects multicast routing table item update method and device in transparent interconnected (TRILL) network.
Background technology
TRILL is data link layer (L2) network standard that IETF recommends.TRILL has very high importance; Be connected because the large-scale data center begins to utilize Ethernet optical-fibre channel new technologies such as (FCoE) that storage transmission and IP transmission is fused to Ethernet, and the Spanning-Tree Protocol of standard (STP) will no longer be fit to the expansion of UNE or ultra-large type data center.Along with the raising of FCoE employing rate, enterprise's storage will begin to add other agreements on the IP network.From the angle of storage, As time goes on, TRILL can replace on the L2 network STP agreement generally used at least.
In the TRILL network, each routing bridge (RB) acquiescence is calculated a multicast distribution tree, also can dispose and calculate many multicast distribution trees.When routing iinformation changes, by the information calculations multicast distribution tree, be used to instruct many purposes message forwarding according to the multicast path in the TRILL network, wherein, many purposes message comprises unicast message, L 2 broadcast message and the multicast message that target MAC (Media Access Control) address is unknown.
Route in the TRILL network calculate be divided into that singlecast router calculates and multicast path by calculating.Referring to Fig. 1, Fig. 1 is a kind of networking structure sketch map of TRILL network.In the TRILL network among Fig. 1, RB1 is the multicast tree root, and be that RB4 is an example with current RB: originally the link between RB1 and the RB2 is normal, and multicast path RB4 when calculating is being on the multicast tree of root with RB1, and then calculates the multicast routing table item that the multicast tree root is RB1; After the link occurs fault between RB1 and the RB2; Link between RB4 and the multicast tree root RB1 is unreachable; To cause follow-up recomputate multicast path by the time RB4 be not on the multicast tree of root at RB1, RB4 uses RB1 to be sky as the multicast routing table item that the multicast tree root calculates.At this moment, according to the processing mode of prior art, RB4 will delete original multicast routing table item, and the consequence that causes thus is that before this multicast tree root RB1 link corresponding status protocol data cell (LSP) was aging, many purposes message can't normally be transmitted.
Summary of the invention
In view of this; The application provides a kind of multichain to connect multicast routing table item update method and device in the transparent internet; When the link between current RB and multicast tree root is unreachable, can recomputate effective multicast routing table item fast, guarantee the normal forwarding of many purposes message.
For solving the problems of the technologies described above, technical scheme of the present invention is achieved in that
A kind of multichain connects multicast routing table item update method in the transparent interconnected TRILL network, and arbitrary multicast tree comprises a plurality of routing bridge RB in the said TRILL network, and said method comprises:
When arbitrary said RB detects link between the multicast tree root of self and said multicast tree and can reach, use said multicast tree root to generate SPF SPF tree, travel through said SPF tree and use said multicast tree root to generate and upgrade the multicast route table items;
Said RB detects link between the multicast tree root of self and said multicast tree when unreachable; Generate said multicast tree root link corresponding status protocol data cell LSP and remove message; And send to each RB that can reach with self link, said each RB is removed the corresponding LSP of this multicast tree root;
The LSP that said RB is corresponding with multicast tree root described in the link-local slip condition database LSDB removes; LSDB according to behind the corresponding LSP of removing generates an available multicast tree root; Use this available multicast tree root to generate the SPF tree, travel through this SPF tree and use said available multicast tree root generation and upgrade the multicast route table items.
A kind of device can be applicable to multichain and meets the arbitrary routing bridge RB in arbitrary multicast tree in the transparent interconnected TRILL network, and said device comprises: detecting unit, generation unit, removing unit and processing unit;
Said detecting unit, whether the link that is used for detecting between the multicast tree root of this RB and said multicast tree can reach;
Said generation unit; Be used for when said detection is unreachable to link between the multicast tree root of this RB and said multicast tree; Generate this multicast tree root link corresponding protocol Data Unit LSP and remove message; And send to each RB that can reach with this RB link, said each RB is removed the corresponding LSP of this multicast tree root;
Said removing unit is used for when said generation unit generates this multicast tree root link corresponding protocol Data Unit LSP removing message, and the LSP that multicast tree root described in the link-local slip condition database LSDB is corresponding removes;
Said processing unit is used for using said multicast tree root to generate the SPF tree when said detection when link can reach between the multicast tree root of this RB and said multicast tree, travels through said SPF tree and uses said multicast tree root to generate and upgrade the multicast route table items; When the said removing unit LSP that multicast tree root described in the link-local slip condition database LSDB is corresponding removes; LSDB according to behind the corresponding LSP of removing generates an available multicast tree root; Use this available multicast tree root to generate the SPF tree, travel through this SPF tree and use said available multicast tree root generation and upgrade the multicast route table items.
In sum; The application, removes the corresponding LSP of former multicast tree root fast, and generates an available multicast tree root according to the LSDB after removing detecting link between self and the multicast tree root when unreachable through RB; Use this multicast tree root to generate SPF tree and multicast routing table item; When the link between current RB and multicast tree root is unreachable, can recomputate effective multicast routing table item fast, guarantee the normal forwarding of many purposes message.
Description of drawings
Fig. 1 is a kind of networking structure sketch map of TRILL network;
Fig. 2 is a multicast routing table item update method flow chart in the embodiment of the invention;
Fig. 3 is the networking structure sketch map of TRILL network in the specific embodiment of the invention;
Fig. 4 is the structural representation that can be used for the device of multicast routing table item renewal.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, scheme according to the invention is done to specify further.
Multicast routing table item update method in a kind of TRILL network is proposed in the embodiment of the invention; Arbitrary multicast tree comprises a plurality of routing bridge RB in the said TRILL network; The method literary composition specific as follows that said arbitrary RB upgrades the multicast route table items is said; When the multicast tree root breaks off, can recomputate effective multicast routing table item fast, guarantee the normal forwarding of many purposes message.
Referring to Fig. 2, Fig. 2 is a multicast routing table item update method flow chart in the embodiment of the invention.Concrete steps are:
Said LSP removes message makes said each RB remove separately the corresponding LSP of this multicast tree root among the LSDB, and then generates the available multicast tree root newly-generated multicast routing table item of laying equal stress on according to the LSDB after removing.The corresponding LSP of said multicast tree root that this step generates when concrete the realization removes message can be the aging message of removing; The life span of removing message that just wears out is set to 0; Other RB receive life span when being 0 aging removing message, and the LSP that the tree root of multicast described in the LSDB is corresponding separately automatically removes.
In this step in the LSDB of this locality quick aging fall the corresponding LSP of former multicast tree root, and need not wait until certain ageing time, as 20 minutes in the agreement.And re-elect the multicast tree root, and generate effective multicast routing table item, can guarantee the normal forwarding of many purposes message.Wherein, the available multicast tree root that generates according to the LSDB that removes behind the corresponding LSP be for can reaching with self link, and as the highest RB of priority of multicast tree root.
Need to prove, not have strict ordinal relation between above-mentioned steps 203 and the step 204, promptly can first execution in step 203 execution in step 204 again, perhaps first execution in step 204 is execution in step 203 again.
This method further comprises:
Receive the corresponding LSP of said multicast tree root that other RB send when removing message; Confirm whether to exist among the local LSDB LSP of said multicast tree root correspondence; If the LSP that multicast tree root described in the local LSDB is corresponding removes, and generate an available multicast tree root according to the LSDB behind the corresponding LSP of removing; Use this available multicast tree root to generate the SPF tree, travel through this SPF tree and use said available multicast tree root generation and upgrade the multicast route table items; Otherwise, keep local multicast routing table item.
The embodiment of the invention is in above-mentioned steps 201; RB can utilize BFD (Bidirectional Forwarding Detection; Two-way forwarding detects) whether session detect self and self link that belongs between the multicast tree root of multicast tree and can reach; Certainly be not limited thereto in concrete the realization; Be useful on and carry out mode that connectivity of link detects all within protection scope of the present invention, as link being carried out fault detect etc. through ARP (Address Resolution Protocol, address resolution protocol).In the embodiment of the invention; Can also utilize route table items to carry out above-mentioned link detecting; RB is through confirming whether to exist in the local singlecast router list item singlecast router list item of the multicast tree root that self arrives said multicast tree; Judge whether the link between self and the said multicast tree root can reach, this moment, above-mentioned steps 201 specifically can may further comprise the steps:
Steps A, arbitrary said RB use self generates the SPF tree as the clean culture tree root, and travels through said SPF tree use self as clean culture tree root generation singlecast router list item.
Arbitrary node in the TRILL network, the state variation of link all possibly trigger the execution of steps A.Generate SPF tree and singlecast router list item in this steps A and realize, give unnecessary details no longer in detail here with existing.
Step B, said RB confirm whether to exist in the said singlecast router list item singlecast router list item of the multicast tree root that self arrives said multicast tree, if, execution in step C; Otherwise, execution in step D.
Whether RB described in this step searches to exist in the singlecast router list item that this locality generates and self confirms to the singlecast router list item of said multicast tree root whether self can reach to the link between the said multicast tree root; If because the link between said RB and the said multicast tree root when unreachable, can't calculate the singlecast router list item of said RB to said multicast tree root.
Step C, said RB confirm that the link between self and the said multicast tree root can reach.
When RB described in this step confirms that the link between self and the said multicast tree root can reach; This method further comprises: said RB uses said multicast tree root generation SPF tree, and travels through the said multicast tree root generation of the SPF tree use multicast routing table item that the said multicast tree root of said use generates.
Step D, said RB confirm that the link between self and the said multicast tree root is unreachable.
The embodiment of the invention when judging whether the multicast tree root can reach, the described judgement of singlecast router list item execution in step A ~ D that can directly generate based on this locality.Certainly, the embodiment of the invention also can at first be carried out above-mentioned steps A with renewal singlecast router list item when judging whether the multicast tree root can reach, and then the described judgement of execution in step B ~ D.Visible by last technical scheme; The embodiment of the invention need not increase under the situation of any mutual message; Through inspection, just can confirm apace whether current RB can reach with the link between the multicast tree root that self belongs to multicast tree to the singlecast router list item content that generates.
Referring to accompanying drawing, specify the present invention in conjunction with specific embodiment and how to realize what the multicast routing table item upgraded.
Referring to Fig. 3, Fig. 3 is the networking structure sketch map of TRILL network in the specific embodiment of the invention.Assumed by default is used multicast tree root of RB1 among Fig. 3, and link failure between RB1 and the RB2 detects with RB8 and self how to carry out the multicast routing table item to RB 1 link when unreachable and be updated to example.
When RB8 and RB1 link can reach; Generate the SPF tree and realize with existing with the multicast routing table item, when the linkdown between RB2 and the RB1, RB8 detects the path of self arriving RB 1 when unreachable; Generate the corresponding LSP of RB1 and remove message; Send to RB2, RB4, RB5, RB8, RB9, RB10, RB14, the RB15 that can reach, make each RB remove the corresponding LSP of RB1 in this locality, and select an available multicast tree root according to the LSP after removing with the RB8 link; Use this tree root to generate the SPF tree, and travel through the said available multicast tree root generation of this SPF tree use and upgrade the multicast route table items.
RB8 selects one to regenerate SPF tree and multicast routing table item as the highest RB of the priority of multicast tree root as available multicast tree root in the RB that can reach with its link.When between RB2 and the RB1 during linkdown, the RB that can reach with the RB8 link is RB2, RB4, RB5, RB8, RB9, RB10, RB14, RB15.Whose is the highest as the priority of multicast tree root in these RB; Whom selects as available multicast tree root; Suppose priority as the multicast tree root the highest be RB2, then use RB2 to generate the SPF tree, travel through this SPF tree and use RB2 to generate and upgrade the multicast route table items as available tree root.
When RB8 receives the message of the corresponding LSP of arbitrary RB sends among RB2, RB4, RB5, RB8, RB9, RB10, RB14, the RB15 removing RB1; Confirm whether to exist among the local LSDB LSP of RB 1 correspondence, if the LSP that RB1 among the local LSDB is corresponding removes; And according to the available multicast tree root of LSDB generation behind the corresponding LSP of removing; Like RB2, use RB2 generation SPF tree, travel through this SPF tree and use RB2 to generate and renewal multicast route table items; Otherwise, keep local multicast routing table item.
In the specific embodiment of the invention, when generating new multicast routing table item, compare, newly-generated multicast routing table item is issued on the chip more original multicast routing table item on the new chip with the multicast routing table item on the current chip.Concrete implementation realizes with existing, gives unnecessary details no longer in detail here.
Based on same inventive concept, also propose a kind of device in the specific embodiment of the invention, can be applicable in the TRILL network on the arbitrary RB in arbitrary multicast tree.Referring to Fig. 4, Fig. 4 is the structural representation that can be used for the device of multicast routing table item renewal.This device comprises: detecting unit 401, generation unit 402, removing unit 403 and processing unit 404.
Detecting unit 401, whether the link that is used for detecting between the multicast tree root of this RB and said multicast tree can reach.
Remove unit 403, be used for when generation unit 402 generates this multicast tree root link corresponding protocol Data Unit LSP removing message, the LSP that multicast tree root described in the link-local slip condition database LSDB is corresponding removes.
Preferably,
Said available multicast tree root be for can reaching with this RB link, and as the highest RB of priority of multicast tree root.
Preferably, this device further comprises: receiving element 405.
Receiving element 405 is used to receive the corresponding LSP removing message of said multicast tree root that other RB send.
Remove unit 403, be used for receiving the corresponding LSP of said multicast tree root that other RB send when removing message, the LSP removing that multicast tree root described in the local LSDB is corresponding when receiving element 405.
Preferably, this device further comprises: confirm unit 406.
Confirm unit 406, be used for confirming whether local LSDB exists the corresponding LSP of said multicast tree root when the corresponding LSP of said multicast tree root that other RB send removes message when receiving element 405 receives.
Remove unit 403, be used for when confirming that unit 406 confirms that there is the LSP of said multicast tree root correspondence in local LSDB, the LSP that multicast tree root described in the local LSDB is corresponding removes.
Detecting unit 401 is used for confirming whether local singlecast router list item exists the singlecast router list item of this RB to the multicast tree root of said multicast tree, if confirm that the link between this RB and the said multicast tree root can reach; Otherwise, confirm that the link between this RB and the said multicast tree root is unreachable.
The unit of the foregoing description can be integrated in one, and also can separate deployment; A unit can be merged into, also a plurality of subelements can be further split into.
In sum; RB removes the corresponding LSP of former multicast tree root fast, and generates an available multicast tree root according to the LSDB after removing detecting link between self and the multicast tree root when unreachable in the specific embodiment of the invention; Use this multicast tree root to generate SPF tree and multicast routing table item; When the link between current RB and multicast tree root is unreachable, can recomputate effective multicast routing table item fast, guarantee the normal forwarding of many purposes message.
The above is merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a multichain connects multicast routing table item update method in the transparent interconnected TRILL network, and arbitrary multicast tree comprises a plurality of routing bridge RB in the said TRILL network, it is characterized in that, said method comprises:
When arbitrary said RB detects link between the multicast tree root of self and said multicast tree and can reach, use said multicast tree root to generate SPF SPF tree, travel through said SPF tree and use said multicast tree root to generate and upgrade the multicast route table items;
Said RB detects link between the multicast tree root of self and said multicast tree when unreachable; Generate said multicast tree root link corresponding status protocol data cell LSP and remove message; And send to each RB that can reach with self link, said each RB is removed the corresponding LSP of this multicast tree root;
The LSP that said RB is corresponding with multicast tree root described in the link-local slip condition database LSDB removes; LSDB according to behind the corresponding LSP of removing generates an available multicast tree root; Use this available multicast tree root to generate the SPF tree, travel through this SPF tree and use said available multicast tree root generation and upgrade the multicast route table items.
2. method according to claim 1 is characterized in that,
Said available multicast tree root be for can reaching with self link, and as the highest RB of priority of multicast tree root.
3. according to the said method of claim 2, it is characterized in that said method further comprises:
Receive the corresponding LSP of said multicast tree root that other RB send when removing message; The LSP that multicast tree root described in the local LSDB is corresponding removes; And according to the available multicast tree root of LSDB generation behind the corresponding LSP of removing; Use this available multicast tree root to generate the SPF tree, travel through this SPF tree and use this available multicast tree root generation and upgrade the multicast route table items.
4. method according to claim 3 is characterized in that, the said corresponding LSP of said multicast tree root that receives other RB transmissions removes after the message, and before the said LSP that multicast tree root described in the local LSDB is corresponding removed, said method further comprised:
Confirm whether to exist among the local LSDB LSP of said multicast tree root correspondence, if carry out the said LSP that multicast tree root described in the local LSDB is corresponding and remove and subsequent step; Otherwise, keep local multicast routing table item.
5. according to the method described in any one of the claim 1-4, it is characterized in that said RB further detects self according to the following steps and whether can reach to the link between the multicast tree root of said multicast tree:
Said RB confirms whether to exist in the local singlecast router list item singlecast router list item of the multicast tree root that self arrives said multicast tree, if confirm that the link between self and the said multicast tree root can reach; Otherwise, confirm that the link between self and the said multicast tree root is unreachable.
6. a device can be applicable to multichain and meets the arbitrary routing bridge RB in arbitrary multicast tree in the transparent interconnected TRILL network, it is characterized in that said device comprises: detecting unit, generation unit, removing unit and processing unit;
Said detecting unit, whether the link that is used for detecting between the multicast tree root of this RB and said multicast tree can reach;
Said generation unit; Be used for when said detection is unreachable to link between the multicast tree root of this RB and said multicast tree; Generate this multicast tree root link corresponding protocol Data Unit LSP and remove message; And send to each RB that can reach with this RB link, said each RB is removed the corresponding LSP of this multicast tree root;
Said removing unit is used for when said generation unit generates this multicast tree root link corresponding protocol Data Unit LSP removing message, and the LSP that multicast tree root described in the link-local slip condition database LSDB is corresponding removes;
Said processing unit is used for using said multicast tree root to generate the SPF tree when said detection when link can reach between the multicast tree root of this RB and said multicast tree, travels through said SPF tree and uses said multicast tree root to generate and upgrade the multicast route table items; When the said removing unit LSP that multicast tree root described in the link-local slip condition database LSDB is corresponding removes; LSDB according to behind the corresponding LSP of removing generates an available multicast tree root; Use this available multicast tree root to generate the SPF tree, travel through this SPF tree and use said available multicast tree root generation and upgrade the multicast route table items.
7. device according to claim 6 is characterized in that,
Said available multicast tree root be for can reaching with this RB link, and as the highest RB of priority of multicast tree root.
8. according to the said device of claim 7, it is characterized in that said device further comprises: receiving element;
Said receiving element is used to receive the corresponding LSP removing message of said multicast tree root that other RB send;
Said removing unit is used for receiving the corresponding LSP of said multicast tree root that other RB send when removing message when said receiving element, and the LSP that multicast tree root described in the local LSDB is corresponding removes.
9. device according to claim 8 is characterized in that said device further comprises: confirm the unit;
Said definite unit is used for confirming whether local LSDB exists the corresponding LSP of said multicast tree root when said receiving element receives when the corresponding LSP of said multicast tree root that other RB send removes message;
Said removing unit is used for when said definite unit confirms that there is the LSP of said multicast tree root correspondence in local LSDB, and the LSP that multicast tree root described in the local LSDB is corresponding removes;
Said processing unit is used for when said definite unit confirms that there is not the LSP of said multicast tree root correspondence in local LSDB, keeping local multicast routing table item.
10. according to the device described in any one of the claim 6-9, it is characterized in that,
Said detecting unit is used for confirming whether local singlecast router list item exists the singlecast router list item of this RB to the multicast tree root of said multicast tree, if confirm that the link between this RB and the said multicast tree root can reach; Otherwise, confirm that the link between this RB and the said multicast tree root is unreachable.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210260905.3A CN102761493B (en) | 2012-07-26 | 2012-07-26 | Multicast routing item updating method and device of multilink transparent internet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210260905.3A CN102761493B (en) | 2012-07-26 | 2012-07-26 | Multicast routing item updating method and device of multilink transparent internet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102761493A true CN102761493A (en) | 2012-10-31 |
| CN102761493B CN102761493B (en) | 2015-04-08 |
Family
ID=47055819
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210260905.3A Active CN102761493B (en) | 2012-07-26 | 2012-07-26 | Multicast routing item updating method and device of multilink transparent internet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102761493B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946357A (en) * | 2012-11-28 | 2013-02-27 | 杭州华三通信技术有限公司 | Method and device for issuing multicast forwarding table items |
| CN103200049A (en) * | 2013-04-07 | 2013-07-10 | 杭州华三通信技术有限公司 | Failure detection method and failure detection device |
| CN103441928A (en) * | 2013-08-23 | 2013-12-11 | 杭州华三通信技术有限公司 | Method and device for rapidly handing over neighbor logical links |
| CN104113483A (en) * | 2013-04-19 | 2014-10-22 | 华为技术有限公司 | Multicast communication method and aggregation switch |
| CN104270315A (en) * | 2014-09-03 | 2015-01-07 | 武汉烽火网络有限责任公司 | Computing method and system for multicast distribution tree in TRILL (Transparent interconnection of Lots of Links) broadcast network |
| CN104283795A (en) * | 2014-10-11 | 2015-01-14 | 杭州华三通信技术有限公司 | Method and device for refreshing multicast table item |
| WO2016078342A1 (en) * | 2014-11-21 | 2016-05-26 | 中兴通讯股份有限公司 | Trill network distribution tree computation method and trill network node |
| CN109005121A (en) * | 2018-08-24 | 2018-12-14 | 新华三技术有限公司 | A kind of route computing method and device |
| CN110740086A (en) * | 2018-07-18 | 2020-01-31 | 中国电信股份有限公司 | Data multicast distribution tree switching method, system and device |
| CN111431763A (en) * | 2020-03-18 | 2020-07-17 | 紫光云技术有限公司 | Connectivity detection method for SDN controller |
| CN114531623A (en) * | 2020-10-31 | 2022-05-24 | 华为技术有限公司 | Information transmission method, device and network node |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1964313A (en) * | 2005-11-11 | 2007-05-16 | 华为技术有限公司 | A method to transmit signal of network element of leaf node at multicast tree in communication network |
| CN101155130A (en) * | 2006-09-30 | 2008-04-02 | 华为技术有限公司 | Method for learning MAC address and system and equipment for conveying VPLS client data |
-
2012
- 2012-07-26 CN CN201210260905.3A patent/CN102761493B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1964313A (en) * | 2005-11-11 | 2007-05-16 | 华为技术有限公司 | A method to transmit signal of network element of leaf node at multicast tree in communication network |
| CN101155130A (en) * | 2006-09-30 | 2008-04-02 | 华为技术有限公司 | Method for learning MAC address and system and equipment for conveying VPLS client data |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946357B (en) * | 2012-11-28 | 2015-07-08 | 杭州华三通信技术有限公司 | Method and device for issuing multicast forwarding table items |
| CN102946357A (en) * | 2012-11-28 | 2013-02-27 | 杭州华三通信技术有限公司 | Method and device for issuing multicast forwarding table items |
| CN103200049A (en) * | 2013-04-07 | 2013-07-10 | 杭州华三通信技术有限公司 | Failure detection method and failure detection device |
| CN103200049B (en) * | 2013-04-07 | 2016-05-04 | 杭州华三通信技术有限公司 | A kind of fault detection method and equipment |
| CN104113483A (en) * | 2013-04-19 | 2014-10-22 | 华为技术有限公司 | Multicast communication method and aggregation switch |
| WO2014169856A1 (en) * | 2013-04-19 | 2014-10-23 | 华为技术有限公司 | Multicast communication method and aggregation switch |
| CN104113483B (en) * | 2013-04-19 | 2017-06-20 | 华为技术有限公司 | A kind of method for multicast communication and convergence switch |
| CN103441928B (en) * | 2013-08-23 | 2017-02-15 | 杭州华三通信技术有限公司 | Method and device for rapidly handing over neighbor logical links |
| CN103441928A (en) * | 2013-08-23 | 2013-12-11 | 杭州华三通信技术有限公司 | Method and device for rapidly handing over neighbor logical links |
| CN104270315A (en) * | 2014-09-03 | 2015-01-07 | 武汉烽火网络有限责任公司 | Computing method and system for multicast distribution tree in TRILL (Transparent interconnection of Lots of Links) broadcast network |
| CN104270315B (en) * | 2014-09-03 | 2017-08-01 | 武汉烽火网络有限责任公司 | The computational methods and system of multicast distribution tree in TRILL radio networks |
| CN104283795A (en) * | 2014-10-11 | 2015-01-14 | 杭州华三通信技术有限公司 | Method and device for refreshing multicast table item |
| CN104283795B (en) * | 2014-10-11 | 2018-04-10 | 新华三技术有限公司 | A kind of multicast list brush new method and apparatus |
| CN105681204A (en) * | 2014-11-21 | 2016-06-15 | 中兴通讯股份有限公司 | Transparent interconnection of lots of links (TRILL) network distribution tree calculation method and TRILL network node |
| WO2016078342A1 (en) * | 2014-11-21 | 2016-05-26 | 中兴通讯股份有限公司 | Trill network distribution tree computation method and trill network node |
| CN110740086A (en) * | 2018-07-18 | 2020-01-31 | 中国电信股份有限公司 | Data multicast distribution tree switching method, system and device |
| CN110740086B (en) * | 2018-07-18 | 2021-09-03 | 中国电信股份有限公司 | Data multicast distribution tree switching method, system and device |
| CN109005121A (en) * | 2018-08-24 | 2018-12-14 | 新华三技术有限公司 | A kind of route computing method and device |
| CN109005121B (en) * | 2018-08-24 | 2021-06-29 | 新华三技术有限公司 | Route calculation method and device |
| CN111431763A (en) * | 2020-03-18 | 2020-07-17 | 紫光云技术有限公司 | Connectivity detection method for SDN controller |
| CN111431763B (en) * | 2020-03-18 | 2021-07-27 | 紫光云技术有限公司 | Connectivity detection method for SDN controller |
| CN114531623A (en) * | 2020-10-31 | 2022-05-24 | 华为技术有限公司 | Information transmission method, device and network node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102761493B (en) | 2015-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102761493B (en) | Multicast routing item updating method and device of multilink transparent internet | |
| US10574479B2 (en) | Bridging of non-capable subnetworks in bit indexed explicit replication | |
| US9698994B2 (en) | Loop detection and repair in a multicast tree | |
| US9176832B2 (en) | Providing a backup network topology without service disruption | |
| US20220272032A1 (en) | Malleable routing for data packets | |
| US9608900B2 (en) | Techniques for flooding optimization for link state protocols in a network topology | |
| CN103516612B (en) | Distribution router generates method and the distribution router of route table items | |
| CN101771604B (en) | Routing detection method, system and intermediate routing device | |
| US9722943B2 (en) | Seamless switching for multihop hybrid networks | |
| CN103428045A (en) | Connectivity detection method, device and system | |
| CN103152261B (en) | A kind of Link State Protocol Data Unit fragment message generates dissemination method and equipment | |
| CN103023773A (en) | Method, device and system for forwarding message in multi-topology network | |
| CN106713130B (en) | A kind of routing table update method, EVPN control equipment and EVPN system | |
| EP3229393A1 (en) | Error code information transfer method, network device and communication system | |
| CN102932255B (en) | Method and device for selecting tunnel path | |
| CN102780623B (en) | Multicast routing table item update method and device in a kind of multilink transparent internet | |
| CN103238300B (en) | The method and device that out-of-date route in the routing information storehouse of managing network element removes | |
| CN103152265A (en) | Message forwarding method and equipment in SPB (Shortest Path Bridge) network | |
| CN102857441B (en) | End system address is avoided to distribute the method and route-bridge of information protocol message storm | |
| CN111884827B (en) | Method for synchronizing topological information in SFC network and routing network element | |
| WO2015051709A1 (en) | Method and apparatus for controlling network traffic path | |
| CN102752175A (en) | Method and device for checking connectivity in TRILL (Transparent Interconnection of Lots of Links) network | |
| CN105337863A (en) | Label assigning method and device | |
| CN103973498A (en) | Main path and alternate path selecting method and device for multi-attribution network | |
| CN105515999B (en) | Quick convergence method and device for end system address distribution information protocol |
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 | ||
| CP03 | Change of name, title or address |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Patentee after: NEW H3C TECHNOLOGIES Co.,Ltd. Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base Patentee before: HANGZHOU H3C TECHNOLOGIES Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230615 Address after: 310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: H3C INFORMATION TECHNOLOGY Co.,Ltd. Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before: NEW H3C TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |