EP2269347A2 - Procédé et ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné d'un réseau de communication - Google Patents

Procédé et ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné d'un réseau de communication

Info

Publication number
EP2269347A2
EP2269347A2 EP09719700A EP09719700A EP2269347A2 EP 2269347 A2 EP2269347 A2 EP 2269347A2 EP 09719700 A EP09719700 A EP 09719700A EP 09719700 A EP09719700 A EP 09719700A EP 2269347 A2 EP2269347 A2 EP 2269347A2
Authority
EP
European Patent Office
Prior art keywords
identifier
incoming message
list
idl
filter arrangement
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.)
Withdrawn
Application number
EP09719700A
Other languages
German (de)
English (en)
Inventor
Florian Hartwich
Franz Bailer
Markus Ihle
Christian Horst
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.)
Robert Bosch GmbH
Original Assignee
Robert Bosch GmbH
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 Robert Bosch GmbH filed Critical Robert Bosch GmbH
Priority to EP14196470.0A priority Critical patent/EP2882144B1/fr
Publication of EP2269347A2 publication Critical patent/EP2269347A2/fr
Withdrawn legal-status Critical Current

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/40006—Architecture of a communication node
    • H04L12/40032—Details regarding a bus interface enhancer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
    • H04L63/0227—Filtering policies
    • 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/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • H04L12/4625—Single bridge functionality, e.g. connection of two networks over a single bridge
    • 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/40208—Bus networks characterized by the use of a particular bus standard
    • H04L2012/40215—Controller Area Network CAN

