WO2025189751A1 - 信息通告方法、通信装置及存储介质 - Google Patents

信息通告方法、通信装置及存储介质

Info

Publication number
WO2025189751A1
WO2025189751A1 PCT/CN2024/125329 CN2024125329W WO2025189751A1 WO 2025189751 A1 WO2025189751 A1 WO 2025189751A1 CN 2024125329 W CN2024125329 W CN 2024125329W WO 2025189751 A1 WO2025189751 A1 WO 2025189751A1
Authority
WO
WIPO (PCT)
Prior art keywords
multicast
node
virtual topology
network
announcement message
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.)
Pending
Application number
PCT/CN2024/125329
Other languages
English (en)
French (fr)
Inventor
张征
徐本崇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of WO2025189751A1 publication Critical patent/WO2025189751A1/zh
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/50—Address allocation
    • H04L61/5069—Address allocation for group communication, multicast communication or broadcast communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation

Definitions

  • the present disclosure relates to the field of communications, and in particular to an information notification method, a communication device, and a storage medium.
  • Multicast technology which enables multicast communication within a network, plays a crucial role in the modern Internet. For example, interactive personality TV (IPTV), network conferencing (Net-Meeting), and live sports broadcasts all utilize multicast technology. Protocol independent multicast (PIM) is currently the most widely deployed multicast technology.
  • an embodiment of the present disclosure provides an information notification method, applied to a first node.
  • the information notification method includes:
  • a multicast announcement message is sent to the second node; the multicast announcement message is used to announce multicast group information; and the multicast announcement message includes a virtual topology identifier.
  • an embodiment of the present disclosure provides an information notification device.
  • the information notification device includes: a sending module;
  • the sending module is used to send a multicast announcement message to the second node; the multicast announcement message is used to announce multicast group information; the multicast announcement message includes a virtual topology identifier.
  • an embodiment of the present disclosure provides a communication device comprising: a memory and a processor; the memory and the processor are coupled; the memory is configured to store a computer program; and the processor implements the information notification method described above when executing the computer program.
  • an embodiment of the present disclosure provides a computer-readable storage medium having computer program instructions stored thereon, which implement the information notification method of the above aspect when executed by a processor.
  • an embodiment of the present disclosure provides a computer program product, which includes computer program instructions, and when the computer program instructions are executed by a processor, the information notification method of the above aspect is implemented.
  • FIG1 is a schematic diagram of a communication system according to some embodiments.
  • FIG2 is a schematic diagram of a multicast network architecture according to some embodiments.
  • FIG3 is a flowchart of an information notification method according to some embodiments.
  • FIG4 is a schematic diagram of multicast notification information according to some embodiments.
  • FIG5 is a schematic diagram of another method of multicasting announcement information according to some embodiments.
  • FIG6 is a schematic diagram of a sub-TLV according to some embodiments.
  • FIG7 is a flowchart of another information notification method according to some embodiments.
  • FIG8 is a flowchart of yet another information notification method according to some embodiments.
  • FIG9 is a schematic diagram of another multicast network architecture according to some embodiments.
  • FIG10 is a schematic diagram of another multicast network architecture according to some embodiments.
  • FIG11 is a schematic structural diagram of an information notification device according to some embodiments.
  • FIG12 is a schematic structural diagram of a communication device according to some embodiments.
  • first and second are used for descriptive purposes only and should not be understood to indicate or imply relative importance or implicitly specify the number of technical features indicated. Therefore, a feature defined as “first”, “second”, etc. may explicitly or implicitly include one or more of the features.
  • A/B can mean A or B.
  • And/or herein is simply a description of an association relationship between associated objects, indicating that three possible relationships exist.
  • a and/or B can mean: only A, only B, and A and B.
  • at least one means one or more, and "a plurality” means two or more.
  • Multicast is a network communication paradigm that involves sending data packets on a best-effort basis to a defined subset of nodes in the network, called a multicast group.
  • the basic concept of multicast technology is that the multicast source sends only one copy of the data, with the destination address being the multicast group address. All receivers in the multicast group receive the same copy of the data, and only nodes within the multicast group (the destination nodes) can receive the data; other nodes in the network cannot.
  • Multicast group addresses are identified by Class D addresses (224.0.0.0-239.255.255.255).
  • PIM is a protocol used for multicast forwarding on routers. Its implementation relies on the interoperability of unicast routes within the network, meaning that the multicast network must first establish a unicast routing table.
  • the PIM protocol constructs a multicast routing table, which includes four items: the multicast source (multicast source IP address), the multicast group (multicast group IP address), the multicast upstream interface, and the multicast downstream interface. Using this multicast routing table, network nodes or routers can determine the upstream (incoming) and downstream (outgoing) interfaces for multicast traffic originating from the multicast source.
  • a network slice refers to a logical network customized to different service requirements on top of a physical or virtual network infrastructure.
  • Network slicing technology allows operators to provide multiple virtual topologies on the same network infrastructure, each of which can be used to serve specific services or users.
  • Each network slice can have different logical topologies, reliability, service levels, etc. to meet the diverse needs of different industries and customers.
  • a network slice can be a complete end-to-end network that includes terminals, access networks, transport networks, core networks, and application servers, thereby providing complete communication services.
  • a network slice has certain network capabilities; a network slice can also be any combination of the above-mentioned terminals, access networks, transport networks, core networks, and application servers.
  • a network slice may have one or more of the following characteristics: The access network may or may not be sliced. The access network may be shared by multiple network slices. The characteristics of different network slices and the network functions that make them up may be different.
  • the embodiments of the present disclosure can be applied to various wireless communication systems, such as: global system of mobile communication (GSM), code division multiple access (CDMA) system, wide band code division multiple access (WCDMA) system, general packet radio service (GPRS), long term evolution (LTE) system, LIE-A (advanced long term evolution) system, Universal Mobile Telecommunications System (UMTS), 5G, Beyond Fifth Generation (B5G), 6th Generation (6G) systems, etc.
  • GSM global system of mobile communication
  • CDMA code division multiple access
  • WCDMA wide band code division multiple access
  • GPRS general packet radio service
  • LTE long term evolution
  • LIE-A advanced long term evolution
  • Universal Mobile Telecommunications System Universal Mobile Telecommunications System
  • 5G Fifth Generation
  • B5G 6th Generation
  • the embodiments of the present disclosure can be applied to various wired communication systems, fixed networks, bearer networks, base station backhaul networks, etc., and the embodiments of the present disclosure are not limited thereto.
  • the embodiments of the present disclosure can be applied to multicast networks.
  • multicast protocols such as Internet Group Management Protocol (IGMP), multicast, and PIM.
  • IGMP Internet Group Management Protocol
  • PIM Packet Management Protocol
  • the embodiments of the present disclosure are primarily applicable to PIM, they can also be applied to other related network scenarios, which are not limited to these scenarios.
  • IGMP Internet Group Management Protocol
  • PIM Packet Management Protocol
  • some of the technologies of the present disclosure are further explained using a multicast network application scenario as an example.
  • Figure 1 is a schematic diagram of a communication system provided by an embodiment of the present disclosure.
  • the communication system includes a first node 110, a second node 120, and a third node 130.
  • the second node 120 and the third node 130 are respectively in communication connection with the first node 110.
  • the first node 110 , the second node 120 , and the third node 130 may be one or more, and the embodiments of the present disclosure do not limit the number.
  • the first node 110 is configured to send a multicast announcement message to the second node 120.
  • the multicast announcement message is used to announce a multicast group message and a multicast source message.
  • the multicast group message may be a multicast group address
  • the multicast source message may be a multicast source address.
  • a multicast announcement message may include at least one (*, G) entry or (S, G) entry for announcing a multicast group message and a multicast source message.
  • * represents a wildcard, i.e., does not specify a multicast source address;
  • S represents a multicast source address;
  • G represents a multicast group address.
  • the multicast announcement message includes a virtual topology identifier, which may identify a virtual topology applicable to the multicast group.
  • the first node 110 may further determine a next-hop node of the first node 110 in the forwarding path of the multicast group based on the virtual topology identifier. For example, the first node 110 may determine a routing table corresponding to the virtual topology (the routing table typically stores the virtual topology) based on the virtual topology identifier, and determine the next-hop node of the first node 110 based on the path table.
  • next-hop node of the first node 110 mentioned in the embodiment of the present disclosure refers to the next-hop node in the direction of the first node 110 to the multicast source of the multicast group. That is to say, the next-hop node of the first node 110 can be regarded as the upstream node of the first node 110 in the forwarding path of the multicast group.
  • the second node 120 is configured to receive the multicast announcement message sent by the first node 110 .
  • the third node 130 is configured to send a multicast notification message to the first node 110.
  • the third node 130 may send the multicast notification message to the first node 110 by flooding.
  • FIG2 is a schematic diagram of a multicast network architecture.
  • the multicast network architecture includes a first multicast source 210, a second multicast source 220, a first multicast receiving terminal 230, a second multicast receiving terminal 240, a third multicast receiving terminal 250, and multiple network nodes (e.g., a first network node R1, a second network node R2, a third network node R3, a fourth network node R4, a fifth network node R5, a sixth network node R6, and a seventh network node R7).
  • the first network node R1 is a node directly connected to the first multicast source 210 and the second multicast source 220, respectively.
  • the sixth network node R6 is a node directly connected to the first multicast receiving terminal 230 and the second multicast receiving terminal 240, respectively.
  • the seventh network node R7 is a node directly connected to the third multicast receiving terminal 250.
  • the sixth network node R6 and the seventh network node R7 connected to multiple multicast receiving terminals learn from the multicast receiving terminals that they need to receive the multicast announcement information of the first multicast source 210 and receive the multicast traffic. Based on the shortest path in the physical topology, network node R7 can determine that its next hop to the first multicast source 210 is the fourth network node R4. At this point, the sixth network node R6 and the seventh network node R7 send a PIM join message to the fourth network node R4.
  • the fourth network node R4 then sends a join message to the first network node R1 based on the shortest path in the physical topology, thereby establishing a multicast forwarding path from the first network node R1 to the fourth network node R4, and then to the sixth network node R6 and the seventh network node R7.
  • the aforementioned forwarding paths established based on the shortest path in the physical topology may cause overloads on the link between the first network node R1 and the fourth network node R4, or between the fourth network node R4 and the sixth network node R6/the seventh network node R7, due to excessive multicast traffic transmitted within the multicast group. This can lead to multicast packet loss, significantly impacting the user experience. It can be seen that some technologies that establish forwarding paths based on the shortest path in the physical topology cannot establish multicast forwarding paths based on a specific topology. They may ignore the characteristics of the actual network topology, resulting in inefficient multicast data transmission and even causing network congestion and overload.
  • Network slicing is a new technology that has emerged in recent years. It can provide multiple virtual/logical networks on the same network infrastructure. Therefore, it is worth considering combining PIM with network slicing. Taking into account the characteristics of the actual network topology, it can provide differentiated services for different multicast applications, improve the efficiency of multicast data transmission, and avoid network congestion and overload.
  • Figure 3 is a flow chart of an information notification method provided by an embodiment of the present disclosure. As shown in Figure 3, the information notification method provided by an embodiment of the present disclosure is applied to a first node and includes S101.
  • S101 Send a multicast notification message to a second node.
  • the multicast announcement message is used to announce multicast group information.
  • the multicast group information may be a multicast group address.
  • the multicast announcement message is also used to announce multicast source information.
  • the multicast source information may be a multicast source address.
  • the multicast announcement message may include at least one (S, G) or (*, G) entry for announcing multicast group information and multicast source information.
  • * represents a wildcard, i.e., does not specify a multicast source address
  • S represents the multicast source address
  • G represents the multicast group address.
  • the multicast announcement message includes a virtual topology identifier, which may be used to indicate a virtual topology applicable to the multicast group.
  • the multicast network has a single physical topology.
  • the virtual topology is a logical topology partitioned based on the physical topology of the multicast network, tailored to specific multicast network requirements and objectives. For example, in a multicast network, the virtual topology can be partitioned using network slicing, multi-topology technology, or other methods.
  • the multicast traffic transmitted in the multicast network if the multicast traffic transmitted in the multicast network is small, the multicast traffic can be transmitted based on the shortest path in the physical topology. However, if the multicast traffic transmitted in the multicast network is large and the multicast network has specific service requirements (such as ultra-high bandwidth and low latency), it is necessary to select a specific virtual topology suitable for the multicast group to establish the multicast group forwarding path and transmit the multicast traffic.
  • specific service requirements such as ultra-high bandwidth and low latency
  • there may be overlap between multiple virtual topologies which is not limited in the embodiments of the present disclosure.
  • the virtual topology identifier is indicated by at least one of the following: an identifier bit, a type-length-value (TLV), or a sub-TLV.
  • the virtual topology identifier is a topology value of the virtual topology, or the virtual topology identifier is a slice value of the network slice to which the virtual topology belongs.
  • the virtual topology identifier can be 200.
  • the topology value, or the slice value includes at least one of the following: a flexible algorithm (FA) value, a topology identification (topology ID), and a slicing identification (slicing ID).
  • FA flexible algorithm
  • topology ID topology identification
  • slicing ID slicing identification
  • the multicast notification message may be notified via a PIM message.
  • the first node When the first node notifies the multicast notification message, it may Extend the multicast notification message (also known as the PIM message) to carry a virtual topology identifier. For example, a new identifier bit can be added to the multicast notification message, a new type-length-value TLV and a new sub-TLV can be defined in the multicast notification message, and the multicast notification message can be broadcast using a flooding mechanism (such as the PFM mechanism of PIM (defined in RFC8364)). In this case, all nodes in the multicast network can receive the multicast notification message.
  • a flooding mechanism such as the PFM mechanism of PIM (defined in RFC8364)
  • the flooding mechanism does not rely on a specific forwarding path or network architecture.
  • the method provided in the embodiment of the present disclosure is based on the flooding mechanism, which can enable a node in a multicast network to send a multicast announcement message to all other nodes after receiving the multicast announcement message until all nodes in the multicast network receive the multicast announcement message, thereby making the forwarding range of the multicast announcement message wider.
  • a new flag bit can be added to a multicast announce message so that the multicast announce message carries a virtual topology identifier.
  • Figure 4 illustrates a multicast announce message.
  • the multicast announce message includes the number of multicast group addresses, the multicast group address, and the virtual topology identifier.
  • the number of multicast group addresses can be 2, the virtual topology identifier is 200, and the multicast group addresses include multicast group address G1 and multicast group address G2.
  • Figure 5 illustrates a multicast announcement message.
  • the multicast announcement information includes the multicast group address, the number of multicast source addresses, the multicast source address, and the virtual topology identifier.
  • the multicast group address may be G1
  • the corresponding number of multicast source addresses may be 1
  • the virtual topology identifier may be 200
  • the multicast source address S1 may be included following G1.
  • the corresponding number of source addresses may be 1, the virtual topology identifier may be 200
  • the multicast source address S2 may be included following G2.
  • Figure 6 is a schematic diagram of a sub-TLV.
  • the sub-TLV includes a type, a length, and a value.
  • the type value can be a network slice and/or topology
  • the length is the length of the slice value and/or topology value
  • the value field is the virtual topology identifier.
  • multicast announcement information can carry virtual topology identifiers in different data formats, increasing the flexibility and selectivity of the solution.
  • the multicast announcement message may be generated by the first node itself (for example, when the first node is an RP (rendezvous point) node, the multicast announcement message may be generated), or the multicast announcement message may be sent to the first node by another node.
  • the above method also includes: receiving the multicast announcement message sent by a third node. Exemplarily, if the third node is a multicast source and the first node is a node directly connected to the multicast source, the first node may receive the multicast announcement message sent by the third node.
  • virtual topology technology is used for the transmission of unicast traffic and cannot provide services for multicast services.
  • the virtual topology identifier is not included, and the nodes in the multicast network cannot perceive the virtual topology in which they are located.
  • it is usually impossible to establish a forwarding path based on the specified topology which may lead to low transmission efficiency of multicast data and even cause network congestion and overload.
  • the method provided in the embodiment of the present disclosure by carrying a virtual topology identifier in the multicast announcement message, can enable the nodes in the multicast network (such as the second node) to receive the multicast announcement message containing the virtual topology identifier, so that the nodes in the multicast network can perceive the virtual topology in which they are located (the connection relationship and forwarding path of the nodes in the multicast network corresponding to each virtual topology are determined), which is beneficial for the nodes in the subsequent multicast network to forward multicast data based on the virtual topology, avoiding the network congestion and overload problems that may exist when forwarding multicast data based on the shortest path in the physical topology.
  • the method provided by the embodiment of the present disclosure combines PIM and network slicing technology to flexibly configure the virtual topology structure according to user needs and the conditions of the multicast network, and then carry different virtual topology identifiers in the multicast announcement information, thereby providing users with differentiated multicast services and realizing a more flexible and efficient multicast data forwarding mechanism.
  • the above S101 may be implemented as: sending the multicast announcement message to the second node when the multicast announcement message includes a transmission bit flag.
  • the transmission bit flag is used to indicate the transmission of the multicast announcement message.
  • a first node when a first node receives multicast announcement information sent by another node (e.g., a third node), if the first node does not support the type of the multicast announcement information or the first node does not support the type in the TLV/sub-TLV, the first node may determine whether the multicast announcement message includes a transmit bit flag (i.e., whether the transmit bit flag is set). If the multicast announcement message includes a transmit bit flag, the first node may flood the multicast announcement message to other nodes (e.g., the second node) in the multicast network according to a PIM flooding mechanism (PFM). If the multicast announcement message does not include a transmit bit flag, the first node does not need to send the multicast announcement message to other nodes.
  • PIM flooding mechanism PIM flooding mechanism
  • the method provided by the embodiment of the present disclosure controls the multicast announcement message by using a transmittable identifier, so that nodes that do not support the multicast announcement message type or the TLV type can control the flooding range, preventing the multicast announcement message from circulating infinitely in the multicast network, thereby avoiding the formation of loops or causing network congestion.
  • Figure 7 is a flow chart of an information notification method provided by an embodiment of the present disclosure. As shown in Figure 7, the information notification method provided by an embodiment of the present disclosure is applied to a first node and includes S201.
  • S201 Determine a next hop node of a first node in a forwarding path of a multicast group based on a virtual topology identifier.
  • the first node may determine the next hop node of the first node (i.e., the next hop node of the first node in the forwarding path of the multicast group in the direction of the multicast source or the RP) based on the virtual topology identifier.
  • the preset condition includes: the first multicast join messages sent by all previous hop nodes of the first node include the same virtual topology identifier.
  • a first node when a first node receives a first multicast join message sent by multiple previous-hop nodes of the first nodes (that is, downstream nodes of the first node in the forwarding path (receiving nodes close to the multicast group)), if the first multicast join message sent by the previous-hop node of the first node carries a virtual topology identifier, then only if the first multicast join messages sent by all previous-hop nodes of the first node include the same virtual topology identifier, can the first node determine the next-hop node of the first node in the forwarding path of the multicast group (that is, the upstream node of the first node in the forwarding path of the multicast group) based on the virtual topology identifier.
  • the first node may determine the next hop node of the first node based on the routing table corresponding to the physical topology, and send a second multicast join message that does not include the virtual topology identifier to the next hop node of the first node.
  • the first node if the first multicast join message sent by the previous hop node of the first node carries different virtual topology identifiers, or if some first multicast join messages carry the virtual topology identifier while some first multicast join messages do not carry the virtual topology identifier, the first node cannot determine the next hop node of the first node based on the virtual topology identifier. In this case, the first node can determine the shortest forwarding path of the multicast group based on the routing table corresponding to the physical topology, and then determine the next hop node of the first node, and send a second multicast join message that does not include the virtual topology identifier to the next hop node of the first node.
  • the virtual topology identifier can instruct the nodes in the multicast network to use the forwarding path predefined by the virtual topology when performing multicast communication, rather than relying solely on the physical network topology.
  • the first node can determine the next hop node of the first node in the forwarding path of the multicast group based on the virtual topology identifier, thereby ensuring that when the nodes in the subsequent multicast network perform multicast communication, the multicast traffic is transmitted according to the forwarding path expected by the virtual topology, thereby increasing the controllability and flexibility of the network.
  • the above-mentioned S201 may be implemented as: S301 to S302 .
  • S301 Determine a routing table corresponding to a virtual topology based on a virtual topology identifier.
  • each virtual topology corresponds to a routing table, which may be pre-configured.
  • the first node first determines the virtual topology based on the virtual topology identifier, and then determines a routing table corresponding to the virtual topology in the direction of the multicast source or the RP.
  • S302 Determine a next hop node of the first node based on a routing table corresponding to the virtual topology.
  • the routing table corresponding to the virtual topology includes the upstream nodes corresponding to each node in the multicast group (that is, the upstream nodes of each node in the multicast group going in the direction of the multicast source or RP). Based on the routing table, the first node can determine the next hop node of the first node (that is, the next hop node of the first node in the forwarding path of the multicast group going in the direction of the multicast source or RP).
  • each virtual topology corresponds to a routing table.
  • the method provided in the embodiment of the present disclosure determines the routing table through the virtual topology identifier, and determines the next hop node of the first node based on the routing table. This allows the nodes in the subsequent multicast network to transmit multicast traffic along the optimal path in the virtual topology when performing multicast communication. This can effectively avoid excessive congestion of certain nodes or links, balance the network load, and improve the stability and reliability of the multicast network.
  • Scenario 1 A network node directly connected to a multicast source broadcasts a multicast notification message based on a flooding mechanism.
  • FIG9 is a schematic diagram of the multicast network architecture corresponding to scenario 1.
  • the multicast network architecture includes: a first multicast source, a second multicast source, a first multicast receiving end, a second multicast receiving end, a third multicast receiving end, and network nodes R1 to R7.
  • a slicing function is deployed in the multicast network, and the slicing function can be implemented through FA technology.
  • the slice includes other R1-R7 nodes except network node R4. Assuming that the virtual topology identifier of the slice is 200, the nodes in the slice can determine the forwarding path within the slice (or virtual topology) according to the virtual topology identifier.
  • the network node R1 directly connected to the first multicast source and the second multicast source can announce multicast announcement messages (S1, G1) and (S2, G2) based on the PFM mechanism of PIM.
  • the multicast announcement message can be used to announce multicast group information and multicast source information.
  • the multicast announcement message used to indicate that it is sent by the first multicast source may include (S1, G1).
  • S1 represents the address of the first multicast source
  • G1 represents the address of the multicast group G1.
  • the announcement message used to indicate the multicast stream sent by the second multicast source 120 may include: (S2, G2).
  • S2 represents the address of the second multicast source, and G2 represents the address of the multicast group G2.
  • the multicast announcement message is flooded in the network, and nodes R2 to R7 will all receive the multicast announcement message.
  • R1 broadcasts a multicast notification message, it can flood the multicast network using the PFM mechanism. All network nodes R1 to R7 (including intermediate network nodes and nodes connected to multicast receivers) in the multicast network will receive the multicast notification message.
  • R1 can define a TLV or sub-TLV in the multicast notification message to allow the message to carry a virtual topology identifier.
  • the multicast announcement message also includes a transmittable flag, which is used to indicate whether the multicast announcement message has a transmittable attribute.
  • the network node After receiving the multicast announcement message, if the network node does not support the multicast announcement message, it can determine whether the multicast announcement message includes a transmittable flag. If it does, the network node can forward the multicast announcement message to other network nodes based on the flooding mechanism. If the multicast announcement message does not include a transmittable flag, the network node will not flood the multicast announcement message to other network nodes. For example, if the transmittable flag is not set in the multicast announcement message sent from R1, and R5 does not support the method mentioned in scenario one, it cannot parse the multicast announcement message carrying the virtual topology flag. Although R5 has received the multicast announcement message, R5 cannot flood to nodes such as R7.
  • network nodes R6 and R7 connected to multiple multicast receivers, can determine, based on local configuration, that a forwarding path for the multicast group needs to be established in a virtual topology identified as 200.
  • R6 and R7 can then query the routing table corresponding to the virtual topology identified as 200 to determine the paths to the first and second multicast sources. For example, after querying, R6 can determine that its next-hop node to the first multicast source is R3, and R7 can determine that its next-hop node to the second multicast source is R5.
  • R6 and R7 then send multicast join messages to R3 and R5, respectively.
  • the multicast join messages can carry the virtual topology identifier 200.
  • R7 determines that its next-hop node to the second multicast source is R5, but if R5 does not support the method mentioned in scenario one, since R5 does not flood forward the multicast announcement message carrying the virtual topology identifier to R7, even if R5 is R7's next-hop node, R7 will not send a multicast join message to R5, but will choose other methods to find R7's next-hop node.
  • R5 will choose the shortest path in the physical topology to find the next hop node (for example, determine the next hop as R4 through the shortest path in the physical topology) and establish a forwarding path, which may cause the forwarding path to be overloaded and easily cause network congestion or network loops.
  • R3 and R5 can continue to query the routing table corresponding to the virtual topology based on local configuration, or based on the virtual topology identifier 200 carried in the multicast join message received from R6 and R7, respectively, to determine the path to the first multicast source and the second multicast source. For example, after querying, R3 can determine that its next hop node to the first multicast source is R2, and R5 can determine that its next hop node to the second multicast source is R1. R3 and R5 can then send multicast join messages carrying the virtual topology identifier 200 to R2 and R1, respectively.
  • the forwarding paths i.e., multicast forwarding paths (source-specific shortest-path trees, SPTs)
  • SPTs source-specific shortest-path trees
  • a forwarding path of R1-R4-R7 is typically established based on a shortest path algorithm, which can result in a heavy load on this forwarding path.
  • the forwarding path of the multicast group can avoid the aforementioned R1-R4-R7 path, thereby avoiding excessive load on the forwarding path, reducing network congestion on the forwarding path, and thus ensuring the forwarding quality of multicast traffic during subsequent multicast communications on the multicast network.
  • Scenario 2 The rendezvous point (RP) node in the multicast network announces multicast announcement messages based on the flooding mechanism.
  • FIG10 is a schematic diagram of the multicast network architecture corresponding to scenario 2.
  • the multicast network architecture includes: a first multicast source, a second multicast source, a first multicast receiving end, a second multicast receiving end, a third multicast receiving end, and network nodes R1 to R7.
  • Network node R2 is an RP node.
  • a slicing function is deployed in the multicast network, and the slicing function can be implemented through FA technology.
  • the slice includes other R1-R7 nodes except network node R4. Assuming that the virtual topology identifier of the slice is 200, the nodes in the slice can determine the forwarding path within the slice (or virtual topology) according to the virtual topology identifier.
  • the network node R2 when the first multicast source and the second multicast source have not yet sent multicast traffic in the multicast network, the network node R2 (i.e., the RP node) can send multicast announcement messages (S1, G1) and (S2, G2) to the multicast network based on the flooding mechanism, and the multicast announcement messages include a virtual topology identifier.
  • network nodes R6 and R7 connected to multiple multicast receiving terminals can, after determining the needs of the multicast receiving terminals (i.e., user needs), determine their next hop node to R2 based on the virtual topology identifier and send a multicast join message to the next hop node. For example, if R6 determines that its next hop node to RP is R3 based on the virtual topology identifier, R6 sends a multicast join message carrying virtual topology identifier 200 to R3. If R7 determines that its next hop node to R2 is R6 based on the virtual topology identifier, R7 sends a multicast join message carrying virtual topology identifier 200 to R6.
  • an RPT path of R2-R3-R6-R7 can be established.
  • R6 and R7 will continue to use the established RPT path to receive multicast traffic even after the first and second multicast sources begin sending multicast traffic. If RPT-to-SPT switching is required in the multicast network, after R6 and R7 receive multicast traffic sent by the first and/or second multicast sources, they can establish a forwarding path using the method described in Scenario 1 above, canceling the forwarding path from R2 (i.e., the RP node) to R6 and R7. In this example, forwarding of multicast traffic from R2 to N6/N7 will be canceled.
  • the information notification device includes at least one of the hardware structure and software module that perform each function. It should be easy for those skilled in the art to realize that, in combination with the units and algorithm steps of each example described in the embodiment disclosed herein, the embodiment of the present disclosure can be implemented in hardware or hardware and computer. Whether a function is implemented in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of the embodiments of this disclosure.
  • the information notification device includes hardware structures and/or software modules corresponding to the execution of each function. It should be easily appreciated by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present disclosure.
  • the embodiment of the present disclosure can divide the information notification device into functional modules according to the above-mentioned method embodiment.
  • each functional module can be divided corresponding to each function, or two or more functions can be integrated into one functional module.
  • the above-mentioned integrated module can be implemented in the form of hardware or software. It should be noted that the division of modules in the embodiment of the present disclosure is schematic and is only a logical function division. There may be other division methods in actual implementation. The following is an example of dividing each functional module corresponding to each function.
  • Figure 11 is a schematic diagram of the structure of an information notification device provided in an embodiment of the present disclosure.
  • the information notification device applied to a first node, can execute the information notification method provided in the above method embodiment.
  • the information notification device 300 includes a sending module 301, a determining module 302, and a receiving module 303.
  • the sending module 301 is configured to send a multicast announcement message to the second node; the multicast announcement message is used to announce multicast group information; and the multicast announcement message includes a virtual topology identifier.
  • the virtual topology identifier is a topology value of the virtual topology, or the virtual topology identifier is a slice value of the network slice to which the virtual topology belongs.
  • the topology value, or the slice value includes at least one of the following: a flexible algorithm FA value, a topology ID, and a slice ID.
  • the sending module 301 is configured to send the multicast announcement message to the second node when the multicast announcement message includes a transmission bit flag; the transmission bit flag is used to indicate that the multicast announcement message is to be transmitted.
  • the determination module 302 is configured to determine a next hop node of a first node in a forwarding path of the multicast group based on the virtual topology identifier.
  • the determination module 302 is configured to determine a routing table corresponding to the virtual topology based on the virtual topology identifier; and determine a next hop node of the first node based on the routing table corresponding to the virtual topology.
  • the determination module 302 is used to determine the next hop node of the first node based on the virtual topology identifier when a preset condition is met; the preset condition includes: the first multicast join messages sent by all previous hop nodes of the first node include the same virtual topology identifier.
  • the determination module 302 is further used to determine the next hop node of the first node based on the routing table corresponding to the physical topology when the preset conditions are not met; and send a second multicast join message that does not include the virtual topology identifier to the next hop node of the first node.
  • the receiving module 303 is configured to receive a multicast announcement message sent by a third node.
  • the multicast announce message is also used to announce multicast source information.
  • the virtual topology identifier is indicated by at least one of the following: an identification bit, a type-length-value TLV, or a sub-TLV.
  • the embodiment of the present disclosure provides a structure of the communication device involved in the above-mentioned embodiment.
  • the communication device 400 includes: a processor 402 and a bus 404.
  • the communication The communication device 400 may further include a memory 401 ; in some embodiments, the communication device 400 may further include a communication interface 403 .
  • Processor 402 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present disclosure.
  • Processor 402 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof.
  • Processor 402 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present disclosure.
  • Processor 402 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
  • the communication interface 403 is used to connect to other devices via a communication network.
  • the communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.
  • the memory 401 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
  • ROM read-only memory
  • RAM random access memory
  • EEPROM electrically erasable programmable read-only memory
  • disk storage medium or other magnetic storage device or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
  • memory 401 may exist independently of processor 402. Memory 401 may be connected to processor 402 via bus 404 to store instructions or program codes. When processor 402 calls and executes the instructions or program codes stored in memory 401, the information notification method and information processing method provided in the embodiments of the present disclosure can be implemented.
  • Bus 404 may be an extended industry standard architecture (EISA) bus, for example.
  • EISA extended industry standard architecture
  • Bus 404 may be divided into an address bus, a data bus, a control bus, and the like.
  • FIG12 shows only one thick line, but this does not imply that there is only one bus or only one type of bus.
  • Some embodiments of the present disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium), which stores computer program instructions.
  • a computer-readable storage medium e.g., a non-transitory computer-readable storage medium
  • the computer executes an information notification method or an information processing method as described in any of the above embodiments.
  • the above-mentioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks or magnetic tapes, etc.), optical disks (e.g., Compact Disks (CDs), Digital Versatile Disks (DVDs), etc.), smart cards and flash memory devices (e.g., Erasable Programmable Read-Only Memory (EPROMs), cards, sticks or key drives, etc.).
  • the various computer-readable storage media described in the present disclosure may represent one or more devices and/or other machine-readable storage media for storing information.
  • the term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing and/or carrying instructions and/or data.
  • An embodiment of the present disclosure provides a computer program product including instructions.
  • the computer program product When the computer program product is run on a computer, the computer is enabled to execute the information notification method and information processing method of any one of the above embodiments.

