CA2607338A1 - Routing method for optimising link capacity and increasing availability - Google Patents
Routing method for optimising link capacity and increasing availability Download PDFInfo
- Publication number
- CA2607338A1 CA2607338A1 CA002607338A CA2607338A CA2607338A1 CA 2607338 A1 CA2607338 A1 CA 2607338A1 CA 002607338 A CA002607338 A CA 002607338A CA 2607338 A CA2607338 A CA 2607338A CA 2607338 A1 CA2607338 A1 CA 2607338A1
- Authority
- CA
- Canada
- Prior art keywords
- routing
- data traffic
- priority level
- routing method
- pkn
- 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.)
- Abandoned
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004891 communication Methods 0.000 claims abstract description 37
- 238000005457 optimization Methods 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 abstract description 16
- 238000011161 development Methods 0.000 description 2
- 230000035484 reaction time Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
-
- 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
-
- 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/02—Topology update or discovery
- H04L45/06—Deflection routing, e.g. hot-potato routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Structure Of Telephone Exchanges (AREA)
- Exchange Systems With Centralized Control (AREA)
Abstract
The invention relates to a routing method for optimising a link capacity and increasing an availability in nodes (x, Y1, Y2, Z) and links (L1, L2) of a packet-based communications network, wherein a routed data transmission (DV) is associated with at least two priority steps (PKn, PKe). A high-priority step data transmission (PKe) is subsequently routed. A low-priority step data transmission (PKn) is afterwards routed. For routing the data transmission (DV) routing methods known per se, whose use is adapted to the requirements of each data transmission (DV), are used. The advantages attained by said invention lie mainly in that the optimal link capacity, a high reliability and a quick error reaction for the corresponding data transmission (DV) are simultaneously obtained. Said invention makes it possible to assign each data transmission (DV) to a high priority step (PKe) such as, for example, a real-time requirement data transmission (DV) is routed in priority by the communications network and the low-priority step (PKn) data transmission (DV) is routed on links (L1, L2).
Description
Description Routing method for optimizing link capacity and increasing availability The invention relates to a routing method for optimizing link capacity and increasing availability in a packet-based communication network comprising nodes and links.
According to definition, a communication network is a resource which comprises network nodes which are remote from one another and which are connected to one another via lines or so-called links. A network node, or also node is a station in the communication network at which at least two or more links come together. In addition, these nodes can also be access points to the communication network and can thus be used as data source or destination for data. The transmission of data from a data source to a destination node for data in a communication network is called data traffic. The connection between two network nodes, which is permanent in most cases, is called a link. The data are transported between the nodes via these linkso In a communication network built up of nodes and links, two types are distinguished on the basis of the switching technology: circuit-switched and packet-based communication networks.
In the circuit-switched communication network such as, for example, telecommunication networks, a continuous channel is switched for the entire duration of a data transport.
In the packet-based communication network such as, for example, X.25 networks or the Internet, no permanent continuous physical channel is made available for a connection for the data traffic but the data are divided into small, individual packets which also have different lengths in some cases. Into these packets, supplementary information for identifying data sources and destination are packed. The supplementary information of these packets is then analyzed by the network nodes through which they pass and the packets are forwarded to the destination by the respective network node.
The analysis of this supplementary information in the individual network nodes and the corresponding forwarding of the individual packets is also called routing or routing method. A network node in which such a routing method is implemented is also called a router.
In conventional packet-based communication networks such as, for example, the Internet, an optimum path for transmitting the data packets - that is to say the data traffic - is usually determined during routing with the aid of so-called metricso Metrics are understood to be fixed routing criteria for which information relating to the paths is stored in the individual network nodes. This information is continuously adapted to the path determined, adjacent network nodes being informed about the links existing in the other adjacent network nodes, and their status.
In a node, an address for the node is usually stored in a so-called routing table for a particular destination which is given by a destination address of the packet. A network node which receives a data packet then evaluates the destination address information integrated in the packet, determines the address of the associated next network node by means of the routing table and forwards the packet to this node in accordance with the metrics via a link. In this manner, the packets are switched from node to node, as it were, by the communication network from the data source to the destination, the links between the nodes being loaded in accordance with the number of data packets which are transmitted via them.
Large packet-based communication networks such as, for example, the Internet, are frequently subdivided into subareas which are again packet-based communication networks. In the Internet, which uses both the Internet Protocol and the Transmission Control Protocol as basic protocol, individual, strictly delimited addressable areas can be defined by a special system.
Such an area is called a domain and can be addressed selectively. If then a data packet is switched within such a defined area - that is to say within a domain - from node to node through the domain from the data source to the destination which can lie within or at the boundaries of the domain, this is also called intra-domain routing.
In most cases, packet-based subnetworks or domains are operated by so-called network operators who, on the one hand, are interested in distributing the entire data traffic in their communication network in such a manner that the capacities of the connections between the nodes, that is to say of the links, are optimally loaded. On the other hand, it is of importance to the network operator that a high availability of their communication network and its services exists in spite of errors on individual links.
The essential routing methods for intra-domain routing in packet-based networks such as, for example, the Internet, operate on the basis of metrics according to which the shortest path at the least cost is sought for the transmission of data packets. Such a routing method known from the prior art is for example, the OSPF (Open Shortest Path First) protocol Version
According to definition, a communication network is a resource which comprises network nodes which are remote from one another and which are connected to one another via lines or so-called links. A network node, or also node is a station in the communication network at which at least two or more links come together. In addition, these nodes can also be access points to the communication network and can thus be used as data source or destination for data. The transmission of data from a data source to a destination node for data in a communication network is called data traffic. The connection between two network nodes, which is permanent in most cases, is called a link. The data are transported between the nodes via these linkso In a communication network built up of nodes and links, two types are distinguished on the basis of the switching technology: circuit-switched and packet-based communication networks.
In the circuit-switched communication network such as, for example, telecommunication networks, a continuous channel is switched for the entire duration of a data transport.
In the packet-based communication network such as, for example, X.25 networks or the Internet, no permanent continuous physical channel is made available for a connection for the data traffic but the data are divided into small, individual packets which also have different lengths in some cases. Into these packets, supplementary information for identifying data sources and destination are packed. The supplementary information of these packets is then analyzed by the network nodes through which they pass and the packets are forwarded to the destination by the respective network node.
The analysis of this supplementary information in the individual network nodes and the corresponding forwarding of the individual packets is also called routing or routing method. A network node in which such a routing method is implemented is also called a router.
In conventional packet-based communication networks such as, for example, the Internet, an optimum path for transmitting the data packets - that is to say the data traffic - is usually determined during routing with the aid of so-called metricso Metrics are understood to be fixed routing criteria for which information relating to the paths is stored in the individual network nodes. This information is continuously adapted to the path determined, adjacent network nodes being informed about the links existing in the other adjacent network nodes, and their status.
In a node, an address for the node is usually stored in a so-called routing table for a particular destination which is given by a destination address of the packet. A network node which receives a data packet then evaluates the destination address information integrated in the packet, determines the address of the associated next network node by means of the routing table and forwards the packet to this node in accordance with the metrics via a link. In this manner, the packets are switched from node to node, as it were, by the communication network from the data source to the destination, the links between the nodes being loaded in accordance with the number of data packets which are transmitted via them.
Large packet-based communication networks such as, for example, the Internet, are frequently subdivided into subareas which are again packet-based communication networks. In the Internet, which uses both the Internet Protocol and the Transmission Control Protocol as basic protocol, individual, strictly delimited addressable areas can be defined by a special system.
Such an area is called a domain and can be addressed selectively. If then a data packet is switched within such a defined area - that is to say within a domain - from node to node through the domain from the data source to the destination which can lie within or at the boundaries of the domain, this is also called intra-domain routing.
In most cases, packet-based subnetworks or domains are operated by so-called network operators who, on the one hand, are interested in distributing the entire data traffic in their communication network in such a manner that the capacities of the connections between the nodes, that is to say of the links, are optimally loaded. On the other hand, it is of importance to the network operator that a high availability of their communication network and its services exists in spite of errors on individual links.
The essential routing methods for intra-domain routing in packet-based networks such as, for example, the Internet, operate on the basis of metrics according to which the shortest path at the least cost is sought for the transmission of data packets. Such a routing method known from the prior art is for example, the OSPF (Open Shortest Path First) protocol Version
2, which, apart from routing, also carries out the processing and forwarding of the routing information. A detailed description of the OSPF protocol can also be found in the document J.Moy, 'OSPF Version 2v , RFC 2328, under httpo//www.ietf.org/rfc/rfc2328etxt, which was published by the Internet Engineering Task Force (IETF).
A further intra-domain routing method known from the prior art in packet-based communication networks is represented by the IS-IS (Intermediate System Intermediate System) protocol which was defined in the document ReCallon "Use of OSI IS-IS for Routing in TCP/IP and Dual Environment", RFC 1195 under httpe//www,ietfeorg/rfc/rfcll95etxt, published by the Internet Engineering Task Force (IETF) and has similarities with the OSPF protocol.
In case of faults in a link or a node, the neighbors of the failed element and the other nodes in the communication network are informed in both protocols - the OSPF protocol and the IS-IS protocol - whereupon the shortest path for the data traffic must be recalculated again by each node. The selection of the path is determined by the topology of the communication network and by the metrics used. In the routing protocols mentioned, the metrics are in most cases selected in such a manner that the data traffic is approximately optimally distributed to the links and thus an optimum link capacity is achieved. However, both routing methods have the disadvantage that in the case of a fault, the information about a failure must first be distributed in the entire network and then a new, shortest path must be determined throughout the network, as a result of which the availability becomes less due to the propagation times for the fault reporting. Although it is possible, in communication networks having propagation times which are not too long, to achieve a fault reaction time - and thus restriction in availability - which is tolerable for many applications with, eog, OPSF routing in combination with accelerated fault detection and accelerated algorithms for path finding, these fault reaction times are not sufficient for applications having extremely high availability and real-time requirements such as, for example, telemedical operations, remote controls for robots etco or for communication networks having extremely long link propagation times such as, e,g, satellite links.
For this reason, a routing method with high reliability for intra-domain routing in packet-based networks was developed as part of the key component for the mobile Internet of the Next Generation (or KING) project, by which method an alternative path is offered in the case of a fault. The so-called Outdegree2 (02) routing, which is described in the document G. Schollmeier, J. Charzinski et ale, "Improving the Resilience in IP Networks" for the High Performance Switching and Routing (HPSR) Workshop 2003 in June 2003 in Turin, Italy, allocates to each node in a communication network two next nodes for each data destination. In the case of a fault, therefore, there is always still one path for the transmission of data packets to the data destination so that a maximum reliability with shortest possible response time is achieved by this approach.
Investigations as part of the KING project have found, however, that the 02 routing method achieves a poorer, higher, link loading because of the detours partially necessary in the data transmission path. Although the 02 routing method achieves very high availability, it has the disadvantage of poor link capacity.
The present invention is based on the object, therefore, of specifying a routing method by means of which both optimum link capacity and high availability for the data traffic are achieved.
According to the invention, the object is achieved by means of a routing method for optimizing link capacity and increasing availability in a packet-based communication network comprising nodes and links, wherein the data traffic to be routed is allocated to one of at least two priority levels, after which the data traffic having a high priority level is routed first, after that the data traffic having a low priority level is routed and in the process, the routing methods used, known per se are adapted to the requirements of the respective data traffic.
In particular the advantages achieved by means of the invention consist in that both optimum link capacity and high reliability and rapid fault response for the corresponding data traffic can be achieved at the same time. It is made possible that the data traffic to which a high priority level has been allocated such as, for example, data traffic with real-time requirements, is forwarded first in the communication network and only then the data traffic having a low priority level is distributed to the links.
Furthermore, it is recommended to use an Outdegree2 routing method known per se, for routing the data traffic having a high priority level because this known routing method offers maximum reliability with shortest possible response time for the data traffic having a high priority level.
In a further embodiment of the invention, it is advantageous if, for routing the data traffic having a low priority level, routing methods for intra-domain routing, known per se, are used because these known routing methods in most cases determine the shortest path in accordance with the respective metrics for the data transmission. This path determination, therefore, achieves optimum link capacity for the data traffic having a low priority level. Above all, it is also achieved that the data traffic having the low priority level is placed onto links which are loaded little by data traffic having a high priority level.
It is particularly advantageous if the Open Shortest Path First protocol, known per se, is used as intra-domain routing protocol for routing the data traffic having a low priority level because this protocol is defined as Version 2 in the Request for Comments (RFC) 2328 of the Internet Engineering Task Force (IETF) and is used by various manufacturers of routers.
It is also advantageous if the Intermediate System Intermediate System protocol, known per se, is used as intra-domain routing protocol for routing the data traffic having a low priority level. This routing protocol is defined by the Request for Comments (RFC) 1195 of the Internet Engineering Task Force (IETF) and is frequently used today as Interior Gateway protocol - meaning for intra-network routing - and for load distribution and by operators of large IP networks.
It is proposed that the respective reliability requirements are utilized as criterion for allocating the data traffic to be routed to one of at least two priority levels. The result is that both traditional Internet services such as, e,g, World Wide Web, E-mail etc, for which a lower reliability is necessary, and highly available real-time services can be offered in communication networks and processed with complex routing methods.
It is also advantageous if the respective Quality-of-Service requirements are utilized as criterion for allocating the data traffic to be routed to one of at least two priority levels. By utilizing the Quality-of-Service requirements, other factors for determining the quality of a service which is offered in a communication network are also utilized for allocating the data traffic to be routed to a priority level. This is of particular importance because Quality-of-Service can be defined differently for different services within a communication network.
A preferred development of the invention also provides that the Internet Protocol is used as basic protocol for the data traffic in the packet-based communication network because the Internet Protocol is independent of the medium used and can therefore be used both in local packet-based communication networks - so-called local area networks - and in long-haul packet-based communication networks - so-called wide area networks.
It is also advantageous if an optimization of the load distribution, known per se, is carried out for the routing method for routing the data traffic having a high priority level as a result of which the reliability and the speed of the data traffic is increased.
It is also advantageous if an optimization of the load distribution, known per se, is carried out for the routing method for routing the data traffic having a low priority level as a result of which the reliability and the speed of the data traffic is increased.
An optimization of the link cost metrics is preferably utilized for optimizing the load distribution since this determines not only short paths but also fast and cost-effective paths.
A preferred development of the invention also provides that first the optimization for routing the data traffic having a high priority level is carried out, then a remaining residual capacity is calculated and for this the routing of the data traffic having a low priority level is carried out because optimum link capacity, high reliability and fast fault response for data traffic of different priority levels can be achieved by this means.
In the text which follows, the invention is explained in greater detail in exemplary manner by referring to the attached figure 1. Figure 1 shows the diagrammatic sequence of the method according to the inventiona In the figure, four nodes X, Yl, Y2 and Z of a communication network are shown, the destination node Z forming the destination for the transmission of the data traffic within the communication network. The other nodes X, Yl, Y2 are connected via links L1, L2 in such a manner that the first link L1 leads from the first node X to the further node Yl and the second link L2 leads from the first node X to the further node Y2.
In a first step 1, the data traffic DV to be routed is marked in accordance with its requirement for reliability and thus allocated to a priority level PKn, PKe. The lower priority level PKn identifies the data traffic DV having normal reliability requirements. The higher priority level PKe marks the data traffic DV having high reliability requirements.
If then the data traffic DV identified by a priority level PKn, PKe reaches the first node X of the communication network in a second step 2, the priority level PKn, PKe of the data traffic DV is evaluated by the first node X in a third step 3. In the first node X - as in all other nodes Y1, Y2 of the communication network - two routing entries per destination node Z are stored. One routing entry defines the path for the routing of the data traffic DV having normal reliability requirements, identified by the lower priority level PKn, to the destination node Z, the shortest path for this data traffic DV being determined on the basis of optimized metrics. The other entry specifies the path for the data traffic DV having high reliability requirement, identified by the higher priority level PKe, to the destination node Z by means of 02 routing.
In a fourth step 4, the data traffic DV having the high reliability requirement, which is marked by the priority level PKe, is now conducted via the first link L1 to the further node Yl to the destination node Z in accordance with the path specified by the 02 routing.
In a fifth step 5, the data traffic DV identified by the priority level PKn is then transmitted along the shortest paths, resulting from the optimized metrics used, via the second link L2 to the further node Y2 to the destination node Z.
As described, step 5 - the determination of the path on the basis of optimized metrics - can be carried out after the path selection for the 02 routing of the data traffic DV having high reliability requirements. As an alternative, however, it is also possible that step 5 is carried out jointly with the path selection for the 02 routing.
A further intra-domain routing method known from the prior art in packet-based communication networks is represented by the IS-IS (Intermediate System Intermediate System) protocol which was defined in the document ReCallon "Use of OSI IS-IS for Routing in TCP/IP and Dual Environment", RFC 1195 under httpe//www,ietfeorg/rfc/rfcll95etxt, published by the Internet Engineering Task Force (IETF) and has similarities with the OSPF protocol.
In case of faults in a link or a node, the neighbors of the failed element and the other nodes in the communication network are informed in both protocols - the OSPF protocol and the IS-IS protocol - whereupon the shortest path for the data traffic must be recalculated again by each node. The selection of the path is determined by the topology of the communication network and by the metrics used. In the routing protocols mentioned, the metrics are in most cases selected in such a manner that the data traffic is approximately optimally distributed to the links and thus an optimum link capacity is achieved. However, both routing methods have the disadvantage that in the case of a fault, the information about a failure must first be distributed in the entire network and then a new, shortest path must be determined throughout the network, as a result of which the availability becomes less due to the propagation times for the fault reporting. Although it is possible, in communication networks having propagation times which are not too long, to achieve a fault reaction time - and thus restriction in availability - which is tolerable for many applications with, eog, OPSF routing in combination with accelerated fault detection and accelerated algorithms for path finding, these fault reaction times are not sufficient for applications having extremely high availability and real-time requirements such as, for example, telemedical operations, remote controls for robots etco or for communication networks having extremely long link propagation times such as, e,g, satellite links.
For this reason, a routing method with high reliability for intra-domain routing in packet-based networks was developed as part of the key component for the mobile Internet of the Next Generation (or KING) project, by which method an alternative path is offered in the case of a fault. The so-called Outdegree2 (02) routing, which is described in the document G. Schollmeier, J. Charzinski et ale, "Improving the Resilience in IP Networks" for the High Performance Switching and Routing (HPSR) Workshop 2003 in June 2003 in Turin, Italy, allocates to each node in a communication network two next nodes for each data destination. In the case of a fault, therefore, there is always still one path for the transmission of data packets to the data destination so that a maximum reliability with shortest possible response time is achieved by this approach.
Investigations as part of the KING project have found, however, that the 02 routing method achieves a poorer, higher, link loading because of the detours partially necessary in the data transmission path. Although the 02 routing method achieves very high availability, it has the disadvantage of poor link capacity.
The present invention is based on the object, therefore, of specifying a routing method by means of which both optimum link capacity and high availability for the data traffic are achieved.
According to the invention, the object is achieved by means of a routing method for optimizing link capacity and increasing availability in a packet-based communication network comprising nodes and links, wherein the data traffic to be routed is allocated to one of at least two priority levels, after which the data traffic having a high priority level is routed first, after that the data traffic having a low priority level is routed and in the process, the routing methods used, known per se are adapted to the requirements of the respective data traffic.
In particular the advantages achieved by means of the invention consist in that both optimum link capacity and high reliability and rapid fault response for the corresponding data traffic can be achieved at the same time. It is made possible that the data traffic to which a high priority level has been allocated such as, for example, data traffic with real-time requirements, is forwarded first in the communication network and only then the data traffic having a low priority level is distributed to the links.
Furthermore, it is recommended to use an Outdegree2 routing method known per se, for routing the data traffic having a high priority level because this known routing method offers maximum reliability with shortest possible response time for the data traffic having a high priority level.
In a further embodiment of the invention, it is advantageous if, for routing the data traffic having a low priority level, routing methods for intra-domain routing, known per se, are used because these known routing methods in most cases determine the shortest path in accordance with the respective metrics for the data transmission. This path determination, therefore, achieves optimum link capacity for the data traffic having a low priority level. Above all, it is also achieved that the data traffic having the low priority level is placed onto links which are loaded little by data traffic having a high priority level.
It is particularly advantageous if the Open Shortest Path First protocol, known per se, is used as intra-domain routing protocol for routing the data traffic having a low priority level because this protocol is defined as Version 2 in the Request for Comments (RFC) 2328 of the Internet Engineering Task Force (IETF) and is used by various manufacturers of routers.
It is also advantageous if the Intermediate System Intermediate System protocol, known per se, is used as intra-domain routing protocol for routing the data traffic having a low priority level. This routing protocol is defined by the Request for Comments (RFC) 1195 of the Internet Engineering Task Force (IETF) and is frequently used today as Interior Gateway protocol - meaning for intra-network routing - and for load distribution and by operators of large IP networks.
It is proposed that the respective reliability requirements are utilized as criterion for allocating the data traffic to be routed to one of at least two priority levels. The result is that both traditional Internet services such as, e,g, World Wide Web, E-mail etc, for which a lower reliability is necessary, and highly available real-time services can be offered in communication networks and processed with complex routing methods.
It is also advantageous if the respective Quality-of-Service requirements are utilized as criterion for allocating the data traffic to be routed to one of at least two priority levels. By utilizing the Quality-of-Service requirements, other factors for determining the quality of a service which is offered in a communication network are also utilized for allocating the data traffic to be routed to a priority level. This is of particular importance because Quality-of-Service can be defined differently for different services within a communication network.
A preferred development of the invention also provides that the Internet Protocol is used as basic protocol for the data traffic in the packet-based communication network because the Internet Protocol is independent of the medium used and can therefore be used both in local packet-based communication networks - so-called local area networks - and in long-haul packet-based communication networks - so-called wide area networks.
It is also advantageous if an optimization of the load distribution, known per se, is carried out for the routing method for routing the data traffic having a high priority level as a result of which the reliability and the speed of the data traffic is increased.
It is also advantageous if an optimization of the load distribution, known per se, is carried out for the routing method for routing the data traffic having a low priority level as a result of which the reliability and the speed of the data traffic is increased.
An optimization of the link cost metrics is preferably utilized for optimizing the load distribution since this determines not only short paths but also fast and cost-effective paths.
A preferred development of the invention also provides that first the optimization for routing the data traffic having a high priority level is carried out, then a remaining residual capacity is calculated and for this the routing of the data traffic having a low priority level is carried out because optimum link capacity, high reliability and fast fault response for data traffic of different priority levels can be achieved by this means.
In the text which follows, the invention is explained in greater detail in exemplary manner by referring to the attached figure 1. Figure 1 shows the diagrammatic sequence of the method according to the inventiona In the figure, four nodes X, Yl, Y2 and Z of a communication network are shown, the destination node Z forming the destination for the transmission of the data traffic within the communication network. The other nodes X, Yl, Y2 are connected via links L1, L2 in such a manner that the first link L1 leads from the first node X to the further node Yl and the second link L2 leads from the first node X to the further node Y2.
In a first step 1, the data traffic DV to be routed is marked in accordance with its requirement for reliability and thus allocated to a priority level PKn, PKe. The lower priority level PKn identifies the data traffic DV having normal reliability requirements. The higher priority level PKe marks the data traffic DV having high reliability requirements.
If then the data traffic DV identified by a priority level PKn, PKe reaches the first node X of the communication network in a second step 2, the priority level PKn, PKe of the data traffic DV is evaluated by the first node X in a third step 3. In the first node X - as in all other nodes Y1, Y2 of the communication network - two routing entries per destination node Z are stored. One routing entry defines the path for the routing of the data traffic DV having normal reliability requirements, identified by the lower priority level PKn, to the destination node Z, the shortest path for this data traffic DV being determined on the basis of optimized metrics. The other entry specifies the path for the data traffic DV having high reliability requirement, identified by the higher priority level PKe, to the destination node Z by means of 02 routing.
In a fourth step 4, the data traffic DV having the high reliability requirement, which is marked by the priority level PKe, is now conducted via the first link L1 to the further node Yl to the destination node Z in accordance with the path specified by the 02 routing.
In a fifth step 5, the data traffic DV identified by the priority level PKn is then transmitted along the shortest paths, resulting from the optimized metrics used, via the second link L2 to the further node Y2 to the destination node Z.
As described, step 5 - the determination of the path on the basis of optimized metrics - can be carried out after the path selection for the 02 routing of the data traffic DV having high reliability requirements. As an alternative, however, it is also possible that step 5 is carried out jointly with the path selection for the 02 routing.
Claims (10)
1. A routing method for optimizing link capacity and increasing availability in a packet-based communication network comprising nodes (X, Y1, Y2, Z) and links (L1, L2), characterized in that the data traffic (DV) to be routed is allocated to one of at least two priority levels (PKn, PKe), wherein reliability requirements and/or Quality-of-Service requirements of the data traffic (DV) to be routed are utilized as criterion for an allocation to one of at least two priority levels, that first the data traffic (DV) having a high priority level (PKe) is routed, that then the data traffic (DV) having a low priority level (PKn) is routed, and that the routing methods used, known per se, are adapted to the requirements of the respective data traffic (DV).
2. The routing method as claimed in claim 1, characterized in that an Outdegree2 routing method, known per se, is used for routing the data traffic (DV) having a high priority level (PKe)e.
3. The routing method as claimed in claim 1 or 2, characterized in that routing methods for intra-domain routing in the Internet, known per se, are used for routing the data traffic (DV) having a low priority level (PKn).
4. The routing method as claimed in claim 3, characterized in that the Open Shortest Path First protocol, known per se, is used as intra-domain routing protocol for routing the data traffic (DV) having a low priority level (PKn).
5. The routing method as claimed in claim 3, characterized in that the Intermediate System Intermediate System protocol, known per se, is used as intra-domain routing protocol for routing the data traffic (DV) having a low priority level (PKn).
6. The routing method as claimed in one of claims 1 to 5, characterized in that the Internet Protocol is used as basic protocol for the data traffic (DV) in the packet-based communication network.
7. The routing method as claimed in one of claims 1 to 6, characterized in that an optimization of the load distribution, known per se, is carried out for the routing method for routing the data traffic (DV) having a high priority level (PKe).
8. The routing method as claimed in one of claims 1 to 7, characterized in that an optimization of the load distribution, known per se, is carried out for the routing method for routing the data traffic (DV) having a low priority level (PKn).
9. The routing method as claimed in claim 8, characterized in that an optimization of the link cost metrics is utilized for optimizing the load distribution.
10. The routing method as claimed in one of claims 1 to 8, characterized in that first the optimization for routing the data traffic (DV) having a high priority level (PKe) is carried out, that then a remaining residual capacity is calculated and that for this, the routing of the data traffic (DV) having a low priority level (PKn) is carried out.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP05103620.0 | 2005-05-02 | ||
| EP05103620A EP1720297A1 (en) | 2005-05-02 | 2005-05-02 | Routing method for the optimisation of the load of links and of the improvement of availability |
| PCT/EP2006/061865 WO2006117319A2 (en) | 2005-05-02 | 2006-04-27 | Routing method for optimising link capacity and increasing availability |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2607338A1 true CA2607338A1 (en) | 2006-11-09 |
Family
ID=36084361
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002607338A Abandoned CA2607338A1 (en) | 2005-05-02 | 2006-04-27 | Routing method for optimising link capacity and increasing availability |
Country Status (7)
| Country | Link |
|---|---|
| EP (2) | EP1720297A1 (en) |
| KR (1) | KR20080013965A (en) |
| CN (1) | CN101228745A (en) |
| AT (1) | ATE434889T1 (en) |
| CA (1) | CA2607338A1 (en) |
| DE (1) | DE502006004068D1 (en) |
| WO (1) | WO2006117319A2 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10897419B2 (en) | 2015-09-30 | 2021-01-19 | Huawei Technologies Co., Ltd. | Method and apparatus for supporting service function chaining in a communication network |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383821B (en) * | 2008-05-28 | 2012-07-04 | 腾讯数码（深圳）有限公司 | Updating method and system for game service installation packet |
| CN101715225B (en) * | 2009-11-20 | 2012-12-05 | 西安电子科技大学 | Routing method of self-adapting self-organized network in cognitive network |
| CN114024892B (en) * | 2021-11-05 | 2023-05-02 | 国网四川省电力公司经济技术研究院 | Information sensitivity aware power sensitive information self-adaptive security routing method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6560230B1 (en) * | 1999-02-01 | 2003-05-06 | Redback Networks Inc. | Packet scheduling methods and apparatus |
| DE10337465B4 (en) * | 2003-08-14 | 2009-10-15 | Nokia Siemens Networks Gmbh & Co.Kg | Method for routing data packets in a packet-switching communications network having a plurality of network nodes |
-
2005
- 2005-05-02 EP EP05103620A patent/EP1720297A1/en not_active Withdrawn
-
2006
- 2006-04-27 EP EP06754876A patent/EP1880521B1/en not_active Not-in-force
- 2006-04-27 KR KR1020077027883A patent/KR20080013965A/en not_active Application Discontinuation
- 2006-04-27 CN CNA2006800150093A patent/CN101228745A/en active Pending
- 2006-04-27 WO PCT/EP2006/061865 patent/WO2006117319A2/en not_active Application Discontinuation
- 2006-04-27 AT AT06754876T patent/ATE434889T1/en active
- 2006-04-27 DE DE502006004068T patent/DE502006004068D1/en active Active
- 2006-04-27 CA CA002607338A patent/CA2607338A1/en not_active Abandoned
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10897419B2 (en) | 2015-09-30 | 2021-01-19 | Huawei Technologies Co., Ltd. | Method and apparatus for supporting service function chaining in a communication network |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2006117319A3 (en) | 2007-01-11 |
| DE502006004068D1 (en) | 2009-08-06 |
| EP1880521A2 (en) | 2008-01-23 |
| CN101228745A (en) | 2008-07-23 |
| KR20080013965A (en) | 2008-02-13 |
| EP1720297A1 (en) | 2006-11-08 |
| ATE434889T1 (en) | 2009-07-15 |
| EP1880521B1 (en) | 2009-06-24 |
| WO2006117319A2 (en) | 2006-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7529239B2 (en) | Distributed dynamic routing | |
| US11108662B2 (en) | Dynamic switching between edge nodes in autonomous network system | |
| US8576721B1 (en) | Local forwarding bias in a multi-chassis router | |
| EP1516460B1 (en) | Dynamic routing on networks | |
| US5953312A (en) | Method and apparatus for determining alternate routes in a network using a connection-oriented protocol | |
| US20090116488A1 (en) | Method for distributing traffic by means of hash codes according to a nominal traffic distribution scheme in a packet-oriented network employing multi-path routing | |
| US8154993B2 (en) | Method for providing alternative paths as a rapid reaction to the failure of a link between two routing domains | |
| US20070074281A1 (en) | Presence-base packet routing control apparatus and packet routing control method | |
| EP1502395B1 (en) | Traffic network flow control using dynamically modified metrics for redundancy connections | |
| US8023435B2 (en) | Distribution scheme for distributing information in a network | |
| US7133402B2 (en) | Link identifier assignment system in connection-oriented communication network | |
| US20060274718A1 (en) | Inter-domain multipath routing method | |
| CN103297340A (en) | Routing convergence method and device in multi-protocol label switching (MPLS) and border gateway protocol (BGP) networking | |
| CA2496345C (en) | Efficient intra-domain routing in packet-switched networks | |
| CA2607338A1 (en) | Routing method for optimising link capacity and increasing availability | |
| US7969988B2 (en) | Method and independent communications subnet for determining label-switched routes a communications subnet of this type | |
| JP4623317B2 (en) | Communication apparatus, routing method and program | |
| US20100329154A1 (en) | Efficient calculation of routing tables for routing based on destination addresses | |
| Hoogendoorn et al. | Towards carrier-grade next generation networks | |
| EP2204054A1 (en) | Method and apparatus for providing a distributed forwarding plane for a mobility home agent | |
| US8027343B2 (en) | Communication system, computer, and method for determining a communication protocol to be used in a communication system | |
| KR20000025746A (en) | Method for routing services when link failure occurs temporarily on internet | |
| US20070019554A1 (en) | Method and network nodes for path searching in a packet-oriented communication network | |
| WO2007051490A1 (en) | Distributing routing information in autonomous systems | |
| EP3939219A1 (en) | A system and a method for routing traffic in an mpls network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |