[go: up one dir, main page]

CN101814997A - Method for reinforcing multicasting survivability - Google Patents

Method for reinforcing multicasting survivability Download PDF

Info

Publication number
CN101814997A
CN101814997A CN 201010133683 CN201010133683A CN101814997A CN 101814997 A CN101814997 A CN 101814997A CN 201010133683 CN201010133683 CN 201010133683 CN 201010133683 A CN201010133683 A CN 201010133683A CN 101814997 A CN101814997 A CN 101814997A
Authority
CN
China
Prior art keywords
node
multicast
tree sequence
source
multicasting
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
Application number
CN 201010133683
Other languages
Chinese (zh)
Other versions
CN101814997B (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.)
Electronic Science And Technology Of Sichuan Foundation For Education Development, University of
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201010133683XA priority Critical patent/CN101814997B/en
Publication of CN101814997A publication Critical patent/CN101814997A/en
Application granted granted Critical
Publication of CN101814997B publication Critical patent/CN101814997B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method for reinforcing multicasting survivability. The method comprises the following steps that: a backup path is recorded when an extension information source tree sequence is generated; when the path is damaged, if the backup path is available, the backup path is used without re-calculating the routes of all nodes, the multicasting can be restored in the shortest time, and the multicasting survivability is reinforced; nodes taking part in the multicasting send query formation to downstream adjacent nodes at time intervals T, if the downstream adjacent nodes are available, the fault information is reported to the multicasting source node by the upstream adjacent nodes of the downstream adjacent nodes of the nodes taking part in the multicasting, so that the path damage information can be found in a much shorter time, and compared with the fault-finding method in the prior art, the method of the invention is shorter in network fault-finding time; and finally, even if the backup path is not available or the damaged path cannot be restored by the use of the backup path, because in the method the multicasting tree sequence is obtained according to the extension information source tree sequence, the amount of calculation and the network restoration time are much lower than those of the conventional multicasting network, and the multicasting survivability is also reinforced.

Description