Definitions

  • the present invention relates to a method for filtering incoming messages via a serial data bus of a communication network in a communication module of a subscriber connected to the data bus by means of a filter arrangement.
  • the messages each have an identifier for identification.
  • the intrinsic circuits of the filter arrangement are defined by identifiers of messages stored in at least one list of the filter arrangement.
  • the invention also relates to a filter arrangement for a communication module of a subscriber connected to a serial data bus of a communication network for carrying out said method.
  • Communication networks are known from the prior art in which messages are transmitted in accordance with serial communication protocols (eg Controller Area Network (CAN), FlexRay, Local Interconnect Network (LIN), Media Oriented Systems Transport (MOST)).
  • the networks comprise at least one data bus to which a plurality of subscriber nodes are connected. It is also known not to use all the messages sent via the data bus from all the subscriber nodes connected to the data bus in these communication networks.
  • the subscriber nodes each comprise a communication module and an application. To relieve the host application in the subscriber node, many communication modules only the messages are passed to the application, which are also used in the application.
  • the messages are recognized by their numerical identifier (so-called identifier). This method is called acceptance filtering.
  • the known methods for acceptance filtering include lists of identifiers which are to be transmitted (so-called acceptance codes). Parts of the identifiers can be hidden for filtering, so that Each list entry can stand for a group of identifiers (so-called acceptance mask). In each case, n bits of the identifier can be masked out by means of a mask, so that the identifier stands for a group of 2n identifiers.
  • the known method can be varied by lists of identifiers which are not accepted, that is to be blocked. These lists can be configured by software.
  • the present invention is based on the object to realize an acceptance filtering with a large number of filter criteria with the least possible effort.
  • the filter method according to the invention thus does not use a list with individual identifiers with optional acceptance masks, but rather a list of identifier pairs.
  • the proposed method defines an identifier pair as a bandpass (so-called acceptance filter) or as a band-stop filter (so-called rejection filter). All identifiers of received messages whose numerical values are numerically between the two numerical values (the first and second identifier) of the identification pair are accepted (bandpass) or rejected or discarded (band-stop filter). Several pairs of identifiers can be considered sequentially until a matching pair is found or until the end of the list is reached.
  • the advantage of the range filter according to the invention lies in the fact that the identifier pairs can be viewed independently of one another and that the width of the filter ranges can be defined as desired.
  • the filter arrangement is preferably implemented in hardware.
  • the identifier pairs are preferably viewed sequentially starting with a specific identifier pair, in particular starting at the beginning of the list. This has the advantage that the control of the filtering process and the access to the list contents is simple and resource-saving and that the identifier
  • Pairs can be stored in random access memory (eg Random Access Memory, RAM), but also in a read-only memory (ROM and modifications thereof (PROM, EPROM, EEPROM)) and not in (flip-flop) Registers must be implemented.
  • RAM Random Access Memory
  • ROM read-only memory
  • PROM EPROM
  • EEPROM electrically erasable programmable read-only memory
  • Figure 1 shows an example of a communication network with subscriber nodes, which have a filter arrangement according to the invention
  • FIG. 2 shows an example of a flowchart of a filtering method according to the invention
  • FIG. 3 shows an example of a filter element of a list of the filter arrangement according to the invention for 11-bit identifiers of CAN messages
  • FIG. 4 shows an example of a filter element of a list of the filter arrangement according to the invention for 29-bit identifiers of CAN messages.
  • a communication network is designated in its entirety by the reference numeral 1.
  • the network 1 comprises a data bus 2, which is represented symbolically by a single line.
  • Several subscriber nodes 3 are connected to the data bus 2, of which only three are shown by way of example in FIG.
  • Each node 3 is connected to the data bus 2 via a communication module 4.
  • the nodes 3 also have a host application 5.
  • Messages 7 may be transmitted over the data bus 2 in accordance with a serial communication protocol (e.g., CAN, FlexRay, LIN, MOST, and the like).
  • the communication module 4 is responsible for receiving and sending messages 7 via the data bus 2. Since not all messages 7 sent via the bus 2 are used by all the nodes 3 connected to the bus 2, the communication modules 4 have a filter arrangement 6. The filter arrangement 6 transmits only those messages 7 to the application 5 which are determined for the respective node 3 and actually used in the application 5 of the node 3.
  • the message 7 each have an identifier 8 (so-called. Identifier), which allows a unique identification of the message ⁇ 7.
  • the identifier 8 is, for example, a type of sender address which allows the origin of the message 7 to be determined and identifies the content of the message 7.
  • the messages 7 also have a user data part 9 (so-called payload).
  • the filtering process performed by the filter assembly 6 is also referred to as acceptance filtering.
  • the present invention relates to a development of the filter assembly 6, so that a particularly large number of filter criteria can be implemented with relatively little effort.
  • Acceptance filtering begins to operate when a new message 7 has been received.
  • the identifier 8 of the received message 7 (a numerical value) is compared with a list of configured identifier pairs to decide whether the received message 7 is forwarded to the application software 5 or whether the message 7 is discarded.
  • An essential aspect of the invention relates to at least one list which is stored in a memory element 10 of the filter arrangement 6.
  • the memory element 10 is preferably used as a memory with optional em access (eg RAM) or as a read only memory (eg flash memory, ROM, EEPROM) formed.
  • the at least one list includes, for example, 128 entries each having a width of 32 bits. Of course, the list may also have a larger or smaller number of entries (eg 256 or 64) or entries with a larger or smaller width (eg 64 or 16 bits).
  • a word width of 64 bits would have the advantage that, for example, for extended 29-bit CAN identifiers, an identifier pair together with configuration bits could be accommodated in one data word so that both identifiers of the identifier pair could be read in with a single read operation.
  • a plurality of identifier pairs are stored, each of which defines an area bounded by a first identifier ID1 and a second identifier ID2.
  • the identifier pairs from the list are preferably compared sequentially with the identifier 8 of the incoming message 7. If no area defined by an identifier pair can be found in the list in which the identifier 8 of the message 7 lies, the incoming message 7 can either be forwarded to the application 5 or rejected, depending on the configuration.
  • the advantage of the method is that the identifier pairs can be viewed sequentially independently of each other and that the width of their filter areas can be configured as desired. Because the identifier pairs are considered sequentially, they can be stored in random access memory or read-only memory and need not be implemented in flip-flop registers. This allows a simple and cost-effective implementation of the invention.
  • the comparison identifiers are present as a list of identifier pairs which are stored in a memory element 10.
  • the memory 10 is typically implemented as RAM, for non-volatile memory non-volatile memories (NVRAM, Flash memory, FeRAM, MRAM, PCRAM) are also possible.
  • NVRAM non-volatile memory non-volatile memories
  • FeRAM FeRAM
  • MRAM MRAM
  • PCRAM PCRAM
  • the number of identifier pairs is freely adjustable. It is determined for each identifier pair whether it acts as a bandpass (so-called acceptance filter) or as a band-stop filter (so-called rejection filter). The two numeric values of an identifier pair may be identical, the identifier pair then only affects a specific message.
  • the acceptance filter 6 or the content of the at least one filter list and the received messages can be stored in the same memory that
  • an identifier pair may be stored in a e.g. 32-bit data word can be accommodated.
  • an identifier pair may be in e.g. two 32-bit data words are accommodated, each with configuration bits that determine, for example, whether the pair acts as a bandpass or as a band-stop filter.
  • optional identifiers in the list of identifiers whose two numerical values are identical can be replaced by individual identifiers.
  • separate lists for data frames and for remote frames as well as for 11-bit identifiers and for 29-bit identifiers can be provided.
  • the proposed acceptance-filtering method can also be combined with masks that hide parts of the identifiers for filtering.
  • a first identifier contained in the list is used as an acceptance identifier and a corresponding second identifier contained in the list as an acceptance mask.
  • a combination of the proposed range filter method with a so-called. Dual ID filter would be conceivable. Both identifiers stored in the list are compared with the identifier 8 of the received message 7.
  • the method begins in a function block 20. Acceptance filtering begins to operate when a new message 7 has been received. Subsequently, in a function block 21, the identifier (ID) 8 of an incoming message 7 is read. In a function block 22, a pointer (so-called pointer) is set to a specific position in the list, preferably to the first identifier pair at the beginning of the list. The filter switching mechanism receives as input parameters the identifier 8 of the received message 7, the pointer to the list of identifier pairs and the number of list entries (size of the list). In a query block 23 it is checked whether the pointer is still within the list.
  • the derailleur reads a first identifier pair from the list in a function block 24 and checks in a query block 25 whether the numerical value of the received identifier 8 in the range defined by the identifier pair. If not, the pointer is incremented by "1" in a function block 26 and branched to the query block 23. During the subsequent run, the next identifier pair is read from the list and compared with the identifier 8 of the attached message 7. This loop thus becomes run a long time until the end of the list is reached ("no" at inquiry block 23) or until there is a "match", that is, until the numerical value of the received identifier 8 lies within the range defined by the identifier pair ("Yes "at query block 25).
  • a branch is made to a query block 27, where it is determined whether the current identifier pair should act as a bandpass (acceptance). If so, it is determined in a function block 28 that the incoming message 7 should be accepted If no, it is determined in a function block 29 that the incoming message 7 should be rejected, and information on whether the identifier pair should act as a bandpass or as a band-stop filter may also be included in the list in the form of a configuration bit SFM (default Filter Mode) to be stored.
  • SFM default Filter Mode
  • a branch is made into a further query block 30, where it is checked whether the incoming message 7 is to be stored in a first buffer FIFOO, from where the application 5 can then pick up the message 7.
  • a first buffer FIFOO for example, it is conceivable to store the message 7 in a different buffer, depending on whether the message 7 is important or unimportant, time-critical or less time-critical, or in the case of a gateway for channel A or for channel B.
  • Information about in which buffer the message 7 is to be stored can also be stored in the list in the form of a configuration bit SFFS (Standard Filter FIFO Select).
  • SFFS Standard Filter FIFO Select
  • a branch is made to a function block 32 where it is determined that the message 7 is stored in the second buffer FIFOl, from where the application 5 can then pick up the message 7.
  • the present invention is not limited to just two latches FIFOO and
  • FIFOl limited.
  • a larger number of FIFOs with a depth of 1 would then be a so-called FuII-CAN.
  • a function block 33 the incoming message 7 is then stored in the selected buffer FIFOO or FIFOl. Then the method is terminated in a function block 34. The procedure is terminated even if the pending message is to be rejected (function block 29).
  • the bit 31 comprises a configuration bit SFE (standard filter enable). All active filter elements are used for acceptance filtering of standard data frames.
  • the value "0" of the bit 31 indicates that the filter is inactive, and the value "1" indicates that the filter is active.
  • Bit 30 comprises a configuration bit SFM (Standard Filter Mode). The value "0" of the bit 30 indicates that the pending message 7 is accepted if the filtering results in a "match", and the value "1" indicates that the pending message is discarded if the filtering results in a "match” ,
  • Bits 29 and 28 include SFT (standard filter type) configuration bits.
  • the value "00" of bits 29 and 28 indicates that the filter element comprises a range filter in the range from the first identifier ID1 to the second identifier ID2.
  • the value "Ol” indicates that the filter element has a dual ID filter for the first identifier IDl and the second identifier ID2 includes.
  • the value "10” means that the filter element comprises a Classic filter, wherein the first identifier ID1 represents an acceptance code and the second identifier ID2 represents an acceptance mask
  • the value "11” is reserved, for example for future extensions of the method ,
  • the bit 27 comprises a configuration bit SFFS (Standard Filter FIFO Select).
  • SFFS Standard Filter FIFO Select
  • the value "0" of the bit 27 indicates that an accepted message 7 is stored in a first buffer FIFOO
  • the value "l" indicates that an accepted message 7 is stored in a second buffer FIFOl.
  • the eleven bits 26 to 16 include the standard filter identifier ID1, and the eleven bits 10 to 0 include the standard filter identifier ID2. Bits 11 to 15 are reserved.
  • FIG. 4 shows a possible structure of two 32-bit data words of the
  • the bit 31 of the first data word FO comprises a configuration bit EFE (Extended Filter Enable). All active filter elements are used for acceptance filtering of extended data frames. The value “0" of the bit 31 indicates that the filter is inactive, and the value “1" indicates that the filter is active.
  • Bit 30 of the first data word comprises an EFM (Extended Filter Mode) configuration bit. The value “0” of the bit 30 indicates that the pending message 7 is accepted if the filtering results in a "match”, and the value "l” indicates that the pending message is discarded if the filtering results in a "match” , Bit 29 of the first data word is reserved.
  • the bits 31 and 30 of the second data word Fl comprise configuration bits EFT (Extended Filter Type).
  • the value "00" of bits 31 and 30 indicates that the filter element comprises a range filter in the range from the first identifier ID1 to the second identifier ID2.
  • the value "01" indicates that the filter element has a dual ID filter for the first identifier IDl and the second identifier ID2 includes.
  • the value "10” means that the filter element comprises a classic filter, wherein the first identifier ID1 represents an acceptance code and the second identifier ID2 represents an acceptance mask
  • the value "11” is reserved, for example for future extensions of the method
  • Bit 29 of the second data word comprises a configuration bit EFFS (Extended Filter FIFO Select).
  • the value "0" of the bit 29 indicates that an accepted message 7 is stored in a first buffer FIFOO, and the value "1" indicates that an accepted message 7 is stored in a second buffer FIFOl.
  • the 29 bits 28 to 0 of the first data word include the extended filter identifier ID1, and the 29 bits 28 to 0 of the second data word include the extended filter identifier ID2.
  • the inventive method is particularly suitable for use in a gateway.
  • a so-called basic CAN controller with one or more FIFOs is preferably used.
  • the gateway is connected to different data buses 2 of different networks 1. It is used to transmit messages from a first data bus 2 of a first network 1 to a second data bus 2 of a second network 1.
  • the gateway software can be decisively relieved.
  • a decisive advantage of the invention also comes into play. Unlike many normal subscriber nodes 3, a gateway must be able to process, ie forward, a large number of messages 7 transmitted in a network 1. Out For this reason, a gateway has a particularly large number of filter criteria that can be implemented in hardware with little effort by the present invention.
  • the present invention allows a particularly fast, efficient and resource-saving implementation of the filtering of incoming messages.
  • the method according to the invention can also be used for so-called full-CAN controllers by not only differentiating additional configuration bits of the filter elements between two FIFOs, but also sorting specific messages in memories reserved for these messages (so-called "dedicated message buffers") ,

