WO2018010568A1 - Procédé de notification d'informations et procédé et appareil de génération d'une entrée de transfert - Google Patents

Procédé de notification d'informations et procédé et appareil de génération d'une entrée de transfert Download PDF

Info

Publication number
WO2018010568A1
WO2018010568A1 PCT/CN2017/091620 CN2017091620W WO2018010568A1 WO 2018010568 A1 WO2018010568 A1 WO 2018010568A1 CN 2017091620 W CN2017091620 W CN 2017091620W WO 2018010568 A1 WO2018010568 A1 WO 2018010568A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
path
information
global
source node
Prior art date
Application number
PCT/CN2017/091620
Other languages
English (en)
Chinese (zh)
Inventor
廖婷
敖婷
司徒嘉
江丽莉
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018010568A1 publication Critical patent/WO2018010568A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks

Definitions

  • the present invention relates to the field of communications, and in particular to an information notification method, a method and apparatus for generating a forwarding entry.
  • multicast data communication plays an increasingly important role.
  • Interactive Internet (TV), Internet conference Net-Meeting, live broadcast, etc. all use multicast. technology.
  • the existing multicast technologies include Protocol Independent Multicast (PIM), Internet Control Message Protocol (IGMP), and Multicast Listener Discovery Protocol (MLD).
  • PIM Protocol Independent Multicast
  • IGMP Internet Control Message Protocol
  • MLD Multicast Listener Discovery Protocol
  • these existing protocols can meet the needs of users.
  • multicast applications become more widespread and networking forms become more complex, multicast is directly applied to the Internet.
  • the multicast state in the backbone network is too large, which occupies a large number of control resources and signaling interactions of the intermediate nodes, and cannot support the development of the virtual private network (VPN) technology that is widely used nowadays.
  • VPN virtual private network
  • the related technologies that can solve these problems include the Multicast Label Distribution Protocol (MLDP) technology and the Point-to-MultiPoint Traffic Engineering (P2MP TE) technology. Display of the Bit Indexed Explicit Replication (BIER) technology.
  • MLDP Multicast Label Distribution Protocol
  • P2MP TE Point-to-MultiPoint Traffic Engineering
  • BIER Bit Indexed Explicit Replication
  • the embodiments of the present invention provide a method for advertising information, a method for generating a forwarding entry, and a device, so as to at least solve the problem that the multicast function existing in the related technology is complicated.
  • a method for notifying information comprising: a source node determining a path from a source node to a boundary node and a global identification ID of the path; the source node information of the path and The global ID is advertised to the other nodes.
  • the source node notifying the information of the path and the global ID to other nodes includes: the source node advertising the information of the path and the global ID to the other by using an internal gateway protocol IGP node.
  • the method further includes: the source node generating, according to the information about the path and the global ID, a first forwarding entry corresponding to the global ID; the source node receiving a multicast stream; the source node Encapsulating the multicast stream according to the global ID; the source node sends the encapsulated multicast stream according to the outbound interface indicated by the first forwarding entry.
  • the information about the path includes at least one of: address information of each node on the path, and hierarchical information of each node on the path on the path, according to between nodes on the path.
  • the upstream and downstream node information of the respective nodes determined by the hierarchical information.
  • a method for generating a forwarding entry comprising: determining, by a first node other than the source node, a path from a source node to a boundary node Upstream and downstream node information and a global identifier ID of the path; the first node generates a second forwarding corresponding to the global ID of the first node according to the determined uplink and downlink node information and a global ID of the path entry.
  • determining, by the first node other than the source node on the path, the uplink and downlink node information of the first node includes: determining, by the first node, information about the path; A node determines uplink and downlink node information of the first node according to the information of the path.
  • the information that the first node determines the path of the path includes at least one of: the first node acquires information about the path advertised by the source node; and the first node is obtained according to a pre-acquisition The access information of each node on the path determines the information of the path.
  • the acquiring, by the first node, the information about the path advertised by the source node includes: receiving, by the first node, information about the path that is advertised by the source node by using an internal gateway protocol IGP.
  • the information about the path includes at least one of: address information of each node on the path, and hierarchical information of each node on the path on the path, according to between nodes on the path.
  • the upstream and downstream node information of the respective nodes determined by the hierarchical information.
  • the method further includes: the first node receives the encapsulation from the source node, and carries the global ID multicast stream; the first node sends the encapsulation according to the second forwarding entry. After the multicast stream.
  • the information about the second forwarding entry includes: a global ID of the path, a next hop out interface information of the first node, and/or inbound interface information.
  • an information notification device configured to be applied to a source node, comprising: a first determining module configured to determine a path from a source node to a boundary node and the path A global identification ID; an advertising module configured to advertise information of the path and the global ID to other nodes.
  • the device further includes: a first generating module, configured to generate a first forwarding entry corresponding to the global ID according to the information of the path and the global ID; and the first receiving module is configured to receive multicast And the encapsulating module is configured to encapsulate the multicast stream according to the global ID; the first sending module is configured to send the encapsulated multicast stream according to the outbound interface indicated by the first forwarding entry.
  • a first generating module configured to generate a first forwarding entry corresponding to the global ID according to the information of the path and the global ID
  • the first receiving module is configured to receive multicast
  • the encapsulating module is configured to encapsulate the multicast stream according to the global ID
  • the first sending module is configured to send the encapsulated multicast stream according to the outbound interface indicated by the first forwarding entry.
  • a device for generating a forwarding entry comprising: a second determination Module, set to determine the location The upstream and downstream node information of the first node and the global identifier ID of the path; the second generating module is configured to generate the first node according to the determined uplink and downlink node information and the global ID of the path The second forwarding entry corresponding to the global ID.
  • the second determining module includes: a first determining unit, configured to determine information of the path; and a second determining unit, configured to determine uplink and downlink node information of the first node according to information about the path .
  • the first determining unit includes at least one of: acquiring a subunit, configured to acquire information about the path advertised by the source node, and determining a subunit, configured to be based on the pre-acquired path
  • the access information of each node determines the information of the path.
  • the device further includes: a second receiving module, configured to receive the encapsulated multicast stream carrying the global ID from the source node; and the second sending module is configured to follow the second forwarding The entry sends the encapsulated multicast stream.
  • a second receiving module configured to receive the encapsulated multicast stream carrying the global ID from the source node
  • the second sending module is configured to follow the second forwarding The entry sends the encapsulated multicast stream.
  • a storage medium is also provided.
  • the storage medium is arranged to store program code for performing the above steps.
  • the source node can advertise the other node related node information on the path and the global ID of the path to other nodes, so that other nodes determine the forwarding entries on the path, thereby reducing the complexity of the multicast and effectively solving the correlation.
  • the multicast function that exists in the technology implements complex problems.
  • FIG. 1 is a flowchart of a method of announcing information according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a method for generating a forwarding entry according to an embodiment of the present invention
  • FIG. 3 is a schematic overall flow diagram of an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a network for multicast optimization in a distributed scenario according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a notification extension of a tree according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a forwarding entry according to an embodiment of the present invention.
  • FIG. 7 is a structural block diagram of an information notifying apparatus according to an embodiment of the present invention.
  • FIG. 8 is a structural block diagram of an advertisement module 74 in an information notification apparatus according to an embodiment of the present invention.
  • FIG. 9 is a block diagram showing a preferred structure of an information notifying apparatus according to an embodiment of the present invention.
  • FIG. 10 is a device for generating a forwarding entry according to an embodiment of the present invention.
  • FIG. 11 is a structural block diagram of a second determining module 102 in a generating device for forwarding an entry according to an embodiment of the present invention
  • FIG. 12 is a block diagram showing a preferred configuration of an apparatus for generating a forwarding entry according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of a method for advertising information according to an embodiment of the present invention. As shown in FIG. 1, the process includes the following steps:
  • Step S102 the source node determines a path from the source node to the boundary node and a global identifier ID of the path;
  • Step S104 the source node notifies the information of the path and the global ID to other nodes.
  • the foregoing boundary node may be a node that connects to the receiver, and the other nodes may be nodes other than the source node on the path, the path may be a forwarding path, and the path may be a tree-like forwarding path (also Can be referred to as a tree).
  • Each node on the path can obtain the access status of the multicast group member in the network through the Interior Gateway Protocol (IGP).
  • IGP Interior Gateway Protocol
  • the node accessed by the source can calculate the node.
  • a locally-based tree reaches the node to which all members in the multicast group are connected.
  • the global ID of the path may be assigned by the administrator to the source node, or the source node may obtain a certain acquisition mode. The obtained (for example, one ID is selected from a plurality of pre-configured IDs as the identifier of the path).
  • the source node can advertise other node related node information on the path and the global ID of the path to other nodes, so that other nodes determine forwarding entries (also referred to as forwarding paths or forwarding tables) on the path, thereby The complexity of the multicast is reduced, and the complex problem of the multicast function existing in the related technology is effectively solved.
  • the foregoing source node notifying the information of the path and the global ID to other nodes includes: the source node notifying the information of the path and the global ID to other nodes by using an internal gateway protocol IGP.
  • the source node may advertise the global ID of the path and the mapping information of the tree to each node in the network (corresponding to other nodes described above) through the IGP extension.
  • the tree in the mapping information is based on the multicast group address, and the source node of the advertisement is the default root.
  • the source node publishes the calculation information of the tree to all the nodes in the network through the extension of the IGP, and takes the root of the tree as the first layer of information, and sequentially releases the information of the 2nd, 3rd, ..., Nth layers on the tree. Information is given to all nodes.
  • Each node can determine who the local upstream node is and what downstream nodes are based on its own situation in the tree, forming a forwarding entry with a global ID to the tree with reverse path checking.
  • each of the foregoing nodes may also locally calculate the condition of the tree according to the location of the root of the tree and the network topology.
  • the method further includes: the source node generating, according to the information of the path and the global ID, a first forwarding entry corresponding to the global ID; the source node receiving the multicast stream; and the source node according to the global ID pair
  • the multicast stream is encapsulated; the source node sends the encapsulated multicast stream according to the outbound interface indicated by the first forwarding entry.
  • the global ID of the above path is used to encapsulate the data packet. After the data packet carries the global ID, it can be forwarded to all receivers according to the forwarding entry of the global ID.
  • the source node may extend the encapsulation carrying the ID to forward the message to all recipients.
  • the multicast stream may be encapsulated in the ingress node (corresponding to the source node) by using a Multi-Protocol Label Switching (MPLS) encapsulation.
  • MPLS Multi-Protocol Label Switching
  • the information about the path includes at least one of the following: address information of each node on the path, and hierarchical information of each node on the path on the path, determined according to hierarchical information between nodes on the path. of Upstream and downstream node information of each node.
  • the source node may advertise through the IGP when advertising the information of the path to other nodes.
  • the IGP includes an intermediate system to intermediate system ISIS and/or an open shortest path priority protocol OSPF.
  • the information of each forwarding entry may include: a global identifier ID of the path, a next hop interface information of the node, and/or an inbound interface information.
  • FIG. 2 is a flowchart of a method for generating a forwarding entry according to an embodiment of the present invention. As shown in FIG. 2, the process includes the following steps:
  • Step S202 the first node other than the source node on the path from the source node to the boundary node determines uplink and downlink node information of the first node and a global identifier ID of the path;
  • Step S204 The first node generates a second forwarding entry corresponding to the global ID of the first node according to the determined uplink and downlink node information and the global ID of the path.
  • the foregoing boundary node may be a node that connects to the receiver, and the path may be a forwarding path, and the path may be a tree-like forwarding path (also referred to as a tree for short).
  • the second forwarding entry described above is used by the first node for data forwarding.
  • the source node can advertise the other node related node information on the path and the global ID of the path to other nodes, so that other nodes determine the forwarding entries on the path, thereby reducing the complexity of the multicast and effectively solving the related
  • the multicast function that exists in the technology implements complex problems.
  • the first node other than the source node on the path determines the uplink and downlink node information of the first node, where the first node determines information about the path, and the first node determines information according to the path. Determine the upstream and downstream node information of the first node.
  • the information about the path determined by the first node includes at least one of the following: the first node acquires information about the path advertised by the source node; and the first node receives the connection of each node on the path according to the pre-acquisition. The information enters the information of the path.
  • the information of the path may be advertised by the source node, or may be obtained by the first node itself.
  • the obtaining, by the first node, the information of the path advertised by the source node includes: receiving, by the first node, information of a path advertised by the source node by using an internal gateway protocol IGP.
  • IGP may include at least one of: an intermediate system to an intermediate system ISIS and/or an open shortest path first protocol OSPF.
  • the information about the path includes at least one of the following: address information of each node on the path, and hierarchical information of each node on the path on the path, according to a level between nodes on the path.
  • address information of each node on the path includes at least one of the following: address information of each node on the path, and hierarchical information of each node on the path on the path, according to a level between nodes on the path.
  • the upstream and downstream node information of each node determined by the information.
  • the first node other than the source node on the path determines the global ID of the path, and the first node receives the global ID of the path advertised by the source node through the internal gateway protocol IGP.
  • the foregoing IGP may include at least one of: an intermediate system to an intermediate system ISIS and/or an open shortest path first protocol OSPF.
  • the method further includes: the first node receiving the encapsulated carrier from the source node
  • the global ID multicast stream is obtained.
  • the encapsulated multicast stream is obtained by the source node encapsulating the multicast stream according to the global ID.
  • the first node sends the encapsulated multicast stream according to the second forwarding entry.
  • the information of the second forwarding entry includes: a global ID of the path, a next hop out interface information of the first node, and/or inbound interface information.
  • FIG. 3 is a schematic diagram of an overall process according to an embodiment of the present invention. As shown in FIG. 3, the method includes the following steps:
  • Step S302 the multicast source node assigns a global ID to the multicast group (or the global ID is assigned by the administrator);
  • Step S304 The multicast source node sends mapping information of the multicast group and the global ID to other nodes in the network.
  • Step S306 the other node calculates a multicast tree by using the node that sends the mapping information as a root, thereby obtaining the information of the upstream and downstream nodes locally in the tree, or the multicast source node calculates one to all by itself.
  • Step S308 the other nodes form a forwarding entry local to the global ID according to the obtained upstream and downstream node information of the tree.
  • Embodiment 1 Extension of ISIS implementation
  • the receivers associated with source 1 and Receiver 1* (eg, Receiver 13, Receiver 15, and Receiver 17 in FIG. 4) are joined to multicast group G1, source 2 and Receiver 2* (eg, Receiver 24 in FIG. 4).
  • Receiver26, Receiver27, Receiver28 related receivers are joined to the multicast group G2, R1 is connected to the source 1, R2 is connected to the source 2, then R1 calculates a tree for the relevant members of the multicast group G1 Tree 1, the result is Tree1 ⁇ R1(1)R10(2)R3(3)R12(3)R7(4)R5(4) ⁇ ; where (n) represents the first few nodes on the tree, which in turn identifies each The layer branches to the boundary node, where there is no node of layer 4 behind R3(3), indicating that there is direct access to the receiver; R7(4) and R5(4) are both followed by R12(3), indicating that it is at R12 There are also two branches on it.
  • R2 calculates a tree Tree 2 for the relevant member of the multicast group G2, and the calculation result is Tree2 ⁇ R2(1)R12(2)R11(3)R4(4)R7(3)R8(3)R6(3) ⁇ Where R4(4) indicates the branch following R11(3), and R11(3) and R7(3) and R8(3) and R6(3) are both branches on R12(2):
  • the source node (or administrator) assigns a globally unique ID1 and ID2 to Tree1 and Tree2 respectively, which may be labels Label1 and Label2, or may exist in other field lengths;
  • R1 maps the assigned Tree1 (G1 multicast group address identifier) and ID1 to other nodes in the network through ISIS extension, and the mapping of Tree2 (G2 multicast group address identifier) and ID2 to which R2 will be assigned. Send to other nodes in the network through ISIS extensions;
  • R1 will report the calculated Tree1 result to other nodes through the extension of ISIS.
  • the coverage information includes: Tree1 ⁇ R1(1)R10(2)R3(3)R12(3)R7(4)R5(4) ⁇ , R2 will report the calculated Tree2 result to other nodes through the extension of ISIS.
  • the coverage information includes: Tree2 ⁇ R2(1)R12(2)R11(3)R4(4)R7(3)R8(3)R6 (3) ⁇ ;
  • the optional notification format is shown in Figure 5, where the type (TYPE) indicates that it is an advertisement of the tree information, and the identifier value can be set to indicate the length of the ID value of the advertisement and the node address field can be indicated.
  • the length, and the length length field indicates that the layer carried by the message is set (8 bits are reserved in the example, and different sets indicate different levels, such as all 0s indicate the first layer, and 00000001 indicates the second layer.
  • Etc. and the following node address (which can be an ip address, v4 or v6 or label or other length, as indicated by the set in the identity value).
  • Step 2 can be selected when the IGP extension advertises the tree information. You can also choose not to announce the notice.)
  • All nodes receive the information of the calculated tree advertised by R1 and R2.
  • R10 it knows that it is in tree 1, the upstream node is R1, and the downstream node is R3 and R12, so in R10
  • the inbound interface of the reverse path check table is set to R1
  • the forwarding outbound interface table is R3 and R12.
  • R12 it knows that its position in tree 1 is layer 3, and the upstream node is R10, the downstream nodes are R5 and R7, and the inbound interface of the reverse path check table for the global ID1 is R10, and the forwarding interface table is R5 and R7; at the same time, R12 knows that the position of the tree 2 is the second layer.
  • the upstream node is R2
  • the downstream node is R11, R7, R8, and R6.
  • the inbound interface of the reverse path check table for the global ID2 is R2
  • the forwarding outbound interface table is R11, R7, R8, and R6, and the logical table entries are forwarded. As shown in Figure 6;
  • R1 sends the packet header of the multicast stream to carry the ID1 as the destination for forwarding.
  • ID is a label
  • the MPLS encapsulation header is used.
  • Each node sequentially forwards to each recipient according to the formed forwarding entries.
  • Embodiment 2 OSPF extended implementation
  • the source 1 and Receiver 1* related receivers are joined to the multicast group G1, the source 2 and Receiver 2* related receivers are joined to the multicast group G2, and the R1 is connected to the source 1.
  • R2 is connected to source 2, then R1 calculates a tree Tree1 for the relevant member of multicast group G1.
  • the result is Tree1 ⁇ R1(1)R10(2)R3(3)R12(3)R7(4) R5(4) ⁇ ; where (n) represents the first few nodes on the tree, which in turn identifies each layer branch to the boundary node, where R3(3) does not have a layer 4 node, indicating that there is direct receiver access on it.
  • Both R7(4) and R5(4) are followed by R12(3), indicating that there are two branches on R12.
  • R2 calculates a tree Tree 2 for the relevant member of the multicast group G2, and the calculation result is Tree2 ⁇ R2(1)R12(2)R11(3)R4(4)R7(3)R8(3)R6(3) ⁇ Where R4(4) indicates the branch following R11(3), and R11(3) and R7(3) and R8(3) and R6(3) are both branches on R12(2):
  • the source node (or administrator) assigns a globally unique ID1 and ID2 to Tree1 and Tree2 respectively, which may be labels Label1 and Label2, or may exist in other field lengths;
  • R1 maps the assigned Tree1 (G1 multicast group address identifier) and ID1 to other nodes in the network through OSPF extension, and the mapping of Tree2 (G2 multicast group address identifier) and ID2 to which R2 will be assigned. Sending to other nodes in the network through OSPF extension;
  • R1 advertises the calculated Tree1 result to other nodes through OSPF extension.
  • the coverage information includes: Tree1 ⁇ R1(1)R10(2)R3(3)R12(3)R7(4)R5(4) ⁇
  • R2 will report the calculated Tree2 result to other nodes through OSPF extension
  • the coverage information includes: Tree2 ⁇ R2(1)R12(2)R11(3)R4(4)R7(3)R8(3)R6 (3) ⁇
  • the optional notification format is shown in Figure 5, where the type indicates that it is an advertisement of the tree information, and the identifier value can be set to indicate the length of the ID value of the advertisement and the length of the node address field.
  • the length length field indicates that the layer carried by the message is set (8 bits are reserved in the example, and different sets indicate different levels, such as all 0s indicating the first layer, 00000001 indicating the second layer, etc.) and The following node address (which can be an ip address, v4 or v6 or label or other length, can be indicated by a set in the identity value). (When the IGP extension advertises the information of the tree, step 2 can choose to advertise or not to advertise)
  • All nodes receive the information of the calculated tree advertised by R1 and R2.
  • R10 it knows that it is in tree 1, the upstream node is R1, and the downstream node is R3 and R12, so in R10
  • the inbound interface of the reverse path check table is set to R1
  • the forwarding outbound interface table is R3 and R12.
  • R12 it knows that its position in tree 1 is layer 3, and the upstream node is R10, the downstream nodes are R5 and R7, and the inbound interface of the reverse path check table for the global ID1 is R10, and the forwarding interface table is R5 and R7; at the same time, R12 knows that the position of the tree 2 is the second layer.
  • the upstream node is R2
  • the downstream node is R11, R7, R8, and R6.
  • the inbound interface of the reverse path check table for the global ID2 is R2
  • the forwarding outbound interface table is R11, R7, R8, and R6, and the logical table entries are forwarded. As shown in Figure 6;
  • R1 sends the packet header of the multicast stream to carry the ID1 as the destination for forwarding.
  • ID is a label
  • the MPLS encapsulation header is used.
  • Each node sequentially forwards to each recipient according to the formed forwarding entries.
  • Embodiment 3 Process processing of each node in the network using the source node as the root to calculate the tree
  • the receivers associated with Source 1 and Receiver 1* are added to the multicast group G1.
  • the receivers associated with Source 2 and Receiver 2* are added to the multicast group G2.
  • the routers on the access side are obtained.
  • the local multicast group joins or registers the multicast group. Through the flooding of the IGP, the local multicast group access is flooded to each node in the network.
  • the R1 is connected to the source 1, and the R2 is connected.
  • the source node (or the administrator) allocates a globally unique ID1 and ID2 to the multicast group to which the source 1 and the source 2 are added.
  • the ID can be Label1 and Label2, or other field lengths. presence;
  • R1 sends the assigned mapping of the multicast group address identifier of G1 and ID1 to other nodes in the network through IGP extension
  • R2 sends the mapping of the assigned multicast group address identifier of G2 and ID2 to the network through IGP extension.
  • each node After receiving the mapping information advertised by R1, all nodes calculate a tree 1 that reaches all receivers by using R1 as the root. When the network topology is stable, the calculation is based on the shortest path. In the case of selecting the next hop address size, the information of the tree 1 calculated by all nodes under the same calculation condition and condition is Tree1 ⁇ R1(1)R10(2)R3(3)R12(3) R7(4)R5(4) ⁇ , according to the calculated information of the tree, each node can know the details of the upstream node and the downstream node in the tree to form a forwarding entry;
  • R1 sends the packet header of the multicast stream to carry the ID1 as the destination for forwarding.
  • ID is a label
  • the MPLS encapsulation header is used.
  • Each node sequentially forwards to each recipient according to the formed forwarding entries.
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, CD-ROM, including a number of instructions to make a terminal device (can be a mobile phone, a computer, The server, or network device, etc.) performs the methods described in various embodiments of the present invention.
  • an information notification device and a forwarding entry generating device are also provided, and the device is used to implement the above-mentioned embodiments and preferred embodiments, and the description thereof has been omitted.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • FIG. 7 is a structural block diagram of an information notifying apparatus according to an embodiment of the present invention.
  • the apparatus may be applied to a source node.
  • the apparatus includes a first determining module 72 and an advertising module 74. Be explained:
  • a first determining module 72 configured to determine a path from the source node to the border node and a global identifier ID of the path; the notification module 74 is coupled to the first determining module 72, configured to use the information according to the path and the global ID Notify to other nodes.
  • FIG. 8 is a structural block diagram of an advertising module 74 in an information notifying apparatus according to an embodiment of the present invention.
  • the advertising module 74 includes an advertising unit 82, which is described below:
  • the notification unit 82 is configured to notify the information of the path and the global ID to other nodes by using the internal gateway protocol IGP.
  • FIG. 9 is a block diagram showing a preferred structure of an information notification apparatus according to an embodiment of the present invention. As shown in FIG. 9, the apparatus includes a first generation module 92 and a first receiving module 94 in addition to all the modules shown in FIG.
  • the encapsulation module 96 and the first transmission module 98 are described below:
  • the first generating module 92 is connected to the first determining module 72, configured to generate a first forwarding entry corresponding to the global ID according to the information of the path and the global ID; and the first receiving module 94 is connected to the first The generating module 92 is configured to receive the multicast stream, and the encapsulating module 96 is connected to the first receiving module 94 for encapsulating the multicast stream according to the global ID.
  • the first sending module 98 is connected to the encapsulating module 96. The encapsulated multicast stream is sent according to the outbound interface indicated by the first forwarding entry.
  • the information about the path includes at least one of the following: address information of each node on the path, hierarchical information of each node on the path on the path, and hierarchical information between nodes according to the path. Determine the upstream and downstream node information of each node.
  • the device 10 is a device for generating a forwarding entry, which may be applied to a first node other than a source node on a path from a source node to a border node, as shown in FIG. 10, the device includes a second, according to an embodiment of the present invention.
  • the determining module 102 and the second generating module 104 are described below:
  • the second determining module 102 is configured to determine the upstream and downstream node information of the first node and the global identifier ID of the path.
  • the second generating module 104 is connected to the second determining module 102, and configured to use the determined information about the upstream and downstream nodes.
  • the global ID of the path generates a second forwarding entry corresponding to the global ID of the first node.
  • FIG. 11 is a structural block diagram of a second determining module 102 in a generating device for forwarding an entry according to an embodiment of the present invention.
  • the second determining module 102 includes a first determining unit 112 and a second determining unit 114.
  • the second determination module 102 is described as follows:
  • the first determining unit 112 is configured to determine the information of the path
  • the second determining unit 114 is connected to the first determining unit 112, and configured to determine uplink and downlink node information of the first node according to the information of the path.
  • the foregoing first determining unit 112 includes: an obtaining subunit, configured to acquire the source section The information of the path of the point advertisement; and/or the determining subunit, configured to determine the information of the path according to the access information of each node on the path acquired in advance.
  • the obtaining subunit is configured to obtain information about a path advertised by the source node by receiving information of a path advertised by the source node through the internal gateway protocol IGP.
  • the information about the path includes at least one of the following: address information of each node on the path, hierarchical information of each node on the path on the path, and hierarchical information between nodes according to the path. Determine the upstream and downstream node information of each node.
  • the second determining module 102 may determine the global identifier ID of the path by receiving the global ID of the path advertised by the source node.
  • the foregoing second determining module 102 may receive the global identifier ID of the path advertised by the source node by receiving the global ID of the path advertised by the source node through the internal gateway protocol IGP.
  • FIG. 12 is a block diagram showing a preferred structure of a device for generating a forwarding entry according to an embodiment of the present invention. As shown in FIG. 12, the device includes a second receiving module 122 and a second transmitting module in addition to all the modules shown in FIG. 124, the device is described below:
  • the second receiving module 122 is connected to the second generating module 104, and configured to receive the encapsulated multicast stream carrying the global ID from the source node, and the second sending module 124 is connected to the second receiving module 122.
  • the encapsulated multicast stream is sent according to the second forwarding entry.
  • the information of the second forwarding entry includes: a global ID of the path, a next hop out interface information of the first node, and/or inbound interface information.
  • each of the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination.
  • the forms are located in different processors.
  • Embodiments of the present invention also provide a storage medium.
  • the above storage medium may be set to store program code for performing the above steps.
  • the foregoing storage medium may include, but is not limited to, a USB flash drive, a Read-Only Memory (ROM), and a Random Access Memory (RAM).
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • the processor performs the above steps according to the stored program code in the storage medium.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the present disclosure is applicable to the field of communications, and is used to reduce the complexity of multicast, and effectively solve the problem of complex implementation of multicast functions existing in related technologies.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé de notification d'informations et un procédé et un appareil pour générer une entrée de transfert, le procédé comprenant : la détermination, par un nœud source, d'un chemin depuis le nœud source vers un nœud limite et un ID d'identifiant global du chemin; et la notification, par le nœud source, aux autres nœuds, d'informations concernant le chemin et l'ID global. La présente invention permet de résoudre efficacement le problème de l'état de la technique selon lequel il est compliqué de mettre en œuvre une fonction de multidiffusion.
PCT/CN2017/091620 2016-07-11 2017-07-04 Procédé de notification d'informations et procédé et appareil de génération d'une entrée de transfert WO2018010568A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610546599.8A CN107612835A (zh) 2016-07-11 2016-07-11 信息的通告方法、转发条目的生成方法及装置
CN201610546599.8 2016-07-11