A kind of method that strengthens multicasting survivability
Technical field
The present invention relates to a kind of technical field of multicast, specifically, relate to a kind of method that strengthens multicasting survivability.
Background technology
Multicasting technology is meant realizes that between sender and each recipient point-to-point configuration connects.If a sender transmits identical data for simultaneously a plurality of recipients, also only need duplicate a identical data packet, improved data-transmission efficiency like this, reduce backbone network and congested possibility occurred.Because multicast can effectively reduce network and main frame expense, than clean culture and broadcasting its unique superiority is arranged, therefore, multicast has obtained using widely, main as real-time video conferencing system, teleeducation system, remote demonstration system and video on-demand system (VOD) or the like.
According to the distribution of multicast member in the network, generally speaking multicast routing protocol can be divided into following two kinds of fundamental types.First kind of hypothesis multicast member is distributed in the network thick and fast, that is to say, the most subnet of network all comprises a multicast member at least, and the network bandwidth is enough big, this being known as " dense mode " (Dense-Mode), this pattern-dependent " pushes away " routers all in network in the technology of flooding with data.The dense mode Routing Protocol comprises DVMRP, MOSPF and PIM-DM agreement etc.Second type be sparse mode, and its hypothesis multicast member is sparse dispersion in network, and network can not provide enough transmission bandwidths.So the sparse mode multicast routing protocol must depend on the technology with routing capability and set up and keep multicast tree.Sparse mode protocol mainly contains PIM-SM and CBT agreement.
Each above-mentioned multicast routing protocol all has its excellent, the shortcoming and scope of application separately.Multicast router is in actual applications realized multiple multicast routing protocol simultaneously in order to support various application widely, and this greatly increases the expense of multicast router on software and hardware.
Along with going deep into to network multicast research, industry is generally recognized and is only relied on the standard multicast business model can't support all multicast application well, and a large amount of foreseeable multicast application are application that source node is determined, have proposed to adopt the model of single source multicast service thus.The SSM architecture that IETF proposes promptly is based on single source multicast thought.This business model has following advantage: the restriction scheme that provides multicast to insert; Routing Protocol is realized simplifying; The management of multicast group does not need the group address administrative mechanism of whole network by source node management and coordination.
In recent years, some have also occurred above-mentioned several multicast routing protocols have been carried out improved research work.For example M λ T agreement and QoSMIC agreement all are the research to the multicast routing protocol of supporting QoS.And RALM agreement and TRAM agreement then are in order to realize reliable multicast.In addition, along with the continuous development of wireless network, multicast path is by also having obtained certain development in field of wireless.
But these technology all are based on the datagram structure, therefore can not solve safe, resist and ruin and problem such as guarantee service quality.Traditional multicast is almost not too many research aspect survivability, more is to rely on unicast technique.Traditional multicast is when link failure occurring, and all nodes all will recomputate route, and amount of calculation is big, and convergence time is long, and multicasting survivability is poor.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, a kind of method that strengthens multicasting survivability is provided.
For achieving the above object, the present invention strengthens the method for multicasting survivability, it is characterized in that, may further comprise the steps:
(1), initialization participates in all nodes of multicast, the multicast source node calculates extension information source tree sequence, has comprised backup path in the extension information source tree sequence;
(2), the multicast source node obtains the multicast tree sequence according to extension information source tree sequence;
(3), the multicast source node sends multicast packet according to the multicast tree sequence to multicast member;
(4), the node of participating in multicast sends inquiry message every the time T downstream neighbor, sees down whether adjacent trip node exists, if step (3) is then returned in existence, if there is no, then this node breaks down;
(5) if certain node failure, the upstream neighbor node of this node is to multicast source node report fault message, if when having backup path to use, source node is directly enabled backup path and is sent multicast packet to multicast member;
(6) can't not repair the damage path if there is backup path can use or enable backup path, source node recomputates extension information source tree sequence, calculate the multicast tree sequence according to new extension information source tree sequence, source node continues to send data to multicast member according to new multicast tree sequence.
Goal of the invention of the present invention is achieved in that
The present invention is directed to multicasting technology and proposed the new anti-technology of ruining, at first when generating extension information source tree sequence, write down backup path, break down at a certain node like this, if the path has backup path to enable backup path when damaging, and need not recomputate the route of all nodes, multicast can recover in the shortest time, has strengthened multicasting survivability.Next node that participates in multicast sends inquiry message every the time T downstream neighbor, see whether downstream neighbor exists, if there is no, then this node breaks down, the path is damaged, and the upstream neighbor node of passing through this node can be found path damage information like this to multicast source node report fault message in very short time, compare with the discovery network failure of prior art, find that than legacy network the time of fault is shorter.And inquiry message only transmits between multicast node, can not increase offered load.At last, backup path can be used or enable even without backup path and the situation of damaging the path can't be repaired, because, the present invention adopts according to extension information source tree sequence and obtains the multicast tree sequence, the time of amount of calculation and reparation network all is significantly less than existing multicast network, and the survivability of multicast also is enhanced.
Description of drawings
Fig. 1 is a kind of specific implementation method flow chart of method that the present invention strengthens multicasting survivability;
Fig. 2 is a kind of concrete computational methods that multicast source node shown in Figure 1 calculates extension information source tree sequence;
Fig. 3 is the schematic diagram that is obtained the multicast tree sequence by extension information source tree sequence;
Fig. 4 is the form of the inquiry message that regularly sends to its downstream neighbor of the node of participating in multicast.
Embodiment
Below in conjunction with accompanying drawing the specific embodiment of the present invention is described, so that those skilled in the art understands the present invention better.What need point out especially is that in the following description, when perhaps the detailed description of known function and design can desalinate main contents of the present invention, these were described in here and will be left in the basket.
Embodiment
Fig. 1 is a kind of specific implementation method flow chart of method that the present invention strengthens multicasting survivability.
As shown in Figure 1, the present invention's method of strengthening multicasting survivability may further comprise the steps:
Step ST1: initialization participates in all nodes of multicast, and the multicast source node calculates extension information source tree sequence, has comprised backup path in the extension information source tree sequence;
Step ST2: the multicast source node obtains the multicast tree sequence according to extension information source tree sequence;
Step ST3: the multicast source node sends multicast packet according to the multicast tree sequence;
Step ST401: the node of participating in multicast sends inquiry message every the time T downstream neighbor, sees whether downstream neighbor exists; Step ST402: if exist, then return step ST3, if there is no, then this node breaks down;
Step ST501: if certain node failure, the upstream neighbor node of this node is to multicast source node report fault message; Step ST502: judged whether backup path; Step ST503: if when having backup path to use, source node is directly enabled backup path, step ST504: judge whether to start successfully, if enable, then return step ST3: send multicast packet;
Step ST6: can't not repair the damage path if there is backup path can use or enable backup path, source node recomputates extension information source tree sequence, calculate the multicast tree sequence according to new extension information source tree sequence, then return step ST3: source node continues to send data according to new multicast tree sequence to multicast member.
In the present embodiment, participate in the node of multicast, send inquiry message every time T to its downstream neighbor, its downstream neighbor receives that back answer upstream neighbor node shows that the path can reach, and downstream neighbor exists; If the overtime answer message of not receiving of upstream neighbor node, then upstream neighbor node thinks that downstream neighbor does not exist, and the path that arrives this downstream neighbor is damaged.
Upstream neighbor node is reported fault message to source node, after source node is received fault message, by checking that the multicast sequence sees if there is the multicast member that backup path can arrive the malfunctioning node influence, then enable backup path if any the backup path existence, if not having backup path can use, then source node begins the reconstruct multicast tree, promptly recomputate extension information source tree sequence, calculate the multicast tree sequence according to new extension information source tree sequence, source node continues multicast for all multicast members after finding best reachable path.
In the present embodiment, if a plurality of node failure is repaired from the near fault of source node earlier, repair again from source node fault far away.
Fig. 2 is a kind of concrete computational methods schematic diagram that multicast source node shown in Figure 1 calculates extension information source tree sequence.
In the present embodiment, the computational methods of extension information source tree sequence, as shown in Figure 2, each node is represented a router, and each node is represented a router among the figure, and for example: node 0 is represented router 0, and node 1 is represented router one.
For the ease of storage and application, we are the sequence of each node and left and right sides bracket with the information source tree representation, and the information source that is expanded is set sequence, and extension information source is set sequence replacement routing table.1), get source node v in the present embodiment, a kind of concrete computational methods of calculating extension information source tree sequence are: s(the v of branch s, v 1... v m); 2), if branches greater than 0, with each child node v of branch iSubstitute (v with its branch i, v 1... v n); 3), the branch of all child nodes is repeated 2), be 0 up to the branches that obtains child node, promptly all become leaf node, finish the information source that is expanded tree sequence; At last to all backup path (v i, v j), at the v of extension information source tree sequence iThe side's of adding left bracket before the node is at v jThe side's of adding right parenthesis behind the node, backup path just is included in the extension information source tree sequence like this.
As Fig. 2,5 paths that two same weights are arranged from node 2 to node, one is that 5, one of node 2-node 4-nodes are node 2-node 5, conventional router is in the process that generates routing table, 2 of nodes can write down an optimal path, in the present invention, and two optimal paths of router records, wherein one is labeled as backup path, in the present embodiment, node 2-node 5 is a backup path, v sWhen generating extended source information source tree at V 2Preceding mark left square bracket is at V 5The right-hand bracket of back mark.
In the present embodiment, the middle extension information source tree sequence that obtains Fig. 1 according to top method is: V 0(V 1([V 2V 3(V 4V 5] V 6))) ([V 7(V 8V 9]) V 10V 11)) V 12, the sequence in its bracket is represented the component source tree.
By this sequence, can conveniently find out optimal path and multicast tree.Compare with routing table, the storage volume that information source tree sequence is occupied is little, only slightly many than the space that stores each node address summation, be about half of routing table, when considering mask, be about 1/4th of routing table, but but comprised much more important information than routing table, i.e. intermediate node information, and need not the information source tree further transformed and form routing table.Because memory space reduces greatly, solved the problem that routing table constantly expands, accelerated the speed of data forwarding, so this method makes multicast have good expandability, can be applied on the large-scale network.Traditional router only keeps source node, next-hop node and the destination node of each bar optimal path, and all the other intermediate nodes then are dropped.And the information of these intermediate nodes is very useful, especially under the situation of route self-healing recovery.The basis of new routing infrastructure has strengthened route self-healing recovery ability owing to stored intermediate node information.
Fig. 3 is the schematic diagram that is obtained the multicast tree sequence by extension information source tree sequence.
In the present embodiment, it is as follows to obtain the method for multicast tree sequence by extension information source tree sequence: from multicast source node V SScan extension information source tree sequence to last one purpose node, by the following method the content of selecting put into the multicast tree sequence:
A. put into multicast source node V earlier S, put into first left bracket and the postjunction thereof that run into again;
B. whenever to a right parenthesis, the content of just having put into is taken out; Just put into to left bracket and postjunction thereof whenever,, put into up to the purpose node that runs into;
C. after this put into the right parenthesis that runs into,, put into up to left bracket that runs into and postjunction thereof;
D. repeat b. and c. and run into last purpose node, put into up to b.; After this put into the adjacent right parenthesis that runs into, finish.
In the present embodiment, as shown in Figure 3, node 0 is the multicast source node, and multicast member is node 5 and node 11, according to said method, from extension information source tree sequence: V 0(V 1([V 2V 3(V 4V 5] V 6))) ([V 7(V 8V 9]) V 10V 11)) V 12Obtain multicast tree sequence: V 0(V 1(V 2(V 4V 5)) (V 7V 11))
Fig. 4 is the form of the inquiry message that regularly sends to its downstream neighbor of the node of participating in multicast.In the present embodiment, Router ID is the ID of upstream neighbor node, Interval is the time interval that sends inquiry message, this time interval can stipulate voluntarily according to the type of network, RouterDeadInterval is the out-of-service time, also do not receive the message of downstream node loopback then think that downstream neighbor lost efficacy that Neighbor is the ID of downstream node if surpass the out-of-service time upstream neighbor node.
Although above the illustrative embodiment of the present invention is described; so that the technical staff of present technique neck understands the present invention; but should be clear; the invention is not restricted to the scope of embodiment; to those skilled in the art; as long as various variations appended claim limit and the spirit and scope of the present invention determined in, these variations are conspicuous, all utilize innovation and creation that the present invention conceives all at the row of protection.

