WO2017140398A1 - Dispositif de nœud de réseau et procédé de transfert de données - Google Patents

Dispositif de nœud de réseau et procédé de transfert de données Download PDF

Info

Publication number
WO2017140398A1
WO2017140398A1 PCT/EP2016/080922 EP2016080922W WO2017140398A1 WO 2017140398 A1 WO2017140398 A1 WO 2017140398A1 EP 2016080922 W EP2016080922 W EP 2016080922W WO 2017140398 A1 WO2017140398 A1 WO 2017140398A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
framebuffercell
network node
memory unit
node device
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/EP2016/080922
Other languages
German (de)
English (en)
Inventor
Andreas Zirkler
Michael Armbruster
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 WO2017140398A1 publication Critical patent/WO2017140398A1/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
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/9036—Common buffer combined with individual queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/10—Packet switching elements characterised by the switching fabric construction
    • H04L49/109—Integrated on microchip, e.g. switch-on-chip
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/901—Buffering arrangements using storage descriptor, e.g. read or write pointers
    • 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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks

Definitions

  • the present invention relates to a network node device configured for receiving, switching and forwarding data at a plurality of data ports.
  • the erfindungsge ⁇ Permitted network node device is preferably designed for a safety-critical application.
  • the present invention further relates to a network device and a network arrangement for a safety-critical use and to a method for switching data.
  • Data packet-oriented networks are finding an increasing application for measuring, controlling and regulating complex technical
  • Actuators a steering wheel position is converted by an electric motor into a wheel position.
  • a move away from a traditional bus structure towards a data packet oriented network in a vehicle control system places increased demands on network node devices.
  • the network can be loaded for example by high data rates, so that important control ⁇ or sensor data can not be exchanged between the network node devices. It is therefore necessary to consider such load situations in safety-critical overall systems in order to ensure reliable operation of the network node devices in the network.
  • the applicant has already proposed a teaching in the German patent specification DE102012000188B4, according to which an annular network of network devices takes place with a network designed in particular for Ethernet communication.
  • a redundant implementation of the network device with duplicated network node and control devices in the respective network device provides secure and reliable data transport in the network.
  • the network node device known in the art as Switch device, adapted for receiving, Ver ⁇ mediation and routing of data packets, which are exchanged bi-directionally over a plurality of data ports of the network node device with network devices or control devices.
  • incoming and outgoing data ports are usually combined in a case-by-case bidirectional data port.
  • a storage unit comprises a plurality of queues, wherein one queue comprises a plurality of buffer cells. Up to a certain size of a data packet is provided to buffer a data packet per buffer cell. If the size of the data packet to be buffered exceeds the size of a buffer cell, the data packet to be buffered is divided into several buffer cells. Alternatively, buffering of outgoing data packets in the corresponding opposite direction is also known.
  • a prioritization of data packets is advantageous in safety-critical networks or overall systems.
  • data packets exchanged between the network node device and a controller are provided with a higher priority class than data packets exchanged with network devices become.
  • the first data packets are usually exchanged via an "in ⁇ ternal" data port, which are like the control ⁇ device and the network node device on a common microcircuit.
  • the microcircuit is designed eg as SoC (system-on-a-chip), FPGA (field programmable gate array) or ASIC (application specific integrated circuit).
  • SoC system-on-a-chip
  • FPGA field programmable gate array
  • ASIC application specific integrated circuit
  • the object of the invention is therefore to provide a suitable in particular for safety-critical applications ei ⁇ NEN network node device, wherein a kete for buffering the pa- necessary storage space compared to known network node devices is reduced.
  • the object is achieved by a Netzknotenein ⁇ direction with the features of claim 1.
  • a generic network node device which is adapted to Entge ⁇ genddling, switching and routing of data to a plurality of data ports comprises data ports for bidirectional communication with network nodes or re chen painen a network. Data packets arriving at a data port are provided for buffering before being forwarded. In this case, each data port is assigned a first SpeI ⁇ cherü which comprises a plurality of waiting Schlan ⁇ gene, wherein each queue contains a plurality of precursor cells PUF.
  • this network node device in particular for a safety-critical application, provision is made for assigning at least one data port to a respectively assigned second memory unit having a plurality of addressable buffer cells. Furthermore, a buffer control unit is provided, which for detecting ei ⁇ ner queue affiliation of a buffered pa ⁇ kets, for assignment to a free addressable buffer cell in the second memory unit and for depositing a pointer to an address of the addressable buffer cell in a next free buffer cell within the the queues belonging particular queue is formed of ers ⁇ th memory unit.
  • the object is further achieved by a network device according to the invention having the features of patent claim 6, by a network arrangement according to the invention with the characteristics len of claim 7, solved by an inventive Ver ⁇ drive with the features of claim 9 and by an inventive computer program product with means for performing the method.
  • FIG. 1 shows a schematic representation of a network node device according to the prior art
  • Figure 4 is a schematic representation of an organization of cells ⁇ tion in an inventive memory unit for buffering data packets
  • Fig. 1 shows a generic known Netzknoteneinrich ⁇ device according to the prior art.
  • One or more data ports P1, P2, P3, P4 form bidirectional interfaces for the exchange of data packets which are buffered in a memory unit FB or "frame buffer" FB.
  • the memory unit FB is organized in queues, wherein a queue comprises a plurality of buffer cells with usually identical recording capacity for receiving a plurality of data packets.
  • the occupancy of the buffer cells of the memory unit FB is controlled by a buffer control unit BM or »buffer management «.
  • a queue control unit QMU or "Queue Management Unit” controls a data transfer between the data ports P1, P2, P3, P4 and the memory unit FB.
  • the queue ⁇ control unit QMU arranges the data packets to be switched in the appropriate queue. In outgoing direction takes a - not shown - scheduler device of the queue control unit QMU the data packets from the queue and transfers them to the respective outgoing ⁇ the data port P1, P2, P3, P4 of the network node device.
  • the queue control unit QMU takes in an extended ⁇ staltung the network node device for a safety-critical applications continue the task, to take over based on a determined from the data packet priority class assignment of the data packet to a queue, the Puf ⁇ precursor cells already contain other data packets of this priority class or - in the event that there is no queue yet, their buffer cells already have data packets of this
  • the queue control unit QMU assumes a determination of the queue membership based on the priority class.
  • a conversion unit LU or "Look Up Engine” is used to handle a MAC address when deciding to which data ports a data packet is to be forwarded.
  • a central switching unit SE or "switch engine” forms the central core of the network node device, via the data packet between the respective functional input port P1, P2, P3, P4 are transferred to or to the respective functional output ports P1, P2, P3, P4.
  • the Vunsein ⁇ ness SE can next to a real "switching fabric” - in other words a "fabric” for the formation of cross-links - including optional functions which have been described above in separate functional units.
  • Fig. 2 shows a cell organization in a memory unit for buffering data packets according to the prior art.
  • the memory unit FB known from FIG. 1 is referred to below as the first memory unit FBI.
  • each of the two dargestell ⁇ th data ports P1, P2 are each assigned a plurality of queues FrameQueue_l, ... FrameQueuelO.
  • a waiting ⁇ snake the data packet are stored which have been received at a respective data port P1, P2.
  • a respective buffer cell FrameBufferCell_l, ... FrameBufferCell_n is provided for sequentially progressively recording a respective data packet within a respective queue FrameQueue_l,.
  • a priority class assigned to the data packet For the data packets to be buffered, membership in a queue is determined according to a priority class assigned to the data packet.
  • a first memory unit FBI is shown, which is provided for processing up to ten priority classes, wherein one of a total of ten queues FrameQueue_l, ... FrameQueuelO is provided for each priority class.
  • a associated with the jewei ⁇ time data packet priority class determined depending according to criticality of one of the underlying chroori- tetiert communicating application - ie in a vehicle, for example, steering, braking system, navigation, infotainment, etc. - about whether the communication of this application to other applications preferred or subordinate forward.
  • the depth of a queue so the maximum expected ⁇ and the buffering data packets per queue is largely determined by the duration of one application cycle as well as during an application cycle maximum expect ⁇ tend dataset.
  • FrameBufferCell_l ... must FrameBufferCell_n within a queue FrameQueue_l, ... FrameQueuelO for receiving data packets with high priority class to be large enough to accommodate the maximum expected amount of data during a Applikati ⁇ onszyklus. This requirement applies in particular to data packets which are to be replaced with an application of high Prio ⁇ rticianst to ensure even in overload situations reliable operation of the network node device without packet loss.
  • the priority class within the Netzkno ⁇ ten driving is - at least not tenden for buffering DA - not evaluated in such a way that at this
  • the priority class is only about the categories ei ⁇ ne temporarily reserved for this priority class War ⁇ tesch long intended to buffer data packets of each priority class sequentially in a particular queue. However, since at this point there is no assessment of the priority class, is to avoid briver- losses at a buffering of data packets for all queues, even for the lowest priority class, so the maximum expected and puf ⁇ fernden data packets the maximum depth, which should also be provided for the highest priority class queue.
  • General ⁇ my can or should be done in advance no provision into which the queue for buffering traffic ⁇ assigns inserted.
  • a vehicle For purposes of illustration, reference will again be made to a vehicle as an example of a safety-critical overall system.
  • the braking system would be assigned a highest priority class, while an infotainment system would occupy a much lower priority class.
  • the data packet-oriented communication with the brake system according to the above is so safety-critical that packet losses are intolerable, packet losses in an infotainment system without greater safety-critical concerns should be acceptable.
  • the maximum depth of the queue is reserved, which is also to be provided for the queues with the highest priority class.
  • Fig. 3 shows a schematic representation of a cell Orga ⁇ tion in a first storage unit FBI according to the prior art buffering a plurality of data packets FrameBufferCell_l, ... FrameBufferCell_n in a respective queue FrameQueue_l, ... FrameQueuel 0. From are overview establish ⁇ only the ten queues associated with the first data port PI, FrameQueue_l, ..., FrameQueuelO of the first memory unit FBI are shown.
  • the figure illustrates this example ei ⁇ nen time at the end of the application cycle in which only some buffer cells framebuffer Cell 1, ... FrameBufferCell_n a respective queue FrameQueue_l, ... FrameQueuelO are occupied.
  • FrameBufferCell_2 shows in Vorliegeenden example, only one-tenth of security reasons always kept available space is occupied, while nine-tenths of the storage ⁇ space must be reserved unnecessarily. In future automobiles further large amounts of data for an environment detection and advanced infotainment fall, so that the maximum expected amount of data during an application cycle is likely to increase, the number n of Puf ⁇ precursor cells FrameBufferCell_l ... FrameBufferCell_n within a queue FrameQueue_l .. FrameQueuelO will be even bigger to size.
  • bursty traffic due to the cyclical processing of applications.
  • Bursty Traffic means irregular data traffic with occasionally high data volumes. This type of data traffic also leads to an increase in the maximum amount of data to be buffered during an application cycle.
  • the object of the invention is also to take measures other than the one despite an increase in the maximum amount of data to be expected during an application cycle Number of buffer cells FrameBufferCell_l, ... FrameBufferCell_n within a queue FrameQueue_l, ... FrameQueuelO, thus keeping or even reducing the space required to buffer the data packets.
  • FIG. 4 shows an illustration of the further development of a cell organization in a memory unit according to the invention for buffering data packets.
  • an additional second memory unit FB2 which is at least one data port zugordnet, a plurality of addressable buffer cells
  • PointerBufferCell_l ... PointerBufferCell_n.
  • the second memory unit ⁇ FB2 is all data ports P1, P2, associated with P3, P4, although 4 are shown for reasons of clarity only two data ports P1, P2 in Fig..
  • a pointer Ptr_l, Ptr_n FrameBufferCell_n is in the ⁇ ers th memory unit FBI then the cached address of the addressable PUF ferzelle FrameBufferCell_l ... stored.
  • PointerBufferCell_n stored within the queued queue of the first memory unit FBI.
  • the first memory unit FBI thus further ensures a sequence of data packets in the order of their arrival within the queue, but - by means of a pointer - by a reference to the second memory unit FB2.
  • the pointer Ptr_l, Ptr_n now only contains the address of the addressable buffer cell, while the data packet itself is stored in an addressable buffer cell of the second memory unit FB2, wherein the pointer Ptr_l, Ptr_n to the address of the addressable buffer cells
  • FrameBufferCell_l ... FrameBufferCell_n of the second memory unit FB2.
  • a length of a few bytes suffices for the pointer Ptr_l, Ptr_n.
  • a realistic length of 2 bytes for a pointer Ptr_l, Ptr_n would result in a memory requirement of the first memory unit FBI of approximately 145 kB per data port P1, P2, P3, P4 instead of a memory requirement of 1.25 required in the prior art MB per data port P1, P2, P3, P4.
  • Fig. 5 is shown to that shown in Fig. 3 situation in an analogous manner, were a plurality of data packets in buffer cells FrameBufferCell_l, ... FrameBufferCell_n, this time in the two ⁇ th memory unit FB2 buffered at the end of a Applikati ⁇ onszyklus, ,
  • PointerBufferCell_l ... PointerBufferCell_n of the first memory unit FBI, but not with the
  • a network node device suitable for safety-critical use in which a memory space necessary for buffering the data packets is reduced.
  • the data packets are stored in a second memory unit FB2, which is assigned to at least one, ideally several or even all data ports P1, P2, P3, P4 of the network node device. Since in a security-relevant network node device with the support of several priority classes can not be predicted how many data packets must be buffered in which queue of the same priority class or "priority queue" remain in the art according to the situation shown in FIG. 3, large parts of for a queue FrameQueue_l, ... FrameQueuelO held buffer ⁇ cells FrameBufferCell_l, ...
  • FrameBufferCell_n the first memory unit FBI unused. Therefore, in the prior art all queues FrameQueue_l, ... FrameQueueO of the first memory unit FBI must be dimensioned so large that they can accommodate the entire data volume or »traffic « within an application cycle. As a result, only one queue is used in summary, all others remain empty.
  • the second memory FB2 assigned to all data ports P1, P2, P3, P4 has a storage capacity which corresponds exactly to the total data volume occurring at all data ports P1, P2, P3, P4 within one application cycle equivalent.
  • the buffer cells PointerBufferCell 1, ... PointerBufferCell n provided for receiving the pointers Ptr_l, Ptr_n Wartenden PointerQueue_l, ... PointerQueuel 0 the first memory unit FBI are occupied, as in the state of Tech ⁇ nik provided for receiving the data packets Pufferzel ⁇ len FrameBufferCell_l, ... FrameBufferCell_n in the queues FrameQueue_l, ... FrameQueuelO the first memory unit FBI, ie summarily only one queue is used, all others remain empty. Since for the deposit of a pointer Ptr_l, Ptr_n but a considerably smaller dimensioning of the buffer cells PointerBufferCell_l, ...
  • PointerBufferCell_n the first storage unit FBI requires as the larger in the art to be dimensioned buffer cells FrameBufferCell_l, ... FrameBufferCell_n for pa ⁇ kete, for example 2 bytes instead of 128 bytes, a sig ⁇ nifikanter proportion of the total storage space required can be saved.
  • the inventively additionally provided second memory unit FB2 does not change the overall balance of the total required memory space, since the sum of the storage capacity of first and second memory unit FB1, FB2 according to the invention is not known in the prior art first memory unit FBI for buffering
  • the saving of the total benötig ⁇ th memory footprint has a positive effect on the cost of an ASIC and especially a FPGA-based imple ⁇ tion of the network node device.
  • the present invention proceeds from a network node device or switch in which an intermediate storage of received data packets is known.
  • the data packets were buffered in the prior art in a first memory unit.
  • This first storage unit is divided into queues and queues, wherein a waiting ⁇ snake having a plurality of buffer cells with usually equal to ⁇ holding capacity. Since no data packet losses can be tolerated for a security-critical deployment of the network node device, the queues or queues in known switches are usually oversized. It is provided according to the invention to provide an additional second memory unit, each assigned to at least one data port, with a plurality of addressable buffer cells.
  • a queue belonging to a buffering pa ⁇ kets is detected and supplied to have a free addressable buffer cell in the second storage unit. Instead of the data packet, a pointer to an address of the addressable buffer cell in the next free buffer cell of the first memory unit is now stored in the first memory unit. Although this first memory unit is occupied by the deposit of the pointer similar fragmentary as in the prior art by the deposit with data packets. However, since the pointers require a significantly smaller storage space for the buffer cells than the buffer cells for data packets, a significant portion of the required storage space can be saved.