Publications (1)

Publication Number Publication Date
WO2018010568A1 true WO2018010568A1 (fr) 2018-01-18

Family

ID=60952789

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/091620 WO2018010568A1 (fr) 2016-07-11 2017-07-04 Procédé de notification d'informations et procédé et appareil de génération d'une entrée de transfert

Country Status (2)

Country Link
CN (1) CN107612835A (fr)
WO (1) WO2018010568A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111181855B (zh) * 2018-11-13 2021-06-04 北京华为数字技术有限公司 一种组播的方法及路由设备
CN112565076A (zh) * 2019-09-10 2021-03-26 中国电信股份有限公司 基于isis协议的关键路径信息转发方法、装置和系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101631073A (zh) * 2009-07-28 2010-01-20 北京交通大学 一种外部网关协议的多路径建立和转发的方法
US20130343176A1 (en) * 2012-06-26 2013-12-26 Cisco Technology, Inc. System And Method For Protection Against Edge Node Failure
CN104717143A (zh) * 2015-03-12 2015-06-17 华为技术有限公司 用于多归场景组播数据传输的方法及设备
CN106656781A (zh) * 2015-11-02 2017-05-10 中兴通讯股份有限公司 一种报文传输的方法、装置和系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101631073A (zh) * 2009-07-28 2010-01-20 北京交通大学 一种外部网关协议的多路径建立和转发的方法
US20130343176A1 (en) * 2012-06-26 2013-12-26 Cisco Technology, Inc. System And Method For Protection Against Edge Node Failure
CN104717143A (zh) * 2015-03-12 2015-06-17 华为技术有限公司 用于多归场景组播数据传输的方法及设备
CN106656781A (zh) * 2015-11-02 2017-05-10 中兴通讯股份有限公司 一种报文传输的方法、装置和系统