Claims (4)

1.一种增强组播抗毁性的方法，其特征在于，包括以下步骤：1. A method for enhancing multicast invulnerability, comprising the following steps: (1)、初始化参与组播的所有节点，组播源节点计算扩展信源树序列，扩展信源树序列中包含了备份路径；(1), initialize all nodes participating in the multicast, the multicast source node calculates the extended source tree sequence, and the extended source tree sequence includes a backup path; (2)、组播源节点根据扩展信源树序列得到组播树序列；(2), the multicast source node obtains the multicast tree sequence according to the extended source tree sequence; (3)、组播源节点根据组播树序列向组播成员发送组播数据；(3), the multicast source node sends multicast data to the multicast members according to the multicast tree sequence; (4)、参加组播的节点每隔时间T向下游相邻节点发送询问报文，看下相邻游节点是否存在，如果存在，则返回步骤(3)，如果不存在，则该节点出现故障。(4), the node participating in the multicast sends an inquiry message to the downstream adjacent node every time T to see if the adjacent downstream node exists, if it exists, return to step (3), if it does not exist, the node appears Fault. (5)、如果某节点故障，该节点的上游相邻节点向组播源节点报告故障信息，如果有备份路径可以使用时，源节点直接启用备份路径向组播成员发送组播数据；(5), if a certain node fails, the upstream adjacent node of this node reports failure information to the multicast source node, if there is a backup path to use, the source node directly enables the backup path to send multicast data to the multicast members; (6)、如果没有备份路径可以使用或启用备份路径还不能修复损坏路径，源节点重新计算扩展信源树序列，根据新的扩展信源树序列计算组播树序列，源节点根据新的组播树序列继续向组播成员发送数据。(6), if there is no backup path to use or enable the backup path and the damaged path cannot be repaired, the source node recalculates the extended source tree sequence, calculates the multicast tree sequence according to the new extended source tree sequence, and the source node calculates the multicast tree sequence according to the new group The treecast sequence continues to send data to the multicast members. 2.根据权利要求1所述的增强组播抗毁性的方法，其特征在于，所述的组播源节点计算扩展信源树序列为：2. the method for enhancing multicast invulnerability according to claim 1, is characterized in that, described multicast source node calculates and expands the source tree sequence and is: 1)、取源节点vs的分支(vs，v1，......vm)；2)、若分支数大于0，将分支的各个子节点vi用其分支替代(vi，v1，......vn)；3)、对所有的子节点的分支重复2)，直到得到子节点的分支数为0，即都成为叶节点，结束，得到扩展信源树序列；最后对所有的备用路径(vi，vj)，在扩展信源树序列的vi节点前加方左括号，在vj节点后加方右括号，这样备份路径就包含在扩展信源树序列中，并将扩展信源树序列取代路由表。1), take the branch of the source node v s (v s , v 1 , ... v m ); 2), if the number of branches is greater than 0, replace each child node v i of the branch with its branch (v i , v 1 ,...v n ); 3), repeat 2) for all sub-node branches, until the number of sub-node branches is 0, that is, they all become leaf nodes, end, and get the extended information source tree sequence; finally, for all backup paths (v i , v j ), add square left brackets before the v i node of the extended source tree sequence, and add square right brackets after the v j node, so that the backup path is included in In the extended source tree sequence, the extended source tree sequence replaces the routing table. 3.根据权利要求2所述的增强组播抗毁性的方法，其特征在于，所述的根据扩展信源树序列得到组播树序列为：3. the method for enhancing multicast invulnerability according to claim 2, is characterized in that, the multicast tree sequence obtained according to the extended source tree sequence is: 从组播源节点VS到最后一个的目的结点扫瞄扩展信源树序列，按以下方法将选择的内容放入组播树序列中：Scan the extended source tree sequence from the multicast source node V S to the last destination node, and put the selected content into the multicast tree sequence in the following way: a.先放入组播源节点VS，再放入遇到的第一个左括号及其后结点；a. Put the multicast source node V S first, and then put the first left parenthesis and subsequent nodes encountered; b.每遇到一个右括号，将刚放入的内容取出；每遇到左括号及其后结点就放入，直到遇到的目的结点，放入；b. Every time a right bracket is encountered, take out the content just put in; every time a left bracket and the following node are encountered, put it in until the destination node is encountered, and put it in; c.此后放入遇到的右括号，直到遇到的左括号及其后结点，放入；c. After that, put the right parenthesis encountered, until the left parenthesis and the node after it, put it in; d.重复b.和c.直到b.遇到最后一个目的结点，放入；此后放入遇到的相邻右括号，结束。d. Repeat b. and c. until b. encounters the last destination node, put in; then put in the adjacent right brackets encountered, end. 4.根据权利要求1所述的增强组播抗毁性的方法，其特征在于，所述的询问报文包括：上游相邻节点的ID、发送询问报文的时间间隔、失效时间、下游相邻节点的ID；4. The method for enhancing multicast invulnerability according to claim 1, wherein the inquiry message includes: the ID of the upstream adjacent node, the time interval for sending the inquiry message, the failure time, the downstream relative The ID of the neighbor node; 如果发送询问报文的时间间隔超过失效时间上游相邻节点还未收到下游相邻节点回送的报文则认为下游相邻节点不存在，该节点出现故障。If the time interval for sending inquiry messages exceeds the failure time, the upstream adjacent node has not received the message sent back by the downstream adjacent node, then it is considered that the downstream adjacent node does not exist, and the node is faulty.
CN201010133683XA 2010-03-26 2010-03-26 A Method of Enhancing Multicast Invulnerability Expired - Fee Related CN101814997B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010133683XA CN101814997B (en) 2010-03-26 2010-03-26 A Method of Enhancing Multicast Invulnerability

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010133683XA CN101814997B (en) 2010-03-26 2010-03-26 A Method of Enhancing Multicast Invulnerability