Landscapes

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

Abstract

L'invention concerne un dispositif de nœud de réseau ou commutateur, pour lequel un stockage temporaire de paquets de données entrants est connu. Selon l'état de la technique, les paquets de données ont été mis en mémoire tampon dans une première unité de mémoire. Cette première unité de mémoire est répartie dans des files d'attente qui comprennent chacune plusieurs cellules tampons ayant habituellement la même capacité de stockage. Puisque, pour une mise en œuvre critique pour la sécurité du dispositif de nœud de réseau, aucune perte de paquet de données ne peut être tolérée, les files d'attente sont le plus souvent surdimensionnées dans des commutateurs connus. Selon l'invention, une seconde unité de mémoire supplémentaire, ayant une pluralité de cellules tampons adressables est associée respectivement à un ou à plusieurs ports de données. Une appartenance à une file d'attente d'un paquet de données à mettre en mémoire tampon est détectée et le paquet de données est alloué à une cellule tampon adressable libre dans la seconde unité de mémoire. Dans la première unité de mémoire, un pointeur vers une adresse de la cellule tampon adressable est déposé, à la place du paquet de données, dans une prochaine cellule tampon libre de la première unité de mémoire. Cette première unité de mémoire est certes par le dépôt des pointeurs occupée d'une manière fragmentée similaire à celle de l'état de la technique avec des paquets de données. Mais puisque les pointeurs nécessitent une place mémoire considérablement plus petite pour les cellules tampons que celle des cellules tampons pour des paquets de données, par exemple 2 octets au lieu de 128, une partie significative de la place mémoire nécessaire peut être économisée.
PCT/EP2016/080922 2016-02-16 2016-12-14 Dispositif de nœud de réseau et procédé de transfert de données Ceased WO2017140398A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102016202331.4 2016-02-16
DE102016202331.4A DE102016202331A1 (de) 2016-02-16 2016-02-16 Netzknoteneinrichtung und Verfahren zur Vermittlung von Daten

