Abstract: The present disclosure relates to the monitoring of network traffic between one or more users and one or more web applications. In particular, the disclosure relates to the detection and evaluation of network-induced quality of experience (QoE) degradations of the users. Thus, the disclosure provides a device for detecting a network-induced contribution to the QoE degradation. The device is configured to obtain one or more user metrics, the user metrics being indicative of a QoE of one or more users of the web applications, and to obtain one or more content metrics, the content metrics being indicative of a content of the web applications. The device is further configured to determine a QoE degradation of the QoE of the users based on the one or more user metrics, and to determine a contribution information indicative of a network-induced contribution to the determined QoE degradation based on the content metrics.

Abstract: A computer-implementation method includes receiving a data packet; identifying a virtual queue from a list of virtual queues to which the data packet pertains; and determining whether the identified virtual queue size exceeds a threshold maximum size. When the first size does not exceed the threshold maximum size, the identified virtual queue is increased based on a size of the data packet and the data packet is forwarded. The method further includes setting a virtual queue from the list of virtual queues as a target queue; determining a service capacity based on an update time interval and increasing a credit allowance based on the service capacity. The target queue is reduced by an amount based on the credit allowance size, and the credit allowance is reduced by the same amount.

Abstract: A client computing device and a server computing device for federated machine learning. The client computing device is configured to receive a model comprising a set of common layers and a set of client-specific layers from the server computing device. After a training at the client computing device, the set of common layers and the set of client-specific layers are both updated. The set of updated common layers is sent to the server computing device, and the set of updated client-specific layers is stored at the client computing device. The server computing device is configured to receive multiple sets of updated common layers from different client computing devices.

Abstract: An engine is equipped with a gas feeding system, including main gas injectors each associated with an intake duct of a respective engine cylinder, a gas distribution manifold communicating with said main injectors, a gas tank, connected to the manifold, where pressurized gas is accumulated, a controlled pressure valve interposed between the tank and manifold, and a control unit for controlling the pressure valve to establish a gas pressure in the manifold. A spark plug of each cylinder is mounted within a support body that defines a combustion pre-chamber and a channel for auxiliary gas injection within the pre-chamber, communicating with a respective auxiliary gas injector. The auxiliary gas injectors are in communication with the manifold, downstream of the pressure valve. In the channel, a non-return valve and a restricted passage are provided in series, providing for passage of gas flow proportional to a volume of the pre-chamber.

Abstract: The present invention relates to a method for managing packets in a network of Information Centric Networking (ICN) nodes (1, 2a, 2b, 2c, 2d, 2e), the method comprising: —at a first node (1), performing steps of: ? Receiving a request (i) for a data packet (C), and if the data packet (C) is stored, responding to the request (i) by forwarding the data packet (C); otherwise ? sending to at least one neighboring node (2a, 2b) of the network a request (i?) for meta-data packets (@), a meta-data packet (@) indicating availability of said data packet (C) at a target node; ? receiving in response at least one meta-data packet (@), so as to identify at least one target node (2c, 2e) wherein said data packet (C) is available; ? forwarding the request (i) for said data packet (C) toward one selected target node (2c); —at a second node (2a, 2b, 2c, 2d, 2e), performing steps of: ? Receiving a request (i?) for meta-data packets (@), and if the data packet (C) is stored, responding to the request (i?) by forwarding a meta-

Abstract: An engine is equipped with a gas feeding system, including main gas injectors each associated with an intake duct of a respective engine cylinder, a gas distribution manifold communicating with said main injectors, a gas tank, connected to the manifold, where pressurized gas is accumulated, a controlled pressure valve interposed between the tank and manifold, and a control unit for controlling the pressure valve to establish a gas pressure in the manifold. A spark plug of each cylinder is mounted within a support body that defines a combustion pre-chamber and a channel for auxiliary gas injection within the pre-chamber, communicating with a respective auxiliary gas injector. The auxiliary gas injectors are in communication with the manifold, downstream of the pressure valve. In the channel, a non-return valve and a restricted passage are provided in series, providing for passage of gas flow proportional to a volume of the pre-chamber.

