[go: up one dir, main page]

WO2008015035A1 - Procédé pour la transmission de données par paquets dans un reseau de communication - Google Patents

Procédé pour la transmission de données par paquets dans un reseau de communication Download PDF

Info

Publication number
WO2008015035A1
WO2008015035A1 PCT/EP2007/055191 EP2007055191W WO2008015035A1 WO 2008015035 A1 WO2008015035 A1 WO 2008015035A1 EP 2007055191 W EP2007055191 W EP 2007055191W WO 2008015035 A1 WO2008015035 A1 WO 2008015035A1
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
logical
layer
network
networks
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.)
Ceased
Application number
PCT/EP2007/055191
Other languages
German (de)
English (en)
Inventor
Johannes Riedl
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG, Siemens Corp filed Critical Siemens AG
Publication of WO2008015035A1 publication Critical patent/WO2008015035A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/18—Loop-free operations
    • 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/04—Interdomain routing, e.g. hierarchical routing

Definitions

  • the invention relates to a method for packet switched data transmission in a communication network having a plurality of L3 nodes in the L3 layer, which communicating with each other via one or more L2 nodes in the L2 layer.
  • the invention also relates to a corresponding commu ⁇ nikationsnetz, in which such a method for packet-switched data transmission is realized, as well as a computer program product.
  • the invention is in the field of packet-switched data transport.
  • OSI Open Systems Intercon- nection
  • This model describes the transmission of data based on seven layer levels with different functionalities.
  • the individual layers are also referred to as Ll, L2,..., L7 or as Layer 1, Layer 2,..., Layer 7.
  • the lowest layer Ll here is the physical layer, which accomplishes the digital bit transmission in a communication network ⁇ .
  • ⁇ L2 layer which is nowadays more and more realized by the well-known from the state of the art Ethernet protocol.
  • the task of the L2 layer is to guarantee a largely error-free transmission of the Layer 3 data packets.
  • MAC Media Access Control
  • Devices which merely effect the data transmission on the L2 layer are, for example, so-called switches (also referred to below as L2 switches).
  • switches also referred to below as L2 switches.
  • ⁇ network layer Above the L2 layer is the so-called ⁇ network layer, which warranty further ⁇ switching of data packets in the data transmission guaranteed.
  • IP Internet Protocol
  • Typical devices that work in this layer are so-called routers, which ensure the forwarding of IP data packets in the L3 layer.
  • OSPF Open Shortest Path First
  • IS-IS Intermediate System to Intermediate System
  • L3 layer are the other layers L4 to L7, which are not explained in detail in this application, since for the inventive method, only the data transmission to the L3 layer of relevance.
  • L3 nodes are network nodes in the communication network which work on the L3 layer and understand the protocols used there. These individual L3 nodes require to realize a not inconsiderable effort and hardware and software insbeson ⁇ particular need of appropriate algorithms may be implemented in the nodes which provide routing of data packets over entspre ⁇ sponding routing methods on the net.
  • the object of the invention is therefore to provide a method for packet-switched data transmission in a communication network, in which the packet-switched data transmission can be realized by less technical effort in the individual network nodes. It is another object of the invention to provide a communication network, which allows a packet-switched data transmission with less technical effort. This object is achieved by the independent claims ge ⁇ triggers. Further developments of the invention are defined in the dependent claims.
  • a bioREMtra ⁇ supply is enabled in a communication network having a plurality of nodes in the L3-L3 layer, the L3 node un ⁇ behind the other communicate with each other via intermediate nodes L2.
  • L2 node apparatus is to be understood that mainly on the L2 layer processing ⁇ tet and no data transmission on the further overlying layers, in particular not on the L3 layer, ver can ⁇ work.
  • Such nodes are simpler than L3 nodes, in particular, these nodes do not have to ensure the routing of data packets by using appropriate algorithms, whereby the hardware and software effort is lower in the ⁇ sen node.
  • one or more logical networks are generated in the communication network by being connectable to each other by one or more L2 nodes
  • L3 node is generated at least an associated one logical network logical connects fertil
  • each logical connection is a phy sical ⁇ compound of the L3-node of the pair via one or more L2 node corresponds to.
  • the invention has the advantage that defined Verbin ⁇ L3 links between nodes are defined using the logical networks, so that a clear disadvantage by each compound ready cash relationship between a pair of L3 node is defined.
  • conventional routing methods can be easily used in the L3 layer.
  • the physical ones used in conventional routing methods In this case, compounds correspond to the logical compounds in the process according to the invention.
  • the method according to the invention avoids, in particular, that several neighbors are assigned to an L3 node on a connection. Such a scenario can only be processed in a limited manner by known routing methods.
  • a particularly simple packet-switched data transmission is ensured in a preferred embodiment of the method according to the invention if exactly one logical connection assigned to a logical network is generated for each pair of L3 nodes which can be connected to one another physically via one or more L2 nodes. If necessary, it is even possible for the one or more logical networks to be generated in such a way that each logical network represents, topologically speaking, a point-to-point connection. This means that each logical network is very simple, because it consists of only one line. This results in the advantage that it is ensured in a simple manner that the networks are loop-free, that is, it is avoided that the data packets circulate in the data transmission in a loop.
  • VLAN virtual local area network
  • stacked VLAN networks Such networks are well known in the art and are further illustrated in the detailed description.
  • VLAN networks in IEEE Standard 802. IQ (IEEE national institutes of Electrical and Electronics Engineers) specifi ⁇ ed.
  • IEEE national institutes of Electrical and Electronics Engineers
  • the invention is not limited to this type of logi ⁇ European networks, it can take any other lo ⁇ cal networks are used to implement the invention drive Ver ⁇ that.
  • IGP Interior Gateway Protocol
  • the protocol is used here such that the neighborhood relationships used in Rou ⁇ ting based on the logical connections of the L3 nodes in the one or more logical networks. The logical connections thus replace the physical connections commonly used in routing.
  • the L2 nodes communicate with one another and with the L3 nodes via an Ethernet protocol, in particular via the protocol, which is almost exclusively used today, according to the IEEE 802.3 standard.
  • the one or more logical networks designed in the OF INVENTION ⁇ method to the invention such that they are insidiously fengol. If the loop freedom can not be guaranteed slightest ⁇ tet, it may be possible to use one or more protocols to prevent loops in data transmission in the L2 layer. In particular, one or more of the following protocols may be used:
  • STP Rapid Spanning Tree Protocol
  • RSTP Rapid Spanning Tree Protocol
  • MSTP Multiple Spanning Tree Protocol
  • EMP Ethernet Ring Protection
  • EAPS Ethernet Automatic Protection Switching
  • the routers edge are especially routers, which are respectively connected with one or more access ⁇ networks to the communication network, and wherein the L2 switches the Nodes in the core of the communication network are, that is those nodes that have no connection to the access networks, but only with each other and with the edge routers are connected.
  • the invention further relates to a communication network for packet-switched data transmission, wherein the network comprises a plurality of L3 nodes in the L3 layer which communicate with each other via one or more L2 nodes in the L2 layer.
  • the communication network is characterized in that it has means which enable a packet-switched data transmission in accordance with the method according to the invention.
  • the L3 nodes are preferably routers, and the L2 nodes are preferably L2 switches.
  • the communication network is preferably a central network interconnecting a plurality of access networks, the routers being peripheral routers of the central network, which are each connected to one or more of the access networks, and wherein the L2 switches are located in the core of the network Kom ⁇ munikationsnetzes are.
  • the invention further relates to a computer program product with a program stored on a machine-readable carrier, program code, wherein the inventive method for briver ⁇ mediated data transfer performed when the program runs on one or more computers in a communication network.
  • Fig. 1 is a schematic representation of a conventional communication network for packet-switched data transmission
  • FIG. 2 shows a schematic representation of a plurality of routers in a communication network, which communicate with one another via L2 switches and logical connections according to an embodiment of the method according to the invention
  • FIG. 3 is a view analogous to FIG. 2, with only the logical connections between the routers drawn in for illustration.
  • Fig. 1 shows a conventional communication network for packet-switched data transmission, wherein in the L3 layer, the IP protocol is used.
  • the communication network comprises a plurality of routers R1, R2, R3, C1, C2, C3 and C4. These routers are interconnected via physical links, as indicated by solid lines between the individual routers.
  • the routers R1 to R3 and C1 to C4 with their physical connections form a so-called IP backbone network in the network layer L3.
  • the routers R1, R2 and R3 are in this case edge routers which connect the backbone network with corresponding access networks A1, A2 and A3.
  • the router Rl is connected to the access network Al, the router R2 to the access network A2 and the router R3 to the access network A3.
  • the router Cl, C2, C3 and C4 are so-called core router in the core of the backbone network which ensure only the forwarding Since ⁇ tenvolen in the backbone network, without even have a connection to an access network.
  • computers for example PCs, are connected to the individual access networks, three computers E1, E2 and E3 being shown by way of example in FIG.
  • the computer El communicates with the access network Al, the computer E2 with the access network A2 and the computer E3 with the access network A3.
  • the computers represent - analogous to the routers described above - nodes in the L3 layer with correspondingly assigned IP addresses.
  • Data packets can be transmitted between computers in different access networks via the individual access networks and the backbone network.
  • the forwarding of the data packets in the backbone network takes place here by any routing method.
  • the routing methods define neighborhood relationships between the individual routers, with the aid of neighborhood relationships enabling the forwarding of the data packets in the L3 layer from one router to the next up to the destination IP address.
  • Known Rou ⁇ ting algorithms are for instance the already mentioned it ⁇ algorithms mentioned OSPF and IS-IS.
  • any any desired IGP routing protocol can be used for forwarding the pa ⁇ kete.
  • the routers R 1 to R 3 and C 1 to C 4 shown in FIG. 1 represent the L3 nodes in the sense of claim 1. It proves disadvantageous here that the hardware and software complexity in the backbone network is very high, since all nodes in the network work on the L3 layer and thus require not only the L3 functionality but also the functionality of the underlying layer L2. According to the invention, it has been recognized that one L3 functionality for the individual core routers C1, C2, C3 and C4 in the backbone network is not absolutely necessary since the edge routers R1, R2 and R3 also have their IP addresses directly in the L3 layer without intermediary routers. can communicate with each other.
  • the individual core routers C1 through C4 are replaced by simply constructed L2 nodes in the form of L2 switches. These nodes have only L2 functionality and do not understand the layers above. It is possible to replace every single core router with a single L2 switch. Optionally, several L2 switches may be provided to replace a core router.
  • FIG. Fig. 2 shows in simplified form a realized according to an embodiment of the invention communication network.
  • this communication network no longer contains any core routers, but the core routers are replaced by corresponding L2 nodes in the form of L2 switches S1, S2, S3 and S4.
  • the edge router
  • VLANs are well known from the prior art and in particular ⁇ special in the already mentioned above IEEE standard 802. IQ defined. VLANs represent logical local networks with corresponding logical connections.
  • VLANs are realized in the L2 layer in particular by assigning each VLAN a unique number, which is also referred to as VLAN ID.
  • VLAN ID a unique number
  • a device belonging to a VLAN with a predetermined identity can only communicate with a device in the VLAN with the same identity.
  • each Ethernet packet in the L2 layer contains 12 bits to VLAN specification.
  • each port of an L2 switch can have one or more VLAN IDs assigned to it, with each port forwarding Ethernet packets only to ports that share the same VLAN ID.
  • V12, V13, V14, V23, V24 and V34 are generated, each VLAN consisting of a single logical connection between two routers. These individual logical connections are indicated in FIG. 2 by solid double arrows.
  • ⁇ at the VLAN V12 connects the routers Rl and R2 via the switches Sl and S2 by means of the physical connections Pl, P3 and P6.
  • the VLAN V14 establishes a connection via the switches Sl, S2 and S4 by means of the physical links Pl, P3, P5 and P7 between routers Rl and R4.
  • the routers R 1 and R 3 are connected to one another via the VLAN V 13 with the interposition of the switches S 1 and S 3 via the physical connections P 1, P 2 and P 8.
  • the VLAN V23 connects the routers R2 and R3 via the switches S2, S4 and S3 and the physical connections P6, P5, P4 and P8.
  • the router R2 communicates with the router R4 over the VLAN V24, which ei ⁇ ne connection between the routers over the switches S2 and S4 and the physical connections P6, P5 and P7 generated.
  • the VLAN V34 creates the logical connection between the routers R3 and R4 via the switches S3 and S4 and the physical connections P8, P4 and P7. If necessary, the individual logical paths can also pass through the switches via other paths as required.
  • the illustration in Fig. 2 is thus to be seen merely as an example of the generation of VLANs.
  • FIG. 3 again shows which logical connection structure is achieved by the VLANs shown in FIG. 2 in the L3 layer.
  • Fig. 3 shows the router Rl in this case analogous to R4 of Fig. 2, but the communication in the L3 layer is reproduced only, that is, the L2 switches WUR ⁇ omitted.
  • the VLANs V12, V13, V14, V23, V24, and V34 provide a structure in which each pair of routers is assigned a unique logical connection.
  • the routing in the L3 layer now runs on these logical connections.
  • a network structure suitable for conventional routing methods is provided in which each router on a link has only a single neighbor.
  • a conventional routing method which usually takes place on physical connections between routers, is now carried out analogously to logical connections between the routers.
  • VLAN stacking In the case of larger backbone networks to be implemented, one can use the prior art VLAN stacking, according to which a VLAN is specified by two 12-bit fields. In this case, 16 million neighborhood relationships can be addressed between edge routers, and thus more than 4,000 edge routers. Under certain circumstances, may be the case, reindeer circulating that the VLANs generated with the inventive method are not loop-free, that is not pass that data packets to a Zielad ⁇ ress, but in the network in a loop. In this case, the above-mentioned L2
  • Protocols especially STP / RSTP / MSTP or RTP, are used to resolve these loops.
  • the individual edge routers are directly connected to each other edge router via a logical point-to-point connection, as can be seen from FIG.
  • the management of the network according to the invention essentially corresponds to the management of a network which essentially consists of L3 nodes. This ensures that the communication network used according to the invention can be managed in a simple manner, since the network operators are familiar with the handling of L3 core networks and thus can apply the mechanisms used there analogously to the network according to the invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

