EP1994713A1 - Procédé de fonctionnement d'un réseau de données décentralisé - Google Patents

Procédé de fonctionnement d'un réseau de données décentralisé

Info

Publication number
EP1994713A1
EP1994713A1 EP07703731A EP07703731A EP1994713A1 EP 1994713 A1 EP1994713 A1 EP 1994713A1 EP 07703731 A EP07703731 A EP 07703731A EP 07703731 A EP07703731 A EP 07703731A EP 1994713 A1 EP1994713 A1 EP 1994713A1
Authority
EP
European Patent Office
Prior art keywords
network
network node
value
query
values
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
EP07703731A
Other languages
German (de)
English (en)
Inventor
Steffen Rusitschka
Alan Southall
Sebnem ÖZTUNALI
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
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 EP1994713A1 publication Critical patent/EP1994713A1/fr
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
    • H04L43/103—Active monitoring, e.g. heartbeat, ping or trace-route with adaptive polling, i.e. dynamically adapting the polling rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/16—Threshold monitoring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1012—Server selection for load balancing based on compliance of requirements or conditions with available server resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1023—Server selection for load balancing based on a hash applied to IP addresses or costs
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1029—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] 
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H04L67/1078—Resource delivery mechanisms
    • H04L67/1085—Resource delivery mechanisms involving dynamic management of active down- or uploading connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Definitions

  • the invention relates to a method for operating a decentralized data network comprising a plurality of network nodes, wherein the network nodes can direct queries to the data network by means of sample values.
  • resources are distributed decentrally to the individual network nodes. It is possible here that each individual network node uses keywords to search for corresponding resources. For this purpose, query values are used, whereby a unique query value is generated from a keyword.
  • the polling values are managed by the network nodes, each network node being responsible for predetermined polling values. With the help of the query values, network nodes set up e.g. Searches in the net. Furthermore, a network node can also send so-called. Publication requests for a particular query value to the network node, which is responsible for the particular query value.
  • the sending network node announces that it wants to publish resources, which are associated with the particular request value and thereby the corresponding keyword, to the network, i. want to provide the other network node.
  • the network nodes may direct so-called subscription requests to the network by which a network node informs another network node responsible for a particular query value that it wishes to be informed of the publication of content relating to that particular query value.
  • the query values are for example hash values, which are generated with a hash algorithm.
  • the query values are stored in a table, wherein each table entry has a corresponding query value and this Contains data associated with the query value, for example a reference to the location of corresponding resources. This data is related to the keyword from which the query value was generated.
  • the table is preferably distributed decentrally in the data network, wherein each network node is responsible for a range of values of the table.
  • the object of the invention is therefore to provide a method for operating a decentralized data network, in which Overloading a network node is easily and effectively avoided due to too many requests.
  • the value table is preferably the distributed hash table mentioned above, wherein the query values in the hash table represent hash values. It is preferably ensured that one or more keywords are uniquely assigned to a query value, which can be achieved when using a distributed hash table with a hash algorithm, for example SHA1.
  • the frequency with which requests for the polling values assigned to a respective network node are directed to the respective network node is monitored for the network nodes.
  • inquiries here are in particular the search and / or
  • the inventive method is characterized in that in the event that the frequency of requests for one or more queries to a particular network node exceeds a predetermined threshold, at least one or more of the table entries of this or these queries are assigned to at least one other network node.
  • the threshold value can be set according to the requirements and the size of the data network For example, the threshold can be determined heuristically.
  • the data associated with a query value are, in a preferred embodiment of the invention, resources, in particular files, or references to memory locations of resources in the data network.
  • the other network node to which at least one or more table entries are assigned, is designed such that it can process inquiries whose frequency is above the predetermined threshold value. This ensures that it does not come again to an overload of the data network, because the other network node has a capacity that ensures the processing of popular requests.
  • the other network node can be a single powerful network computer or a cluster of network computers.
  • a new network node is added to the data network, wherein at least one or these table entries are assigned to the new network node.
  • the frequency of the requests for one or more query values in a respective network node is exceeded, it is also possible for at least one or more of the table entries of this or these query values to be assigned to a network node already present in the data network.
  • an assignment of the table entry or entries to another network node is reversed if the frequency of the requests is again below the predetermined threshold value. This ensures that the original network structure is restored in normal operation.
  • the network nodes each manage a contiguous range of values of table entries.
  • the query value for which the threshold of the frequency of the requests in the respective network node has been exceeded is removed from the value range of the respective network node and assigned to the other network node.
  • the values of the value range of the respective overloaded network node from the beginning of the value range to the extracted query value-excluding this query value- are assigned to the network node which has the value range which lies adjacent to the beginning of the value range of the congested network node.
  • the values of the value range of the respective network node are assigned to the overloaded network node as the new value range from the extracted query value-and exclusively this query value-up to the end of the value range of the overloaded network node.
  • the method is based on the join mechanism known for networks with distributed hash tables and ensures a simple and effective incorporation of a new network node by dividing the hash areas into adjacent network nodes.
  • the steps of monitoring requests and / or assigning table entries to other network nodes are performed remotely by each network node for the requests addressed to it.
  • the data network can be managed by a network operator, wherein the individual network nodes report congestion to the network operator, who then executes the assignment of table entries to another network computer, in particular the inclusion of a new network computer.
  • the invention further relates to a decentralized data network comprising a plurality of network nodes, wherein the data network is designed such that a method according to one of the preceding claims is feasible.
  • the data network is in this case, for example, a computer network in which the network nodes comprise one or more computers, in particular a peer-to-peer network, for. In the form of a chord ring.
  • FIG. 1 shows a schematic representation of a distributed hash table based peer-to-peer network in which the inventive method can be used;
  • FIG. 2 shows a schematic representation analogous to FIG. 1, in which the scenario of overloading a peer is illustrated;
  • FIG. and 3 shows a view analogous to FIGS. 1 and 2, which illustrates the replacement of the overloaded peer according to an embodiment of the method according to the invention.
  • a decentralized data network in the form of a peer-to-peer overlay network which is operated according to the method according to the invention, is considered by way of example.
  • the network has a ring structure, for example in the form of a chord ring, and comprises peers A, B, C, D, E, F, G, H, and I, which represent network nodes, which in turn represent one or more network computers.
  • it is possible to search for resources in the network.
  • the well-known from the prior art distributed hash table is used.
  • the search is made possible by means of keywords, whereby for each keyword a unique hash value is generated by a hash algorithm, for example SHAl.
  • a hash table which comprises a plurality of hash values, with corresponding data being associated with each hash value.
  • This table is distributed in the network of Fig. 1 to the participating network nodes A to I, each network node is responsible for a range of values of the table. According to Fig. 1, the responsibilities are distributed as follows:
  • Peer A manages the hash values 10000000 to 10000009; Peer B manages the hash values 10000010 to 10000019; Peer C manages the hash values 10000020 to 10000029; Peer D manages the hash values 10000030 to 10000039; Peer E manages the hash values 10000040 to 10000049; Peer F manages the hash values 10000050 to 10000059; Peer G manages the hash values 10000060 to 10000069; Peer H manages the hash values 10000070 to 10000079; Peer I manages the hash values 10000080 to 10000089.
  • Each peer can now use the keywords to query the data network, converting the keywords to the appropriate hash values.
  • the mechanism of finding hash values in a hash table distributed on peers is a mechanism well known in the art, which will therefore not be described further.
  • FIG. 2 shows, by way of example, the process of sending inquiries in the data network of FIG. 1.
  • requests from various peers S1 to S7 are directed to other peers, as indicated by corresponding solid or dashed arrows.
  • the requests S1 to S5 are directed by the corresponding peers I, G, F, C and E to the peer D.
  • These requests are shown with solid lines.
  • the requests here are, for example, search queries that search for a file xyz.doc that is requested more than frequently in the network, the corresponding hash value for these search requests being stored in peer D.
  • the hash value that is most frequently queried in Peer D has the value 10000033, which is within the range of values managed by Peer D.
  • the requests S6 and S7 of the peers F and H relate to other data stored in the network, which are less popular.
  • each peer can default, which in turn can cause the entire network to collapse.
  • it is monitored in each peer how frequently requests are directed to the respective peer. This can be decentralized by any peer However, it is also possible that a central monitoring entity is provided, which monitors the requests in all peers.
  • the frequency of the requests are detected by the peer itself, and when a threshold value is exceeded, each peer issues a corresponding message to a network operator, which is set up on the decentralized network.
  • the network operator manages a plurality of very powerful computers or computer clusters, which can be integrated into the decentralized data network if required.
  • the peer D reports an overload due to too frequent requests to the network operator.
  • the operator now removes the peer D from the network and replaces it with a high-performance computer or cluster of high-performance computers.
  • This process is shown in FIG.
  • the peer D is now no longer available, but instead a high-performance computer J is used, the computer is designed so that it can meet the capacity requirements of the strong requests.
  • the computer J is therefore a substitute for the peer D and he takes over the management of previously managed by Peer D hash values 10000030 to 10000039. If after a certain period of time, it is found that the number of requests in the computer J goes back again this is reported to the network operator, who can then reintegrate the original peer D into the data network.
  • the peer C which manages the adjacent smaller hash values 10000020 to 10000029, now also assumes the value range of 10000030 to 10000032, that is, he now manages the hash Values 10000020 to 10000032.
  • the hash value redistribution mechanism just described is the join mechanism known from the prior art for attaching a new peer in a distributed hash table based peer-to-peer system.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Cardiology (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention concerne un procédé de fonctionnement d'un réseau de données décentralisé comprenant une pluralité de nœuds de réseau (A,…, I), les nœuds de réseau (A,…, I) pouvant adresser des requêtes (S1,…, S7) à l'aide de valeurs de requêtes dans le réseau de données, dans lequel : a) une ou plusieurs entrées d'un tableau de valeurs réparti sur les nœuds de réseau (A,…, I) sont attribuées à plusieurs nœuds de réseau (A,…, I), chaque entrée de tableau comprenant une valeur d'interrogation et des données affectées à la valeur d'interrogation; b) la fréquence avec laquelle des requêtes (S1,…, S7) pour les valeurs d'interrogation respectives attribuées à chacun des nœuds de réseau (A,…,I) sont adressées à chacun des nœuds de réseau (A,…,I) est contrôlée; c) au cas où l'on établit dans l'étape b) que la fréquence des requêtes (S1,…, S7) pour une ou plusieurs valeurs d'interrogation respectives à l'un des nœuds de réseau (A,…, I) dépasse une valeur seuil prédéterminée, au moins la ou les entrée(s) de tableau de cette ou de ces valeur(s) d'interrogation est (sont) attribuée(s) à au moins un autre nœud de réseau (J).
