WO1996008098A1 - Procede de transmission de donnees entre des stations ou des unites de traitement de donnees - Google Patents
Procede de transmission de donnees entre des stations ou des unites de traitement de donnees Download PDFInfo
- Publication number
- WO1996008098A1 WO1996008098A1 PCT/AT1995/000167 AT9500167W WO9608098A1 WO 1996008098 A1 WO1996008098 A1 WO 1996008098A1 AT 9500167 W AT9500167 W AT 9500167W WO 9608098 A1 WO9608098 A1 WO 9608098A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- station
- fault
- network
- stations
- broadcast
- 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
Links
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]
- H04L12/40—Bus networks
- H04L12/40169—Flexible bus arrangements
- H04L12/40176—Flexible bus arrangements involving redundancy
- H04L12/40189—Flexible bus arrangements involving redundancy by using a plurality of bus systems
-
- 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]
- H04L12/40—Bus networks
- H04L12/407—Bus networks with decentralised control
- H04L12/417—Bus networks with decentralised control with deterministic access, e.g. token passing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
-
- 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]
- H04L12/40—Bus networks
- H04L2012/4026—Bus for use in automation systems
Definitions
- the invention relates to a method for data transmission between information processing stations or devices, e.g. Programmable logic controllers, host computers or operating devices for automation technology, which are connected to each other via a double (redundant) network with serial or parallel buses, and where the data is transferred using the token-passing method.
- information processing stations or devices e.g. Programmable logic controllers, host computers or operating devices for automation technology
- Bus systems have the advantage that all stations are connected in parallel to the data carrier (bus line), which means that when individual stations are switched off there is no breakdown of the network. In the case of bus systems, the information is also transmitted faster than in the case of ring systems.
- the "token” is a defined bit sequence that is passed on from one station, each of which has a unique identification number in the network, to the next. Each station forwards the “token” to the station with the next higher identification number in the network. Since the number of identification numbers to be assigned is limited, the station with the lowest number receives the "token” from the station with the highest number, as a result of which a logical ring is formed in the network. The “token” remains with the station during transmission. This ensures that there is no data collision on the bus.
- a property of the token passing method is that stations can be switched on or off at any time. However, a reconfiguration is necessary to maintain the logical token ring.
- a new station When a new station is switched on or closed If an existing network is connected, it does not get a token because at the beginning no identification number is entered as a new number at any station. After the token timeout has expired, the new station sends out a continuous signal and thus interrupts the current communication. All stations now begin to count down from the highest identification number until they have reached their own station number. If a station has reached its own number, it now tries to pass the token on to the station with the next higher one. If this station does not exist, an attempt is made to pass the token on to the station with the number increased by two. This is repeated until an existing station is reached.
- the attempt is made to send the token to the station with the lowest possible number. If the token transfer to a second station was successful, their identification number is saved as a new number. The second station now tries to pass on the token to the station with the next higher number, this is increased by one until the next station is reached. When all stations have entered the number of their successor stations, the reconfiguration is complete.
- the transmission authorization (token) is passed on from one station to the next both on the active and on the passive bus.
- the object of the invention is now to create a method for a double-executed or redundant network, with which one of the two buses gradually becomes active for all stations in the event of a fault.
- the object is achieved by the invention, which is characterized in that all stations work according to a constant synchronized time cycle which is divided into three phases, which run in the order of synchronization phase, broadcast phase and message phase, with the beginning and end of each phase in all stations Network is known, and that the type of data telegram that is released by each individual station for transmission is determined by the phase that is currently relevant, and that each station cyclically and independently of each other independently of each other for functionality or errors (Fault) is monitored, and that each error in the entire network is assigned a unique error weight as an even number, and that each station has either the conditions observed itself or those reported by another station with the highest error weight on the one for the sending station currently active bus the other stations in the network in the broadcast phase, in which each station sends a data telegram to all stations one after the other, and that each station
- the functional, interference-free network is assigned the error weight "0".
- a further development of the invention is that those stations in the network that are not capable of redundancy are assigned the highest error weight. Since this is the largest possible error, the next broadcast phase immediately switches from the redundant network to a single network.
- the station which is the first to receive transmission authorization in the broadcast phase becomes the broadcast master in this time cycle and only from this at If the next send authorization is received, the broadcast end telegram is sent on both buses, and therefore only a single broadcast end telegram occurs in the functional, interference-free network on the active and passive bus during a cycle, and that if more than one broadcast end occurs An error is derived on the telegram on one of the two or on both buses. This measure can be used to determine which of the two buses is defective and the bus that is in Ordnimg also immediately becomes active.
- the fault weight is reduced in constant steps until the weight is either "0" or, in the event of a multiple fault, a pending fault with a lower weight until then determines which bus the active and which becomes the passive. Since the error weight in the individual stations does not immediately take on the lowest value after an error has been corrected, subsequent errors with a lower weight are partially ignored, depending on the time of occurrence.
- FIG. 1 shows the structure of a redundant network and FIG. 2 shows the time cycle in the fault-free case on the passive bus.
- the network 1 shows four stations 1, 2, 3, 4 connected to a redundant network.
- This network consists of two parallel or serial buses 5, 6, one of which is always the active and the other the passive for each station 1, 2, 3, 4.
- Each station 1, 2, 3, 4 has two network controllers 7, 8, one of which is connected to bus 5 and the second to bus 6.
- the network controllers 7, 8 can be implemented in hardware or software.
- each station 1, 2, 3, 4 sends a data telegram to all stations 1, 2, 3, 4.
- all stations 1, 2, 3, 4 connected to the redundant network receive the transmission authorization (token) and send a released data telegram on their currently active bus 5 or 6.
- the duration of the broadcast phase depends on the number of stations 1, 2, 3, 4 connected to the redundant network.
- the broadcast phase is followed by message phase 11, in which each station 1, 2, 3, 4 sends a data telegram on the bus currently active for it 5 or 6 to a certain other station 1, 2, 3, 4, as long as it receives the transmission authorization.
- This phase 11 is followed by the synchronization phase 13, 14 with the first 13 and the second synchronization telegram 14, which are likewise sent again on both buses 5, 6.
- the first synchronization telegram 13 is sent by the station that is the first to get the token in this phase 13, 14. All stations 1, 2, 3, 4 on the network are time-synchronized with this telegram 13.
- the second synchronization telegram 14 is sent by the station which subsequently receives the token and is ignored in all stations 1, 2, 3, 4.
- the downward direction of the time cycle 9 is indicated by an arrow in this figure.
- the duration of a time cycle is in the range of a few 100 ms.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Small-Scale Networks (AREA)
Abstract
Dans un procédé de transmission de données fondé sur la méthode d'accès à jeton, entre des stations (1, 2, 3, 4) de traitement de données utilisées en technique d'automatisation, qui sont raccordées à un réseau (5, 6) redondant, toutes les stations fonctionnent selon un cycle temporel (9) synchronisé constant. Ce cycle temporel comprend trois phases successives: phase de synchronisation (13, 14), phase de diffusion (8) et phase de message (9). Chacun des deux bus (5, 6) est surveillé de manière cyclique par chacune des stations (1, 2, 3, 4), pour lui-même et indépendamment de l'autre, quant à sa fiabilité de fonctionnement ou à d'éventuels défauts (parasites). Un poids de défaut défini figurant sous forme de valeur à nombre pair est attribué à chaque défaut du réseau global. Durant la phase de diffusion, chaque station (1, 2, 3, 4) informe les autres stations (1, 2, 3, 4) du réseau des états observés par elle-même ou signalés par une autre station (1, 2, 3, 4) avec le poids de défaut le plus important en ce qui concerne le bus (5, 6) qui est précisément actif pour la station émettrice. Chaque station (1, 2, 3, 4) décide immédiatement sur la base de l'erreur qu'elle a pu elle-même observer ou qui a été transmise par une autre station (1, 2, 3, 4), avec le poids de défaut le plus important, quel est le bus (5, 6) qui doit être passif et quel est celui qui doit être actif. En présence d'un défaut, une commutation automatique s'effectue sur le bus (5, 6) en ordre, qui devient par conséquent actif. Après élimination du défaut, par ex. une coupure de ligne sur un des deux bus (5, 6), le système repasse automatiquement en fonctionnement en mode redondant.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| ATA1684/94 | 1994-09-02 | ||
| AT168494 | 1994-09-02 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO1996008098A1 true WO1996008098A1 (fr) | 1996-03-14 |
Family
ID=3518761
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/AT1995/000167 Ceased WO1996008098A1 (fr) | 1994-09-02 | 1995-08-17 | Procede de transmission de donnees entre des stations ou des unites de traitement de donnees |
Country Status (1)
| Country | Link |
|---|---|
| WO (1) | WO1996008098A1 (fr) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1999014989A1 (fr) * | 1997-09-18 | 1999-03-25 | Siemens Aktiengesellschaft | Dispositif de commande destine aux installations d'eclairage d'aeroports |
| EP0878981A3 (fr) * | 1997-05-16 | 2000-08-23 | Siemens Aktiengesellschaft | Stabilisateur de courant |
| WO2001063850A1 (fr) * | 2000-02-25 | 2001-08-30 | Honeywell International Inc. | Tolerance aux pannes de reseau multiples grace a une gestion redondante du reseau |
| WO2001084313A3 (fr) * | 2000-05-02 | 2002-04-25 | Sun Microsystems Inc | Procede et systeme d'obtention d'une grande disponibilite dans un systeme informatique en reseau |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1985003825A1 (fr) * | 1984-02-14 | 1985-08-29 | Rosemount Inc. | Systeme de commutation de canaux de communication alternants |
| EP0416942A2 (fr) * | 1989-09-08 | 1991-03-13 | Honeywell Inc. | Méthode pour détecter un défaut sur un câble et pour connecter un câble redondant dans un réseau local universel |
| EP0580938A2 (fr) * | 1992-06-26 | 1994-02-02 | Yokogawa Electric Corporation | Dispositif de commande pour la communication duplex |
-
1995
- 1995-08-17 WO PCT/AT1995/000167 patent/WO1996008098A1/fr not_active Ceased
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1985003825A1 (fr) * | 1984-02-14 | 1985-08-29 | Rosemount Inc. | Systeme de commutation de canaux de communication alternants |
| EP0416942A2 (fr) * | 1989-09-08 | 1991-03-13 | Honeywell Inc. | Méthode pour détecter un défaut sur un câble et pour connecter un câble redondant dans un réseau local universel |
| EP0580938A2 (fr) * | 1992-06-26 | 1994-02-02 | Yokogawa Electric Corporation | Dispositif de commande pour la communication duplex |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0878981A3 (fr) * | 1997-05-16 | 2000-08-23 | Siemens Aktiengesellschaft | Stabilisateur de courant |
| WO1999014989A1 (fr) * | 1997-09-18 | 1999-03-25 | Siemens Aktiengesellschaft | Dispositif de commande destine aux installations d'eclairage d'aeroports |
| WO2001063850A1 (fr) * | 2000-02-25 | 2001-08-30 | Honeywell International Inc. | Tolerance aux pannes de reseau multiples grace a une gestion redondante du reseau |
| CN100391190C (zh) * | 2000-02-25 | 2008-05-28 | 霍尼韦尔国际公司 | 经由冗余网络控制的多重网络故障容错管理的方法和装置 |
| WO2001084313A3 (fr) * | 2000-05-02 | 2002-04-25 | Sun Microsystems Inc | Procede et systeme d'obtention d'une grande disponibilite dans un systeme informatique en reseau |
| US6854069B2 (en) | 2000-05-02 | 2005-02-08 | Sun Microsystems Inc. | Method and system for achieving high availability in a networked computer system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE3750967T2 (de) | Steuerung von verteilten Taktimpulsen in einer verteilten Digital-Vermittlungsanlage. | |
| EP0403763B1 (fr) | Méthode et système d'interconnexion de calculateurs ou de réseaux de calculateurs | |
| EP0964549B1 (fr) | Circuit de surveillance d'un réseau de transmission | |
| EP1869836B1 (fr) | Unite maitre, systeme de communication et procede pour les faire fonctionner | |
| WO2007121984A1 (fr) | Unité d'interface et système de communication à structure maître-esclave | |
| EP0092719B1 (fr) | Disposition pour le couplage d'unités de traitement numérique | |
| DE3140058A1 (de) | Vielfachdatensystem | |
| EP1648117B1 (fr) | Procédé de synchronisation dans un système de communication redondant | |
| EP0993714A2 (fr) | Procede et systeme pour commander l'utilisation de la capacite de transmission de satellites dans des reseaux terrestres | |
| EP0509114B1 (fr) | Méthode pour la transmission de données à plusieurs stations | |
| WO1996008098A1 (fr) | Procede de transmission de donnees entre des stations ou des unites de traitement de donnees | |
| DE4242438C2 (de) | Vorrichtung zur Ausnutzung der Redundanz bei Datenringen in Doppelringtopologie | |
| EP0720337A2 (fr) | Méthode de communication de messages consistente et à haute fiabilité | |
| DE3420365C2 (fr) | ||
| DE19921179A1 (de) | Logikeinheit nach byzantinen Algorithmus, Rechnereinheit mit solcher Logikeinheit, Verbund aus Logik- oder Rechnereinheiten und Verfahren zum Betreiben eines solchen Verbunds | |
| AT983U1 (de) | Programmlogik zur datenübertragung zwischen informationsverarbeitenden stationen bzw. geräten | |
| EP1399818A2 (fr) | Procede et dispositif de communication dans un systeme informatique reparti tolerant aux erreurs | |
| DE19951526C2 (de) | Datenübertragungsnetzwerk | |
| WO1996008097A1 (fr) | Procede de transmission de donnees entre des stations ou des unites de traitement de donnees | |
| EP1266461B1 (fr) | Procede de passage a un reseau equivalent d'un champ de sous-ensembles dans des systemes numeriques de transmission de donnees et reseau equivalent pour la mise en oeuvre dudit procede | |
| DE19513318C1 (de) | Verfahren zum Betrieb eines asynchronen und redundanten Serienbusses | |
| EP1550267A2 (fr) | Procede de transformation d'un procede pour le fonctionnement d'un reseau ainsi que des abonnes pour appliquer le procede | |
| EP0392246B1 (fr) | Système de surveillance et de commande pour systèmes de transmission d'informations numériques avec maître et maître de substitution | |
| DE2365871C3 (de) | Datenübertragungsanlage | |
| AT982U1 (de) | Programmlogik zur datenübertragung zwischen informationsverarbeitenden stationen bzw. geräten |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE |
|
| DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
| 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 |