La présente invention concerne un procédé pour la transmission de données par paquets dans un réseau de communication comprenant un grand nombre de noeds L3 (R1, R2,..., R4) dans la couche L3, qui communiquent entre eux par un ou plusieurs noeds L2 (S1, S2,..., S4) dans la couche L2, procédé dans lequel : un ou plusieurs réseaux logiques (V12, V13, V14, V23, V24, V34) sont créés dans le réseau de communication par le fait que pour chaque paire de noeds L3 (R1, R2,..., R4) reliables entre eux physiquement par un ou plusieurs noeds L2 (S1, S2,..., S4), il est généré au moins une liaison logique associée à un réseau logique (V12, V13, V14, V23, V24, V34), chaque liaison logique correspondant à une liaison physique des noeds L3 (R1, R2,..., R4) de la paire par un ou plusieurs noeds L2 (S1, S2,..., S4). La transmission de données par paquets sur la couche L3 entre les noeds L3 (R1, R2,..., R4) s'effectue sur les liaisons logiques du ou des réseaux logiques (V12, V13, V14, V23, V24, V34).
PCT/EP2007/055191 2006-08-04 2007-05-29 Procédé pour la transmission de données par paquets dans un reseau de communication Ceased WO2008015035A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE200610036565 DE102006036565A1 (de) 2006-08-04 2006-08-04 Verfahren zur paketvermittelten Datenübertragung in einem Kommunikationsnetz
DE102006036565.8 2006-08-04