EP07703731A 2006-03-10 2007-01-09 Procédé de fonctionnement d'un réseau de données décentralisé Ceased EP1994713A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102006011291A DE102006011291A1 (de) 2006-03-10 2006-03-10 Verfahren zum Betrieb eines dezentralen Datennetzes
PCT/EP2007/050181 WO2007104586A1 (fr) 2006-03-10 2007-01-09 Procédé de fonctionnement d'un réseau de données décentralisé

Publications (1)

Publication Number Publication Date
EP1994713A1 true EP1994713A1 (fr) 2008-11-26

Family

ID=37964594

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07703731A Ceased EP1994713A1 (fr) 2006-03-10 2007-01-09 Procédé de fonctionnement d'un réseau de données décentralisé

Country Status (5)

Country Link
US (1) US7936768B2 (fr)
EP (1) EP1994713A1 (fr)
CN (1) CN101401388A (fr)
DE (1) DE102006011291A1 (fr)
WO (1) WO2007104586A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102006052451B4 (de) * 2006-07-24 2008-05-08 Siemens Ag Verfahren zum Betrieb eines dezentralen Datennetzes
DE102007018299B3 (de) * 2007-04-18 2008-10-23 Siemens Ag Verfahren zur Verteilung von Ressourcen auf Netzknoten in einem dezentralen Datennetz
US8582469B2 (en) * 2007-11-14 2013-11-12 Cisco Technology, Inc. Peer-to-peer network including routing protocol enhancement
US20140233392A1 (en) * 2011-09-21 2014-08-21 Nec Corporation Communication apparatus, communication system, communication control method, and program
FR2993735B1 (fr) * 2012-07-17 2015-04-17 Thales Sa Procede d'optimisation d'un service de dissemination des informations de qualite de service reseau
US20180028406A1 (en) * 2016-08-01 2018-02-01 Jim Patton Secure Controlled Substance Pill Dispensing Device

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7054867B2 (en) * 2001-09-18 2006-05-30 Skyris Networks, Inc. Systems, methods and programming for routing and indexing globally addressable objects and associated business models
US7096228B2 (en) * 2002-03-27 2006-08-22 Microsoft Corporation Method and system for managing data records on a computer network
US7206934B2 (en) * 2002-09-26 2007-04-17 Sun Microsystems, Inc. Distributed indexing of identity information in a peer-to-peer network
US7657597B2 (en) * 2002-09-26 2010-02-02 Sun Microsystems, Inc. Instant messaging using distributed indexes
US8095500B2 (en) * 2003-06-13 2012-01-10 Brilliant Digital Entertainment, Inc. Methods and systems for searching content in distributed computing networks
US8880502B2 (en) * 2004-03-15 2014-11-04 International Business Machines Corporation Searching a range in a set of values in a network with distributed storage entities
US7685312B1 (en) * 2005-02-10 2010-03-23 Sun Microsystems, Inc. Resource location by address space allocation
US20070143442A1 (en) * 2005-12-20 2007-06-21 Nec Laboratories America, Inc. Scalable Publish/Subscribe Broker Network Using Active Load Balancing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2007104586A1 *

