Accelerating monitoring of network traffic by: configuring a first network chip of a non-accelerated line card with a VOQ associated with an internal interface that is connected to a second network chip of a first accelerated line card; receiving, at the first network chip, a data unit; selecting, by the first network chip, the data unit based on a traffic sampling rate; adding information identifying the data unit as having been selected for sampling to obtain a selected data unit; and sending the selected data unit from the first network chip to the second network chip using the VOQ and the internal interface. The second network chip identifies the selected data unit and, based on the identification, appends a sampling header to the data unit to obtain a sampled data unit, and transmits the sampled data unit to the sampling engine of the first accelerated line card.

A satellite communication framework includes a satellite system controller; at least one satellite transponder; and a plurality of remote terminals, each including a modem, a router, and a terminal agent. The terminal agent is configured to, based on a current allowable data rate and measurements of a current router queue size and a current router packet arrival rate, use a delayed uplink resource assignment for each modem and an MCV-based flow-control policy to forecast a future router queue size and a future router packet arrival rate and further update the delayed uplink resource request for a time after an uplink allocation delay. The modem is configured to communicate with the router and also with the satellite system controller through the satellite transponder, perform modulation and demodulation, and manage packet loss and delay according to the future router queue size and the future router packet arrival rate.

An in-vehicle network system includes first device and second device configured to send or receive to or from each other, and an intermediate node connected between the first device and the second device, the intermediate node being configured to output buffered messages in a sequence determined by a relative priority scheme. The first device includes a control unit configured to measure a communication delay for each of a plurality of different priority messages, set a delay representative value less than a maximum value of the plurality of communication delays, and adjust time that a time management unit manages, based on time that the first device manages, time that the second device manages, and the delay representative value.

Techniques are disclosed for extending scalable policy management to supporting network devices. A network device comprising a memory and a processor may perform various aspects of the techniques. The memory may be configured to store a policy. The processor may be configured to obtain the policy to be enforced by a supporting network device coupled to a server, and identify a port of the supporting network device to which the server is coupled via the switch fabric. The policy controller may also identify a workload executed by the server to which the policy is associated, and convert the policy into configuration data supported by the network device. The policy controller may further configure, based on the configuration data, the network device to enforce the policy with respect to network traffic received via the identified port.

Various methods and systems for implementing request scheduling and processing in a multi-tenant distributed computing environment are provided. Requests to utilize system resources in the distributed computing environment are stored in account queues corresponding to tenant accounts. If storing a request in an account queue would exceed a throttling threshold such as a limit on the number of requests stored per account, the request is dropped to a throttling queue. A scheduler prioritizes processing requests stored in the processing queue before processing requests stored in the account queues. The account queues can be drained using dominant resource scheduling. In some embodiments, a request is not picked up from an account queue if processing the request would exceed a predefined hard limit on system resource utilization for the corresponding tenant account. In some embodiments, the hard limit is defined as a percentage of threads the system has to process requests.

Implementations of the disclosure provide for queuing portions of the network traffic directed to a migrated guest for both receiving and transmitting at a source of the migration. In one implementation, a method is provided. The method comprises receiving, by a processing device via a network interface card (NIC), a first data packet. The first data packet includes a network address associated with a virtual machine (VM) that migrates from a first host to a second host. The first data packet is queued in a memory buffer at the first host in view of the network address. An indication that the network address of the VM is associated with the second host is received. Thereupon, the method causes the NIC to transmit the first data packet from the memory buffer over a network associated with the VM at the second host.

The systems and methods discussed herein provide for classifying CDN connections to the originating application on the first packet. In some implementations, the system identifies application connections established within a predetermined time period prior to the CDN connection and increments a value associated with these connections. The system classifies the CDN connection as corresponding to the application connection with the highest associated value, allowing routing of network traffic to take advantage of QoS benefits and reduce the need for deep packet inspection.

A credit loop that produces a deadlock is identified in a network of switches that are interconnected for packet traffic flows therethrough. The identification is carried out by periodically transmitting respective credit loop control messages from the loop-participating switches via their deadlock-suspected egress ports to respective next-hop switches. The CLCMs has switch port-unique identifiers (SPUIDs). The loop is identified when in one of the next-hop switches the SPUID of a received CLCM is equal to the SPUID of a transmitted CLCM thereof. A master switch is selected for resolving the deadlock.

Methods, systems, and computer readable media for lock-free communications processing at a network node are disclosed. One method occurs at a first network node configured to add messages to a plurality of queues, wherein each of the plurality of queues is accessed by one of a plurality of threads. The method comprises receiving a first message associated with a first mobile subscriber; determining that the first message is associated with a first partition key; assigning, based on the first partition key, the first message to a first queue of the plurality of queues, wherein the first queue includes messages associated with the first mobile subscriber and wherein the first queue is accessible by a first thread of the plurality of threads; and processing, by the first thread, messages of the first queue in a first in, first out order.

A queue management method, system, and recording medium include Selective Acknowledgments (SACK) examining to examine SACK blocks of the forwarder o selectively drop packets in the forward flow queue based on a reverse flow queue and MultiPath Transmission Control Protocol (MPTCP) examining configured to examine multipath headers to recognize MPTCP flows and examine the reverse flow queue to determine if redundant data has been sent such that the dropping drops the redundant data.