WO2004066568A1 - Procede pour devier des paquets de donnees en cas de detection locale de defaillances de liaison par routage multiple - Google Patents
Procede pour devier des paquets de donnees en cas de detection locale de defaillances de liaison par routage multiple Download PDFInfo
- Publication number
- WO2004066568A1 WO2004066568A1 PCT/EP2004/000468 EP2004000468W WO2004066568A1 WO 2004066568 A1 WO2004066568 A1 WO 2004066568A1 EP 2004000468 W EP2004000468 W EP 2004000468W WO 2004066568 A1 WO2004066568 A1 WO 2004066568A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network
- packet
- subnet
- routing
- node
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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
Definitions
- the invention relates to methods for a failed network element ⁇ avoiding routing of a data packet in a packet network with connectionless packet switching.
- routing plays a central role for the reliability of packet transmission over packet networks.
- Conventional packet networks do not guarantee quality criteria.
- current data traffic via the Internet is usually Best effort principle routed, ie that the transmission of data packets is carried out as efficiently as possible but without guaranteeing quality criteria
- MPLS Media Protocol Label Switching
- IP networks In addition to preventing overload, the reaction of the network to malfunctions, such as the failure of a connection section (usually called a link in the specialist literature) or a router or node, is a decisive factor in determining whether quality of service characteristics can be maintained, especially with regard to data traffic under real-time conditions.
- IP networks two routing algorithms are primarily used for routing within domains or autonomous systems (AS), namely distance vector routing and link state routing. With distance vector routing, the distance is minimized in the sense of a metric for the respective destination.
- the routing table then contains the next station or the next hop in terms of the minimum distance to the respective destination.
- a router uses the distance information of its neighboring routers to calculate the distance.
- Link state routing is based on the propagation or distribution of topology information or distance information using so-called link state packets in the entire network or the entire autonomous system.
- inconsistency in the routing tables or routing information held by the routers results in both methods.
- This inconsistency is gradually eliminated as part of the propagation of topology information.
- convergence of the routing information Networks converged with regard to the routing information are inconsistent and have completed their reaction to the incident.
- the transmission of data is impaired, which usually leads to quality leads to reductions. Rapid convergence of the network is therefore an important criterion for the efficiency of a routing algorithm. Because of the faster convergence, the link state algorithm is usually preferred to distance vector routing.
- the object of the invention is to improve the response of packet networks to incidents.
- the method according to the invention allows a quick reaction to the failure of a network element in a packet network with connectionless packet switching.
- the routing of a data packet is restricted to a subnet or subnetwork which does not include the failed network element. Only the network elements comprised by the subnet are then used for routing the data packet.
- Failed network elements can, for example, connecting sections
- Routing restricted to the subnet can be initiated by entering information in the packet header of the data packet that references or designates the subnet to be used for routing.
- IP Internet Protocol
- the area of the DSCP (differentiated services codepoint) field designated as "For experimental use" in the IP protocol header or packet header can be used for the introduction of this information.
- the subnet can be selected such that the failed node represents a leaf node with respect to the subnet, ie a node with only one link to another node in the network.
- the node or leaf node in general
- the node is then not used to reach other nodes while restricting the routing to the subnet.
- the statement is that the subnet does not include the corresponding node, to be interpreted in such a way that routing between non-failed nodes limited to the subnet always avoids the failed node.
- the method according to the invention has the advantage that a rapid reaction to the failure of network elements is possible, which prevents the loss of data packets or the disruption of data connections due to excessively long runtimes of packets as a result of the disruption.
- conventional connection networks that work without a connection
- the convergence of the topology information within the network which is exchanged, for example in the context of link state advertisements, has to be restored after a fault before undisturbed routing is possible again.
- the routing of data packets is traditionally impaired until the topology information converges.
- the method according to the invention can be used for routing restricted to an undisturbed subnet until the topology information of the network has converged again.
- the routing is limited to a subnet only if there is information about a fault in a network element.
- This fault is determined by a node based on the topology information exchanged.
- This node modifies the packet headers of data packets to be forwarded in accordance with the restriction of the routing to a subnetwork which does not contain the failed network element.
- a suitable subnet can be identified on the basis of the topology information about the data network in the network node.
- a number of subnetworks is defined, with a subnetwork being provided for each network element that is likely to fail, which this network element is not contains and which can be used for routing if this network element fails. Routing tables for routing corresponding to the respective subnetworks can then be kept at the network nodes. If a network element fails, a network node then identifies the subnet to be used and uses the associated routing table for the onward transmission of the data packet. By setting information in the packet header, subsequent routers can recognize that the subnetwork not containing the network element is to be used for routing the data packet. The data packet is thus forwarded within the subnet without the subsequent nodes having to be informed about the failure of the network element.
- Network element is to be used, for example, can be kept in tabular form at the nodes of the network.
- the routing can be restricted to one subnet by assigning link costs or weighting factors for the routing. Links that are not covered by the respective subnetwork are given a weighting factor which, due to its high value, prevents routing via the respective link.
- a subnet is then determined, for example, by the allocation of link costs for all links of the data network, links which are covered by the subnet receiving the weight factor 1 and other links the weight factor “infinite” or the highest possible weight factor.
- Fig. 1 A network formed with links and nodes
- Fig. 2 The network of Fig. 1, wherein a majority of the links are assigned to one of two subnets
- FIG. 4 shows the second subnet according to the assignment of FIG. 2.
- 1 shows a network formed with links or connection sections and nodes. It is a connectionlessly switched network, such as an IP network.
- FIG. 2 shows how subnets can be defined which are used according to the invention for routing after network element failures.
- Two subnets are shown.
- One subnet is formed by the links shown in broken lines, the other by the links shown in dotted lines.
- the two subnets are complementary in that no link of the data network is part of both subnets. If a link fails, the subnet that does not include this link can be used for routing. If a link fails that is not assigned to either of the two subnets, both subnets can be used for routing. Both subnets connect all nodes with each other, ie with routing restricted to one subnet each node can be reached. The two subnet ze are selected so that each node in one of the two subnets is an end node. If a node fails, the subnet can be used for routing, which contains the failed node as the end node, because with routing restricted to this subnet, all nodes can be reached without the packet having to be routed via the failed node.
- both subnets can be used for routing. It is then possible to distribute traffic over the two subnets, i.e. to route the data packets alternately on one or the other subnet. Similarly, in the case of more than two subnets in the event of a link or node failure, those that enable interference-free routing can be selected and the data traffic can be distributed over these subnets in order to avoid overloading one of the subnets.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
L'invention concerne un procédé permettant de réagir à la défaillance d'un élément réseau d'un réseau de données à commutation par paquets sans connexion. Ce procédé consiste à déterminer, p. ex. par définition d'un paramètre dans l'en-tête du paquet de données, un sous-réseau du réseau à commutation par paquets qui ne comprend pas l'élément réseau défectueux. Le paquet de données est ensuite routé au moyen des éléments réseau compris dans le sous-réseau. Le procédé selon l'invention permet de réagir directement à des défaillances d'éléments réseau et d'éviter que le routage ne soit affecté jusqu'à ce que de nouvelles informations topologiques prenant en compte la défaillance de l'élément réseau soient propagées dans le réseau de données.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10302807 | 2003-01-24 | ||
DE10302807.2 | 2003-01-24 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004066568A1 true WO2004066568A1 (fr) | 2004-08-05 |
Family
ID=32747490
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2004/000468 WO2004066568A1 (fr) | 2003-01-24 | 2004-01-21 | Procede pour devier des paquets de donnees en cas de detection locale de defaillances de liaison par routage multiple |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2004066568A1 (fr) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007043919A1 (fr) * | 2005-10-11 | 2007-04-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Méthode de génération de spanning trees |
US8056139B2 (en) | 2004-10-05 | 2011-11-08 | Vectormax Corporation | Method and system for authorizing multimedia multicasting |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0841824A2 (fr) * | 1996-11-08 | 1998-05-13 | Nec Corporation | Système de restauration d'une panne utilisable notamment pour un réseau à grande échelle |
EP1117038A2 (fr) * | 2000-01-10 | 2001-07-18 | Sun Microsystems, Inc. | Méthode et appareil pour fournir des adresses insensibles aux défaillances pour des noeuds dans un système d'ordinateur groupé |
WO2002054795A2 (fr) * | 2000-12-28 | 2002-07-11 | Nokia, Inc. | Procede et appareil permettant de communiquer des donnees en fonction de plusieurs classes de trafic |
US20020167898A1 (en) * | 2001-02-13 | 2002-11-14 | Thang Phi Cam | Restoration of IP networks using precalculated restoration routing tables |
-
2004
- 2004-01-21 WO PCT/EP2004/000468 patent/WO2004066568A1/fr active Search and Examination
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0841824A2 (fr) * | 1996-11-08 | 1998-05-13 | Nec Corporation | Système de restauration d'une panne utilisable notamment pour un réseau à grande échelle |
EP1117038A2 (fr) * | 2000-01-10 | 2001-07-18 | Sun Microsystems, Inc. | Méthode et appareil pour fournir des adresses insensibles aux défaillances pour des noeuds dans un système d'ordinateur groupé |
WO2002054795A2 (fr) * | 2000-12-28 | 2002-07-11 | Nokia, Inc. | Procede et appareil permettant de communiquer des donnees en fonction de plusieurs classes de trafic |
US20020167898A1 (en) * | 2001-02-13 | 2002-11-14 | Thang Phi Cam | Restoration of IP networks using precalculated restoration routing tables |
Non-Patent Citations (1)
Title |
---|
KODIALAM M ET AL: "RESTORABLE DYNAMIC QUALITY OF SERVICE ROUTING", IEEE COMMUNICATIONS MAGAZINE, IEEE SERVICE CENTER. PISCATAWAY, N.J, US, vol. 40, no. 6, June 2002 (2002-06-01), pages 72 - 81, XP001123514, ISSN: 0163-6804 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8056139B2 (en) | 2004-10-05 | 2011-11-08 | Vectormax Corporation | Method and system for authorizing multimedia multicasting |
WO2007043919A1 (fr) * | 2005-10-11 | 2007-04-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Méthode de génération de spanning trees |
US7804791B2 (en) | 2005-10-11 | 2010-09-28 | Telefonaktiebolaget L M Ericsson (Publ) | Method of generating spanning trees to handle link and node failures in a network |
US8483097B2 (en) | 2005-10-11 | 2013-07-09 | Telefonaktiebolaget L M Ericsson (Publ) | Method of generating spanning trees to handle link and node failures in a network |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1597877B1 (fr) | Procede pour reagir rapidement a des defections de liaison entre differents domaines de routage | |
EP1897292B1 (fr) | Procede de mise a disposition de chemins de remplacement en tant que reaction rapide a la defaillance d'une liaison entre deux domaines d'acheminement | |
DE60305581T2 (de) | Verfahren zur Ausführung eines Routerschnittstellen-Backups mit VRRP (Virtual Router Redundancy Protocol) | |
EP1897293A1 (fr) | Procede de mise a disposition de chemins de remplacement en tant que reaction rapide a la defaillance d'une liaison entre deux domaines d'acheminement | |
WO2004073264A1 (fr) | Controle d'acces a un reseau oriente paquet en fonction d'exigences de resilience | |
EP0700224A2 (fr) | Procédé pour la recherche adaptive d'un chemin dans un réseau de communication | |
EP1394985A1 (fr) | Méthode de test pour les chemin de réseaux entre les éléments du réseau dans un réseau de communication | |
EP1397009B1 (fr) | Méthode et dispositif de routage de messages dans les réseaux SS7 | |
DE602005000724T2 (de) | Wegleitung in einem Kommunikationsnetzwerk | |
WO2005013564A1 (fr) | Procede de routage inter-domaine par trajets multiples | |
EP1532780B1 (fr) | Acheminement d'intra-domaine efficace dans des reseaux de commutation par paquets | |
EP1566039A1 (fr) | Procede pour devier des paquets de donnees lorsque des echecs de liaison sont identifiees | |
EP1894363B1 (fr) | Procede et element de reseau de communication independant destines a determiner des routes etiquetees dans un tel element de reseau de communication | |
WO2001054448A1 (fr) | Procede et dispositif de commande d'acces a un reseau de communication | |
DE10142372A1 (de) | Vorrichtung und Verfahren zum Wiederherstellen von Verbindungen in automatisch schaltbaren optischen Netzen | |
DE60027423T2 (de) | Kommunikationseinrichtungen | |
WO2004066568A1 (fr) | Procede pour devier des paquets de donnees en cas de detection locale de defaillances de liaison par routage multiple | |
EP1880521A2 (fr) | Procede d'acheminement pour l'optimisation de la charge de liaison et l'augmentation de la disponibilite | |
EP1762060A1 (fr) | Calcul efficace de tables de routage pour un routage sur la base d'adresses cibles | |
DE10308614A1 (de) | Verfahren und Anordnung zum Routing von Datenpaketen in einem paketvermittelnden Datennetz | |
DE60210945T2 (de) | Verfahren zum verbindungsaufbau in einem multimedianetzwerk | |
WO2002041583A2 (fr) | Procede pour selectionner des reseaux de communication a l'aide de criteres de selection a reglage dynamique afin de commander l'etablissement d'une connexion entre des terminaux de communication | |
WO2005125117A1 (fr) | Procede pour mettre des ressources en reserve pour un routage inter-domaines avec attributs de qualite de service | |
DE102005046397B4 (de) | Verfahren zum raschen Auffinden günstiger Link-Kostenmetriken nach Netzwerkfehler | |
DE102004047024B4 (de) | Verfahren zur Optimierung der Verkehrsverteilung in einem Kommunikationsnetz mit Mehrwege-Routing |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
122 | Ep: pct application non-entry in european phase | ||
DPEN | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101) |