Publications (1)

Publication Number Publication Date
WO2017140398A1 true WO2017140398A1 (fr) 2017-08-24

Family

ID=57589014

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2016/080922 Ceased WO2017140398A1 (fr) 2016-02-16 2016-12-14 Dispositif de nœud de réseau et procédé de transfert de données

Country Status (2)

Country Link
DE (1) DE102016202331A1 (fr)
WO (1) WO2017140398A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543129A (zh) * 2020-11-27 2021-03-23 北京经纬恒润科技股份有限公司 队列深度的确认方法、系统及报文模拟器

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3694166B1 (fr) * 2019-02-06 2022-09-21 Hitachi Energy Switzerland AG Opération à créneaux temporels cycliques dans un réseau industriel sans fil

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030026205A1 (en) * 2001-07-31 2003-02-06 Mullendore Rodney N. Packet input thresholding for resource distribution in a network switch
US20090180475A1 (en) * 2008-01-10 2009-07-16 Fujitsu Limited Packet forwarding apparatus and controlling method
US20090257441A1 (en) * 2008-04-15 2009-10-15 Fujitsu Limited Packet forwarding apparatus and method for discarding packets
US20140185442A1 (en) * 2012-12-27 2014-07-03 Cisco Technology, Inc. Supporting quality of service differentiation using a single shared buffer
DE102012000188B4 (de) 2012-01-09 2015-05-28 Siemens Aktiengesellschaft Verfahren zum Betreiben eines Kommunikationsnetzwerkes und Netzwerkanordnung

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6535963B1 (en) * 1999-06-30 2003-03-18 Cisco Technology, Inc. Memory apparatus and method for multicast devices

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030026205A1 (en) * 2001-07-31 2003-02-06 Mullendore Rodney N. Packet input thresholding for resource distribution in a network switch
US20090180475A1 (en) * 2008-01-10 2009-07-16 Fujitsu Limited Packet forwarding apparatus and controlling method
US20090257441A1 (en) * 2008-04-15 2009-10-15 Fujitsu Limited Packet forwarding apparatus and method for discarding packets
DE102012000188B4 (de) 2012-01-09 2015-05-28 Siemens Aktiengesellschaft Verfahren zum Betreiben eines Kommunikationsnetzwerkes und Netzwerkanordnung
US20140185442A1 (en) * 2012-12-27 2014-07-03 Cisco Technology, Inc. Supporting quality of service differentiation using a single shared buffer

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SANDER O ET AL: "Priority-based packet communication on a bus-shaped structure for FPGA-systems", DESIGN, AUTOMATION&TEST IN EUROPE CONFERENCE&EXHIBITION, 2009. DATE '09, IEEE, PISCATAWAY, NJ, USA, 20 April 2009 (2009-04-20), pages 178 - 183, XP032317486, ISBN: 978-1-4244-3781-8, DOI: 10.1109/DATE.2009.5090654 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543129A (zh) * 2020-11-27 2021-03-23 北京经纬恒润科技股份有限公司 队列深度的确认方法、系统及报文模拟器
CN112543129B (zh) * 2020-11-27 2022-06-21 北京经纬恒润科技股份有限公司 队列深度的确认方法、系统及报文模拟器

