A ring network and service data forwarding method

Abstract

The invention discloses a ring network and a service data forwarding method. A root node can send service data to adjacent leaf nodes respectively through ring ports in two forwarding directions, so as to realize two-way sending of service data; The ring port in one forwarding direction receives service data and forwards it out through the ring port in the other forwarding direction, so that the leaf node has both the receiving function and the forwarding function, so that the leaf node can receive two identical service data , and then copy the business data received through the ring port as the source of business data landing and send it to the user equipment to realize the landing of business data. In this way, the root node does not need to be determined by the number of leaf nodes as in the prior art The number of copies, so the number of copies of business data copied by the root node is greatly reduced, which can effectively reduce the bandwidth pressure of the link near the root node.

Description

Technical field [0001] The invention relates to the field of communication technology, in particular to a ring network and a method for forwarding service data. Background technique [0002] As the types of services increase, the complexity of the service increases, and the reliability of the service increases, higher requirements are put forward on the service network, namely, high bandwidth, low delay, and low jitter. In order to meet the requirements of users for services, the only way to group the transmission service network is to put the service in the packet network for transmission. [0003] At present, for multicast services, the Ethernet tree (E-tree) model can be used to carry. Among them, the typical characteristics of the E-tree model include: there are two types of nodes in an E-Tree service, which are the root Nodes and leaf nodes. For the root node, the User Network Interface (UNI) interface of the root node can communicate with the UNI interface of the leaf node. ...

AI Technical Summary

Problems solved by technology

[0003] At present, for multicast services, the Ethernet tree (E-tree) model can be used to carry them. The typical features of the E-tree model include: there are two types of nodes in an E-Tree service, namely the root Nodes and leaf nodes, for the root node, the User Network Interface (UNI) interface of the root node can communicate with the UNI interface of the leaf node, while for the leaf node, the UNI interface of the leaf node can only communicate with the root node UNI interface communication; therefore, when performing multicast business data transmission, the root node needs to determine the number of copies of business data according to the set number of leaf nodes, so as to send the business data to each leaf node and then realize the business data. Landing; in this way, when the root node performs business replication and distribution, as many business landing points as there are, the bandwidth of the business needs to be occupied, which brings great bandwidth pressure to the link close to the root node

Moreover, if the link between the root node and the leaf nodes in the E-tree model fails, the leaf nodes will not be able to receive business data and cannot achieve business landing

Images