Abstract

L'invention concerne un procédé et un ensemble filtre (6) pour filtrer des messages entrant (7) par un bus de données (2) sériel d'un réseau de communication (1), dans un module de communication (4) d'un abonné (3) connecté au bus de données (2). L'invention vise à réaliser un filtrage particulièrement simple et efficace de messages entrant (7), même en cas d'un nombre élevé de critères de filtrage. A cet effet, l'ensemble filtre (6) comprend une liste dans laquelle sont consignées plusieurs paires de caractéristiques (ID1, ID2) qui définissent une zone délimitée par une première caractéristique (ID1) et par une deuxième caractéristique (ID2). La caractéristique (8) d'un message entrant (7) est comparée au moins à des paires de caractéristiques (ID1, ID2) sélectionnées de la liste, puis il est demandé si la caractéristique (8) du message entrant (7) est supérieure ou égale à la première caractéristique (ID1) sélectionnée et inférieure ou égale à la deuxième caractéristique (ID2) sélectionnée. En fonction de la détermination par bits de configuration (SFM; EFM), le message entrant (7) est transmis à l'application (5) ou refusé si la caractéristique (8) du message entrant (7) se trouve dans la zone délimitée par la première caractéristique (ID1) et par la deuxième caractéristique (ID2).
EP09719700A 2008-03-10 2009-03-05 Procédé et ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné d'un réseau de communication Withdrawn EP2269347A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP14196470.0A EP2882144B1 (fr) 2008-03-10 2009-03-05 Procédé et agencement de filtre destinés à filtrer des informations entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un abonné du réseau

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102008000583 2008-03-10
PCT/EP2009/052571 WO2009112411A2 (fr) 2008-03-10 2009-03-05 Procédé et ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné d'un réseau de communication

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP14196470.0A Division EP2882144B1 (fr) 2008-03-10 2009-03-05 Procédé et agencement de filtre destinés à filtrer des informations entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un abonné du réseau