Also Published As

Publication number Publication date
CN107612835A (zh) 2018-01-19

Similar Documents

Publication Publication Date Title
US7804790B1 (en) Aggregate multicast trees for virtual private local area network (LAN) service multicast
US8339973B1 (en) Multicast traceroute over MPLS/BGP IP multicast VPN
WO2018072704A1 (fr) Procédé et appareil de transmission de messages, nœud et support de stockage informatique
CN106656794B (zh) 一种报文传输方法及装置
CN102035729B (zh) 一种组播数据转发方法
US8638787B2 (en) Multicast hello on demand
US20160006614A1 (en) Source Routing Using Path Computation Elements
WO2021196717A1 (fr) Procédé et appareil de transmission de trafic de multidiffusion, nœud de communication et support de stockage
US9325605B2 (en) On-demand boot strap router source announcements
CN102148745B (zh) 提高虚拟专用局域网业务网络转发效率的方法和系统
CN107612809A (zh) 一种组播表项同步方法以及设备
WO2018214809A1 (fr) Procédé et dispositif de transmission de message, et support de stockage
US10225091B2 (en) Method for implementing point-to-multipoint multicast, network node, and system
WO2017177756A1 (fr) Procédé, appareil et système permettant de transmettre des informations
WO2018010658A1 (fr) Procédé et appareil de transfert d'informations dans la réplication explicite indexée par bit
US20140241351A1 (en) Dynamic determination of the root node of an mldp tunnel
CN102571375B (zh) 组播转发方法、装置及网络设备
WO2013139270A1 (fr) Procédé, dispositif et système pour implémenter un réseau privé virtuel en couche 3
US9100201B1 (en) Inter-site PIM-dense mode and PIM-BSR support for MPLS/BGP IP VPNs
CN103973459A (zh) IPv6组播孤岛间的组播报文的传输方法及装置
WO2018010566A1 (fr) Procédé de notification d'informations, procédé et dispositif de génération d'éléments de transfert
CN106357541B (zh) 一种信息传递方法和装置
WO2018010568A1 (fr) Procédé de notification d'informations et procédé et appareil de génération d'une entrée de transfert
CN106817308A (zh) 一种组播流的转发系统、方法及装置
CN106230730B (zh) 一种组播传输方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17826905

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17826905

Country of ref document: EP

Kind code of ref document: A1