Publications (2)

Publication Number Publication Date
CN101814997A true CN101814997A (en) 2010-08-25
CN101814997B CN101814997B (en) 2011-10-05

Family

ID=42622123

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010133683XA Expired - Fee Related CN101814997B (en) 2010-03-26 2010-03-26 A Method of Enhancing Multicast Invulnerability

Country Status (1)

Country Link
CN (1) CN101814997B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105610708A (en) * 2014-10-31 2016-05-25 杭州华三通信技术有限公司 Method for realizing multicast FRR in TRILL network and RB equipment
CN105656721A (en) * 2016-01-29 2016-06-08 国家电网公司 Method and device for determining invulnerability entropy of electric power communication network

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070177525A1 (en) * 2006-02-02 2007-08-02 Ijsbrand Wijnands Root node redundancy for multipoint-to-multipoint transport trees
CN101072241A (en) * 2006-05-11 2007-11-14 华为技术有限公司 Method and device for improving shortest path bridge reliability
CN101394330A (en) * 2008-10-20 2009-03-25 电子科技大学 A Subtree Self-protection Method of VPN Multicast Tree
CN101552715A (en) * 2008-03-31 2009-10-07 华为技术有限公司 Method, node and system for establishing backup label switching path
CN101588361A (en) * 2009-06-19 2009-11-25 电子科技大学 A Method of Enhancing Multicast Security

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070177525A1 (en) * 2006-02-02 2007-08-02 Ijsbrand Wijnands Root node redundancy for multipoint-to-multipoint transport trees
CN101072241A (en) * 2006-05-11 2007-11-14 华为技术有限公司 Method and device for improving shortest path bridge reliability
CN101552715A (en) * 2008-03-31 2009-10-07 华为技术有限公司 Method, node and system for establishing backup label switching path
CN101394330A (en) * 2008-10-20 2009-03-25 电子科技大学 A Subtree Self-protection Method of VPN Multicast Tree
CN101588361A (en) * 2009-06-19 2009-11-25 电子科技大学 A Method of Enhancing Multicast Security

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105610708A (en) * 2014-10-31 2016-05-25 杭州华三通信技术有限公司 Method for realizing multicast FRR in TRILL network and RB equipment
US10523468B2 (en) 2014-10-31 2019-12-31 Hewlett Packard Enterprise Development Lp Traffic forwarding
CN105656721A (en) * 2016-01-29 2016-06-08 国家电网公司 Method and device for determining invulnerability entropy of electric power communication network