Publications (1)

Publication Number Publication Date
EP2269347A2 true EP2269347A2 (fr) 2011-01-05

Family

ID=40756415

Family Applications (4)

Application Number Title Priority Date Filing Date
EP14196470.0A Active EP2882144B1 (fr) 2008-03-10 2009-03-05 Procédé et agencement de filtre destinés à filtrer des informations entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un abonné du réseau
EP09719700A Withdrawn EP2269347A2 (fr) 2008-03-10 2009-03-05 Procédé et ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné d'un réseau de communication
EP14196479.1A Active EP2882145B1 (fr) 2008-03-10 2009-03-06 Procédé et agencement de filtre destinés à stocker des informations rélies aux messages entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un noeud du réseau
EP09719565A Withdrawn EP2274877A2 (fr) 2008-03-10 2009-03-06 Procédé et un ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné de réseau de communication

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP14196470.0A Active EP2882144B1 (fr) 2008-03-10 2009-03-05 Procédé et agencement de filtre destinés à filtrer des informations entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un abonné du réseau

Family Applications After (2)

Application Number Title Priority Date Filing Date
EP14196479.1A Active EP2882145B1 (fr) 2008-03-10 2009-03-06 Procédé et agencement de filtre destinés à stocker des informations rélies aux messages entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un noeud du réseau
EP09719565A Withdrawn EP2274877A2 (fr) 2008-03-10 2009-03-06 Procédé et un ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné de réseau de communication

