CN114157557B - Point-to-multipoint service transmission method and device - Google Patents
Point-to-multipoint service transmission method and device Download PDFInfo
- Publication number
- CN114157557B CN114157557B CN202111313083.6A CN202111313083A CN114157557B CN 114157557 B CN114157557 B CN 114157557B CN 202111313083 A CN202111313083 A CN 202111313083A CN 114157557 B CN114157557 B CN 114157557B
- Authority
- CN
- China
- Prior art keywords
- node
- root
- leaf
- p2mp
- service data
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000005540 biological transmission Effects 0.000 title claims abstract description 27
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 52
- 238000004891 communication Methods 0.000 claims description 7
- 230000001012 protector Effects 0.000 claims 5
- 238000012545 processing Methods 0.000 description 12
- 239000010410 layer Substances 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 239000012792 core layer Substances 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- 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/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
-
- 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/16—Multipoint routing
-
- 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/22—Alternate routing
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application discloses a method and a device for transmitting point-to-multipoint service, wherein the method can comprise the steps that a first node receives service data sent by a directly adjacent upstream node of the first root through the first root; when the immediately adjacent upstream node of the first root is the same node as the immediately adjacent downstream node of a leaf of the first node, the first node takes the first root as an alternative root of the leaf except the leaf in the first node; when the immediately adjacent upstream node of the first root is different from the immediately adjacent downstream node of any leaf of the first node, the first node takes the first root as an alternative root of the leaf of the first node; the method comprises the steps that a leaf of a first node selects one root from alternative roots of the leaf as a current use root, a hooking relation is established between the leaf and the current use root, the leaf receives service data from the current use root according to the hooking relation, and the service data is sent to an immediately adjacent downstream node of the leaf. The protection capability of service transmission in P2MP service can be improved.
Description
The present application is a divisional application of the chinese patent application with application number CN 201710756922.9.
Technical Field
The present invention relates to the field of communications, and in particular, to a method and apparatus for transmitting a point-to-multipoint service.
Background
Point-to-multipoint (English full name: point To Multiple Point, english abbreviation: P2 MP) service is an important service model in Ethernet. The P2MP service is a unidirectional service, and the service is transmitted from a root node (or source end) of the network to an end node (or destination end) corresponding to the root node. The specific transmission process is that the service data is input from a Root (English full name: root) and sent to all leaves (English full name: leaf) of the Root, and all the leaves receive the identical service data. However, in the current P2MP service, the transmission path from the root node to the end node is generally one, which causes that the service cannot be transmitted when a certain link of the transmission path fails. It can be seen that the protection capability of service transmission in the current P2MP service is not strong. How to improve the transmission protection capability of the P2MP service and avoid the report Wen Huanlu becomes a technical problem to be solved.
Disclosure of Invention
The embodiment of the application discloses a method and a device for transmitting point-to-multipoint service, wherein the method can comprise the steps that a first node receives service data sent by a directly adjacent upstream node of the first root through the first root; when the immediately adjacent upstream node of the first root is the same node as the immediately adjacent downstream node of a leaf of the first node, the first node takes the first root as an alternative root of the leaf except the leaf in the first node; when the immediately adjacent upstream node of the first root is different from the immediately adjacent downstream node of any leaf of the first node, the first node takes the first root as an alternative root of the leaf of the first node; the method comprises the steps that a leaf of a first node selects one root from alternative roots of the leaf as a current use root, a hooking relation is established between the leaf and the current use root, the leaf receives service data from the current use root according to the hooking relation, and the service data is sent to an immediately adjacent downstream node of the leaf. The protection capability of service transmission in P2MP service can be improved.
In a first aspect, the present application provides a method for transmitting a point-to-multipoint service, including:
a first node receives service data sent by a second node through a first root, wherein the second node is an upstream node directly adjacent to the first node, and the first node is directly connected with the second node through the first root;
the first node sends service data through a first She Zixiang third node, wherein the third node is a downstream node directly adjacent to the first node, and the first node is directly connected with the third node through the first leaf;
when the second node and the third node are the same node, the first node takes the first root as an alternative root of other leaves except the first leaf in the first node;
when the second node is not the same node as the third node and the second node is not the same as any of the immediately adjacent downstream nodes of the leaves of the first node, the first node treats the first root as an alternative root of the first leaf;
the first node selects one root from all the alternative roots of the first leaf as a current use root, receives first service data from the current use root according to a first hooking relation between the first leaf and the current use root, and sends the first service data through a downstream node directly connected with the first leaf by the first She Zixiang.
In a second aspect, the present application provides a point-to-multipoint service transmitting apparatus, where the apparatus is applied to a first node, and includes: receiving unit, processing unit and sending unit, wherein:
the receiving unit is configured to receive, through a first root, service data sent by a second node, where the second node is an upstream node directly adjacent to the first node, and the first node is directly connected to the second node through the first root;
the sending unit is configured to send service data through a first She Zixiang third node, where the third node is a downstream node directly adjacent to the first node, and the first node is directly connected to the third node through the first leaf;
the processing unit is configured to use the first root as an alternative root of a leaf other than the first leaf in the first node when the second node and the third node are the same node;
the processing unit is further configured to take the first root as an alternative root of the first leaf when the second node is not the same node as the third node and the second node is not the same as any immediately adjacent downstream node of the first leaf.
The processing unit is further configured to select, from the first node, one root from all the candidate roots of the first leaf as a current use root, and according to a first hooking relationship between the first leaf and the current use root, control the receiving unit to receive first service data from the current use root, and control the sending unit to send the first service data through a downstream node directly connected to the first leaf by the first She Zixiang. Therefore, the leaf of the first node can selectively receive the service data from the root of the first node, and the service transmission protection capability in the P2MP service can be improved.
Drawings
Fig. 1 is a schematic flow chart of a method for transmitting a point-to-multipoint service according to an embodiment of the present application;
fig. 2 is a schematic view of a scenario of multipoint service transmission according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a point-to-multipoint service transmission device according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of another point-to-multipoint service transmitting apparatus according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
In this embodiment of the present application, the first node may be any device capable of supporting point-to-multipoint service delivery, for example: switches, routers, etc., and the network layer where the first node is located is not limited, for example: the first node may be a device in the core layer, the convergence layer, or the access layer.
In addition, the embodiment of the application can be applied to a network in which service data such as an Ethernet network or a multiprotocol label switching (English full name: multi-Protocol Label Switching, english abbreviation: MPLS) network is transmitted in one direction in the device.
Referring to fig. 1, fig. 1 is a flow chart of a point-to-multipoint service transmission method according to an embodiment of the present application, as shown in fig. 1, including the following steps:
101. the method comprises the steps that a first node receives service data sent by a second node through a first root, wherein the second node is an upstream node directly adjacent to the first node, and the first node is directly connected with the second node through the first root.
The immediately adjacent upstream node of the first node is illustrated below. For example: in the paths of the node A, the node B, the node C and the node D, the node A is an access node of the whole network, the root of the node A can be a multicast source outside the network, and the immediately adjacent upstream node of the root A of the node B is the node A. In addition, the downstream nodes of leaf C of node B include node C and node D, where node C is the immediate neighboring downstream node of leaf C of node B and node D is the non-immediate neighboring downstream node of leaf B.
Alternatively, the first node may include a plurality of roots, and one or more roots of the immediately adjacent upstream nodes may be roots of the immediately adjacent downstream nodes of the leaf of the first node. In addition, when the directly adjacent upstream node of a root is the directly adjacent downstream node of a leaf of the first node, the directly adjacent upstream node of the root and the first node may be nodes of the same network layer, that is, in this embodiment, two nodes that are a root and a leaf may be two nodes that belong to the same network layer. In addition, there may be one or more common upstream nodes for two nodes that are root and leaf to each other, where the common upstream node here may be a directly adjacent upstream node or a non-directly adjacent upstream node. For example: as shown in fig. 2, the immediately adjacent upstream node of root C of node B is node C, the immediately adjacent downstream node of leaf C of node B is also node C, and the upstream node of root a of node B (where the upstream node may or may not include the immediately adjacent upstream node) includes node a, as well as the upstream node of root a of node C includes node a. Thus node B and node C are root and leaf to each other and node B and node C have a common upstream node a. Of course, node B and node C may also have other roots, which may or may not have a common upstream node. The node B may thus selectively receive data transmitted by node a from node a or node C, so that when a path between node B and node a fails, the node B may choose to receive data forwarded by node a to node C from node C. Alternatively, the first node may choose to receive data from node a that node a forwards to node C when the path between node B and node C fails. In addition, two nodes that are root and leaf to each other may not have a common upstream node.
Alternatively, two nodes that are root and leaf to each other may have one or more common downstream nodes, where the common downstream nodes may be directly adjacent downstream nodes or not directly adjacent upstream nodes. For example: as shown in fig. 2, the immediately upstream node of the root C of the node B is the node C, the immediately downstream node of the leaf C of the node B is also the node C, and the downstream node of the leaf D of the node B (here, the downstream node may include the immediately downstream node or the immediately downstream node not), includes the node D, and the downstream node of the leaf D of the node C also includes the node D. Thus node B and node C are root and leaf to each other and there is a common downstream node D. Of course, node B and node C may have other leaves, and these roots may or may not have a common downstream node. Node D may thus selectively receive data transmitted by node B from node B or node C, so that node D may choose to receive data forwarded by node B to node C from node C when a path between node D and node B fails.
102. The first node sends service data through a first She Zixiang third node, wherein the third node is a downstream node directly adjacent to the first node, and the first node is directly connected with the third node through the first leaf.
The first root may be any root of the first node. In addition, the first node may include a plurality of roots, so that the first node may select service data transmitted through an upstream node of at least one root including the first root from the plurality of roots according to a connection state between the first node and an upstream node of each root of the first node, so as to improve a protection capability of service transmission in the P2MP service.
103. When the second node and the third node are the same node, the first node takes the first root as an alternative root of at least one leaf of the first node except the first leaf.
The second node and the third node are the same node, and will be described below by way of example. For example: in the node architecture shown in fig. 2, the immediately upstream node of the root C of the node B is the node C, the immediately downstream node of the leaf C of the node B is also the node C, so that the node C is the upstream node of the node B and is also the downstream node of the node B, and likewise, the node B is the downstream node of the node C and the node B is also the upstream node of the node C. This allows the first node to receive traffic data from nodes that are root and leaf to the first node, and at the same time, the first node may send traffic data received from other roots to the node.
By step 103, when the directly adjacent upstream node of the first root and the directly adjacent downstream node of a leaf of the first node are the same node, the first root can be used as an alternative root of the leaf of the directly adjacent downstream node of the first root in the first node, which is not the directly adjacent upstream node of the first root, so that the service data received by the first root can not be sent to the directly adjacent upstream node of the first root, and the cyclic transmission of the service data between two nodes which are the root and the leaf can be avoided.
Optionally, step 103 may include:
when the second node and the third node are the same node, the first node takes the first root as an alternative root of at least one leaf except the first leaf in the first node, wherein a downstream node of at least one leaf in the at least one leaf is an upstream node of one root of the first node, and the downstream node is the same downstream node as the first node.
Wherein the downstream nodes in this step include directly adjacent downstream nodes or non-directly adjacent downstream nodes, and the upstream nodes include directly adjacent upstream nodes or non-directly adjacent upstream nodes. For example: as shown in fig. 2, the at least one leaf has a leaf C of a node B, a directly adjacent downstream node of the leaf C is a node C, the node C is a directly adjacent upstream node of the node B, and the nodes downstream of the node C and the node D both include a node D and a node E. Of course, this is merely illustrated with a direct adjacent downstream node and a direct adjacent upstream node, and further, the downstream node may exist in common with the first node, or one or more common downstream nodes may exist.
Thus, the first root can be used as the alternative root of the at least one leaf, and the downstream node of at least one leaf of the leaves and the first node have the same downstream node, so that when the path from the first node to the downstream node fails, the downstream node can select to receive the service data sent by the first node from other nodes, thereby improving the service data protection capability. For example: as shown in fig. 2, node D may choose to receive traffic data from receiving node C when the path between node B and node D fails.
104. When the second node is not the same node as the third node and the second node is not the same as any immediately adjacent downstream node of the leaf of the first node, the first node treats the first root as an alternative root of the first leaf.
When the immediately adjacent upstream node of the first root is not identical to the immediately adjacent downstream node of any leaf of the first node, the first root may then act as an alternative root for any leaf in the first node.
105. The first node selects one root from all the alternative roots of the first leaf as a current use root, receives the service data from the current use root according to a first hooking relation between the first leaf and the current use root, and sends the service data through a downstream node directly connected with the first leaf by the first She Zixiang.
Step 105 is not limited to the first leaf, but may be any leaf in the first node, that is, step 105 is performed on all leaves of the first node, so that the rule that all the leaves in the first node send service data is the same is implemented. In addition, the traffic data received by the first node from the various roots may be identical, so that the leaf receives the same traffic data regardless of which root is selected to receive the traffic data. For example: as shown in fig. 2, node B may receive traffic data from both root a and root C and the traffic data received from both roots may be the same, such that leaf D of node B receives the same traffic data regardless of whether it chooses to receive traffic data from root a or root C.
In addition, the leaf of the first node may select one root from the candidate roots of the leaf as the current use root, and the leaf of the first node may select any root from the candidate roots of the leaf as the current use root; alternatively, the leaf of the first node selects the working root of the leaf from the candidate roots of the leaf as the currently used root, wherein the working root can be understood as the root of the leaf for receiving the service data by default; alternatively, the leaf of the first node selects the non-failed working root from the candidate roots of the leaf as the currently used root.
Optionally, the foregoing steps merely describe receiving service data through the first root, and in this embodiment, the first node may receive service data through other roots in addition to the first root, where for the flow of receiving service data through the first root, reference may be made to the flow of receiving service data through the first root, which is not repeated herein.
It should be noted that, the current root may define a root used at the current time, so in this embodiment, the current root may be a different root at a different time.
It should be noted that, step 103 and step 104 may be performed after step 101; step 103 and step 103 may also be performed before step 101, so that an alternative root of each leaf may be preselected, and when traffic data transmission is performed, it is just to directly select the currently used root.
In this embodiment, the leaf of the first node may selectively receive service data from the root of the first node, so that the protection capability of service transmission in the P2MP service may be improved in this application. Further, when the directly adjacent upstream node of the first node and the directly adjacent downstream node of the first node are the same node, after the first node receives the data sent by the node, the data is not retransmitted to the node, so that a message loop is effectively avoided.
Optionally, when the first root is the current used root and the first root fails, the first node determines that a second root is determined as the current used root from all the alternative roots of the first leaf, and the first node receives the service data from the second root according to a second hooking relationship between the first leaf and the second root, and sends the service data to an immediately adjacent downstream node of the first leaf.
According to the embodiment, when the current use root of the leaf fails, the leaf can select another root from the alternative roots of the leaf to serve as the current use root, and then the service data is received from the current use root, so that the protection capability of the service data is improved. For example: the first root is a working root, and then the second root may be a protection root.
Alternatively, when all candidate roots of a leaf of the first node, including the current root, fail, the first node notifies the immediately adjacent downstream node of the leaf that the leaf is not to be selected as a root.
When all the alternative roots of any leaf in the first node, including the current root, fail, the immediately adjacent downstream node of the leaf cannot transmit the service data transmitted by the first node, so that the immediately adjacent downstream node of the leaf can be informed that the leaf is not selected as the root. Wherein the immediately adjacent downstream node informing the leaf does not select the leaf as a root, it is understood that the immediately adjacent downstream node informing the leaf does not select to receive service data from the first node.
Optionally, the first node may determine whether each root may receive service data sent by an upstream node of the root, if so, determine that the root has no fault, and if not, determine that the root has a fault; or the first node determines whether each root fails through an operation administration maintenance (english: operation Administration and Maintenance, english: OAM) message.
"root" as used herein refers to an input interface in a node and "leaf" refers to an output interface in a node. The node receives the service data sent by the upstream node through the root and sends the service data to the downstream node through the leaf. In the service model of P2MP described in the present application, the rule that all leaves of each node send service data is the same. In addition, the traffic data received by each node from its own respective root may be the same, so that the leaf of that node is the same traffic data received regardless of which root is selected to receive the traffic data. For example: as shown in fig. 2, node B may receive traffic data from both root a and root C and the traffic data received from both roots may be the same, such that leaf D of node B receives the same traffic data regardless of whether it chooses to receive traffic data from root a or root C.
The term "hooking relation" as used in the present application refers to a correspondence relationship between a root and a leaf actually used in message forwarding. For example, node a has a plurality of roots numbered 1,2,3, respectively. Root 1, root 2 and root 3 are each used to receive traffic data sent by, for example, a root node. In the current working state, the main selected root is root 1, namely root 1 is the current used root, after the node receives data from root 1, the leaf corresponding to root 1 is leaf 1, and the corresponding relationship between root 1 and leaf 1 can be called as a first hooking relationship. For another example, if the leaf corresponding to the root 2 is the leaf 2, the correspondence between the root 2 and the leaf 2 may be referred to as a second hooking relationship. Of course, for different roots, the same leaf may be corresponding, and the correspondence between different roots and the same leaf may correspond to different joint relationships, respectively, for guiding message forwarding.
The following is an embodiment of the apparatus for performing the method 100 of the present application, and for convenience of explanation, only the portions relevant to the embodiment of the present application are shown, and specific technical details are not disclosed, please refer to the method 100 for relevant description.
Referring to fig. 3, fig. 3 is a schematic structural diagram of a point-to-multipoint service transport apparatus according to an embodiment of the present application, and the apparatus 300 may be applied to the scenario shown in fig. 2 for executing the method 100 corresponding to fig. 1. As shown in fig. 3, the apparatus 300 includes: a receiving unit 301, a processing unit 302, and a transmitting unit 303. The receiving unit 301 may be specifically configured to perform various service data reception performed by the first node in the method 100, the transmitting unit 303 is configured to perform various data transmission performed by the first node in the method 100, and the processing unit 302 is configured to perform other processing of the apparatus in the method 100 except for the data reception and transmission.
For example, the receiving unit 301 is configured to receive, by using the first root, service data sent by the second node. The sending unit 303 is configured to send the service data through the first She Zixiang third node. The processing unit 302 is configured to, when the second node and the third node are the same node, take the first root as an alternative root of a leaf other than the first leaf in the first node; when the second node is not the same node as the third node and the second node is not the same as any of the immediately adjacent downstream nodes of the leaves of the first node, the processing unit determines that the first root is an alternate root of the first leaf; and the method is also used for selecting one root from all the alternative roots of the first leaf from the first node as a current use root, controlling the receiving unit to receive the service data from the current use root according to a first hooking relation between the first leaf and the current use root, and controlling the sending unit to send the service data through a downstream node directly connected with the first leaf by the first She Zixiang.
The details are described with reference to relevant portions of the method 100, and are not repeated here.
It should be understood that the above division of each unit is merely a division of a logic function, and may be fully or partially integrated into one physical entity or may be physically separated when actually implemented. In this embodiment, both the receiving unit 301 and the sending unit 303 may be implemented by a communication interface, and the processing unit 302 may be implemented by a processor. As shown in fig. 4, the apparatus 400 may include a processor 401, a communication interface 402, and a memory 403. The memory 403 may be used to store a program and code preloaded when the apparatus 400 is shipped from the factory, or may be used to store a code or the like when the processor 401 executes.
It should be appreciated that the apparatus 400 according to the embodiments of the present application may correspond to a first node in the method 100 according to the embodiments of the present application, wherein the communication interface 402 is configured to perform various information transceiving performed by the first node in the method 100, and the processor 401 is configured to perform other processing of the network device in the method 100 than information transceiving. And will not be described in detail herein.
Bus interface 404, which may include any number of interconnected buses and bridges, may also be included in fig. 4, with various circuits of the memory, specifically represented by one or more of the processors and memory, being linked together. The bus interface may also link together various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., which are well known in the art and, therefore, will not be described further herein. The bus interface provides an interface. The communication interface provides a means for communicating with various other apparatus over a transmission medium. The processor is responsible for managing the bus architecture and general processing, and the memory may store data used by the processor in performing operations.
It will also be appreciated by those of skill in the art that the various illustrative logical blocks (illustrative logical block) and steps (steps) described in connection with the embodiments herein may be implemented in electronic hardware, computer software, or combinations of both. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Those skilled in the art may implement the described functionality in varying ways for each particular application, but such implementation is not to be understood as beyond the scope of the embodiments of the present application.
The various illustrative logical blocks and circuits described in the embodiments of the present application may be implemented or performed with a general purpose processor, a digital signal processor, an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the general purpose processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
The steps of a method or algorithm described in the embodiments of the present application may be embodied directly in hardware, in a software element executed by a processor, or in a combination of the two. The software elements may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. In an example, a storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may reside in a UE. In the alternative, the processor and the storage medium may reside in different components in a UE.
It should be understood that, in various embodiments of the present application, the size of the sequence number of each process does not mean that the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), etc.
All parts of the specification are described in a progressive manner, and all parts of the embodiments which are the same and similar to each other are referred to each other, and each embodiment is mainly described as being different from other embodiments. In particular, for apparatus and system embodiments, the description is relatively simple, as it is substantially similar to method embodiments, with reference to the description of the method embodiments section.
The foregoing description of the specification may enable any person skilled in the art to make or use the content of the application, and any modifications may be made based on the disclosure as will be apparent to the person skilled in the art, and the basic principles described herein may be applied to other variations without departing from the spirit and scope of the invention of the application. Thus, the disclosure is not limited to the embodiments and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The foregoing disclosure is only illustrative of the preferred embodiments of the present application and is not intended to limit the scope of the claims herein, as the equivalent of the claims herein shall be construed to fall within the scope of the claims herein.
Claims (22)
1. A method of point-to-multipoint P2MP traffic transmission performed by a first node, the first node comprising a first root, a first leaf, and a second leaf, the method comprising:
receiving first P2MP service data sent by a second node through a third leaf through a first root, wherein the first node is directly connected with the second node through the first root, the first node is directly connected with the third node through the first leaf, and the first node is directly connected with the second root of the second node through the second leaf; in the transmission direction of the first P2MP service data, the second node is an upstream node directly adjacent to the first node, the third node is a downstream node directly adjacent to the first node, and the second node and the third node are different nodes;
the first node forwards the first P2MP service data through the first She Zixiang third node;
the first node does not forward the first P2MP traffic data through the second node of the second She Zixiang;
the root refers to the input interface in the node and the leaf refers to the output interface in the node.
2. The method of claim 1, wherein the first node further comprises a third root, the method further comprising:
receiving second P2MP service data sent by a fourth node through the third root, wherein the first node is directly connected with the fourth node through the third root, the fourth node is an upstream node directly adjacent to the first node in the transmission direction of the second P2MP service data, and the second node is a downstream node directly adjacent to the first node;
forwarding the second P2MP traffic data by the second node through the second She Zixiang.
3. The method of claim 1 or 2, wherein the first root is a root of a protection of the first node.
4. The method of claim 2, wherein the first root is a root of a protection of the first node and the third root is a root of a work of the first node.
5. The method of claim 1 or 2, wherein the first root is a root of a work of the first node.
6. The method of claim 2, wherein the first root is a worker root of the first node and the third root is a protector root of the first node.
7. A first node for transmitting point-to-multipoint P2MP traffic comprising a first root, a first leaf, and a second leaf, comprising:
a memory storing instructions;
a processor coupled to the memory, which when executed by the processor, causes the first node to:
receiving first P2MP service data sent by a second node through a third leaf through a first root, wherein the first node is directly connected with the second node through the first root, the first node is directly connected with the third node through the first leaf, and the first node is directly connected with the second root of the second node through the second leaf; in the transmission direction of the first P2MP service data, the second node is an upstream node directly adjacent to the first node, the third node is a downstream node directly adjacent to the first node, and the second node and the third node are different nodes;
the first node forwards the first P2MP service data through the first She Zixiang third node;
the first node does not forward the first P2MP traffic data through the second node of the second She Zixiang;
the root refers to the input interface in the node and the leaf refers to the output interface in the node.
8. The first node of claim 7, wherein the first node further comprises a third root, the instructions further causing the first node to:
receiving second P2MP service data sent by a fourth node through the third root, wherein the first node is directly connected with the fourth node through the third root, the fourth node is an upstream node directly adjacent to the first node in the transmission direction of the second P2MP service data, and the second node is a downstream node directly adjacent to the first node;
forwarding the second P2MP traffic data by the second node through the second She Zixiang.
9. The first node of claim 7 or 8, wherein the first root is a protection root of the first node.
10. The first node of claim 8, wherein the first root is a root of protection of the first node and the third root is a root of work of the first node.
11. The first node of claim 7 or 8, wherein the first root is a root of a work of the first node.
12. The first node of claim 8, wherein the first root is a worker root of the first node and the third root is a protector root of the first node.
13. A computer storage medium comprising instructions which, when executed by a processor, implement the method of any of claims 1-6.
14. A communication system for transmitting point-to-multipoint P2MP traffic, comprising a first node, a second node and a third node, wherein the first node comprises a first root, a first leaf and a second leaf, and the second node comprises a second root, wherein the first node is configured to:
receiving first P2MP service data sent by a second node through a third leaf through a first root, wherein the first node is directly connected with the second node through the first root, the first node is directly connected with the third node through the first leaf, and the first node is directly connected with the second root of the second node through the second leaf; in the transmission direction of the first P2MP service data, the second node is an upstream node directly adjacent to the first node, the third node is a downstream node directly adjacent to the first node, and the second node and the third node are different nodes;
forwarding the first P2MP traffic data through the third node of the first She Zixiang;
forwarding the first P2MP traffic data not through the second node of the second She Zixiang;
the root refers to the input interface in the node and the leaf refers to the output interface in the node.
15. The communication system of claim 14, further comprising a fourth node, wherein the first node further comprises a third root, wherein the first node is further configured to:
receiving second P2MP service data sent by the fourth node through the third root, wherein the first node is directly connected with the fourth node through the third root, and in the transmission direction of the second P2MP service data, the fourth node is an upstream node directly adjacent to the first node, and the second node is a downstream node directly adjacent to the first node;
forwarding the second P2MP traffic data by the second node through the second She Zixiang.
16. The system of claim 15, wherein the second node comprises a fourth root, the second node configured to:
receiving, by the fourth root, the second P2MP traffic data forwarded by the first node through the second leaf;
the second P2MP traffic data is not forwarded by the first node through the third She Zixiang.
17. The system of any of claims 14-16, wherein the first root is a root of a protection of the first node.
18. The system of claim 15 or 16, wherein the first root is a root of protection of the first node and the third root is a root of work of the first node.
19. The system of claim 16, wherein the first root is a root of a protection of the first node, the third root is a root of a work of the first node, and the fourth root is a root of a work of the second node.
20. The system of any of claims 14-16, wherein the first root is a root of a work of the first node.
21. The system of claim 15 or 16, wherein the first root is a worker root of the first node and the third root is a protector root of the first node.
22. The system of claim 16, wherein the first root is a worker root of the first node, the third root is a protector root of the first node, and the fourth root is a protector root of the second node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111313083.6A CN114157557B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111313083.6A CN114157557B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
| CN201710756922.9A CN109428750B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710756922.9A Division CN109428750B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114157557A CN114157557A (en) | 2022-03-08 |
| CN114157557B true CN114157557B (en) | 2023-12-29 |
Family
ID=65502068
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111313083.6A Active CN114157557B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
| CN201710756922.9A Active CN109428750B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710756922.9A Active CN109428750B (en) | 2017-08-29 | 2017-08-29 | Point-to-multipoint service transmission method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN114157557B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104601464A (en) * | 2015-01-16 | 2015-05-06 | 华为技术有限公司 | Point-to-point service transmission method and device |
| WO2016078332A1 (en) * | 2014-11-17 | 2016-05-26 | 中兴通讯股份有限公司 | Point to multiple point multicast traffic engineering tunnel system and path selection method and apparatus therefor |
| WO2016188025A1 (en) * | 2015-05-22 | 2016-12-01 | 中兴通讯股份有限公司 | Method and device for protecting point-to-multipoint tunnel |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101771561A (en) * | 2008-12-31 | 2010-07-07 | 华为技术有限公司 | Method for creating label forwarding table, node equipment and system |
| CN101710899B (en) * | 2009-12-09 | 2012-12-19 | 中兴通讯股份有限公司 | Method, label switching router (LSR) and system for switching multi-protocol label switching (MPLS) network protection |
| CN102447612B (en) * | 2010-09-30 | 2016-03-30 | 中兴通讯股份有限公司 | Bidirectional point is to multipoint label switched path foundation, grafting and pruning method and system |
| CN102142969B (en) * | 2010-12-31 | 2013-10-02 | 华为技术有限公司 | Method, device and system for establishing P2MP (point to multiple points) |
| CN102904809B (en) * | 2011-07-26 | 2016-08-03 | 华为技术有限公司 | The bandwidth management methods, devices and systems of label forwarding path |
| US9893929B2 (en) * | 2011-09-26 | 2018-02-13 | Tejas Networks Limited | Protection switching method and system for a multi-rooted point-to-multi-point service in a provider backbone bridge (PBB) network |
| CN103178976A (en) * | 2011-12-22 | 2013-06-26 | 迈普通信技术股份有限公司 | Method for multicast tree establishment and fault restoration |
| US9137146B2 (en) * | 2012-12-11 | 2015-09-15 | Futurewei Technologies, Inc. | Enhanced upstream label assignment (ULA) mechanism for point to multi-point (P2MP) and/or multi-point to multi-point (MP2MP) facility protection |
| US9473350B2 (en) * | 2013-09-26 | 2016-10-18 | Futurewei Technologies, Inc. | Protecting a label switched path egress without using downstream labels |
-
2017
- 2017-08-29 CN CN202111313083.6A patent/CN114157557B/en active Active
- 2017-08-29 CN CN201710756922.9A patent/CN109428750B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016078332A1 (en) * | 2014-11-17 | 2016-05-26 | 中兴通讯股份有限公司 | Point to multiple point multicast traffic engineering tunnel system and path selection method and apparatus therefor |
| CN104601464A (en) * | 2015-01-16 | 2015-05-06 | 华为技术有限公司 | Point-to-point service transmission method and device |
| WO2016188025A1 (en) * | 2015-05-22 | 2016-12-01 | 中兴通讯股份有限公司 | Method and device for protecting point-to-multipoint tunnel |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109428750A (en) | 2019-03-05 |
| CN114157557A (en) | 2022-03-08 |
| CN109428750B (en) | 2021-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11496355B2 (en) | Method for processing forwarding device fault, device, and controller | |
| EP2553886B1 (en) | Aggregating data traffic from access domains | |
| US20170111296A1 (en) | Handling dynamic port/lag changes without breaking communication in an extended bridge | |
| US10122618B2 (en) | Path switching method and device | |
| WO2018010555A1 (en) | Northbound interface lte service automatic configuration method, northbound interface apparatus, and storage medium | |
| KR20130055392A (en) | Method and appratus for protection switching in point-to- multipoint network | |
| US20220255847A1 (en) | Packet Sending Method and First Network Device | |
| JP7124206B2 (en) | Packet processing methods and gateway devices | |
| US20140092725A1 (en) | Method and first network node for managing an ethernet network | |
| EP2858302B1 (en) | Connectivity check method of service stream link, related apparatus and system | |
| TW202008756A (en) | Auto-backup method for a network and a network system thereof | |
| WO2014117499A1 (en) | Multicast recovering method and apparatus, and relay device comprising multicast recovering apparatus | |
| US9906435B2 (en) | Method and apparatus for determining intermediate routing node and system | |
| CN104348737B (en) | The transmission method and interchanger of a kind of multicast message | |
| US11153214B2 (en) | In service flow capability update in guaranteed bandwidth multicast network | |
| CN114157557B (en) | Point-to-multipoint service transmission method and device | |
| CN112073285B (en) | Error code notification method and related equipment | |
| EP2693706A1 (en) | Method and device for implementing multi-protection overlapped protection groups | |
| CN111901181A (en) | Processing method for error rate detection and related equipment | |
| US20170317924A1 (en) | Point-to-Multipoint Service Transmission Method and Apparatus | |
| EP2953299A1 (en) | Protection switching method, system and node | |
| CN107347037B (en) | Multicast flow control method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |