H04L43/106

IDENTIFYING HEARTBEAT MESSAGES
20180006910 · 2018-01-04 ·

Examples relate to identifying heartbeat messages. In one example, a computing device may: obtain a plurality of messages that includes incoming messages and outgoing messages, each incoming message being sent from a server device to a client device, and each outgoing message being sent from the client device to the server device; identify candidate message pairs, each candidate message pair including one incoming message and one outgoing message; and identify a heartbeat message pair from the candidate message pairs based on at least one of: plurality of timestamps that includes i) incoming message timestamps that each correspond to one of the incoming messages, and ii) outgoing message timestamps that each correspond to one of the outgoing messages; a number of occurrences of each candidate message pair included a message log; or characteristics of data included in the incoming message and outgoing message of each candidate message pair.

METHODS FOR INTELLIGENT LOAD BALANCING AND HIGH SPEED INTELLIGENT NETWORK RECORDERS

A high speed intelligent network recorder for recording a plurality of flows of network data packets into and out of a computer network over a relevant data time window is disclosed. The high speed intelligent network recorder includes a printed circuit board; a high speed network switching device mounted to the printed circuit board; and an X column by Y row array of a plurality of intelligent hard drives with micro-computers mounted to the printed circuit board and coupled in parallel with the high speed network switching device.

A method for network recording is disclosed. In one embodiment, the method includes the following: receiving a plurality of incoming packets, wherein each incoming packet belongs to a conversation flow; forming a capture stream of packet records for the incoming packets; and performing intelligent load balancing on the capture stream of packet records, the load balancing including reading the metadata for each packet record, determining a packet record is part of either a hot flow or a cold flow, selecting a destination node for each packet record based on the flow hash, and steering the packet record to one of a plurality of encapsulation buffers based on the destination node, wherein a cold flow tends to be maintained in a flow coherency at a node. The method may further include operations that include querying and back-testing in order to enable distributed analytics by using low cost, low band width nodes.

MONITORING PACKET RESIDENCE TIME AND CORRELATING PACKET RESIDENCE TIME TO INPUT SOURCES
20180006920 · 2018-01-04 ·

An output circuit, included in a device, may determine counter information associated with a packet provided via an output queue managed by the output circuit. The output circuit may determine that a latency event, associated with the output queue, has occurred. The output circuit may provide the counter information and time of day information associated with the counter information. The output circuit may provide a latency event notification associated with the output queue. An input circuit, included in the device, may receive the latency event notification associated with the output queue. The input circuit may determine performance information associated with an input queue. The input queue may correspond to the output queue and may be managed by the input circuit. The input circuit may provide the performance information associated with the input queue and time of day information associated with the performance information.

Out of order packet scheduler
11711312 · 2023-07-25 · ·

An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Out of order packet scheduler
11711312 · 2023-07-25 · ·

An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Systems and methods for routing trade orders based on exchange latency

Systems and methods for routing trade orders based on exchange latency are disclosed. An example method includes measuring a first latency associated with a first exchange based on a processing time of a first trade order; and routing a second trade order from a trading device to one of the first and a second exchange based on the first latency.

Systems and methods for routing trade orders based on exchange latency

Systems and methods for routing trade orders based on exchange latency are disclosed. An example method includes measuring a first latency associated with a first exchange based on a processing time of a first trade order; and routing a second trade order from a trading device to one of the first and a second exchange based on the first latency.

High accuracy time stamping for multi-lane ports

In a transceiver, the accuracy of a packet time stamp can be improved by compensating for errors introduced by processing of the packet. A received packet can be received via multiple lanes. A packet time stamp can be measured using a start of frame delimiter (SFD). A last arriving lane can be used to provide a recovered clock signal. A phase offset between the recovered clock signal and the system clock of the transceiver can be used to adjust the time stamp. A position of the SFD within a data block can be used to adjust the time stamp. A position of the data block within a combined group of data blocks can be used to adjust the time stamp. Also, a serializer-deserializer delay associated with the last arriving lane can be used to adjust the time stamp.

High accuracy time stamping for multi-lane ports

In a transceiver, the accuracy of a packet time stamp can be improved by compensating for errors introduced by processing of the packet. A received packet can be received via multiple lanes. A packet time stamp can be measured using a start of frame delimiter (SFD). A last arriving lane can be used to provide a recovered clock signal. A phase offset between the recovered clock signal and the system clock of the transceiver can be used to adjust the time stamp. A position of the SFD within a data block can be used to adjust the time stamp. A position of the data block within a combined group of data blocks can be used to adjust the time stamp. Also, a serializer-deserializer delay associated with the last arriving lane can be used to adjust the time stamp.

Load balancing during increased data traffic latency

A system includes at least one server that is configured to provide a multi-client network service to a plurality of existing users. When the server receives requests to join the multi-client network service from new users, the server may issue timestamps to each new user, obtain load metric based on the requests or timestamps, and collect the load metric to obtain historical data characterizing a demand in the multi-client network service over time. Further, based on the historical data, the server can predict a future load demand in the multi-client network service and selectively enable to join the multi-client network service by at least one of the plurality of new users based on the future load demand.