Country Status (7)

Country Link
US (2) US9154324B2 (fr)
EP (4) EP2882144B1 (fr)
JP (2) JP5221685B2 (fr)
CN (2) CN101965714B (fr)
DE (1) DE102009001377A1 (fr)
RU (1) RU2487483C2 (fr)
WO (2) WO2009112411A2 (fr)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9256714B2 (en) * 2011-11-09 2016-02-09 International Business Machines Corporation Preserving integrity of messages in a messaging oriented middleware system
JP5716683B2 (ja) * 2012-01-16 2015-05-13 株式会社デンソー 車載ゲートウェイ装置、車載通信システム、及びプログラム
EP2832070B1 (fr) 2012-03-29 2020-05-20 Arilou Information Security Technologies Ltd. Dispositif pour protéger un système électronique de véhicule
FR3002401B1 (fr) * 2013-02-21 2015-03-13 Renault Sa Procede et dispositif de transmission de trames entre deux bus can
US9703955B2 (en) 2014-07-17 2017-07-11 VisualThreat Inc. System and method for detecting OBD-II CAN BUS message attacks
US10095634B2 (en) * 2015-05-22 2018-10-09 Nxp B.V. In-vehicle network (IVN) device and method for operating an IVN device
US11363035B2 (en) * 2015-05-22 2022-06-14 Fisher-Rosemount Systems, Inc. Configurable robustness agent in a plant security system
US10691631B2 (en) * 2015-11-12 2020-06-23 Mercury Systems, Inc. Broadcast bus frame filter
US20170235698A1 (en) * 2016-02-12 2017-08-17 Nxp B.V. Controller area network (can) message filtering
DE102016205138A1 (de) * 2016-03-29 2017-10-05 Robert Bosch Gmbh Vorrichtung und Verfahren zur Filterung von sicherheitsrelevanten Eingriffen, sowie ein Gateway-Steuergerät
RU2646339C2 (ru) * 2016-06-07 2018-03-02 Общество с ограниченной ответственностью "Научно-Техническая Компания "Эспадон" Способ обработки информационных сообщений телекоммуникационных сетей
US10650621B1 (en) 2016-09-13 2020-05-12 Iocurrents, Inc. Interfacing with a vehicular controller area network
DE102017202602A1 (de) * 2017-02-17 2018-08-23 Robert Bosch Gmbh Verfahren und Vorrichtung zum Betreiben eines Steuergerätes an einem Bus
EP3668756B1 (fr) 2017-08-17 2023-08-02 Red Bend Ltd. Systèmes et procédés pour désactiver une ecu malveillante dans un bus de réseau can (controller area network)
EP3729766A1 (fr) 2017-12-24 2020-10-28 Arilou Information Security Technologies Ltd. Système et procédé de détection de logiciel malveillant basée sur un tunnel
JP2019213081A (ja) * 2018-06-06 2019-12-12 ルネサスエレクトロニクス株式会社 半導体装置及び情報処理方法
CN110808891B (zh) 2019-09-30 2021-10-12 深圳市道通合创新能源有限公司 一种can过滤器合并的方法、装置及can控制器
DE102021201120A1 (de) 2021-02-08 2022-08-11 Robert Bosch Gesellschaft mit beschränkter Haftung Teilnehmerstation für ein serielles Bussystem und Verfahren zur Kommunikation in einem seriellen Bussystem