Landscapes

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

Abstract

提供一种信息通告方法、通信装置及存储介质。该信息通告方法应用于第一节点，并且该信息通告方法包括：向第二节点发送组播通告消息；组播通告消息用于通告组播组信息；组播通告消息包括虚拟拓扑标识。

Description

信息通告方法、通信装置及存储介质
本公开要求于2024年03月12日提交的、申请号为202410283952.2的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本公开涉及通信领域，尤其涉及一种信息通告方法、通信装置及存储介质。
背景技术
组播技术是一种在网络中实现多播通信的技术，其在现在的互联网发挥着重要的作用。例如，交互式电视(interactive personality TV，IPTV)、网络会议(Net-Meeting)、赛况直播等领域都使用到了组播技术。协议无关组播(protocol independent multicast，PIM)是目前部署最广泛的组播技术。
发明内容
第一方面，本公开实施例提供一种信息通告方法，应用于第一节点。该信息通告方法包括：
向第二节点发送组播通告消息；组播通告消息用于通告组播组信息；组播通告消息包括虚拟拓扑标识。
第二方面，本公开实施例提供一种信息通告装置。该信息通告装置包括：发送模块；
所述发送模块，用于向第二节点发送组播通告消息；组播通告消息用于通告组播组信息；组播通告消息包括虚拟拓扑标识。
第三方面，本公开实施例提供一种通信装置。该通信装置包括：存储器和处理器；所述存储器和所述处理器耦合；所述存储器用于存储计算机程序；所述处理器执行计算机程序时实现上述方面的信息通告方法。
第四方面，本公开实施例提供一种计算机可读存储介质，计算机可读存储介质上存储有计算机程序指令，该计算机程序指令被处理器执行时实现上述方面的信息通告方法。
第五方面，本公开实施例提供一种计算机程序产品，该计算机程序产品包括计算机程序指令，该计算机程序指令被处理器执行时实现上述方面的信息通告方法。
附图说明
为了更清楚地说明本公开中的技术方案，下面将对本公开一些实施例中所需要使用的附图作简单地介绍。显而易见地，下面描述中的附图仅仅是本公开的一些实施例的附图，对于本领域普通技术人员来讲，还可以根据这些附图获得其他的附图。
图1为根据一些实施例的一种通信系统的示意图。
图2为根据一些实施例的一种组播网络架构示意图。
图3为根据一些实施例的一种信息通告方法的流程图。
图4为根据一些实施例的一种组播通告信息的示意图。
图5为根据一些实施例的另一种组播通告信息的示意图。
图6为根据一些实施例的一种子TLV的示意图。
图7为根据一些实施例的另一种信息通告方法的流程图。
图8为根据一些实施例的又一种信息通告方法的流程图。
图9为根据一些实施例的另一种组播网络架构示意图。
图10为根据一些实施例的又一种组播网络架构示意图。
图11为根据一些实施例的一种信息通告装置的结构示意图。
图12为根据一些实施例的一种通信装置的结构示意图。
具体实施方式
下面将结合本公开中的附图，对本公开中的技术方案进行清楚、完整地描述。显然，所描述的实施例仅是本公开一部分实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本公开保护的范围。
需要说明的是，在本公开中，“示例性地”或者“例如”等表述用于表示作例子、例证或说明。本公开中被描述为“示例性地”或者“例如”等的任何实施例或设计方案不应被解释为比其它实施例或设计方案更优选或更具优势。确切而言，使用“示例性地”或者“例如”等表述旨在以详细方式呈现相关概念。
以下，术语“第一”、“第二”仅用于描述目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量。由此，限定有“第一”、“第二”等的特征可以明示或者隐含地包括一个或者更多个该特征。
在本公开的描述中，除非另有说明，“/”表示“或”的意思，例如，A/B可以表示A或B。本文中的“和/或”仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：仅A、仅B以及A和B。此外，“至少一个”是指一个或多个，“多个”是指两个或两个以上。
为了方便理解，首先对本公开实施例涉及的相关概念进行简单介绍。
1、组播技术：
组播是一种网络通信范式，其是指在网络中将数据包以尽力传送(best-effort)的形式发送到网络中的某个确定节点子集，这个子集称为组播组(multicast group)。组播技术的基本思想是，组播源只发送一份数据，这份数据中的目的地址为组播组地址，组播组中的所有接收者都可接收到同样的数据拷贝，并且只有组播组内的节点(目标节点)可以接收该数据，网络中其它节点不能收到。组播组地址用D类地址(224.0.0.0-239.255.255.255)来标识。
2、PIM：
PIM是一个运用于路由器组播转发的协议。PIM的实现依赖于网络中单播路由的互通，即组播网络需要先完成单播路由表的构建。PIM协议构建了组播路由表，该组播路由表包括组播源(组播源IP地址)、组播组(组播组IP地址)、组播上游接口、组播下游接口四项内容。通过该组播路由表，网络节点或路由器可以确定从组播源发来的某个组播流量的上游接口(进入)和下游接口(发出)。
3、网络切片：
网络切片(network slice)(也称slice)，指在物理或者虚拟的网络基础设施之上，根据不同的服务需求定制的逻辑网络。网络切片技术可以让运营商在同一套网络基础设施上提供多个虚拟拓扑，每个虚拟拓扑可用于服务特定的业务或者用户。每个网络切片可以有不同的逻辑拓扑、可靠性、服务等级等，以满足不同行业与客户的差异性需求。网络切片可以是一个包括了终端、接入网、传输网、核心网和应用服务器的完整的端到端网络，从而能够提供完整的通信服务，网络切片具有一定网络能力；网络切片也可以是上述终端、接入网、传输网、核心网和应用服务器的任意组合。网络切片可能具有如下一个或多个特性：接入网可能切片，也可能不切片。接入网可能是多个网络切片共用的。不同的网络切片的特性和组成它们的网络功能可能是不一样的。
以上是本公开实施例中所涉及到的部分概念的介绍，以下不再赘述。
本公开实施例可以应用于各种无线通信系统，例如：全球移动通讯系统(global system of mobile communication，GSM)、码分多址(code division multiple access，CDMA)系统、宽带码分多址(wide band code division multiple access，WCDMA)系统、通用分组无线业务(general packet radio service，GPRS)、长期演进(long term evolution，LTE)系统、LIE-A(advanced long term evolution，先进的长期演进)系统、 通用移动通信系统(universal mobile telecommunication system，UMTS)、5G、超5代(beyond fifth generation，B5G)、第6代(6th generation，6G)系统等。本公开实施例可以应用于各种有线通信系统、固网、承载网、基站回传网络等，本公开实施例并不限定。
本公开实施例可以应用于组播网络。组播协议有多种诸如网路群组管理协议(internet group management protocol，IGMP)组播、PIM等。本公开实施例主要应用于PIM，也可以应用于其它相关网络场景，本公开实施例并不限定。为详尽阐述本技术方案，以组播网络应用场景为例，对本公开的一些技术进一步解释说明。
图1为本公开实施例提供的一种通信系统的示意图。该通信系统包括第一节点110、第二节点120和第三节点130。第二节点120和第三节点130分别与第一节点110通信连接。
在一些实施例中，第一节点110、第二节点120和第三节点130可以为一个或多个，本公开实施例不对数量进行限定。
第一节点110，用于向第二节点120发送组播通告消息。组播通告消息用于通告组播组消息和组播源消息。示例性地，组播组消息可以是组播组地址，组播源消息可以是组播源地址。
示例性地，组播通告消息可以包括至少一条(*，G)表项或(S，G)表项，以用于通告组播组消息和组播源消息。*表示通配符，即，不指定组播源地址，S表示组播源地址，G表示组播组地址。
在一些实施例中，组播通告消息中包括虚拟拓扑标识，该虚拟拓扑标识可以标识适用于组播组的虚拟拓扑。
在一些实施例中，第一节点110，还可以基于虚拟拓扑标识，确定在组播组的转发路径中的第一节点110的下一跳节点。示例性地，第一节点110可以基于虚拟拓扑标识，确定虚拟拓扑对应的路由表(路由表中通常存储有虚拟拓扑)，并基于路径表，确定第一节点110的下一跳节点。
需要说明的是，本公开实施例所提到的第一节点110的下一跳节点，指的是第一节点110去往组播组的组播源方向的下一跳节点，也就是说，第一节点110的下一跳节点，可以看作第一节点110在组播组的转发路径中的上游节点。
第二节点120，用于接收第一节点110发送的组播通告消息。
第三节点130，用于向第一节点110发送组播通告消息。示例性地，第三节点130可以通过泛洪的方式，将组播通告消息发送给第一节点110。
需要说明的是，上述场景是为了更加清楚的说明本公开实施例的技术方案，并不构成对于本公开实施例提供的技术方案的限定，本领域普通技术人员可知，随着系统架构的演变和新业务场景的出现，本公开实施例提供的技术方案对于类似的技术问题，同样适用。
PIM是目前部署最广泛的组播技术，例如，在IPTV场景中，PIM技术为目前部署中的重要组播技术。传统的PIM技术通常基于物理拓扑的最短路径进行转发路径的构建。示例性地，图2为组播网络架构示意图。如图2所示，该组播网络架构包括第一组播源210、第二组播源220、第一组播接收端230、第二组播接收端240、第三组播接收端250以及多个网络节点(如第一网络节点R1、第二网络节点R2、第三网络节点R3、第四网络节点R4、第五网络节点R5、第六网络节点R6以及第七网络节点R7)。第一网络节点R1是分别与第一组播源210和第二组播源220直接相连的节点。第六网络节点R6是分别与第一组播接收端230、第二组播接收端240直接相连的节点，第七网络节点R7是直接与第三组播接收端250相连的节点。
基于上述图2所示的组播网络架构，连接多个组播接收端的第六网络节点R6和第七网络节点R7从组播接收端获知需要接收第一组播源210的组播通告信息，并接收组播流量。根据第六网络节点R6和第七网 络节点R7在物理拓扑上的最短路径，可以确定其去往第一组播源210的下一跳是第四网络节点R4。此时，第六网络节点R6和第七网络节点R7会向第四网络节点R4发送PIM的加入(join)消息，第四网络节点R4在根据物理拓扑上的最短路径，向第一网络节点R1发送join消息，从而建立从第一网络节点R1到第四网络节点R4，再到第六网络节点R6和第七网络节点R7的组播转发路径。
在实际的通信网络中，上述基于物理拓扑上的最短路径建立的播转发路径，可能会因为组播组中传输的组播流量过大，导致第一网络节点R1到第四网络节点R4，或者导致第四网络节点R4到第六网络节点R6/第七网络节点R7的链路过载，进而导致组播流量丢包，极大影响用户的体验。可以看出，一些技术中的基于物理拓扑建立最短路径而建立转发路径的方法，无法基于指定拓扑实现组播转发路径的建立，可能会忽略实际网络拓扑的特点，导致组播数据的传输效率低下，甚至造成网络拥塞和过载。
网络切片技术是近年来兴起的新技术，使用网络切片技术，可以在同一套网络基础设施上提供多个虚拟/逻辑网络。因此，可以考虑将PIM技术与网络切片技术相结合，考虑实际网络拓扑的特点，为不同的组播应用提供差异化的服务，提高组播数据传输的效率，避免网络拥塞和过载。
针对上述问题，参见图3，图3为本公开实施例提供的一种信息通告方法的流程图。如图3所示，本公开实施例提供的信息通告方法应用于第一节点，包括S101。
S101、向第二节点发送组播通告消息。
组播通告消息用于通告组播组信息。示例性地，组播组信息可以是组播组地址。
在一些实施例中，组播通告消息还用于通告组播源信息。示例性地，组播源信息可以是组播源地址。
示例性地，组播通告消息可以包括至少一条(S，G)或者(*，G)表项，以用于通告组播组信息和组播源信息。*表示通配符，即，不指定组播源地址，S表示组播源地址，G表示组播组地址。
在一些实施例中，组播通告消息包括虚拟拓扑标识，虚拟拓扑标识可以用于指示适用于组播组的虚拟拓扑。
在一些实施例中，组播网络的物理拓扑只有一个，虚拟拓扑是在组播网络的物理拓扑的基础之上，根据特定的组播网络需求和目标划分出的逻辑拓扑。示例性地，在组播网络中，虚拟拓扑的划分可以通过网络切片技术、多拓扑技术等方式实现。
在一些实施例中，若组播网络中进行传输的组播流量较小，可以基于物理拓扑中的最短路径进行组播流量的传输。然而，当组播网络中进行传输的组播流量较大、组播网络有特定的业务需求(例如超大带宽、低时延等需求)时，则需要选择适用于组播组的特定的虚拟拓扑建立组播组的转发路径并进行组播流量的传输。
在一些实施例中，虚拟拓扑可以有多个，每个虚拟拓扑都有自己对应的拓扑结构、资源分配和转发路径。此外，基于特点的组播网络需求和目标，多个虚拟拓扑之间可以存在重叠的部分，本公开实施例对此不作限定。
在一些实施例中，虚拟拓扑标识通过以下至少一项指示：标识位、类型长度值(type-length-value，TLV)、子TLV(sub-TLV)。
在一些实施例中，虚拟拓扑标识为虚拟拓扑的拓扑值，或者，虚拟拓扑标识为虚拟拓扑所属的网络切片的切片值。示例性地，虚拟拓扑标识可以为200。
在一些实施例中，拓扑值，或者切片值包括以下至少一项：灵活算法(flexible algorithm，FA)值、拓扑标识(topology identification，topology ID)、切片标识(slicing identification，slicing ID)。
在一些实施例中，组播通告消息可以通过PIM消息进行通告，第一节点在通告组播通告消息时，可以 扩展组播通告消息(也即PIM消息)，以使其携带虚拟拓扑标识。例如，可以在组播通告消息中扩展新的标识位、在组播通告消息中定义新的类型长度值TLV、新的子TLV等，并使用泛洪机制(例如PIM的PFM机制(通过RFC8364定义))通告组播通告消息，此时，组播网络中的所有节点都可以接收到该组播通告消息。
可以理解的是，泛洪机制不依赖于特定的转发路径或网络架构，本公开实施例提供的方法基于泛洪机制，可以使得组播网络中的节点接收到组播通告消息后，将该组播通告消息发送给所有的其他节点，直到组播网络中的所有节点都接收到组播通告消息，可以使得组播通告消息的转发范围更加的广泛。
作为一个示例，可以在组播通告消息中扩展新的标识位，以使得组播通告消息携带虚拟拓扑标识。示例性地，图4为组播通告消息的示意图。如图4所示，组播通告消息包括：组播组地址数量、组播组地址和虚拟拓扑标识。示例性地，组播组地址数量可以为2，虚拟拓扑标识为200，组播组地址包括组播组地址G1和组播组地址G2等。
作为一个示例，图5为组播通告消息的示意图。如图5所示，组播通告信息包括：组播组地址、组播源地址数量、组播源地址和虚拟拓扑标识。示例性地，组播组地址可以为G1，其对应的组播源地址数量为1，虚拟拓扑标识设置为200，组播源地址S1跟随G1包含其中。同样地，对于组播组地址G2，其对应的源地址数量为1，虚拟拓扑标识设置为200，组播源地址S2跟随G2包含其中。
作为又一个示例，若直接沿用组播通告消息中所定义的TLV，因为该TLV中已经包含组播组地址和组播源地址，因此可以直接在组播通告消息后面携带子TLV。示例性地，图6为子TLV的示意图。如图6所示，子TLV包括类型(type)、长度(length)和值(value)。类型值可以为网络切片和/或拓扑，长度为切片值和/或拓扑值的长度，value字段则为虚拟拓扑标识。
可以理解的是，基于TLV的可扩展性和灵活性，在本公开实施例提供的方法中，新的数据类型可以轻松的添加到TLV格式中，而不会影响现有数据的解析和处理，提高了组播通告信息的稳定性和扩展性。此外，在本公开实施例提供的方法中，组播通告信息可以以不同的数据形式携带虚拟拓扑标识，提高了方案的灵活性和可选择性。
在一些实施例中，组播通告消息可以是第一节点自身生成的(例如当第一节点为RP(汇聚点，rendezvous point)节点时，可以生成组播通告消息)，或者，组播通告消息还可以是其他节点发送给第一节点的。上述方法还包括：接收第三节点发送的组播通告消息。示例性地，若第三节点为组播源，第一节点是与组播源直接连接的节点，则第一节点可以接收第三节点发送的组播通告消息。
可以理解的是，在一些技术中，虚拟拓扑技术用于单播流量的传输，并不能为组播业务提供服务，在一些技术中，在发送组播通告消息(例如组播组信息)时不包含虚拟拓扑标识，组播网络中的节点无法感知到所处的虚拟拓扑，在后续建立组播组的转发路径时，通常无法基于指定拓扑实现转发路径的建立，可能会导致组播数据的传输效率低下，甚至造成网络拥塞和过载。在本公开实施例提供的方法，通过在组播通告消息中携带虚拟拓扑标识，可以使得组播网络中的节点(例如第二节点)接收到包含虚拟拓扑标识的组播通告消息，以便于组播网络中的节点感知到其所处的虚拟拓扑(每个虚拟拓扑对应的组播网络中节点的连接关系和转发路径是确定的)，有利于后续组播网络中的节点基于该虚拟拓扑进行组播数据的转发，避免基于物理拓扑中的最短路径进行组播数据转发时，可能存在的网络拥塞和过载的问题。
此外，本公开实施例提供的方法通过将PIM和网络切片技术相结合，可以根据用户的需求和组播网络的情况等，灵活配置虚拟拓扑结构，进而在组播通告信息中携带不同的虚拟拓扑标识，从而为用户提供差异化的组播服务，实现更加灵活和高效的组播数据转发机制。
在一些实施例中，上述S101例如可实现为：在组播通告消息中包括传送位标识的情况下，向第二节点发送组播通告消息。
传送位标识用于指示传送组播通告消息。
在一些实施例中，当第一节点接收到其他节点(例如第三节点)发送的组播通告信息时，若第一节点并不支持该组播通告信息的类型或者第一节点并不支持TLV/子TLV中的类型，则第一节点可判断组播通告消息中是否包括传送位标识(也即传送位标识是否被设置)。若组播通告消息中包括传送位标识，则第一节点可以根据PIM泛洪机制(PIM flooding mechanism，PFM)向组播网络中的其他节点(例如第二节点)泛洪该组播通告消息。若组播通告消息中不包括传送位标识，则第一节点无需再向其他节点发送组播通告消息。
可以理解的是，本公开实施例提供的方法通过使用可传送标识对组播通告消息进行控制，使不支持组播通告消息类型或不支持TLV类型的节点对泛洪范围进行控制，防止组播通告消息在组播网络中无限循环，从而避免形成环路或造成网络拥塞。
参见图7，图7为本公开实施例提供的一种信息通告方法的流程图。如图7所示，本公开实施例提供的信息通告方法应用于第一节点，包括S201。
S201、基于虚拟拓扑标识，确定组播组的转发路径中第一节点的下一跳节点。
在一些实施例中，在满足预设条件的情况下，第一节点可以基于虚拟拓扑标识，确定第一节点的下一跳节点(也即第一节点在组播组的转发路径中去往组播源方向或RP方向的下一跳节点)。预设条件包括：由第一节点的所有上一跳节点发送的第一组播加入消息均包括相同的虚拟拓扑标识。
示例性地，第一节点在接收到多个第一节点的上一跳节点(也即第一节点在转发路径中的下游节点(靠近组播组的接收节点))发送的第一组播加入消息时，若第一节点的上一跳节点发送的第一组播加入消息中携带虚拟拓扑标识，则只有在第一节点的所有上一跳节点发送的第一组播加入消息均包括相同的虚拟拓扑标识的情况下，第一节点才能基于该虚拟拓扑标识，确定组播组的转发路径中第一节点的下一跳节点(也即第一节点在组播组的转发路径中的上游节点)。
在一些实施例中，在不满足预设条件的情况下，第一节点可以基于物理拓扑对应的路由表，确定第一节点的下一跳节点，并向第一节点的下一跳节点发送不包括虚拟拓扑标识的第二组播加入消息。
在一些实施例中，若第一节点的上一跳节点发送的第一组播加入消息中携带了不同的虚拟拓扑标识，或者有的第一组播加入消息中携带虚拟拓扑标识，而有的第一组播加入消息中不携带虚拟拓扑标识，则第一节点无法根据虚拟拓扑标识，确定第一节点的下一跳节点。此时，第一节点可以基于物理拓扑对应的路由表，确定组播组的最短转发路径，进而确定第一节点的下一跳节点，并向第一节点的下一跳节点发送不包括虚拟拓扑标识的第二组播加入消息。
可以理解的是，虚拟拓扑标识可以指示组播网络中的节点在进行组播通信时，使用虚拟拓扑预定义的转发路径，而不仅仅依赖于物理网络拓扑。在本公开实施例提供的方法中，只有在第一节点的所有上一跳节点发送的第一组播加入消息均包括相同的虚拟拓扑标识(也即第一节点的所有上一条节点都已感知到该虚拟拓扑且支持该虚拟拓扑)的情况下，第一节点才能基于该虚拟拓扑标识，确定组播组的转发路径中的第一节点的下一跳节点，从而可以确保后续组播网络中的节点在进行组播通信时，组播流量按照虚拟拓扑所预期的转发路径进行传输，增加了网络的可控性和灵活性。
在一些实施例中，如图8所示，上述S201例如可实现为：S301至S302。
S301、基于虚拟拓扑标识，确定虚拟拓扑对应的路由表。
在一些实施例中，每个虚拟拓扑都对应一个路由表，该路由表可以是提前配置的。第一节点基于虚拟拓扑标识，首先确定虚拟拓扑，进而根据该虚拟拓扑，确定虚拟拓扑对应的去往组播源方向或者RP方向的路由表。
S302、基于虚拟拓扑对应的路由表，确定第一节点的下一跳节点。
在一些实施例中，虚拟拓扑对应的路由表中包括组播组中各个节点对应的上游节点(也即组播组中各个节点去往组播源方向或RP方向的上游节点)，第一节点基于路由表，即可确定第一节点的下一跳节点(也即第一节点在组播组的转发路径中去往组播源方向或RP方向的下一跳节点)。
可以理解的是，每个虚拟拓扑都对应一个路由表，本公开实施例提供的方法通过虚拟拓扑标识确定路由表，并基于路由表，确定第一节点的下一跳节点，可以使得后续组播网络中的节点在进行组播通信时，组播流量沿着虚拟拓扑中的最优路径进行传输，可以有效避免某些节点或链路的过度拥塞，均衡网络负载，提高组播网络的稳定性和可靠性。
为便于理解，下面分别以不同的场景为例对本公开实施例提供的信息通告方法进行描述。
场景一、与组播源直接相连的网络节点基于泛洪机制通告组播通告消息。
示例性地，如图9所示，图9为场景一对应的组播网络架构的示意图。示例性地，如图9所示，该组播网络架构包括：第一组播源、第二组播源、第一组播接收端、第二组播接收端、第三组播接收端、网络节点R1至网络节点R7。该组播网络中部署了切片功能，该切片功能可以通过FA技术实现。如图9所示，该切片包括了除网络节点R4之外的其他R1-R7节点，假设该切片的虚拟拓扑标识为200，则切片中的节点可根据该虚拟拓扑标识确定在该切片(或者虚拟拓扑)内的转发路径。
在一些实施例中，与第一组播源和第二组播源直接相连的网络节点R1，可以基于PIM的PFM机制通告组播通告消息(S1，G1)和(S2，G2)，该组播通告消息可以用于通告组播组信息和组播源信息。示例性地，用于表示第一组播源发出的组播通告消息可以包括(S1，G1)。S1表示第一组播源的地址，G1表示组播组G1的地址。用于表示第二组播源120发出的组播流的通告消息可以包括：(S2，G2)。S2表示第二组播源的地址，G2表示组播组G2的地址。组播通告消息在网络中进行泛洪，R2节点至R7节点均会收到该组播通告消息。R1在通告组播通告消息时，可以基于PFM的机制将组播通告消息在组播网络中进行泛洪，组播网络中的网络节点R1至R7(包括组播网络中的中间网络节点和连接组播接收端的节点)都会收到该组播通告消息。此外，R1还可以在组播通告消息中定义TLV或者子TLV，以使得组播通告消息可以携带虚拟拓扑标识。
在一些实施例中，组播通告消息中还包括可传送标识，可传送标识用于指示组播通告消息是否具有可传送属性。网络节点在收到组播通告消息后，若不支持该组播通告消息，则可判断组播通告消息中是否包括可传送标识，若包括，则该网络节点可以基于泛洪机制向其他网络节点转发组播通告消息。若组播通告消息中不包括可传送标识，则该网络节点不会向其他网络节点泛洪转发组播通告消息。示例性地，若从R1发出的组播通告消息中没有设置可传送标识，且R5不支持场景一所提到的方法，其无法解析携带虚拟拓扑标识的组播通告消息，则R5虽然接收到了该组播通告消息，但R5无法向R7等节点进行泛洪。
在一些实施例中，与多个组播接收端相连的网络节点R6和网络节点R7，可以基于本地配置，确定需要在虚拟拓扑标识为200的虚拟拓扑中建立组播组的转发路径，则R6和R7可以在虚拟拓扑标识为200的虚拟拓扑中查询该虚拟拓扑对应的路由表，进而确定去往第一组播源和第二组播源的路径。示例性地，经过查询，R6可确定其去往第一组播源的下一跳节点为R3，R7可确定其去往第二组播源的下一跳节点为R5，R6和R7分别向R3和R5发送组播加入消息。该组播加入消息中可携带虚拟拓扑标识200。
在一些实施例中，若R7确定其去往第二组播源的下一跳节点为R5，但若R5不支持场景一所提到的方法，由于R5并没有向R7泛洪转发携带虚拟拓扑标识的组播通告报文，则即使R5为R7的下一跳节点，R7也不会向R5发送组播加入消息，而是会选择其他方式寻找R7的下一跳节点。
可以理解的是，若R7仍然向R5发送组播加入消息，R5由于不支持基于虚拟拓扑标识查询R5的下一跳，则R5会选择物理拓扑中的最短路径寻找下一跳节点(例如通过物理拓扑中的最短路径确定下一跳为R4)并建立转发路径，可能会使得该转发路径的负载过重，容易造成网络阻塞或网络环路。
在一些实施例中，R3和R5可以根据本地配置，或者可以分别根据从R6和R7中接收到的组播加入消息中携带的虚拟拓扑标识200，继续查询该虚拟拓扑对应的路由表，进而确定去往第一组播源和第二组播源的路径。示例性地，经过查询，R3可确定其去往第一组播源的下一跳节点为R2，R5可确定其去往第二组播源的下一跳节点为R1，则R3和R5可分别向R2和R1发送携带虚拟拓扑标识200的组播加入消息。以此类推，经过上述步骤，即可建立组播组的转发路径(也即组播转发路径(source-specific shortest-path tree，SPT))R1-R2-R3-R6和R1-R5-R7。
可以理解的是，在一些技术中建立组播组的转发路径时，通常基于最短路径算法，建立R1-R4-R7的转发路径，会使得该条转发路径的负载较重。本公开实施例提供的方法中，组播组的转发路径可以避开上述R1-R4-R7，从而避免转发路径的负载过重，减轻转发路径的网络拥塞问题，进而保障后续组播网络进行组播通信时，组播流量的转发质量。
场景二、组播网络中的汇聚点(rendezvous point，RP)节点基于泛洪机制通告组播通告消息。
示例性地，如图10所示，图10为场景二对应的组播网络架构的示意图。示例性地，如图10所示，该组播网络架构包括：第一组播源、第二组播源、第一组播接收端、第二组播接收端、第三组播接收端、网络节点R1至网络节点R7。网络节点R2为RP节点。该组播网络中部署了切片功能，该切片功能可以通过FA技术实现。如图10所示，该切片包括了除网络节点R4之外的其他R1-R7节点，假设该切片的虚拟拓扑标识为200，则切片中的节点可根据该虚拟拓扑标识确定在该切片(或者虚拟拓扑)内的转发路径。
在一些实施例中，在第一组播源和第二组播源还未在组播网络中发送组播流量时，网络节点R2(也即RP节点)可以基于泛洪机制，向组播网络中发送组播通告消息(S1，G1)和(S2，G2)，组播通告消息中包括虚拟拓扑标识。
在一些实施例中，与多个组播接收端相连的网络节点R6和网络节点R7，在确定组播接收端的需求(也即用户需求)后，可以基于虚拟拓扑标识，确定其去往R2的下一跳节点，并向下一跳节点发送组播加入消息。例如，R6基于虚拟拓扑标识确定其去往RP的下一跳节点为R3，则R6向R3发送携带虚拟拓扑标识200的组播加入消息。R7基于虚拟拓扑标识确定其去往R2的下一跳节点为R6，则R7向R6发送携带虚拟拓扑标识200的组播加入消息。以此类推，可以建立起R2-R3-R6-R7的RPT路径。
在一些实施例中，若组播网络中不需要RPT到SPT的切换，则即使第一组播源和第二组播源开始发送组播流量后，R6和R7仍然会使用已建立的RPT路径接收组播流量。如果组播网络中需要RPT到SPT的切换，则在R6和R7接收到第一组播源和/或第二组播源发送的组播流量后，可采用上述场景一中的方式建立转发路径，取消从R2(也即RP节点)到R6和R7的转发路径。在本示例中，将取消从R2到N6/N7的组播流量的转发。
上述主要从方法的角度对本公开实施例的方案进行了介绍。可以理解的是，信息通告装置为了实现上述功能，其包含了执行各个功能相应的硬件结构和软件模块中的至少一个。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，本公开实施例能够以硬件或硬件和计 算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本公开实施例的范围。
可以理解的是，信息通告装置为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本公开实施例描述的各示例的算法步骤，本公开能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本公开的范围。
本公开实施例可以根据上述方法实施例对信息通告装置进行功能模块的划分，例如，可以对应每一个功能划分每一个功能模块，也可以将两个或两个以上的功能集成在一个功能模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件的形式实现。需要说明的是，本公开实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。下面以采用对应每一个功能划分每一个功能模块为例进行说明。
图11为本公开实施例提供的一种信息通告装置的结构示意图。信息通告装置应用于第一节点，可以执行上述方法实施例提供的信息通告方法。如图11所示，信息通告装置300包括：发送模块301、确定模块302和接收模块303。
发送模块301，用于向第二节点发送组播通告消息；组播通告消息用于通告组播组信息；组播通告消息包括虚拟拓扑标识。
在一些实施例中，虚拟拓扑标识为虚拟拓扑的拓扑值，或者，虚拟拓扑标识为虚拟拓扑所属的网络切片的切片值。
在一些实施例中，拓扑值，或者切片值包括以下至少一项：灵活算法FA值、拓扑标识topology ID、切片标识slicing ID。
在一些实施例中，发送模块301，用于在组播通告消息中包括传送位标识的情况下，向第二节点发送组播通告消息；传送位标识用于指示传送组播通告消息。
在一些实施例中，确定模块302，用于基于虚拟拓扑标识，确定组播组的转发路径中第一节点的下一跳节点。
在一些实施例中，确定模块302，用于基于虚拟拓扑标识，确定虚拟拓扑对应的路由表；基于虚拟拓扑对应的路由表，确定第一节点的下一跳节点。
在一些实施例中，确定模块302，用于在满足预设条件的情况下，基于虚拟拓扑标识，确定第一节点的下一跳节点；预设条件包括：由第一节点的所有上一跳节点发送的第一组播加入消息均包括相同的虚拟拓扑标识。
在一些实施例中，确定模块302，还用于在不满足预设条件的情况下，基于物理拓扑对应的路由表，确定第一节点的下一跳节点；向第一节点的下一跳节点发送不包括虚拟拓扑标识的第二组播加入消息。
在一些实施例中，接收模块303，用于接收第三节点发送的组播通告消息。
在一些实施例中，组播通告消息还用于通告组播源信息。
在一些实施例中，虚拟拓扑标识通过以下至少一项指示：标识位、类型长度值TLV、子TLV。
在采用硬件的形式实现上述集成的模块的功能的情况下，本公开实施例提供了上述实施例中所涉及的通信装置的一种结构。如图12所示，该通信装置400包括：处理器402、总线404。在一些实施例中，该通 信装置400还可以包括存储器401；在一些实施例中，该通信装置400还可以包括通信接口403。
处理器402，可以是实现或执行结合本公开实施例所描述的各种示例性的逻辑方框，模块和电路。该处理器402可以是中央处理器，通用处理器，数字信号处理器，专用集成电路，现场可编程门阵列或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。处理器402可以实现或执行结合本公开实施例所描述的各种示例性的逻辑方框，模块和电路。处理器402也可以是实现计算功能的组合，例如包含一个或多个微处理器组合，DSP和微处理器的组合等。
通信接口403，用于与其他设备通过通信网络连接。该通信网络可以是以太网，无线接入网，无线局域网(wireless local area networks，WLAN)等。
存储器401，可以是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(random access memory，RAM)或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。
作为一种实现方式，存储器401可以独立于处理器402存在，存储器401可以通过总线404与处理器402相连接，用于存储指令或者程序代码。处理器402调用并执行存储器401中存储的指令或程序代码时，能够实现本公开实施例提供的信息通告方法、信息处理方法。
另一种实现方式中，存储器401也可以和处理器402集成在一起。总线404，可以是扩展工业标准结构(extended industry standard architecture，EISA)总线等。总线404可以分为地址总线、数据总线、控制总线等。为便于表示，图12中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
本公开的一些实施例提供了一种计算机可读存储介质(例如，非暂态计算机可读存储介质)，该计算机可读存储介质中存储有计算机程序指令，计算机程序指令在计算机上运行时，使得计算机执行如上述实施例中任一实施例的信息通告方法、信息处理方法。
示例性地，上述计算机可读存储介质可以包括，但不限于：磁存储器件(例如，硬盘、软盘或磁带等)，光盘(例如，压缩盘(Compact Disk，CD)、数字通用盘(Digital Versatile Disk，DVD)等)，智能卡和闪存器件(例如，可擦写可编程只读存储器(Erasable Programmable Read-Only Memory，EPROM)、卡、棒或钥匙驱动器等)。本公开描述的各种计算机可读存储介质可代表用于存储信息的一个或多个设备和/或其它机器可读存储介质。术语“机器可读存储介质”可包括但不限于，无线信道和能够存储、包含和/或承载指令和/或数据的各种其它介质。
本公开实施例提供一种包含指令的计算机程序产品，当该计算机程序产品在计算机上运行时，使得该计算机执行上述实施例中任一实施例的信息通告方法、信息处理方法。
以上，仅为本公开的具体实施方式，但本公开的保护范围并不局限于此，任何在本公开揭露的技术范围内的变化或替换，都应涵盖在本公开的保护范围之内。因此，本公开的保护范围应该以权利要求的保护范围为准。

