CN1567891B - A method for implementing data service transmission routing - Google Patents
A method for implementing data service transmission routing Download PDFInfo
- 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
- data service
- node
- looped network
- data
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a method of selecting data service transmission path in elastic packet ring (RPR) network, firstly obtaining data service quantity of each node, then determining the transmission path of data service in each node according to the data service quantity of the node and the bandwidth of the RPR network and according to the principle of node-to-node transmission flow balance in the RPR network. It solves the problem of path jam and bandwidth waste and realizes the effective utilization of the bandwidth in the RPR network.
Description
Technical field
The present invention relates to the routing technique in the RPR network (RPR), relate to a kind of method that realizes the selection of data service transmission path among the RPR or rather.
Background technology
RPR is a kind of based on ethernet frame structure and data-oriented looped network technology, uses the mode of dicyclo work.RPR and transmission medium are irrelevant, therefore can expand based on the RPR looped network of RPR technology, and the RPR technology adopt is distributed management, congested control and protection mechanism, and therefore the RPR looped network based on the RPR technology possesses the ability that sends data according to the grade of service.
Aspect the node path selection, the RPR agreement provides the auto discovery mechanism of loop node, each node can both monitor the state of each node in the whole loop, and generates loop topology and routing iinformation thus, is the transmit path of the service selection optimum of this node according to the topology information of loop.According to the RPR standard, professional transmitting-receiving path is to select according to the principle of path optimum, that is to say, in a RPR looped network, if the data service of mailing to another node from a node is walked clockwise direction and need be passed through N node, walking counterclockwise needs through M node, if N＜M, clockwise path optimum then is described, therefore the transmission of clockwise path is walked in data service, on the contrary, if N＞M, anticlockwise path optimum then is described, so the transmission of anticlockwise path is walked in data service.
With the RPR looped network with 5 nodes is example.This RPR ring network structure is referring to Fig. 1, A, B, C, D, E have constituted the RPR looped network, the data service relation is arranged between A wherein, C two nodes, the A node is after generating loop topology according to the RPR agreement, the data service that the C node is mail in discovery need be passed through two nodes of E, D from clockwise direction, and from counterclockwise only needing through B node, therefore the A node sends to the data service meeting selection counter clockwise direction of C node, accordingly, the C node sends to the data service meeting selection clockwise direction of A node.
This optimal route selection method can make each node on the RPR looped network send data service according to the shortest path.But for the RPR looped network, occur the situation that a certain side business is concentrated on the looped network possibly, the road load of promptly a certain side ring is a lot, cause this side ring to pass by and carry, and the load of opposite side loop is lighter, does not also reach the flowing full amount.To send the convergent type business in RPR looped network shown in Figure 1 is example, and the looped network bandwidth is 1G, and the A node is professional convergent point, and the data service that B, C node mail to the A node is 600M, and the data service that D, E node mail to the A node is 100M.According to the RPR agreement, node select to send the path of data service by optimal route selection method, and then clockwise path is walked in the data service of mailing to the A node of B, C node, and anticlockwise path is walked in the data service that D, E node mail to the A node.It is 600M that the method for this transmission data service causes clockwise B, C two internodal data services, B, A two data between nodes business have then surpassed 1G, D, E two internodal data services are 100M, E, A two internodal data services are 200M, and the bandwidth of looped network is 1G, therefore adopt optimal route selection method to select the path can cause B, A two internodal loads of data traffic excessive, and E, A two internodal data services reach the bandwidth traffic of looped network 1G far away.
In sum, adopt optimal route selection method to select the path can't consider the actual loading situation of RPR looped network, can not select optimal path according to the loading condition of each section of looped network reality, and can only select the shortest path, therefore may aggravate the congestion situation of the excessive loop of looped network load, and the bandwidth of the lighter loop of load can't be fully utilized, and caused the waste of whole RPR looped network bandwidth resources.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method that realizes the selection of transmission paths of data business in the RPR looped network, makes node can determine to send the path of data service according to the loading condition of RPR looped network.
For reaching above purpose, technical scheme of the present invention is achieved in that a kind of method that the data service transmission path is selected of realizing, be applicable to that in the RPR looped network, this method may further comprise the steps: a. obtains 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 transmission path flow homeostatic principle in the RPR looped network.
This method may further include, need be if having in the node by the data service of specified path transmission, and 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.
Among the described step a, can 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.
This method may further include, if node increases data service, then selects minor axis to transmit this data service according to the RPR agreement.
This method may further include and 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.
This method can further include, 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 according to the line of apsides flow equalization principle part that this node increases in the data service is transmitted by minor axis, another part transmits by major diameter.
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 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.
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 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.
This method can further include, and 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.The invention provides according to the flow situation of data service in the RPR looped network technical scheme in data traffic transmission path in the specified node in advance, can solve path congestion problem in the RPR looped network, realize effective utilization bandwidth in the RPR looped network by this scheme.
The present invention can also be by satisfying certain user's particular requirement to some data service given transmission path; When the RPR looped network breaks down, select to send the path of data service by node is set, the RPR looped network can not occurred because of looped network the break down loss of data that causes or the problem of waste bandwidth according to the topology information that produces again.
Description of drawings
Fig. 1 is the structural representation of the RPR looped network be made up of 5 nodes;
Fig. 2 determines the flow chart in the data traffic transmission path of node for the present invention program.
Embodiment
Below in conjunction with drawings and the specific embodiments technical scheme of the present invention is done detailed explanation.
The present invention program can directly specify the transmission path of data service in each node by the static configuration mode, solves the problem of the path congestion that prior art may occur with this.
Below in conjunction with Fig. 2 the method for direct specific data service transmission path is elaborated, the method for specific data service transmission path may further comprise the steps:
A, obtain the data business volume of each node in the RPR looped network.
Because the number of users that each node connected in the RPR looped network is known, therefore can obtain the flow of each RPR data service that node sends according to these information analyses, and the ratio of the miscellaneous service in the data service that sends.A maximum data flow value can also be set for each node in the RPR looped network,, the maximum data flow in the whole RPR looped network be fixed by this maximum data flow value is set.
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.
During the transmission path of data service, the data service that certain port in the node can be sent sends by a paths in determining node, and other data services of this node are sent by another paths; Also the data service with certain data characteristic can being sent by a paths, another paths is passed through in other data services of this node send, can also be their combination in any.Here said data characteristic can be the ether source address of input slogan (PORT), data or destination address (MAC), virtual local area network No. (VLAN ID), IP address, transmission control protocol (TCP) port numbers, udp port number, VLAN priority, IP precedence (TOS) etc.
By setting in advance the transmit path of all data services in each node, the congested situation of loop that causes because of a certain side data service set in the RPR looped network that may occur in the time of can guaranteeing can not occur in the whole RPR looped network to adopt the optimal path method to select the path.
Sending the convergent type data service with RPR looped network shown in Figure 1 is example, because B, C node need send to the data service of A node and be 600M, and need sending to the data service of A node, D, E node be 100M, therefore can specify all data of B node all directly to send to the A node, specify the data service of 100M in the C node to send to the A node by the B node, remaining 500M data service sends to the A node by D, E node successively.Like this, the data service of transmitting between B, A two nodes is 700M, and the data service of transmitting between E, A two nodes also is 700M, therefore adopts the method for data service transmit path in the specified node can make the data service of transmitting in the whole RPR looped network relatively more balanced.
In adopting specified node in the RPR looped network of data service transmit path, if certain node need be expanded the data service of this node, then can be at professional its transmission path of specifying of this partial data, under also can the situation of each segment data service traffics equilibrium in guaranteeing the RPR looped network, node be this partial data service selection transmission path according to the current data flow of each section in the RPR looped network.Specifically, can adopt the method for optimal route selection to select transmission path earlier, and judge whether this path reaches the flow boundary that sets in advance, and can be set to congestedly, also can be set to certain fixing flow boundary, such as 80%, if do not reach the flow boundary,, then adopt this optimal path transmitting data service, if reach the flow boundary, then select the transmission of the major diameter outside the optimal path in the RPR looped network.Can also judge further whether major diameter reaches the flow boundary that sets in advance, this flow boundary can be set to congested equally, also can be set to certain fixing flow boundary, such as 80%, if do not reach the flow boundary, then by this major diameter transmission, if reach the flow boundary, then the part in the increasing data service is transmitted by minor axis, another part is transmitted by major diameter.The data service that designated port in the newly-increased data service of this node sends can be transmitted by minor axis, also the data service with certain data characteristic can be transmitted by minor axis, remaining data service is transmitted by major diameter, also the data service that designated port in the newly-increased data service of this node can be sent or the data service with certain data characteristic are transmitted by major diameter, remaining data service is transmitted by minor axis, can also be their combination in any.Here said data characteristic can be the ether source address of input slogan (PORT), data or destination address (MAC), virtual local area network No. (VLAN ID), IP address, transmission control protocol (TCP) port numbers, udp port number, VLAN priority, IP precedence (TOS) etc.
RPR looped network with each node transmitting data service path of appointment shown in Figure 1 is an example below, illustrates node is selected transmission path according to the current data flow of each section in the RPR looped network method.Suppose that the C node need expand the data service of 100M, and the C node learns that the BA section of RPR looped network has only the data business volume of 300M at present, the CB section has only the data business volume of 100M, and the EA section is 700M, and then this part data service that will expand of C node all is transferred to node A by the CBA section.If the C node is learnt the EA section of RPR looped network and the data service of transmission at present of BA section and is 700M that then the C node transmits the data service of half in the 100M data service of expansion by CBA, and second half is transmitted by CDEA.
When the RPR looped network breaks down, the topological structure of RPR looped network becomes the chain structure by loop configuration, the communication path between each node can only have one on the link at this moment, therefore there are not transmission major diameter and transmission minor axis, at this situation, prior art provides two kinds of disturbance switching modes, and a kind of is to turn to adjustment (Steering), and a kind of is solderless wrapped connection (WRAP).If adopt the Steering protected mode, then the RPR looped network is according to original transmission path data service the time, can not continue to transmit this data service downwards because of breaking down if find this path, then this data service is directly abandoned, this method will cause destination node can't receive data service; If adopt the WRAP protected mode; then the RPR looped network is according to original transmission path data service the time; can not continue to transmit this data service downwards because of breaking down if find this path; then this data service is turned back to the node that sends this data service; this node adopts another paths transmission again; this method will increase the node of transmission data service and the load of the transmission of the path between the malfunctioning node, thereby cause the bandwidth in this section path to be wasted.In light of this situation; routing resource when the present invention program also provides protection to switch; if promptly node is found fault to have occurred in the RPR looped network; then node is at first selected trouble-free path between this node and the destination node according to the chain topological structure situation after upgrading, according to this path transmitting data service.
The above only is the present invention program's preferred embodiment, not in order to limit 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 03137714 CN1567891B (en) | 2003-06-20 | 2003-06-20 | A method for implementing data service transmission routing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 03137714 CN1567891B (en) | 2003-06-20 | 2003-06-20 | A method for implementing data service transmission routing |
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 implementing data service transmission routing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1567891B (en) |
Families Citing this family (10)
| 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 | 华为技术有限公司 | Load sharing method |
| JPWO2010092751A1 (en) * | 2009-02-16 | 2012-08-16 | 日本電気株式会社 | Event distribution system, rendezvous node, broker node, load distribution method for event distribution system, load distribution method for rendezvous node, distribution route construction method for broker node, load distribution program, and distribution route construction program |
| CN101860484A (en) | 2010-05-24 | 2010-10-13 | 中兴通讯股份有限公司 | Dynamic adjustment method and network device of switching loop |
| 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)
| 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 |
-
2003
- 2003-06-20 CN CN 03137714 patent/CN1567891B/en not_active Expired - Fee Related
Patent Citations (1)
| 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 |
|---|---|---|
| CN101447929B (en) | Traffic routing method, router and communication system | |
| CN100461755C (en) | Data message transmitting method and node equipment based on MPLS TE tunnel | |
| US7012919B1 (en) | Micro-flow label switching | |
| CN101496357B (en) | Dynamic TE-LSP priority and preemption | |
| US7872991B2 (en) | Methods and systems for providing MPLS-based layer-2 virtual private network services | |
| JP4034782B2 (en) | Ring connection device and data transfer control method | |
| US20030048750A1 (en) | Network system capable of selecting optimal route according to type of transmitted data | |
| US7092359B2 (en) | Method for distributing the data-traffic load on a communication network and a communication network for implementing this method | |
| JP4167072B2 (en) | Selective protection against ring topology | |
| CN1731768A (en) | Method for forwarding traffic in a connectionless communications network | |
| CN102227890A (en) | In-band signalling for point-point packet protection switching | |
| JP2005502275A (en) | Method and apparatus in IP communication network | |
| CN101228739A (en) | Dynamic enforcement of MPLS-TE inter-domain policy and QoS | |
| WO2005034440A1 (en) | Router selecting method and router apparatus | |
| CN101682567A (en) | Method for setting up a logic connecting path in a connection-oriented packet-switched communication network | |
| JP2006262291A (en) | Communication system, communication card, and communication method | |
| CN1567891B (en) | A method for implementing data service transmission routing | |
| JP2006261903A (en) | Communication system, communication card, and communication method | |
| CN110572320A (en) | Named data single-source multi-path routing method, system and medium based on NDN | |
| WO2007019758A1 (en) | A method, system and apparatus for implementing traffic engineering | |
| JP4978520B2 (en) | Network control system, network control device, traffic control method, and program | |
| CN102123089B (en) | Tunnel establishing method and device | |
| US20030002531A1 (en) | Method and device for controlling access to a communications network | |
| CN100428725C (en) | A method for implementing data service transmission routing | |
| Srikitja et al. | On providing survivable QoS services in the next generation Internet |
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 |