Family Cites Families (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2433607A1 (fr) * 1993-07-28 1995-02-09 3Com Corporation Station de reseau multifonction a adresses reseaux pour unites fonctionnels
JPH10290268A (ja) 1997-04-17 1998-10-27 Matsushita Electric Ind Co Ltd 同期式シリアル通信回路と通信方法
GB2347309B (en) * 1998-12-16 2003-08-20 Element 14 Inc Decoding packets of digital data
KR20000059519A (ko) 1999-03-04 2000-10-05 권상문 상호 다른 프로토콜을 이용하는 기종간의 통신시스템
US7158986B1 (en) * 1999-07-27 2007-01-02 Mailfrontier, Inc. A Wholly Owned Subsidiary Of Sonicwall, Inc. Method and system providing user with personalized recommendations by electronic-mail based upon the determined interests of the user pertain to the theme and concepts of the categorized document
CN100413279C (zh) * 1999-08-31 2008-08-20 佳能株式会社 信息信号处理设备和信息信号处理方法
US7039614B1 (en) * 1999-11-09 2006-05-02 Sony Corporation Method for simulcrypting scrambled data to a plurality of conditional access devices
JP2002077416A (ja) * 2000-08-30 2002-03-15 Nec Corp 留守番メッセージの転送サービス
KR100570143B1 (ko) * 2000-12-09 2006-04-12 인터내셔널 비지네스 머신즈 코포레이션 상호 통신 프리프로세서
US7012927B2 (en) * 2001-02-06 2006-03-14 Honeywell International Inc. High level message priority assignment by a plurality of message-sending nodes sharing a signal bus
US6907445B2 (en) * 2001-02-12 2005-06-14 International Truck Intellectual Property Company, Llc Consistent application programming interface for communicating with disparate vehicle network classes
DE10143356A1 (de) * 2001-09-04 2003-03-27 Philips Corp Intellectual Pty Akzeptanz-Filter
US7076517B2 (en) * 2001-09-20 2006-07-11 Microchip Technology Incorporated Serial communication device with dynamic filter allocation
US20040153583A1 (en) * 2001-09-20 2004-08-05 Bartling James E. Serial communication device with dynamic allocation of acceptance masks using serial implementation
US6944739B2 (en) * 2001-09-20 2005-09-13 Microchip Technology Incorporated Register bank
US7684321B2 (en) * 2001-12-21 2010-03-23 Hewlett-Packard Development Company, L.P. System for supply chain management of virtual private network services
US7933998B2 (en) * 2002-01-11 2011-04-26 Motorola Mobility, Inc. Dynamic CAN bus system configuration and messaging
EP1370056B1 (fr) * 2002-06-03 2006-07-26 Alcatel Système de télécommunication avec transfer d'une session multimedia en mode packet à une connexion en mode circuit
CA2493196C (fr) * 2002-07-23 2009-09-22 Research In Motion Limited Systeme de gestion de memoire de donnees et procede destine a des appareils sans fil
US7343394B2 (en) * 2003-03-10 2008-03-11 International Business Machines Corporation Method of managing e-mail messages
WO2004105328A1 (fr) * 2003-05-21 2004-12-02 Philips Intellectual Property & Standards Gmbh Memoire a message pour un protocole de communication et son procede
FR2859297A1 (fr) * 2003-08-29 2005-03-04 France Telecom Dispositif de transmission de messages par reseau a des postes d'utilisateurs
US7937759B2 (en) * 2003-10-02 2011-05-03 Auburn University System and method for protecting communication devices from denial of service attacks
AU2004306903C1 (en) * 2003-10-15 2009-01-22 Qualcomm Incorporated High data rate interface
US7366099B2 (en) * 2003-12-01 2008-04-29 Cisco Technology, Inc. Method and apparatus for synchronizing a data communications network
JP4401239B2 (ja) * 2004-05-12 2010-01-20 Ｎｅｃエレクトロニクス株式会社 通信メッセージ変換装置、通信方法及び通信システム
JP2005337017A (ja) 2004-05-24 2005-12-08 Mitsubishi Electric Corp 車両用電子制御装置
DE602004027024D1 (de) * 2004-08-05 2010-06-17 Bosch Gmbh Robert Kommunikationskontrolleur für FlexRay-Netze
CA2484509C (fr) * 2004-09-14 2009-04-21 Jean-Louis Vill Methode et systeme pour le filtrage de messages electroniques
US8230020B2 (en) * 2004-11-22 2012-07-24 Jean-Louis Vill Method and system for filtering electronic messages
EP1659752A1 (fr) * 2004-11-23 2006-05-24 Toshiba Corporation Système et procédé pour filtrer les paquets SNMP pour des dispositifs d'impression
KR100679858B1 (ko) * 2004-11-25 2007-02-07 한국전자통신연구원 동적 우선순위에 기반한 메시지 전달 장치 및 그를 이용한우선순위 조정 장치와 동적 우선순위 메시지 처리 방법
WO2006065108A1 (fr) * 2004-12-17 2006-06-22 Nhn Corporation Systeme et procede de filtrage de messages
US7609669B2 (en) * 2005-02-14 2009-10-27 Vocollect, Inc. Voice directed system and method configured for assured messaging to multiple recipients
US7373462B2 (en) * 2005-03-29 2008-05-13 International Business Machines Corporation Snoop filter for filtering snoop requests
US7532890B2 (en) * 2005-04-01 2009-05-12 Rockliffe Systems Content-based notification and user-transparent pull operation for simulated push transmission of wireless email
DE102005033700B4 (de) * 2005-07-19 2007-03-08 Siemens Ag CAN-System
US20070157156A1 (en) * 2005-12-29 2007-07-05 Microsoft Corporation Information models and the application life cycle
US7877447B2 (en) * 2006-09-11 2011-01-25 International Business Machines Corporation Method and system for managing rejected messages
CN101330736B (zh) * 2007-06-18 2011-04-20 华为技术有限公司 为用户提供呼叫转移业务的方法及装置

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
EP2882145B1 (fr) 2017-03-01
JP2011514111A (ja) 2011-04-28
EP2274877A2 (fr) 2011-01-19
CN101965714B (zh) 2014-03-26
RU2010141342A (ru) 2012-04-20
WO2009112411A3 (fr) 2009-11-26
CN101965714A (zh) 2011-02-02
DE102009001377A1 (de) 2009-09-17
US9154324B2 (en) 2015-10-06
US8954516B2 (en) 2015-02-10
US20110113107A1 (en) 2011-05-12
JP5199399B2 (ja) 2013-05-15
JP5221685B2 (ja) 2013-06-26
EP2882145A1 (fr) 2015-06-10
EP2882144B1 (fr) 2017-03-01
WO2009112434A3 (fr) 2009-12-30
EP2882144A2 (fr) 2015-06-10
JP2011528193A (ja) 2011-11-10
CN101965713A (zh) 2011-02-02
RU2487483C2 (ru) 2013-07-10
US20110125855A1 (en) 2011-05-26
WO2009112411A2 (fr) 2009-09-17
EP2882144A3 (fr) 2015-10-21
WO2009112434A2 (fr) 2009-09-17

Similar Documents

Publication Publication Date Title
EP2882144B1 (fr) Procédé et agencement de filtre destinés à filtrer des informations entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un abonné du réseau
DE60300333T2 (de) Verfahren und Vorrichtung für ein flexibles Rahmenverarbeitungs und Klassifikationssystem
EP1284561B1 (fr) Procedé et dispositif pour commander les paquets de données
DE60026676T2 (de) Paketklassifizierungsautomat
EP1069731B1 (fr) Réseau et procédé pour l'échange de messages
WO1996010308A1 (fr) Procede et dispositif d'adressage d'utilisateurs dans un reseau comprenant au moins deux segments
DE112017000902T5 (de) Weiterleitungsvorrichtung
DE102014224944A1 (de) Verfahren und Steuergerät zur Übertragung sicherheitsrelevanter Daten in einem Kraftfahrzeug mittels eines Ethernet-Standards
DE102016211189B4 (de) Weiterleitungsvorrichtung
DE102008001548B4 (de) Teilnehmerknoten eines Kommunikationssystems, Kommunikationssystem und Verfahren zum Übertragen einer Nachricht in dem Kommunikationssystem
DE102014207479A1 (de) Verfahren zum Klassifizieren eines Datensegments bezüglich dessen Weiterverarbeitung
DE10327545B4 (de) Verfahren und Vorrichtung zur Verarbeitung von Echtzeitdaten
EP2159959B1 (fr) Procédé de détermination d'une topologie, composants de réseau et unité centrale
EP1357477B1 (fr) Dispositif connecté à un système de bus
DE102008017192A1 (de) Verfahren zum Aufbau eines Netzwerks
DE102019218248A1 (de) Vermittlungsvorrichtung
DE102005024782B3 (de) Verfahren und Vorrichtung zur Datenübertragung mit einer Bündelung von mehreren Übertragungskanaleinrichtungen
EP3721590B1 (fr) Procédé pour faire fonctionner un abonné réseau et abonné réseau
WO2012136783A1 (fr) Procédé et dispositif destinés à la transmission de données entre des systèmes de bus reliés
DE10218645A1 (de) An einen Bus angeschlossene Einrichtung
EP3590235B1 (fr) Procédé de transmission de données et réseau de communication d'automatisation
DE102020203823A1 (de) Vermittlungsvorrichtung
DE10112950A1 (de) Empfangseinrichtung zum Empfangen von Daten
DE102020206326A1 (de) Verfahren zum Betreiben einer Recheneinheit und Recheneinheit
EP4170977A1 (fr) Procédé de surveillance d'un réseau de données dans un véhicule automobile, ainsi que dispositif de commutation et véhicule automobile

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: 20101011

AK Designated contracting states

Kind code of ref document: A2

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

AX Request for extension of the european patent

Extension state: AL BA RS

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20140730

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

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20141210