Publications (1)

Publication Number Publication Date
WO2008015035A1 true WO2008015035A1 (fr) 2008-02-07

Family

ID=38289870

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2007/055191 Ceased WO2008015035A1 (fr) 2006-08-04 2007-05-29 Procédé pour la transmission de données par paquets dans un reseau de communication

Country Status (2)

Country Link
DE (1) DE102006036565A1 (fr)
WO (1) WO2008015035A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102007000561B4 (de) 2007-10-24 2022-09-01 Zf Friedrichshafen Ag Elektrohydraulische Steuervorrichtung einer Getriebeeinrichtung
DE102011088812A1 (de) * 2011-12-16 2013-06-20 Ge Energy Power Conversion Gmbh Verfahren zum Übertragen von Nutzdaten

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030133412A1 (en) * 2002-01-10 2003-07-17 Iyer Arvind B. VLAN to MPLS mapping: method to establish end-to-end traffic path spanning enterprise local area networks and a global network
EP1351450A2 (fr) * 2002-03-15 2003-10-08 Broadcom Corporation Implementation de voie rapide pour de services LAN transparents sur MPLS
EP1398920A2 (fr) * 2002-08-27 2004-03-17 Alcatel Canada Inc. Fourniture de réseau virtuel empilable dans un réseau ponté
EP1684469A1 (fr) * 2005-01-24 2006-07-26 Samsung Electronics Co., Ltd. Dispositif et procédé pour fournir un réseau virtuel privé (VPN) basé sur la commutation d'étiquettes multiprotocole (MPLS)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004066120A2 (fr) * 2003-01-15 2004-08-05 Ciena Coporation Procede et appareil permettant de transporter des paquets de donnees sur un reseau optique
US8422500B2 (en) * 2004-07-02 2013-04-16 Rockstar Consortium Us Lp VLAN support of differentiated services
WO2006070197A2 (fr) * 2004-12-31 2006-07-06 British Telecommunications Public Limited Company Programme de communications en mode connexion pour trafic de communication sans connexion

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030133412A1 (en) * 2002-01-10 2003-07-17 Iyer Arvind B. VLAN to MPLS mapping: method to establish end-to-end traffic path spanning enterprise local area networks and a global network
EP1351450A2 (fr) * 2002-03-15 2003-10-08 Broadcom Corporation Implementation de voie rapide pour de services LAN transparents sur MPLS
EP1398920A2 (fr) * 2002-08-27 2004-03-17 Alcatel Canada Inc. Fourniture de réseau virtuel empilable dans un réseau ponté
EP1684469A1 (fr) * 2005-01-24 2006-07-26 Samsung Electronics Co., Ltd. Dispositif et procédé pour fournir un réseau virtuel privé (VPN) basé sur la commutation d'étiquettes multiprotocole (MPLS)

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
BROCKNERS F ET AL: "Metro ethernet - deploying the extended campus using ethernet technology", LOCAL COMPUTER NETWORKS, 2003. LCN '03. PROCEEDINGS. 28TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON 20-24 OCT. 2003, PISCATAWAY, NJ, USA,IEEE, 20 October 2003 (2003-10-20), pages 594 - 604, XP010666022, ISBN: 0-7695-2037-5 *
IBANEZ G ET AL: "Alternative Multiple Spanning Tree Protocol (AMSTP) for Optical Ethernet Backbones", COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE, 2004. CSB 2004. PROCEEDINGS. 2004 IEEE TAMPA, FL, USA 16-18 NOV. 2004, LOS ALAMITOS, CA, USA,IEEE (COMPUT. SOC, US, 16 November 2004 (2004-11-16), pages 744 - 751, XP010753186, ISBN: 0-7695-2260-2 *
LI J ET AL: "PUBLIC ACCESS MOBILITY LAN: EXTENDING THE WIRELESS INTERNET INTO THE LAN ENVIRONMENT", IEEE WIRELESS COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 9, no. 3, June 2002 (2002-06-01), pages 22 - 30, XP001123557, ISSN: 1536-1284 *
METZ C: "LAYER 2 OVER IP/MPLS", IEEE INTERNET COMPUTING, IEEE SERVICE CENTER, NEW YORK, NY, US, July 2001 (2001-07-01), pages 77 - 82, XP001060238, ISSN: 1089-7801 *

Also Published As

Publication number Publication date
DE102006036565A1 (de) 2008-02-07

Similar Documents

Publication Publication Date Title
EP2721784B1 (fr) Procédé de fonctionnement d' un équipement de réseau et équipement de réseau
EP2343857B1 (fr) Noeud de réseau pour un réseau de communication
EP2409458B1 (fr) Exploitation en parallèle de protocoles rstp (rapid spanning tree protocol) et mrp (media redundancy protocol) et segmentation/couplage
DE112012001320B4 (de) Prioritätsgestützte Flusssteuerung in einer Switching-Netzwerkarchitektur mit einem Protokoll einer verteilten Struktur (Distributed Fabric Protocol DFP)
DE102011114278B4 (de) Verfahren und Vorrichtung, die eine Ausfallumschaltung für einen Punkt-Punkt-Tunnel für Split-Plane-Umgebungen drahtloser lokaler Netze bereitstellen
DE69716451T2 (de) Lastverteilung für redundante netze
DE102007015539B4 (de) Verfahren zum Rekonfigurieren eines Kommunikationsnetzwerks
DE112008002665T5 (de) Bereitstellen einer Abstraktionsschicht in einem Clusterswitch, der mehrere Switches hat
DE102011114276B4 (de) Ausfallsicherheit durch Routed Split Multi-Link Trunking für Split-Plane-Umgebungendrahtloser lokaler Netze
EP2693700A1 (fr) Procédé de transmission de messages dans un réseau de communication industriel pouvant fonctionner de manière redondante et appareil de communication pour un réseau de communication industriel pouvant fonctionner de manière redondante
DE102011114272B4 (de) Paketweiterleitungsfunktion eines Mobilitätsswitchs, der als Routed-SMLT-(RSMLT-)Knoten eingesetzt wird
WO2020125987A1 (fr) Procédé de communication de données, comportant une exigence applicable relative à la fiabilité, appareil de communication, programme informatique et support lisible par ordinateur
EP1955480B1 (fr) Réseau ayant des propriétés de redondance, commutateur ethernet pour un réseau de ce type et procédé de configuration d un réseau de ce type
DE60020299T2 (de) Erzeugung eines vollständigen Baumes in einem Netzwerk welches Gruppen beinhaltet
EP2130331B1 (fr) Procédé de reconfiguration d'un réseau de communication
EP2652917B1 (fr) Réseau intermédiaire de topologie annulaire et procédé de création d'une liaison de réseau entre deux domaines d'un réseau
WO2008106907A1 (fr) Recherche de port cible dans des réseaux constitués de sous-réseaux reliés
EP2704370A1 (fr) Procédé de transmission de nouvelles dans un réseau de communication industriel pouvant fonctionner de manière redondante et appareil de communication pour un réseau de communication industriel pouvant fonctionner de manière redondante
WO2008015035A1 (fr) Procédé pour la transmission de données par paquets dans un reseau de communication
DE102022206121A1 (de) Deadlock-freies lokales umleiten zur behandlung mehrerer lokaler verbindungsausfälle in hierarchischen netztopologien
DE102019131823A1 (de) Automatisierungsnetzwerk und Verfahren zur Datenübertragung in einem Automatisierungsnetzwerk
EP4425875A1 (fr) Procédé de transmission de données à haute disponibilité dans un système de communication, système de communication et appareil de communication
DE10260640A1 (de) Verfahren zur Topologie-Erkennung und Weglenkung von Datenpaketen in einem Pakete vermittelnden Ring
EP1627505B1 (fr) Noeud reseau d'un reseau de communication a commutation de paquets et procede de distribution du trafic de donnees dans un reseau de communication a commutation de paquets
EP2143241B1 (fr) Réseau de communication à commutation de paquets, et procédé de reconfiguration du réseau de communication

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07729613

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

122 Ep: pct application non-entry in european phase

Ref document number: 07729613

Country of ref document: EP

Kind code of ref document: A1