A method and system of correcting a packet delay variation, PDV, of express traffic comprising high-priority express packets interspersed at a transmitter (2) by a preemption mechanism with a best-effort traffic comprising low-priority best-effort packets, wherein the method comprises the steps of: calculating (S1) at the transmitter (2) a preemption delay value, PRDV, which indicates a preemption delay, PD, introduced by the preemption mechanism; writing (S2) the calculated preemption delay value, PRDV, into a delay header field of a header of a high-priority express packet transmitted by said transmitter (2) via a signal line (4) to a receiver (3); extracting (S3) the preemption delay value, PRDV, from the delay header field of the header of the high-priority express packet received by the receiver (3) via the signal line (4) from the transmitter (2); calculating (S4) at the receiver (3) a variation compensation delay, VCD, value by subtracting the extracted preemption delay value, PRDV, from a predetermined worst-case preemption delay value, PRDV.sub.worst; and applying (S5) at the receiver an additional delay to the high-priority express packet according to the calculated variation compensation delay, VCD, value to compensate the preemption delay, PD, introduced by the preemption mechanism at the transmitter (2).

A MANET protocol, comprising: receiving a data packet (DP) from a current sender (CS) by a recipient, defining: an identity of the CS, a prior sender (PS) from which CS received DP, and a target recipient (ID), a count (HC) of hops previously traversed by DP, and a sequence identifier (SI); updating a forwarding table (FT) to mark CS as being reachable in one hop, and PS as being reachable in two hops via CS as next hop; determining if ID is the recipient; determining whether to rebroadcast by recipient, if and only if the SI is not present in a list of prior SIs; and selectively rebroadcasting DP by recipient in dependence on said determining, modified by: replacement of CS with an identity of the recipient, PS with CS, and ID with a next hop from the FT if present, and incrementing HC.

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).

The present disclosure describes a system and method to reduce the overall time taken to complete distributed process workflows. Each workflow can include multiple actions that are completed by or at different client devices. The actions of a workflow can be dependent on prior actions in the workflow. For example, a second client device may not be able to complete a second action until a first client device completes a first action in the workflow. The system can predict time periods and the geolocations where client devices are most likely to complete an assigned action. Using the selected time periods and geolocations, the system can transmit notifications to the client devices when the action is most likely to be completed.

A network adapter includes circuitry and one or more ports. The ports connect to a communication network including multiple network elements. The circuitry accesses outbound messages that are pending to be sent over the communication network to multiple remote nodes via the ports. At least some of the outbound messages request the remote nodes to send respective amounts of data back to the network adapter. Based on the amounts of data requested by the outbound messages, the circuitry forecasts a bandwidth of inbound response traffic, which is expected to traverse a selected network element in response to the outbound messages toward the network adapter, determines a schedule for transmitting the outbound messages to the remote nodes so that the forecasted bandwidth meets a bandwidth supported by the selected network element, and transmits the outbound messages to the remote nodes in accordance with the determined schedule.

Techniques for dropping packets at congested network elements for no drop traffic are described. A network element in communication with a congested network element initiates a copy packet queue and stores a copy of each transmitted no-drop packet sent to the congested element. When the network element receives an indication that the congested element has dropped a no-drop packet, the network element begins retransmission of the dropped packets to the congested element from the copy packet queue, thus providing a lossless network while allowing for dropped packets.

The technologies described herein are generally directed toward shedding processing loads associated with route updates. For instance, a system can comprise a processor and a memory that can enable operations facilitating performance of operations including facilitating receiving a content item for transmission to a destination router device on a network. The operations can further comprise facilitating communicating, to a second routing device, a first portion of the content item. The operations can further comprise facilitating communicating, to a third routing device, a second portion of the content item. Further, operations can be performed for appending a separation indicator to at least one of the first portion or the second portion, wherein the separation indicator provides information that links the first portion to the second portion.

A method for measuring a schedule update time of a time aware shaper DUT includes configuring the DUT with a first configuration that blocks traffic from at least one gate of the DUT. The method further includes transmitting traffic from an emulated talker to an emulated listener via the DUT. The method further includes confirming blocking of the traffic from the at least one gate of the DUT and transmitting a second configuration from an emulated CNC node to the DUT, where the second configuration opens the at least one gate of the DUT, recording a time T1 of transmission of the second configuration to the DUT, detecting traffic from the at least one gate of the DUT at the listener, recording a time T2 of receipt of the traffic at the listener, and calculating a response time of the DUT to the second configuration based on T1 and T2.

Methods and systems for cache optimization are described. Content items served to client devices of a content distribution network may be associated with a cache value. The cache value for a content item may cause a cache device to cache the content item for a period of time. The cache value for the content item may be updated based on increasing or decreasing popularity. The content item may be encoded at a plurality of bitrates, and cache values may vary across the plurality of bitrates such that multiple copies of the content item may each be cached for varying periods of time depending on a corresponding bitrate.

A network failure detection method and a network failure detection device are provided. The network failure detection method includes capturing a plurality of packets, analyzing contents of the plurality of packets and determining whether a network failure occurs to generate a determination result according to the contents of the plurality of packets, and outputting an alarm signal to implement an alarm function according to the determination result.