CN1567891B - A method for realizing data service transmission path selection - Google Patents

A method for realizing data service transmission path selection Download PDF

Info

Publication number
CN1567891B
CN1567891B CN 03137714 CN03137714A CN1567891B CN 1567891 B CN1567891 B CN 1567891B CN 03137714 CN03137714 CN 03137714 CN 03137714 A CN03137714 A CN 03137714A CN 1567891 B CN1567891 B CN 1567891B
Authority
CN
China
Prior art keywords
node
data service
data
path
rpr
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.)
Expired - Fee Related
Application number
CN 03137714
Other languages
Chinese (zh)
Other versions
CN1567891A (en
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN 03137714 priority Critical patent/CN1567891B/en
Publication of CN1567891A publication Critical patent/CN1567891A/en
Application granted granted Critical
Publication of CN1567891B publication Critical patent/CN1567891B/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

本发明公开了弹性分组环网(RPR)中的一种实现对数据业务传输路径选择的方法,首先获取各个节点的数据业务量,再根据节点的数据业务量和RPR环网的带宽,按照RPR环网中各个节点间的传输流量均衡原则确定每个节点中数据业务的传输路径。该方法解决了现有技术在传输数据业务时不能根据RPR环网中各段的实际负载情况选择最佳传输路径,只能选择最短路径,容易造成路径拥塞,并导致带宽浪费的问题,实现了对RPR环网中带宽的有效利用。

Figure 03137714

The invention discloses a method for realizing data service transmission path selection in a resilient packet ring network (RPR). The transmission path of the data service in each node is determined by the principle of transmission traffic balance among various nodes in the ring network. This method solves the problem in the prior art that the best transmission path cannot be selected according to the actual load conditions of each segment in the RPR ring network when transmitting data services, and only the shortest path can be selected, which is likely to cause path congestion and lead to bandwidth waste. Effective utilization of bandwidth in the RPR ring network.

Figure 03137714

Description

一种实现对数据业务传输路径选择的方法A method for realizing data service transmission path selection

技术领域 technical field

本发明涉及弹性分组环网(RPR)中的路径选择技术,更确切地说是涉及RPR中的一种实现对数据业务传输路径选择的方法。The present invention relates to a path selection technology in a resilient packet ring (RPR), more precisely, a method for realizing data service transmission path selection in the RPR.

背景技术 Background technique

RPR是一种基于以太网帧结构、且面向数据的环网技术,使用双环工作的方式。RPR与传输媒体无关,因此基于RPR技术的RPR环网可扩展,并且RPR技术采用的是分布式的管理、拥塞控制与保护机制,因此基于RPR技术的RPR环网具备根据服务等级发送数据的能力。RPR is a data-oriented ring network technology based on the Ethernet frame structure and uses a double-ring working mode. RPR has nothing to do with transmission media, so the RPR ring network based on RPR technology can be expanded, and RPR technology uses a distributed management, congestion control and protection mechanism, so the RPR ring network based on RPR technology has the ability to send data according to the service level .

在节点路径选择方面,RPR协议提供了环路节点的自动发现机制,每个节点都能够监视整个环路中各个节点的状态,并由此生成环路拓扑和路由信息,根据环路的拓扑信息为本节点的业务选择最优的发送路径。根据RPR标准,业务的收发路径是按照路径最优的原则选择,也就是说,在一个RPR环网中,从一个节点发往另一个节点的数据业务如果走顺时针方向需要经过N个节点,走逆时针方向需要经过M个节点,如果N<M,则说明顺时针方向的路径最优,因此数据业务走顺时针方向的路径发送,相反,如果N>M,则说明逆时针方向的路径最优,因此数据业务走逆时针方向的路径发送。In terms of node path selection, the RPR protocol provides an automatic discovery mechanism for ring nodes. Each node can monitor the status of each node in the entire ring, and thus generate ring topology and routing information. According to the topology information of the ring Select the optimal sending path for the business of this node. According to the RPR standard, the sending and receiving path of the service is selected according to the principle of the optimal path. That is to say, in an RPR ring network, if the data service sent from one node to another node goes clockwise, it needs to pass through N nodes. It needs to go through M nodes in the counterclockwise direction. If N<M, it means that the path in the clockwise direction is the best, so the data service is sent on the path in the clockwise direction. On the contrary, if N>M, it means that the path in the counterclockwise direction is the best. Optimum, so the data service is sent along the path in the counterclockwise direction.

以具有5个节点的RPR环网为例。该RPR环网结构参见图1,A、B、C、D、E构成了RPR环网,其中的A、C两节点之间有数据业务关系,A节点在根据RPR协议生成环路拓扑后,发现发往C节点的数据业务从顺时针方向需要经过E、D两个节点,而从逆时针方向只需要经过B节点,因此A节点发送到C节点的数据业务会选择逆时针方向,对应地,C节点发送到A节点的数据业务会选择顺时针方向。Take the RPR ring network with 5 nodes as an example. The structure of the RPR ring network is shown in Figure 1. A, B, C, D, and E constitute the RPR ring network. There is a data service relationship between nodes A and C. After node A generates the ring topology according to the RPR protocol, It is found that the data service sent to node C needs to pass through two nodes E and D in the clockwise direction, but only needs to pass through node B in the counterclockwise direction, so the data service sent from node A to node C will choose the counterclockwise direction, correspondingly , the data service sent from node C to node A will choose a clockwise direction.

这种最优路径选择方法可以使RPR环网上各个节点按照最短的路径发送数据业务。但是对于RPR环网来说,很可能会出现环网上某一侧业务集中的情况,即某一侧环路负载很多,造成该侧环路过载,而另一侧环路负载较轻,还没有达到满流量。以在图1所示的RPR环网中发送汇聚型业务为例,环网带宽为1G,A节点为业务的汇聚点,B、C节点发往A节点的数据业务均为600M,D、E节点发往A节点的数据业务均为100M。根据RPR协议,节点通过最优路径选择方法选择发送数据业务的路径,则B、C节点发往A节点的数据业务走顺时针方向的路径,D、E节点发往A节点的数据业务走逆时针方向的路径。这种发送数据业务的方法导致顺时针方向的B、C两节点间的数据业务为600M,B、A两节点之间的数据业务则超过了1G,D、E两节点间的数据业务为100M,E、A两节点间的数据业务为200M,而环网的带宽为1G,因此采用最优路径选择方法选择路径会造成B、A两节点间的数据业务负载过量,而E、A两节点间的数据业务远未达到环网1G的带宽流量。This optimal path selection method can enable each node on the RPR ring network to send data services according to the shortest path. However, for the RPR ring network, it is likely that the business concentration on one side of the ring network will occur, that is, the ring load on one side is heavy, causing the ring on this side to be overloaded, while the ring load on the other side is light. to full flow. Take the aggregation service sent in the RPR ring network shown in Figure 1 as an example. The bandwidth of the ring network is 1G. Node A is the service convergence point. The data services sent by nodes B and C to node A are both 600M. The data services sent by nodes to node A are all 100M. According to the RPR protocol, the node selects the path for sending data services through the optimal path selection method, then the data services sent by nodes B and C to node A take a clockwise path, and the data services sent by nodes D and E to node A go in the reverse direction The path in the clockwise direction. This method of sending data services results in a clockwise data service between nodes B and C of 600M, a data service between nodes B and A of more than 1G, and a data service between nodes D and E of 100M , the data traffic between nodes E and A is 200M, and the bandwidth of the ring network is 1G, so choosing the path using the optimal path selection method will cause excessive data traffic load between nodes B and A, while nodes E and A The data service between the ring network is far from reaching the 1G bandwidth flow of the ring network.

综上所述,采用最优路径选择方法选择路径无法考虑到RPR环网的实际负载情况,不能根据环网各段实际的负载情况选择最优路径,而只能选择最短的路径,因此可能会加剧环网负载过量环路的拥塞情况,而负载较轻的环路的带宽无法得到充分的利用,造成了整个RPR环网带宽资源的浪费。To sum up, using the optimal path selection method to select the path cannot take into account the actual load conditions of the RPR ring network, and the optimal path cannot be selected according to the actual load conditions of each segment of the ring network, but only the shortest path can be selected, so it may be This aggravates the congestion of the ring network with excessive load, while the bandwidth of the ring with light load cannot be fully utilized, resulting in a waste of the bandwidth resources of the entire RPR ring network.

发明内容 Contents of the invention

有鉴于此,本发明的主要目的在于提供RPR环网中的一种实现对数据业务的传输路径选择的方法,使节点可以根据RPR环网的负载情况确定发送数据业务的路径。In view of this, the main purpose of the present invention is to provide a method for selecting a transmission path for data services in the RPR ring network, so that nodes can determine the path for sending data services according to the load condition of the RPR ring network.

为达到以上目的,本发明的技术方案是这样实现的:一种实现对数据业务传输路径选择的方法,适用于RPR环网中,该方法包括以下步骤:a.获取RPR环网中每个节点的数据业务量;In order to achieve the above object, the technical solution of the present invention is achieved in this way: a method for realizing data service transmission path selection is applicable in the RPR ring network, and the method comprises the following steps: a. obtaining each node in the RPR ring network of data traffic;

b.根据节点的数据业务量和RPR环网的带宽,按照RPR环网中各个节点间的传输路径流量均衡原则确定每个节点中数据业务的传输路径。b. According to the data service volume of the node and the bandwidth of the RPR ring network, the transmission path of the data service in each node is determined according to the principle of equalization of transmission path traffic between nodes in the RPR ring network.

该方法可以进一步包括,如果节点中有需要通过指定路径传输的数据业务,则指定该数据业务的传输路径为该指定路径;否则,根据节点的数据业务量和RPR环网的带宽,按照RPR环网中各个节点间的传输流量均衡原则确定每个节点中数据业务的传输路径。The method may further include, if there is a data service that needs to be transmitted through a specified path in the node, specifying the transmission path of the data service as the specified path; otherwise, according to the data traffic volume of the node and the bandwidth of the RPR ring network, according to the RPR ring The transmission flow balance principle among each node in the network determines the transmission path of the data service in each node.

所述步骤a中,可以预先设置RPR环网中每个节点最大的数据业务量,所述步骤b中,根据每个节点的最大数据业务量和RPR环网的带宽,按照RPR环网中各个节点间的传输流量均衡原则确定每个节点中数据业务的传输路径。In the step a, the maximum data traffic volume of each node in the RPR ring network can be preset, and in the step b, according to the maximum data traffic volume of each node and the bandwidth of the RPR ring network, according to each node in the RPR ring network The transmission flow balancing principle between nodes determines the transmission path of data services in each node.

该方法可以进一步包括,如果节点增加数据业务,则根据RPR协议选择短径传输该数据业务。The method may further include, if the node adds a data service, selecting a short path to transmit the data service according to the RPR protocol.

该方法可以进一步包括预先设置流量界限,判断选择的短径是否达到所述预先设置的流量界限,如果没达到,则通过该短径传输该节点所增加的数据业务,如果达到,则选择RPR环网中的长径传输该节点所增加的数据业务。The method may further include presetting the flow limit, judging whether the selected short path reaches the preset flow limit, if not, then transmitting the increased data service of the node through the short path, and if so, selecting the RPR ring The long path in the network transmits the data service added by the node.

该方法还可以进一步包括,判断该RPR环网中的长径是否达到预先设置的流量界限,如果没达到,则通过该长径传输该节点所增加的数据业务,如果达到,则根据长短径流量均衡原则将该节点所增加数据业务中的一部分通过短径传输,另一部分通过长径传输。The method may further include, judging whether the long path in the RPR ring network reaches a preset flow limit, if not, then transmitting the increased data service of the node through the long path, and if it is, then according to the long and short path flow rate The principle of balance is to transmit part of the data services added by the node through the short path, and the other part through the long path.

在长径达到预先设置的流量界限时,所述通过长径传输的数据业务为该节点新增数据业务中指定端口发送来的数据业务或具有相同数据特性的数据业务,所述通过短径传输的数据业务为该节点所增加数据业务中通过长径传输外的其余部分。When the long path reaches the preset flow limit, the data service transmitted through the long path is the data service sent from the designated port in the new data service of the node or the data service with the same data characteristics, and the data service transmitted through the short path The data service is the remaining part of the added data service of the node except through the long-path transmission.

在长径达到预先设置的流量界限时,所述通过短径传输的数据业务为该节点新增数据业务中指定端口发送来的数据业务或具有相同数据特性的数据业务,所述通过长径传输的数据业务为该节点所增加数据业务中通过短径传输外的其余部分。When the long path reaches the preset flow limit, the data service transmitted through the short path is the data service sent from the designated port in the new data service of the node or the data service with the same data characteristics, and the data service transmitted through the long path The data service of the node is the remaining part of the added data service of the node except the short-path transmission.

该方法还可以进一步包括,在RPR环网出现故障时,节点根据更新后的链形拓扑结构选择该节点与目的节点之间无故障的路径传输数据业务。本发明提供了根据RPR环网中数据业务的流量情况预先指定节点中数据业务传输路径的技术方案,通过该方案可以解决RPR环网中的路径拥塞问题,实现对RPR环网中带宽的有效利用。The method may further include, when the RPR ring network fails, the node selects a fault-free path between the node and the destination node to transmit data services according to the updated chain topology. The present invention provides a technical solution for pre-designating the data service transmission path in the node according to the traffic conditions of the data service in the RPR ring network, through which the problem of path congestion in the RPR ring network can be solved, and the effective utilization of the bandwidth in the RPR ring network can be realized .

本发明还可以通过对某些数据业务指定传输路径来满足某些用户的特定要求;通过设置节点在RPR环网发生故障时根据重新产生的拓扑信息选择发送数据业务的路径,使RPR环网不会出现因环网发生故障而导致的数据丢失或浪费带宽的问题。The present invention can also meet the specific requirements of some users by specifying the transmission path for some data services; by setting nodes to select the path for sending data services according to the regenerated topology information when the RPR ring network fails, the RPR ring network will not There will be problems of data loss or wasted bandwidth due to failure of the ring network.

附图说明 Description of drawings

图1为由5个节点组成的RPR环网的结构示意图;Fig. 1 is the structural representation of the RPR ring network that is made up of 5 nodes;

图2为本发明方案确定节点的数据业务传输路径的流程图。Fig. 2 is a flow chart of determining a data service transmission path of a node in the solution of the present invention.

具体实施方式 Detailed ways

下面结合附图及具体实施例对本发明的技术方案作详细的说明。The technical solution of the present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.

本发明方案可以通过静态配置方式直接指定每个节点中数据业务的传输路径,以此来解决现有技术可能会出现的路径拥塞的问题。The solution of the present invention can directly specify the transmission path of the data service in each node through a static configuration mode, so as to solve the problem of path congestion that may occur in the prior art.

下面结合图2对直接指定数据业务传输路径的方法作详细说明,指定数据业务传输路径的方法包括以下步骤:Below in conjunction with Fig. 2, the method for directly specifying the data service transmission path is described in detail, and the method for specifying the data service transmission path includes the following steps:

A、获取RPR环网中每个节点的数据业务量。A. Obtain the data service volume of each node in the RPR ring network.

由于RPR环网中每个节点所连接的用户数量是已知的,因此可以根据这些信息分析获得每个RPR节点所发送数据业务的流量,及所发送数据业务中各种业务的比例。还可以为RPR环网中的每个节点设置一个最大数据流量值,通过设置该最大数据流量值,使整个RPR环网中的最大数据流量固定。Since the number of users connected to each node in the RPR ring network is known, the flow of data services sent by each RPR node and the proportion of various services in the sent data services can be obtained by analyzing the information. It is also possible to set a maximum data flow value for each node in the RPR ring network, and by setting the maximum data flow value, the maximum data flow rate in the entire RPR ring network is fixed.

B、根据节点的数据业务量和RPR环网的带宽,按照RPR环网中各个节点间的传输流量均衡原则确定每个节点中数据业务的传输路径。B. According to the data service volume of the node and the bandwidth of the RPR ring network, the transmission path of the data service in each node is determined according to the principle of balancing the transmission flow between each node in the RPR ring network.

在确定节点中数据业务的传输路径时,可以将节点中某些端口发送来的数据业务通过一条路径发送,将该节点的其他数据业务通过另一条路径发送;也可以将具有某种数据特性的数据业务通过一条路径发送,将该节点的其他数据业务通过另一条路径发送,还可以是它们的任意组合。这里所说的数据特性可以是输入端口号(PORT)、数据的以太源地址或目的地址(MAC)、虚拟局域网号(VLAN ID)、IP地址、传输控制协议(TCP)端口号、UDP端口号、VLAN优先级、IP优先级(TOS)等。When determining the transmission path of the data service in the node, the data service sent from some ports in the node can be sent through one path, and the other data services of the node can be sent through another path; The data service is sent through one path, and other data services of the node are sent through another path, or any combination of them. The data characteristics mentioned here can be input port number (PORT), Ethernet source address or destination address (MAC) of data, virtual local area network number (VLAN ID), IP address, transmission control protocol (TCP) port number, UDP port number , VLAN priority, IP priority (TOS), etc.

通过预先设置每个节点中所有数据业务的发送路径,可以保证整个RPR环网中不会出现采用最优路径方法选择路径时可能出现的因RPR环网中某一侧数据业务集中而导致的环路拥塞的情况。By setting the transmission path of all data services in each node in advance, it can be ensured that the loop caused by the concentration of data services on one side of the RPR ring network will not appear in the entire RPR ring network when the path is selected using the optimal path method. Road congestion situation.

以图1所示的RPR环网发送汇聚型数据业务为例,由于B、C节点需要发送给A节点的数据业务均为600M,而D、E节点需要发送给A节点的数据业务均为100M,因此可以指定B节点的所有数据都直接发送给A节点,指定C节点中100M的数据业务通过B节点发送给A节点,其余的500M数据业务依次通过D、E节点发送给A节点。这样,B、A两节点间传输的数据业务为700M,E、A两节点间传输的数据业务也为700M,因此采用指定节点中数据业务发送路径的方法可以使整个RPR环网中传输的数据业务比较均衡。Take the RPR ring network shown in Figure 1 as an example to send converged data services. Since the data services that nodes B and C need to send to node A are both 600M, and the data services that nodes D and E need to send to node A are both 100M , so all the data of node B can be specified to be sent directly to node A, the data service of 100M in node C can be sent to node A through node B, and the remaining 500M data services can be sent to node A through nodes D and E in turn. In this way, the data service transmitted between nodes B and A is 700M, and the data service transmitted between nodes E and A is also 700M. Therefore, the data service transmission path in the specified node can make the data transmitted in the entire RPR ring network The business is relatively balanced.

在采用指定节点中数据业务发送路径的RPR环网中,如果某个节点需要扩展本节点的数据业务,则可以针对该部分数据业务指定其传输路径,也可以在保证RPR环网中各段数据业务流量均衡的情况下,节点根据RPR环网中各段的当前数据流量为该部分数据业务选择传输路径。具体来说,可以先采用最优路径选择的方法选择传输路径,并判断该路径是否达到预先设置的流量界限,可以设置为拥塞,也可以设置为某个固定的流量界限,比如80%,如果没达到流量界限,,则采用该最优路径传输数据业务,如果达到流量界限,则选择RPR环网中最优路径之外的长径传输。还可以进一步判断长径是否达到预先设置的流量界限,该流量界限同样可以设置为拥塞,也可以设置为某个固定的流量界限,比如80%,如果没达到流量界限,则通过该长径传输,如果达到流量界限,则将所增加数据业务中的一部分通过短径传输,将另一部分通过长径传输。可以将该节点新增数据业务中指定端口发送来的数据业务通过短径传输,也可以将具有某种数据特性的数据业务通过短径传输,将其余的数据业务通过长径传输,也可以将该节点新增数据业务中指定端口发送来的数据业务或具有某种数据特性的数据业务通过长径传输,将其余的数据业务通过短径传输,还可以是它们的任意组合。这里所说的数据特性可以是输入端口号(PORT)、数据的以太源地址或目的地址(MAC)、虚拟局域网号(VLAN ID)、IP地址、传输控制协议(TCP)端口号、UDP端口号、VLAN优先级、IP优先级(TOS)等。In the RPR ring network that adopts the transmission path of the data service in the specified node, if a node needs to expand the data service of the node, it can specify its transmission path for this part of the data service, or it can ensure that each segment of the data service in the RPR ring network In the case of service flow balance, the node selects a transmission path for the data service of this part according to the current data flow of each segment in the RPR ring network. Specifically, the optimal path selection method can be used to select the transmission path first, and determine whether the path reaches the preset flow limit, which can be set as congestion or a fixed flow limit, such as 80%, if If the flow limit is not reached, the optimal path is used to transmit the data service, and if the flow limit is reached, a long-path transmission other than the optimal path in the RPR ring network is selected. It can also be further judged whether the long path reaches the preset flow limit. The flow limit can also be set as congestion, or it can be set to a fixed flow limit, such as 80%. If the flow limit is not reached, the long path will be transmitted , if the traffic limit is reached, a part of the increased data traffic will be transmitted through the short path, and another part will be transmitted through the long path. The data service sent from the specified port in the new data service of the node can be transmitted through the short path, or the data service with certain data characteristics can be transmitted through the short path, and the remaining data services can be transmitted through the long path, or the Among the newly added data services of the node, the data services sent from the specified port or the data services with certain data characteristics are transmitted through the long path, and the rest of the data services are transmitted through the short path, or any combination of them. The data characteristics mentioned here can be input port number (PORT), Ethernet source address or destination address (MAC) of data, virtual local area network number (VLAN ID), IP address, transmission control protocol (TCP) port number, UDP port number , VLAN priority, IP priority (TOS), etc.

下面以图1所示指定各个节点传输数据业务路径的RPR环网为例,举例说明节点根据RPR环网中各段的当前数据流量选择传输路径的方法。假设C节点需要扩展100M的数据业务,且C节点得知RPR环网的BA段目前只有300M的数据业务量,CB段只有100M的数据业务量,而EA段为700M,则C节点将扩展的这部分数据业务都通过CBA段传输给节点A。如果C节点得知RPR环网的EA段和BA段目前传输的数据业务均为700M,则C节点将扩展的100M数据业务中一半的数据业务通过CBA传输,将另一半通过CDEA传输。Taking the RPR ring network in which each node transmits a data service path as shown in FIG. 1 as an example, the method for nodes to select a transmission path according to the current data traffic of each segment in the RPR ring network is illustrated as an example. Assuming that node C needs to expand the data service of 100M, and node C learns that the BA segment of the RPR ring network currently has only 300M data traffic, the CB segment only has 100M data traffic, and the EA segment is 700M, then C node will expand the These data services are all transmitted to node A through the CBA segment. If the C node knows that the current data traffic transmitted by the EA segment and the BA segment of the RPR ring network is 700M, then the C node will transmit half of the data traffic in the extended 100M data traffic through the CBA, and transmit the other half through the CDEA.

在RPR环网出现故障时,RPR环网的拓扑结构由环形结构变为链形结构,此时链路上各个节点之间的通讯路径只能有一条,因此不存在传输长径和传输短径,针对这种情况,现有技术提供了两种故障倒换方式,一种是转向调整(Steering),一种是绕接(WRAP)。如果采用Steering保护方式,则RPR环网在按照原有的传输路径传输数据业务时,如果发现该路径因出现故障而不能继续向下传输该数据业务,则将该数据业务直接丢弃,这种方法将导致目的节点无法接收到数据业务;如果采用WRAP保护方式,则RPR环网在按照原有的传输路径传输数据业务时,如果发现该路径因出现故障而不能继续向下传输该数据业务,则将该数据业务返回到发送该数据业务的节点,该节点再采用另一条路径传输,这种方法将增加发送数据业务的节点与故障节点之间的路径传输的负载,从而导致该段路径的带宽被浪费。鉴于这种情况,本发明方案还提供了保护倒换时的路径选择方法,即如果节点发现RPR环网中出现了故障,则节点首先根据更新后的链状拓扑结构情况选择该节点与目的节点之间无故障的路径,根据该路径传输数据业务。When the RPR ring network fails, the topology of the RPR ring network changes from a ring structure to a chain structure. At this time, there can only be one communication path between each node on the link, so there is no long transmission path and short transmission path. In view of this situation, the prior art provides two failover modes, one is steering adjustment (Steering), and the other is winding (WRAP). If the Steering protection mode is used, when the RPR ring network transmits data services according to the original transmission path, if it is found that the path cannot continue to transmit the data service downwards due to a fault, the data service will be discarded directly. It will cause the destination node to be unable to receive the data service; if the WRAP protection mode is adopted, when the RPR ring network transmits the data service according to the original transmission path, if it is found that the path cannot continue to transmit the data service downward due to failure, then The data service is returned to the node that sent the data service, and the node uses another path for transmission. This method will increase the load of the path transmission between the node that sends the data service and the faulty node, thus causing the bandwidth of this section of the path to wasted. In view of this situation, the present invention also provides a path selection method during protection switching, that is, if a node finds that a fault has occurred in the RPR ring network, the node first selects the path between the node and the destination node according to the updated chain topology situation. The fault-free path between them, and the data traffic is transmitted according to the path.

以上所述仅为本发明方案的较佳实施例,并不用以限定本发明的范围。The above descriptions are only preferred embodiments of the solutions of the present invention, and are not intended to limit the scope of the present invention.

Claims (9)

1. the method that realization is selected the data service transmission path is applicable in the RPR looped network, it is characterized in that this method may further comprise the steps:
A. obtain the data business volume of each node in the RPR looped network;
B. according to the data business volume of node and the bandwidth of RPR looped network, determine the transmission path of data service in each node according to each internodal delivery flow rate homeostatic principle in the RPR looped network.
2. method according to claim 1 is characterized in that described step b is specially:
Need be if having in the node by the data service of specified path transmission, the transmission path of then specifying this data service is this specified path;
Otherwise,, determine the transmission path of data service in each node according to each internodal delivery flow rate homeostatic principle in the RPR looped network according to the data business volume of node and the bandwidth of RPR looped network.
3. method according to claim 1, it is characterized in that among the described step a, set in advance the data business volume of each node maximum in the RPR looped network, among the described step b, according to the maximum data traffic carrying capacity of each node and the bandwidth of RPR looped network, determine the transmission path of data service in each node according to each internodal delivery flow rate homeostatic principle in the RPR looped network.
4. method according to claim 1 is characterized in that this method further comprises, if node increases data service, then selects minor axis to transmit this data service according to the RPR agreement.
5. method according to claim 4, it is characterized in that this method further comprises sets in advance the flow boundary, judge whether the minor axis of selecting reaches the described flow boundary that sets in advance, if do not reach, then transmit the data service that this node increases by this minor axis, if reach, then select the major diameter in the RPR looped network to transmit the data service that this node increases.
6. method according to claim 5, it is characterized in that this method further comprises, judge whether the major diameter in this RPR looped network reaches the flow boundary that sets in advance, if do not reach, then transmit the data service that this node increases by this major diameter, if reach, then the part that this node increases in the data service is transmitted by minor axis according to line of apsides flow equalization principle, another part transmits by major diameter.
7. method according to claim 6, it is characterized in that, when major diameter reaches the flow boundary that sets in advance, described data service by the major diameter transmission increases data service that designated port sends in the data service and/or the data service with identical data characteristic newly for this node, and described data service by the minor axis transmission increases in the data service by the outer remainder of major diameter transmission for this node.
8. method according to claim 6, it is characterized in that, when major diameter reaches the flow boundary that sets in advance, described data service by the minor axis transmission increases data service that designated port sends in the data service and/or the data service with identical data characteristic newly for this node, and described data service by the major diameter transmission increases in the data service by the outer remainder of minor axis transmission for this node.
9. method according to claim 1 is characterized in that this method further comprises, when the RPR looped network broke down, node was selected trouble-free path transmitting data service between this node and the destination node according to the chain topological structure after upgrading.
CN 03137714 2003-06-20 2003-06-20 A method for realizing data service transmission path selection Expired - Fee Related CN1567891B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 03137714 CN1567891B (en) 2003-06-20 2003-06-20 A method for realizing data service transmission path selection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 03137714 CN1567891B (en) 2003-06-20 2003-06-20 A method for realizing data service transmission path selection

Publications (2)

Publication Number Publication Date
CN1567891A CN1567891A (en) 2005-01-19
CN1567891B true CN1567891B (en) 2010-04-21

Family

ID=34470512

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 03137714 Expired - Fee Related CN1567891B (en) 2003-06-20 2003-06-20 A method for realizing data service transmission path selection

Country Status (1)

Country Link
CN (1) CN1567891B (en)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1859280A (en) * 2005-09-28 2006-11-08 华为技术有限公司 Method for selecting ring in resilient packet ring
CN100417138C (en) * 2005-11-19 2008-09-03 华为技术有限公司 A method of load sharing
WO2010092751A1 (en) 2009-02-16 2010-08-19 日本電気株式会社 Event distribution system, rendezvous node, broker node, load distribution method for event distribution system, method for distribution of load on rendezvous node, distribution route construction method for broker node, storage medium on which load distribution program is stored, and storage medium on which distribution route construction program is stored
CN101860484A (en) * 2010-05-24 2010-10-13 中兴通讯股份有限公司 Dynamic Adjustment Method and Network Equipment of Switching Ring
CN103546321B (en) * 2013-10-24 2016-10-12 杭州华三通信技术有限公司 A kind of RPR administration of energy conservation method and device
CN103944819B (en) * 2014-04-15 2017-10-17 新华三技术有限公司 A kind of data message transmission method and equipment
CN105959218A (en) * 2016-05-09 2016-09-21 中国联合网络通信集团有限公司 Network route selection method and network route selection system
CN107547365A (en) * 2017-08-29 2018-01-05 新华三技术有限公司 A kind of message transmissions routing resource and device
CN109743243B (en) * 2019-01-28 2021-08-27 广州广哈通信股份有限公司 Ring network data transmission method and device based on non-peer-to-peer network
CN113079090A (en) 2020-01-06 2021-07-06 华为技术有限公司 Traffic transmission method, node and system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001069865A1 (en) * 2000-03-15 2001-09-20 Infosim Informationstechnik Gmbh Method and system for communication of data via an optimum data path in a network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001069865A1 (en) * 2000-03-15 2001-09-20 Infosim Informationstechnik Gmbh Method and system for communication of data via an optimum data path in a network

Also Published As

Publication number Publication date
CN1567891A (en) 2005-01-19

Similar Documents

Publication Publication Date Title
US11750506B2 (en) System and method for adaptive traffic path management
CN101447929B (en) Traffic routing method, router and communication system
US9654383B2 (en) Route optimization using measured congestion
US8942242B2 (en) Method and apparatus for self-learning of VPNS from combinations of unidirectional tunnels in MPLS/VPN networks
US6832249B2 (en) Globally accessible computer network-based broadband communication system with user-controllable quality of information delivery and flow priority
US7872991B2 (en) Methods and systems for providing MPLS-based layer-2 virtual private network services
US9036474B2 (en) Communication available transport network bandwidth to L2 ethernet nodes
CN104067575B (en) Rerouting technique
JP4167072B2 (en) Selective protection against ring topology
CN103780509B (en) Message forwarding method and routing forwarding device
JP2003078556A (en) Network system, network relay device, network relay monitoring device, and network operation method
CN102804717B (en) Method and device for adjusting IP network load
EP2090035A1 (en) Congestion control in stateless domains
CN104396214B (en) For using the equipment of signaling and the rich-media state and feedback of infrastructure component in path
JP7092813B2 (en) Packet transmission method and equipment
WO2012065466A1 (en) Method and device for allocating aggregated link bandwidth in packet-switched network
CN1567891B (en) A method for realizing data service transmission path selection
CN103416028A (en) System and method for advertising a composite link in interior gateway protocol and/or interior gateway protocol-traffic engineering
CN116112423B (en) A method, device and equipment for determining a path
JP2005057487A (en) Route control device for selecting a plurality of routes, route selection method, program thereof, and recording medium
CN100461764C (en) Method and system for realizing consistent message forwarding path
CN104994019B (en) A kind of horizontal direction interface system for SDN controllers
CN109587058A (en) A kind of selection method and device of flux engineering route
CN100428725C (en) A method for realizing data service transmission path selection
US20230379246A1 (en) Method and Apparatus for Performing Protection Switching in Segment Routing SR Network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20100421

Termination date: 20150620

EXPY Termination of patent right or utility model