Also Published As

Publication number Publication date
US7936768B2 (en) 2011-05-03
WO2007104586A1 (fr) 2007-09-20
US20090028165A1 (en) 2009-01-29
DE102006011291A1 (de) 2007-09-27
CN101401388A (zh) 2009-04-01

Similar Documents

Publication Publication Date Title
DE60317403T2 (de) Mehrstufige Cache-Speicherarchitektur und Cache-Speicherverwaltungsverfahren für gleichrangiges Namensauflösungs-Protokoll
DE69628769T2 (de) System und Verfahren um die Belastung von Datei-Server zu verteilen
DE60111072T2 (de) Verfahren und vorrichtung zur parallelen nachrichtenübermittlung in echtzeit von dateisegmentierten
DE60306084T2 (de) Verfahren zur Rundsendung von Inhalten eines Peer-to-Peer Netzes
DE112018000193B4 (de) Daten sequenziell in Zonen in einem verstreuten Speichernetzwerk speichern
DE60317925T2 (de) Steuerung von netzwerkverkehr in einer peer-to-peer umgebung
EP1423964B1 (fr) Reseau point a point echelonnable presentant un service de repertoire
DE602005001883T2 (de) Überlagerte Daten, Selbstorganisierte überlagerte Metadaten, und Mehrfachsendung auf Anwendungsebene
DE60015423T2 (de) Verfahren und Vorrichtung zur Objektwiedergabe in einem Netzwerk
DE602005000862T2 (de) Datenverteilungssystem basierend auf einer Punkt-zu-Punkt Architektur
DE112019000309B4 (de) Dynamisches batching von berechtigungen in einem verteilten speichernetzwerk
DE60128200T2 (de) Methode und System für skalierbare, hochperformante hierarchische Speicherverwaltung
DE602004010807T2 (de) Techniken zur bereitstellung eines virtuellen arbeitsraums, bestehend aus einer vielzahl elektronischer einrichtungen
EP1994713A1 (fr) Procédé de fonctionnement d'un réseau de données décentralisé
DE202014010898U1 (de) Hierarchische Stückelung von Objekten in einem dezentralen Speichersystem
DE112010004772T5 (de) Verfahren und System zum Verwalten von Konfigurationen von Systemverwaltungsagentenin einer Verteilten Umgebung
DE112012002631T5 (de) Stream-Verarbeitung unter Verwendung einer Client-Server-Architektur
DE112010003458B4 (de) Verfahren und System für die Verwaltung der P2P-Dateiübertragung
EP2095611B1 (fr) Procédé de répartition de charge dans un réseau dédié au poste à poste
WO2005073852A1 (fr) Procede permettant de faire fonctionner un ensemble de plusieurs ordinateurs en cas de defaillance d'un ordinateur
DE102016125023A1 (de) Verfahren zum Betreiben eines Druckservers für digitale Hochleistungsdrucksysteme
EP2044738B1 (fr) Procédé pour l'exploitation d'un reseau de données decentralisé
DE112005001995T5 (de) Computeranordnung und Verfahren zum Anbieten von Diensten für Benutzer über ein Netzwerk
DE102007018299B3 (de) Verfahren zur Verteilung von Ressourcen auf Netzknoten in einem dezentralen Datennetz
DE102018111318A1 (de) Verarbeitungsverfahren und Endgerätevorrichtung

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20080731

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

17Q First examination report despatched

Effective date: 20090811

DAX Request for extension of the european patent (deleted)
RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20140127