The invention relates to a method for transmitting at least one data packet from a first communication participant via a transfer channel shared with at least one further communication participant, wherein data packets are transmitted by the communication participants according to a Round-Robin method. The method comprises receiving by the first communication participant of at least one data packet from the at least one further communication participant via the shared transfer channel, wherein the further communication participant is configured to transmit data packets of different priority values, and determining a priority value from the data packet assigned to the further communication participant. The method comprises a transmission of the data packet by the first communication participant via the shared transfer channel depending on the priority value. The invention also relates to a controller and a system as well as a motor vehicle.

A method and system for managing command fetches by an Non-Volatile Memory express (NVMe) controller from a plurality of queues in a host maintains a predefined ratio of data throughput, based on the command fetches, between the plurality of queues. Each of the plurality of queues is assigned with a particular priority and weight.

A scheduling device for managing a packet queue of a communication gateway includes a receiving portion configured to receive data packets according to at least one communication protocol, a processor, and classification module configured to separate the received data packets into a first traffic queue and a second traffic queue separate from the first traffic queue. The first traffic queue includes a low latency service flow classified to have strict priority. The second traffic queue includes a primary service flow classified as having a classic priority. The classification module separates the received data packets so that those with a first indicator are sent to the first traffic queue and those without the first indicator are sent to the second traffic queue.

In one embodiment, a gateway includes a memory, and a processor to, in response to receiving a plurality of content requests, generate a plurality of network flows and flow buffers, each one content request of the plurality of content requests being served by one network flow of the plurality of network flows, and one flow buffer of the plurality of flow buffers, the one flow buffer being included in the memory, the plurality of network flows including a first flow and a second flow, the first flow serving one of the plurality of requests having a first priority level, the second flow serving one of the plurality of requests having a second priority level, the first priority level being higher than the second priority level, and run a network arbiter to give prioritize reading the first flow over reading the second flow when the first flow is non-idle.

Examples described herein provide a packet ingress and egress system with a memory buffer in a network device. The ingress and egress system can generate a time stamp for one or more received packets at an ingress port, allocate a received packet to a queue among multiple queues, and permit egress of a packet from a queue. An ingress port can have one or more queues allocated to store received packets. An egress port can use the one or more queues from which to egress packets. A maximum size of a queue is set as the allocated memory region size divided by the number of ingress ports that use the allocated memory region. An egress arbiter can apply an arbitration scheme to schedule egress of packets in time stamp order.

Methods and network interface modules for processing packet headers are provided. The method comprises: receiving a packet comprising a header and a payload; generating, using the header, an initial packet header vector (PHV); providing the initial PHV to a pipeline comprising a plurality of processing stages; and processing the initial PHV in the pipeline, wherein the processing comprises, for a current processing stage in the plurality of processing stages: receiving, by the current processing stage, an input PHV, wherein the input PHV (i) is the initial PHV or a modified version of the initial PHV and (ii) comprises one or more flits, and applying a feature to the input PHV to generate an output PHV, including increasing an initial length of the input PHV if the initial length is not sufficient to apply the feature.

A method is provided for storing log data in a logging system, comprising: instantiating a plurality of buffers in the logging system, the plurality of buffers including one or more type-1 buffers and one or more type-2 buffers; retrieving a log data item from a temporary storage of the logging system, and identifying a type of the log data item; when the log data item is from a first type: identifying a current type-1 buffer, detecting whether the current type-1 buffer is full, when the current type-1 buffer is not full, storing the log data item in the current type-1 buffer, when the current type-1 buffer is full, designating another buffer as the current type-1 buffer, and storing the log data item in the newly-designated current type-1 buffer.

In one embodiment, a system comprises an interface to receive a plurality of packets; and a plurality of processor units to execute a plurality of transmission sub-interfaces, each transmission sub-interface to perform hierarchical quality of service (HQoS) scheduling on a distinct subset of the plurality of packets, wherein each transmission sub-interface is to schedule its subset of the plurality of packets for transmission by a network interface controller by assigning the packets of the subset to a plurality of transmission queues that each correspond to a distinct traffic class.

A system for providing communication using a plurality of radio access technologies is disclosed. The system utilizes terminals capable of communicating with the plurality of radio access technologies. The terminals are capable of selecting the most suitable radio access technology for different types traffic. Different radios access technologies are further capable of cross-communication in order to route traffic over the most efficient paths.

Methods, systems and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a weight for each of the plurality of VLs, the determined weight being proportional to a demand each of the plurality of VLs will place on the time-triggered ethernet network; generating a plurality of bins whose length in time is harmonic to all the scheduled rates of the plurality of VLs; determining a demand value proportional to how often the bin is expected to be used based upon a green zone of each of the plurality of VLs and the determined weight for each of the plurality of VLs; updating the demand value for each bin within the green zone; sorting the plurality of bins from least demanded to most demanded based upon the updated demand value; and scheduling the sorted plurality of VLs within the sorted plurality of bins.