Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Forwarding entry deletion method and root node

A technology for forwarding table items and root nodes, applied in the field of communication, can solve problems such as occupying a lot of network resources, and achieve the effect of fast deletion

Active Publication Date: 2012-06-20
HUAWEI TECH CO LTD
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When there are many participants in the video conference on the network, or there are many video conferences held, there will be more forwarding entries in the invalid multicast tree of the entire network, and these invalid forwarding entries will occupy more network resources.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Forwarding entry deletion method and root node
  • Forwarding entry deletion method and root node
  • Forwarding entry deletion method and root node

Examples

Experimental program
Comparison scheme
Effect test

no. 2 example

[0039] figure 2 Shown is a schematic diagram of the multicast tree in the second embodiment.

[0040] exist figure 2 Among them, the root node of the multicast tree is router 1 (R1), and R1 is a source designated router (DR); router 2 (R2) is the first-level downstream multicast neighbor node of R1; router 3 (R3) is the The second-level downstream multicast neighbor node; router 4 (R4) is the third-level downstream multicast neighbor node of R1, and R4 is also a rendezvous node (RP); router R5 is the fourth-level downstream multicast neighbor node of R1, and R5 is a user End Designated Router (DR), which is the terminal leaf node of the multicast tree. The multicast tree includes R1, R2, R3, R4 and R5.

[0041] When R1 detects that the multicast traffic of the multicast tree is disconnected, it sends a first multicast tree disconnection message to R2 according to the forwarding entry of the multicast tree on R1.

[0042] After sending the first multicast tree disconnecti...

no. 3 example

[0052] In this embodiment, the structure of the multicast tree is the same as that in the second embodiment figure 2 The structures of the multicast trees shown are the same, that is, the root node of the multicast tree is router 1 (R1), and R1 is a source designated router (DR); router 2 (R2) is the first-level downstream multicast neighbor node of R1 ;Router 3 (R3) is the second-level downstream multicast neighbor node of R1; router 4 (R4) is the third-level downstream multicast neighbor node of R1, and R4 is also a rendezvous node (RP); router 5 (R5) is R 1 The four-level downstream multicast neighbor node of R5, R5 is a designated router (DR) at the user end, and is the terminal leaf node of the multicast tree. The multicast tree includes R1, R2, R3, R4 and R5.

[0053] The processing method in this embodiment is as follows.

[0054] When R1 detects that the multicast traffic of the multicast tree is disconnected, it sends a first multicast tree disconnection message to...

no. 4 example

[0064] image 3 It is a schematic diagram of a multicast tree according to Embodiment 4 of the present invention.

[0065] exist image 3 Among them, the root node of the multicast tree is router 1 (R1), and R1 is a source designated router (DR); router 2 (R2) is the rendezvous node (RP) of the multicast tree, and the RP is not in the On the forwarding path of the multicast tree; router 3 (R3) is the first-level downstream multicast neighbor node of R1; router 4 (R4) and router 5 (R5) are the second-level downstream multicast neighbor nodes of R1, and R4 and R5 are The two client designated routers (DRs) are the end leaf nodes of the multicast tree. The multicast tree includes R1, R3, R4, R5 and RP.

[0066] The processing method in this embodiment is as follows.

[0067] When R1 detects that the multicast traffic of the multicast tree is disconnected, it sends an RP multicast tree disconnection message to the RP, that is, R2. In addition, R1 also sends the first multicas...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a forwarding entry deletion method and a root node. The method comprises the following steps: a root node of a multicast tree sends first multicast tree cutoff messages to part of or all nodes in primary downstream multicast neighbor nodes of the root node respectively after detecting cutoff of the multicast flow, so as to enable the primary downstream multicast neighbor nodes receiving the first multicast tree cutoff messages to delete the forwarding entries of the multicast tree maintained by the primary downstream multicast neighbor nodes per se; and the root node deletes the forwarding entries of the multicast tree maintained by the root node per se after detecting cutoff of the multicast flow. The invention has the advantage that as the root node deletes the forwarding entries of the multicast tree maintained by the root node per se, and part of or all nodes in the primary downstream multicast neighbor nodes of the root node delete the forwarding entries of the multicast tree maintained by the primary downstream multicast neighbor nodes per se, a plurality of multicast entries on the multicast tree are quickly deleted based on a notification mechanism.

Description

technical field [0001] The present invention relates to the field of communications, in particular to a method for deleting a forwarding entry and a root node Background technique [0002] Internet Protocol (IP) multicasting is the use of a protocol to transmit IP packets from one source to multiple destinations, sending a copy of the message to a set of addresses to all recipients who want to receive it. IP multicast is the "best effort" transmission of IP data packets to a set of hosts forming a multicast group, and each member of the group can be distributed on each independent physical network. The relationship between members in an IP multicast group is dynamic. The host can join and exit the group at any time. The membership of the group determines whether the host receives the multicast data packets sent to the group. Hosts that are not members of a certain group It is also possible to send multicast packets to the group. Multimedia conferencing is a relatively new ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/56H04L12/18H04L45/16H04L45/74
Inventor 宋俊骏秦玉涂聪郑岩丁汉成
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com