Also Published As

Publication number Publication date
CN101814997B (en) 2011-10-05

Similar Documents

Publication Publication Date Title
CN103067286B (en) A kind of muticast data transmission method and apparatus
US7304955B2 (en) Scalable IP multicast with efficient forwarding cache
US7522596B2 (en) Enhanced DVMRP for destination-based forwarding of multicast data
CN106470162B (en) A kind of method of multicasting and device of service message
CN101552715B (en) Method and node for establishing backup label switching path
CN109150580B (en) Protocol Independent Multicast Join Entropy
CN104038417A (en) Service Instance Applied To Mpls Networks
CN104378296A (en) Message forwarding method and device
US20120294193A1 (en) Method and System for Increasing Forwarding Efficiency of Virtual Private LAN Service Network
CN102316014B (en) Load sharing method and router under hierarchical virtual dedicated local area network service environment
CN104901893A (en) Method and device for protecting multicast traffic
CN104539545B (en) Method for forwarding multicast message and equipment in TRILL network
CN101814997B (en) A Method of Enhancing Multicast Invulnerability
CN101237343A (en) Method and fast switching system for fast switching in case of failure
US7899928B1 (en) Efficient multicast packet handling in a layer 2 network
US9313037B2 (en) Method, apparatus and system for forwarding data under protocol independent multicast dual join
CN108616380A (en) Tree network recovery method of software defined network and controller
CN101388788B (en) Double layer multicast management method, system and double layer switch
CN101729348A (en) Method and system for protecting point to multi-point ring
Cheuk et al. Island multicast: The combination of IP multicast with application-level multicast
Papan et al. Utilization of PIM-DM in IP fast reroute
Chakeres et al. Connecting MANET multicast
CN102882794A (en) Method for optimizing ethernet multicast data transmission
Papán et al. The new PIM-SM IPFRR mechanism
Papan et al. Multicast in IP Fast Reroute

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Owner name: WUXI UEST SCIENCE + TECHNOLOGY DEVELOPMENT CO., LT

Free format text: FORMER OWNER: UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA

Effective date: 20131029

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 611731 CHENGDU, SICHUAN PROVINCE TO: 214135 WUXI, JIANGSU PROVINCE

TR01 Transfer of patent right

Effective date of registration: 20131029

Address after: 214135 Jiangsu New District of Wuxi City Branch Park University Chinese sensor network science and Technology Park building A room 402 business district

Patentee after: WUXI UESTC TECHNOLOGY DEVELOPMENT Co.,Ltd.

Address before: 611731 Chengdu province high tech West West source Avenue, No. 2006

Patentee before: University of Electronic Science and Technology of China

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20210107

Address after: No.2006 Xiyuan Avenue, Chengdu, Sichuan 611731

Patentee after: University of Electronic Science and technology of Sichuan foundation for education development

Address before: Room 402, area a, Liye building, science and Technology Park, China sensor network university, Taike Park, New District, Wuxi City, Jiangsu Province, 214135

Patentee before: WUXI UESTC TECHNOLOGY DEVELOPMENT Co.,Ltd.

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20111005

CF01 Termination of patent right due to non-payment of annual fee