Unit (1, eNB, SGW, PGW) comprising a processor (20) and interface means (10) adapted for receiving and transmitting packets (15, 17) to external units (1, eNB, SGW, PGW) over a communication interface. The interface means (10) comprises a first layer filtering means (101) operating according to first level filtering rules (1010) and first packet queues (Q1_1-Q1_n); while the processor (20) comprises at least one kernel (KL_1-KL_n), second layer filtering means (102) operating according to second level filtering rules (1020), second packet queues and applications. For a given packet received on the communication interface, the unit being adapted for —delivering (12) parts the packet to the first layer filtering means (101); —applying first level filtering (14); —performing first sorting (16) and delivering parts of the packet according to the first level filtering rules (201) and delivering parts of the packet to one of the first packet queues (Q1_1-Q1_n) in dependence on the first sorting; the unit further being adapted for —delivering (16, 18) the packet to second layer filtering means (102) from kernel or from first packet queues; —applying (24) second level filtering; —performing second sorting (26) of parts of the packet according to the second level filtering rules (201) and —delivering (28) parts of the packet to one of the applications in dependence on the second sorting (AP_1-AP_n).

An access control unit includes packet buffers provided for each of users, a packet identification unit that stores received packets in a corresponding packet buffer, a scheduling unit that decides a packet buffer to be the object of transfer, a transfer control unit that, in a case that updating of reference data can be performed at an application processing circuit, and also the packet buffer decided by the scheduling unit is different from the current packet buffer that is the object of transfer, updates to reference data corresponding to the packet buffer decided by the scheduling unit, and a buffer selection unit that connects the packet buffers decided to be the object of transfer to the packet transfer unit when updating of reference data is completed.

A method performed by a switch in a software-defined network (SDN), the switch being communicatively coupled to a controller, is provided. The method includes performing a first flow action with respect to a first flow (e.g., deleting the first flow). The method further includes storing a first flow event data object, the first flow event data object indicating the first flow and the first flow action. The method further includes storing a first tag in association with the flow event data object. The method further includes generating a flow event message comprising the first flow event data object and the first tag. The method further includes sending the flow event message to the controller.

Methods and apparatus for efficient data transfer within a user space network stack. Unlike prior art monolithic networking stacks, the exemplary networking stack architecture described hereinafter includes various components that span multiple domains (both in-kernel, and non-kernel). For example, unlike traditional “socket” based communication, disclosed embodiments can transfer data directly between the kernel and user space domains. Direct transfer reduces the per-byte and per-packet costs relative to socket based communication. A user space networking stack is disclosed that enables extensible, cross-platform-capable, user space control of the networking protocol stack functionality. The user space networking stack facilitates tighter integration between the protocol layers (including TLS) and the application or daemon. Exemplary systems can support multiple networking protocol stack instances (including an in-kernel traditional network stack).

A method and device for preventing a failure processing delay are provided in the disclosure. In an example, when the number of queue elements in an equivalence class time-window queue reaches a set threshold (denoted as N) in a set time-window, it means that there are N Bidirectional Forwarding Detection (BFD) sessions in the same equivalence class set, that detect Down events. It thus can be intelligently inferred that a public network path carrying the N BFD sessions breaks down. For processing a failure in time and reducing data stream loss on an upper layer, the present disclosure may allow reporting a corresponding Down event for each BFD session in the equivalence class set to which the N BFD sessions belong.

The present invention relates to a wireless communication terminal and a wireless communication method for efficiently scheduling uplink multi-user transmission. To this end, provided are a base wireless communication terminal, including: a transceiver configured to transmit and receive a wireless signal; and a processor configured to control an operation of the transceiver, wherein the processor selects an access category for transmitting a trigger frame which solicits an uplink multi-user transmission, performs a backoff procedure for transmitting the trigger frame based on the selected access category, and transmits the trigger frame when a backoff counter of the backoff procedure expires and a wireless communication method using the same.

An electronic device includes a sequence generator module that generates a sequence in a predetermined order based on a traffic class of data to be sent. The sequence is written into a portion of a sequence header of an outgoing data packet that corresponds to the traffic class. A traffic class identifier is also written into a header of the packet that indicates the traffic class of the data. The electronic device sends the packet to another electronic device over one of multiple channels of multiple priorities. The other electronic device determines the traffic class of the data based on the traffic class identifier, extracts the sequence from the portion of the sequence header that corresponds to the traffic class, and compares the sequence to a previously extracted sequence of a previously received packet of the same traffic class to determine whether a replay attack has occurred.

Example packet control methods and apparatus are described. One example method includes detecting a packet flow causing a congestion status change. A congestion isolation message is generated and is used to change a priority of a packet in the packet flow. The congestion isolation message includes description information of the packet flow. The congestion isolation message is sent to at least one node.

A method for dividing communication services in smart substation into different priorities, the method including: determining the priority of a message to be sent according to the service type and its priority definition; the communication services includes trip message, state change message, sampled value message, device status message, time synchronization message, and file transfer message; the corresponding priority is respectively defined as 7, 6, 5, 4, 3, 1; and filling the user priority field of IEEE802.1Q label in a message header with a binary value corresponding to its priority.

A network device adds an extreme low latency (ELL) service packet to an ELL queue, and adds a (time sensitive) TS service packet to a TS queue. A packet in the TS queue is sent within a time window corresponding to the TS queue, and the packet in the TS queue is not allowed to be sent within a time period beyond the time window corresponding to the TS queue. When a remaining time period obtained by subtracting a time period required by a to-be-sent TS service packet within the time window from the time window is greater than or equal to a first threshold, a packet in the ELL queue is allowed to be sent within the time window corresponding to the TS queue. The first threshold is a time period required for sending one or more ELL service packets in the ELL queue.