Claims (13)

  1. 一种信息通告方法，其中，所述方法应用于第一节点，并且包括：
    向第二节点发送组播通告消息；其中，所述组播通告消息用于通告组播组信息；所述组播通告消息包括虚拟拓扑标识。
  2. 根据权利要求1所述的方法，其中，所述虚拟拓扑标识为虚拟拓扑的拓扑值，或者，所述虚拟拓扑标识为所述虚拟拓扑所属的网络切片的切片值。
  3. 根据权利要求2所述的方法，其中，所述拓扑值，或者所述切片值包括以下至少一项：灵活算法FA值、拓扑标识topology ID、切片标识slicing ID。
  4. 根据权利要求1所述的方法，其中，所述向第二节点发送所述组播通告消息，包括：
    在所述组播通告消息中包括传送位标识的情况下，向所述第二节点发送所述组播通告消息；其中，所述传送位标识用于指示传送所述组播通告消息。
  5. 根据权利要求1所述的方法，还包括：
    基于所述虚拟拓扑标识，确定组播组的转发路径中的所述第一节点的下一跳节点。
  6. 根据权利要求5所述的方法，其中，所述基于所述虚拟拓扑标识，确定所述组播组的转发路径中所述第一节点的下一跳节点，包括：
    基于所述虚拟拓扑标识，确定所述虚拟拓扑对应的路由表；
    基于所述虚拟拓扑对应的路由表，确定所述第一节点的下一跳节点。
  7. 根据权利要求5所述的方法，其中，所述基于虚拟拓扑标识，确定所述组播组的转发路径中所述第一节点的下一跳节点，包括：
    在满足预设条件的情况下，基于所述虚拟拓扑标识，确定所述第一节点的下一跳节点；
    其中，所述预设条件包括：由所述第一节点的所有上一跳节点发送的第一组播加入消息均包括相同的所述虚拟拓扑标识。
  8. 根据权利要求7所述的方法，还包括：
    在不满足所述预设条件的情况下，基于物理拓扑对应的路由表，确定所述第一节点的下一跳节点；
    向所述第一节点的下一跳节点发送不包括所述虚拟拓扑标识的第二组播加入消息。
  9. 根据权利要求1所述的方法，还包括：
    接收第三节点发送的所述组播通告消息。
  10. 根据权利要求1所述的方法，其中，所述组播通告消息还用于通告组播源信息。
  11. 根据权利要求1所述的方法，其中，所述虚拟拓扑标识通过以下至少一项指示：标识位、类型长度值TLV、子TLV。
  12. 一种通信装置，包括：存储器和处理器；所述存储器和所述处理器耦合；所述存储器用于存储所述处理器可执行的指令；所述处理器执行所述指令时执行根据权利要求1至11中任一项所述的方法。
  13. 一种计算机可读存储介质，其中，所述计算机可读存储介质上存储有计算机指令，当所述计算机指令在电子设备上运行时，使得所述电子设备执行根据权利要求1至11中任一项所述的方法。