Abstract: The present invention relates to a method for managing packets in a network of Information Centric Networking (ICN) nodes (1, 2a, 2b, 2c, 2d, 2e), the method comprising:—at a first node (1), performing steps of: ? Receiving a request (i) for a data packet (C), and if the data packet (C) is stored, responding to the request (i) by forwarding the data packet (C); otherwise ? sending to at least one neighboring node (2a, 2b) of the network a request (i?) for meta-data packets (@), a meta-data packet (@) indicating availability of said data packet (C) at a target node; ? receiving in response at least one meta-data packet (@), so as to identify at least one target node (2c, 2e) wherein said data packet (C) is available; ? forwarding the request (i) for said data packet (C) toward one selected target node (2c);—at a second node (2a, 2b, 2c, 2d, 2e), performing steps of: ? Receiving a request (i?) for meta-data packets (@), and if the data packet (C) is stored, responding to the request (i?) by forwarding a meta-da

Abstract: The present invention relates to an ICN router (1), comprising a first cache layer (L1) and a second cache layer (L2), the first cache layer (L1) comprising a first content memory (11) and the second cache layer (L2) comprising a second content memory (21), the second content memory (21) having a higher capacity but a slower access speed than the first content memory (11), the router (1) being configured so that the first cache layer (L1) is adapted to fetch data from second cache layer (L2) when the router (1) is requested to output said data, characterized in that the first content memory (11) presents a first block size and the second content memory (21) presents a second block size, the second block size being higher that the first block size, the first content memory (11) comprising a swap area (110) through which the first content memory (11) is connected to the second content memory (21), the swap area (110) being adapted for individually serving blocks at the first block size as parts of blocks at the

Abstract: A method for managing packets over interfaces of a Content Centric Networking node, the method comprising the following steps receiving over an interface of the node at least a request for a data packet; if the data packet is stored by the node, forwarding the data packet over the interface of the received request; otherwise performing an exploration step, by selecting randomly at least an interface towards a neighboring node; forwarding the request over the selected interface; receiving in response over the randomly selected interface, the data packet with associated minimum time delivery value estimated by the neighboring node; identifying an interface providing the minimum data packet delivery time value based on exploration step results.

Abstract: The invention relates to a method and a system for detecting a single data flow in an aggregate packet data flow and identifying the application generating the single data flow, this single data flow being divided into messages, each message comprising a plurality of blocks, each block (g) having n bits for identifying 2n block values (i).

Abstract: The invention concerns a method and an apparatus for detecting vocal data flow in a packet data flow characterised by at least two measurable variables (X5Y). A distribution function (P{x 1 C}, P{y I C}) is provided of the values of each variable (X5Y) in a vocal data flow, and the values (x,y) of each variable (X,Y) are measured in order to obtain a sequence of measured values (x(k), y(k)) on a number (k) of blocks. Each measured value (x(k), y(k)) is therefore applied to the respective distributiion function (P{x 1 C}, P{yI C}) in order to generate a sequence of likelihood values Formula (I) from which respective average likelihood values (E [Bx],E[By]) are generated. The average values are processed in order to generate a reference likelihood value (B) which, when compared with a threshold likelihood value (Bmin) enables the presence of vocal data flow in a packet data flow to be detected.

Abstract: The invention concerns a method and an apparatus for detecting vocal data flow in a packet data flow characterised by at least two measurable variables (X5Y). A distribution function (P{x 1 C}, P{y I C}) is provided of the values of each variable (X5Y) in a vocal data flow, and the values (x,y) of each variable (X,Y) are measured in order to obtain a sequence of measured values (x(k), y(k)) on a number (k) of blocks. Each measured value (x(k), y(k)) is therefore applied to the respective distributiion function (P{x 1 C}, P{yI C}) in order to generate a sequence of likelihood values Formula (I) from which respective average likelihood values (E [Bx],E[By]) are generated. The average values are processed in order to generate a reference likelihood value (B) which, when compared with a threshold likelihood value (Bmin) enables the presence of vocal data flow in a packet data flow to be detected.

Abstract: The invention relates to a method and a system for detecting a single data flow in an aggregate packet data flow and identifying the application generating the single data flow, this single data flow being divided into messages, each message comprising a plurality of blocks, each block (g) having n bits for identifying 2n block values (i).