Also Published As

Publication number Publication date
DE102016202331A1 (de) 2017-08-17

Similar Documents

Publication Publication Date Title
DE3751046T2 (de) Vermittlungssystem.
DE69628631T2 (de) Dateneingangs/-ausgangsvorrichtung durch Referenzierung zwischen zentralen Verarbeitungseinheiten und Ein-/Ausgabevorrichtungen
DE60203057T2 (de) Effizienter Optimierungsalgorithmus für Speichergebrauch in Netzwerkanwendungen
DE69810132T2 (de) Multiport drams mit internen cache-speichern
DE69031220T2 (de) Hochgeschwindigkeitsmultiport-FIFO-Pufferschaltung
DE2406195C3 (de) Modulare programmgesteuerte Vermittlungsanlage
DE3728805A1 (de) Datenpaketvermittlung
EP1101329A2 (fr) Module de pontage
DE69527110T2 (de) Verfahren und Vorrichtung zum Routen von nach einem asynchronen Transfermodus einkommenden verschachelten Zellen mit reduzierter Vermittlung
DE2249371C2 (de) Zeitvielfachvermittlungsanlage
EP0692893B1 (fr) Dispositif de commutation dans un réseau de commutation numérique à mode de transfer asynchrone
DE69817159T2 (de) Vermittlungssystem mit einem Maskiermechanismus zur Änderung des internen Leitweglenkungsprozesses
DE112013001211T5 (de) Multithread-Paketverarbeitung
DE102016202331A1 (de) Netzknoteneinrichtung und Verfahren zur Vermittlung von Daten
DE3875079T2 (de) Verwaltungseinrichtung fuer asynchrone zeitmultiplex-datenvermittlungseinheit.
EP1370952B1 (fr) Procede de communication pour realiser des canaux d'evenement dans un systeme de communication temporise
DE102016206109A1 (de) Speicherdirektzugriffssteuereinrichtung für mindestens eine einen Arbeitsspeicher aufweisende Recheneinheit
EP0322075B1 (fr) Réseau de commutation et dispositif de commande pour un système de commutation
DE102007049044A1 (de) Vorrichtung und Verfahren zum Datenaustausch zwischen mindestens zwei Funktionsmodulen einer integrierten Schaltung
WO1993005601A1 (fr) Procede de transmission de donnees et installation de traitement de donnees pourvu de noeuds de calcul repartis
WO2012110541A1 (fr) Procédé de transmission de données par le biais d'un bus de données série synchrone
DE102022201219B3 (de) Fahrzeugsystem, insbesondere für eine E/E-(Elektrisch/Elektronische)-Architektur und Fahrzeug
EP1892631A2 (fr) Procédé et dispositif d'alimentation de données dans un bus de données série
EP0960551B1 (fr) Procede et circuit pour transmettre des cellules de donnees dans le cadre de liaisons virtuelles presentant differentes priorites
DE102020203548A1 (de) Relaisvorrichtung

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16815805

Country of ref document: EP

Kind code of ref document: A1