PCT/CN2024/125329 2024-03-12 2024-10-16 信息通告方法、通信装置及存储介质 Pending WO2025189751A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202410283952.2A CN120639748A (zh) 2024-03-12 2024-03-12 信息通告方法、通信装置及存储介质
CN202410283952.2 2024-03-12

Publications (1)

Publication Number Publication Date
WO2025189751A1 true WO2025189751A1 (zh) 2025-09-18

Family

ID=96971966

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2024/125329 Pending WO2025189751A1 (zh) 2024-03-12 2024-10-16 信息通告方法、通信装置及存储介质

Country Status (2)

Country Link
CN (1) CN120639748A (zh)
WO (1) WO2025189751A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140122683A1 (en) * 2012-10-30 2014-05-01 Futurewei Technologies, Inc. System and Method for Virtual Network Abstraction and Switching
CN112511319A (zh) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 信息通告、报文转发、报文消除方法、装置、设备和介质
CN116208542A (zh) * 2021-11-30 2023-06-02 中兴通讯股份有限公司 路径通告方法、路径计算方法、电子设备和可读存储介质
CN117424942A (zh) * 2022-07-11 2024-01-19 中兴通讯股份有限公司 报文生成方法、报文传输方法、网络设备、介质及产品

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140122683A1 (en) * 2012-10-30 2014-05-01 Futurewei Technologies, Inc. System and Method for Virtual Network Abstraction and Switching
CN112511319A (zh) * 2020-07-03 2021-03-16 中兴通讯股份有限公司 信息通告、报文转发、报文消除方法、装置、设备和介质
CN116208542A (zh) * 2021-11-30 2023-06-02 中兴通讯股份有限公司 路径通告方法、路径计算方法、电子设备和可读存储介质
CN117424942A (zh) * 2022-07-11 2024-01-19 中兴通讯股份有限公司 报文生成方法、报文传输方法、网络设备、介质及产品

Also Published As

Publication number Publication date
CN120639748A (zh) 2025-09-12

Similar Documents

Publication Publication Date Title
CN111385206B (zh) 报文转发的方法、网络系统、相关设备及计算机存储介质
US20230070345A1 (en) Communication method and apparatus
EP3531617B1 (en) Message transmission method and apparatus, node and computer storage medium
CN101989952B (zh) 一种组播方法及装置
US20190007888A1 (en) Method for determining transmission link and terminal device
US8787160B2 (en) Method, apparatus, and system for judging path congestion
EP3070879A1 (en) Oam performance monitoring method and apparatus
CN114124795A (zh) 一种基于SRv6的数据处理方法及相关网络设备
WO2021000752A1 (zh) 一种在数据中心网络中转发报文的方法及相关装置
US11909546B2 (en) Method and network node for sending and obtaining assert packet
CN112311685A (zh) 一种处理网络拥塞的方法以及相关装置
EP2936751A1 (en) System, method and apparatus to resolve rpf-vector attribute conflicts
WO2022033449A1 (zh) 发送组播报文的方法、获取转发表项的方法及装置
CN116318554A (zh) 网络传输方法及装置
CN113595915A (zh) 转发报文的方法及相关设备
CN116781593A (zh) 数据获取方法、装置、设备及存储介质
WO2025189751A1 (zh) 信息通告方法、通信装置及存储介质
US20260005890A1 (en) Packet generation method, packet transmission method, network device, medium, and product
CN115208829A (zh) 报文处理的方法及网络设备
WO2025232190A1 (zh) 分段路径控制方法、设备、系统和存储介质及程序产品
WO2021164573A1 (zh) 一种指定转发器的选举方法及设备
CN113824754B (zh) 网络设备的通信方法、网络设备及存储介质
WO2023138351A1 (zh) 一种流量转发方法、报文发送方法、消息发送方法及装置
CN115643311A (zh) 一种安全可信路径节点压缩方法
WO2022007653A1 (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: 24929200

Country of ref document: EP

Kind code of ref document: A1