A method or system for mitigating payload failures in a networked computing environment. A payload failure is detected at either a sender or receiver NIC based on one or more health metrics, such as timeouts, transmission errors, or latency anomalies. In response, the system spoofs progress to the upstream application by signaling that data transmission is continuing, thereby preventing disruption or termination of the application process. A backup NIC is selected from the available NICs at the sender or receiver host based on one or more efficiency metrics, including a proximity metric (e.g., NUMA locality) and a utilization metric (e.g., current traffic load). Data transmission is then rerouted to the selected backup NIC, maintaining operational continuity.
H04L 41/0663 - Gestion des fautes, des événements, des alarmes ou des notifications en utilisant la reprise sur incident de réseau en réalisant des actions prédéfinies par la planification du basculement, p. ex. en passant à des éléments de réseau de secours
H04L 41/0604 - Gestion des fautes, des événements, des alarmes ou des notifications en utilisant du filtrage, p. ex. la réduction de l’information en utilisant la priorité, les types d’éléments, la position ou le temps
H04L 41/0631 - Gestion des fautes, des événements, des alarmes ou des notifications en utilisant l’analyse des causes profondesGestion des fautes, des événements, des alarmes ou des notifications en utilisant l’analyse de la corrélation entre les notifications, les alarmes ou les événements en fonction de critères de décision, p. ex. la hiérarchie ou l’analyse temporelle ou arborescente
A method or system for mitigating payload failures in a networked computing environment. A payload failure is detected at either a sender or receiver NIC based on one or more health metrics, such as timeouts, transmission errors, or latency anomalies. In response, the system spoofs progress to the upstream application by signaling that data transmission is continuing, thereby preventing disruption or termination of the application process. A backup NIC is selected from the available NICs at the sender or receiver host based on one or more efficiency metrics, including a proximity metric (e.g., NUMA locality) and a utilization metric (e.g., current traffic load). Data transmission is then rerouted to the selected backup NIC, maintaining operational continuity.
H04L 45/28 - Routage ou recherche de routes de paquets dans les réseaux de commutation de données en utilisant la reprise sur incident de routes
G06F 11/00 - Détection d'erreursCorrection d'erreursContrôle de fonctionnement
H04B 1/74 - Détails des systèmes de transmission, non couverts par l'un des groupes Détails des systèmes de transmission non caractérisés par le milieu utilisé pour la transmission pour augmenter la fiabilité, p. ex. en utilisant des canaux ou des appareils supplémentaires ou de réserve
H04L 12/28 - Réseaux de données à commutation caractérisés par la configuration des liaisons, p. ex. réseaux locaux [LAN Local Area Networks] ou réseaux étendus [WAN Wide Area Networks]
H04L 41/0663 - Gestion des fautes, des événements, des alarmes ou des notifications en utilisant la reprise sur incident de réseau en réalisant des actions prédéfinies par la planification du basculement, p. ex. en passant à des éléments de réseau de secours
H04L 43/0811 - Surveillance ou test en fonction de métriques spécifiques, p. ex. la qualité du service [QoS], la consommation d’énergie ou les paramètres environnementaux en vérifiant la disponibilité en vérifiant la connectivité
H04L 45/247 - Routes multiples en utilisant M: N routes actives ou de secours
H04L 69/40 - Dispositions, protocoles ou services de réseau indépendants de la charge utile de l'application et non couverts dans un des autres groupes de la présente sous-classe pour se remettre d'une défaillance d'une instance de protocole ou d'une entité, p. ex. protocoles de redondance de service, état de redondance de protocole ou redirection de service de protocole
For each respective flow over a network initiated by an application layer, a controller determines a respective path taken by the respective flow from respective source host to respective destination host, transmits respective probe packets along the respective path while taking timestamps at the respective source host and the respective destination host, and determines a respective one-way delay for the respective path based on the timestamps. The controller determines utilization for each path, determines determining an optimal usage across each path, and schedules transmission of data for each respective flow based on the optimal usage.
H04L 47/283 - Commande de fluxCommande de la congestion par rapport à des considérations temporelles en réponse à des retards de traitement, p. ex. causés par une gigue ou un temps d'aller-retour [RTT]
H04L 47/30 - Commande de fluxCommande de la congestion en combinaison avec des informations sur l'occupation de mémoires tampon à chaque extrémité ou aux nœuds de transit
An application captures, by a sender host, timestamp of a system clock of the sender host. The application writes, by the sender host, the system clock timestamp to memory of the system host. The application reads, directly from the memory, by a component of the sender host, the timestamp. The application transmits, from the component of the sender host to a component of a receiver host, the timestamp over a Remote Direct Memory Access (RDMA) network. The application writes, by the component of the receiver host, the timestamp to memory of the receiver host. The application calculates, by the receiver host, a one-way delay (OWD) between the sender host and the receiver host using the timestamp, and outputs a control signal based on the one-way delay.
H04L 7/04 - Commande de vitesse ou de phase au moyen de signaux de synchronisation
G06F 1/12 - Synchronisation des différents signaux d'horloge
H04L 47/12 - Prévention de la congestionRécupération de la congestion
H04L 67/1097 - Protocoles dans lesquels une application est distribuée parmi les nœuds du réseau pour le stockage distribué de données dans des réseaux, p. ex. dispositions de transport pour le système de fichiers réseau [NFS], réseaux de stockage [SAN] ou stockage en réseau [NAS]
5.
TIMESTAMP INJECTION AND COMPRESSION IN RDMA MESSAGE METADATA FOR CLOCK SYNCHRONIZATION AND CONGESTION CONTROL
An application identifies a metadata field within a Remote Direct Memory Access (RDMA) message structure that can be used for timestamp injection. The application generates a high-resolution timestamp that captures a time when the RDMA message is sent, where the high-resolution timestamp has a first size that exceeds a size of the metadata field. The application compresses the high-resolution timestamp into a compressed timestamp having a second size that fits within the size of the metadata field, and injects the compressed timestamp into the metadata field of the RDMA message, the RDMA message sent from a sender host to a receiver host. The application calculates a one-way delay between the sender host and the receiver host using the compressed timestamp, and outputs a control signal based on the one-way delay.
G06F 1/14 - Dispositions pour le contrôle du temps, p. ex. horloge temps réel
G06F 1/12 - Synchronisation des différents signaux d'horloge
G06F 15/173 - Communication entre processeurs utilisant un réseau d'interconnexion, p. ex. matriciel, de réarrangement, pyramidal, en étoile ou ramifié
6.
TIMESTAMP INJECTION AND COMPRESSION IN RDMA MESSAGE METADATA FOR CLOCK SYNCHRONIZATION AND CONGESTION CONTROL
An application identifies a metadata field within a Remote Direct Memory Access (RDMA) message structure that can be used for timestamp injection. The application generates a high-resolution timestamp that captures a time when the RDMA message is sent, where the high-resolution timestamp has a first size that exceeds a size of the metadata field. The application compresses the high-resolution timestamp into a compressed timestamp having a second size that fits within the size of the metadata field, and injects the compressed timestamp into the metadata field of the RDMA message, the RDMA message sent from a sender host to a receiver host. The application calculates a one-way delay between the sender host and the receiver host using the compressed timestamp, and outputs a control signal based on the one-way delay.
H04L 7/00 - Dispositions pour synchroniser le récepteur avec l'émetteur
H04L 43/106 - Surveillance active, p. ex. battement de cœur, utilitaire Ping ou trace-route en utilisant des informations liées au temps dans des paquets, p. ex. en ajoutant des horodatages
H04L 69/04 - Protocoles de compression de données, p. ex. ROHC
G06F 15/173 - Communication entre processeurs utilisant un réseau d'interconnexion, p. ex. matriciel, de réarrangement, pyramidal, en étoile ou ramifié
Systems and methods are disclosed herein method for controlling traffic of a network at an application layer. A controller detects that an application is initiating transmission of a message from a sender host to a receiver host. The controller records one or more application layer sender timestamps corresponding to the transmission of the message, and records one or more application layer receiver timestamps based on detecting receipt of at least a portion of the message at the receiver host. Responsive to detecting that the message has been completely received by the receiver host, the controller determines a message duration spanning a length of time between a first one of the application layer sender timestamps and a last one of the application layer receiver timestamps. The controller performs a network traffic control function based on the message duration.
Systems and methods are disclosed herein method for controlling traffic of a network at an application layer. A controller detects that an application is initiating transmission of a message from a sender host to a receiver host. The controller records one or more application layer sender timestamps corresponding to the transmission of the message, and records one or more application layer receiver timestamps based on detecting receipt of at least a portion of the message at the receiver host. Responsive to detecting that the message has been completely received by the receiver host, the controller determines a message duration spanning a length of time between a first one of the application layer sender timestamps and a last one of the application layer receiver timestamps. The controller performs a network traffic control function based on the message duration.
H04L 47/283 - Commande de fluxCommande de la congestion par rapport à des considérations temporelles en réponse à des retards de traitement, p. ex. causés par une gigue ou un temps d'aller-retour [RTT]
H04L 47/30 - Commande de fluxCommande de la congestion en combinaison avec des informations sur l'occupation de mémoires tampon à chaque extrémité ou aux nœuds de transit
9.
CLOCK SYNCHRONIZATION ACROSS GLOBAL AND LOCAL REFERENCES
In some embodiments, for a first tier of nodes having long links, a coordinator selects a master reference node. For a group of nodes within a second tier of nodes, the coordinator selects a local reference node. The coordinator adjusts, during a plurality of cycles, a local reference clock of the local reference node based on a clock difference between the local reference clock and a master reference clock of the master reference node. For each node of the group of nodes within the second tier of nodes, the coordinator adjusts, during the plurality of cycles, its corresponding clock based on a corresponding clock difference between its corresponding clock and the local reference clock, where adjustments to the local reference clock are applied during each of the plurality of cycles using guardrails that are not applied when adjusting clocks of the group of nodes within the second tier of nodes.
In some embodiments, for a first tier of nodes having long links, a coordinator selects a master reference node. For a group of nodes within a second tier of nodes, the coordinator selects a local reference node. The coordinator adjusts, during a plurality of cycles, a local reference clock of the local reference node based on a clock difference between the local reference clock and a master reference clock of the master reference node. For each node of the group of nodes within the second tier of nodes, the coordinator adjusts, during the plurality of cycles, its corresponding clock based on a corresponding clock difference between its corresponding clock and the local reference clock, where adjustments to the local reference clock are applied during each of the plurality of cycles using guardrails that are not applied when adjusting clocks of the group of nodes within the second tier of nodes.
A bump-on-the-wire (BOTW) associated with a sender host receives a data packet destined for a receiver host, where the data packet was transmitted by the sender host, where the sender bump-on-the-wire is at a position on a data path between the sender host and a receiver host, and where the sender host, the receiver host, the sender bump-on-the-wire, and a receiver bump-on-the-wire are clock-synchronized with respect to one another. The sender BOTW records a sender timestamp of the data packet. The sender BOTW receives, from a receiver bump-on-the-wire associated with the receiver host, a receiver timestamp of the data packet along with auxiliary information. The sender BOTW determines a congestion metric based on the sender timestamp, the receiver timestamp, and the auxiliary information, and transmits, to the sender host, a congestion signal based on the congestion metric.
H04L 41/00 - Dispositions pour la maintenance, l’administration ou la gestion des réseaux de commutation de données, p. ex. des réseaux de commutation de paquets
H04L 47/00 - Commande du trafic dans les réseaux de commutation de données
H04L 47/20 - Commande de fluxCommande de la congestion en assurant le maintien du trafic
H04L 47/24 - Trafic caractérisé par des attributs spécifiques, p. ex. la priorité ou QoS
12.
DEPLOYING SHADOW BUFFER ON BUMP-ON-THE-WIRE BETWEEN NODES IN CONTEXT OF CLOCK-SYNCHRONIZED EDGE-BASED NETWORK FUNCTIONS
A bump-on-the-wire (BOTW) associated with a sender host receives a data packet destined for a receiver host, where the data packet was transmitted by the sender host, where the sender bump-on-the-wire is at a position on a data path between the sender host and a receiver host, and where the sender host, the receiver host, the sender bump-on-the-wire, and a receiver bump-on-the-wire are clock-synchronized with respect to one another. The sender BOTW records a sender timestamp of the data packet. The sender BOTW receives, from a receiver bump-on-the-wire associated with the receiver host, a receiver timestamp of the data packet along with auxiliary information. The sender BOTW determines a congestion metric based on the sender timestamp, the receiver timestamp, and the auxiliary information, and transmits, to the sender host, a congestion signal based on the congestion metric.
H04L 43/0882 - Utilisation de la capacité de la liaison
H04L 7/00 - Dispositions pour synchroniser le récepteur avec l'émetteur
H04L 43/106 - Surveillance active, p. ex. battement de cœur, utilitaire Ping ou trace-route en utilisant des informations liées au temps dans des paquets, p. ex. en ajoutant des horodatages
13.
CLOCK-SYNCHRONIZED EDGE-BASED DATA FLOW PRIORITY ASSIGNMENT
Network traffic is monitored to coordinate control of data flows. Data flows between sender hosts and a receiver host are identified. A first data flow and a second data flow have respective priorities. Delay thresholds are assigned to the first data flow and second data flow based on their respective priorities. One-way delays of data packets of the first and second data flows are monitored relative to the assigned delay thresholds. Responsive to determining that the one-way delay of the first data flow's data packets exceed a first delay threshold, transmissions of the first data flow's data packets are paused for a first amount of time. Responsive to determining that the one-way delay of the second data flow's data packets exceed a second delay threshold, transmissions of the second data flow's packets are paused for a second amount of time that exceeds the first amount of time.
H04L 47/12 - Prévention de la congestionRécupération de la congestion
H04L 47/2425 - Trafic caractérisé par des attributs spécifiques, p. ex. la priorité ou QoS pour la prise en charge de spécifications de services, p. ex. SLA
14.
Clock syntonization using network effect and/or adaptive stochastic control
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/033 - Commande de vitesse ou de phase au moyen des signaux de code reçus, les signaux ne contenant aucune information de synchronisation particulière en utilisant les transitions du signal reçu pour commander la phase de moyens générateurs du signal de synchronisation, p. ex. en utilisant une boucle verrouillée en phase
G06N 20/10 - Apprentissage automatique utilisant des méthodes à noyaux, p. ex. séparateurs à vaste marge [SVM]
H03L 7/087 - Détails de la boucle verrouillée en phase concernant principalement l'agencement de détection de phase ou de fréquence, y compris le filtrage ou l'amplification de son signal de sortie utilisant au moins deux détecteurs de phase ou un détecteur de fréquence et de phase dans la boucle
15.
Quantized pause for a traffic control mechanism robust to underlying network conditions
An application determines conditions of the network between a sender host and a receiver host. The application determines, from the conditions, a length of pause to apply. The application transmits the traffic until the length of pause is completely applied to the network using a series of quantized pauses. When the length of pause exceeds a threshold, the application instructs the sender host to pause the traffic for a first amount of time, and where the length of pause does not exceed the threshold, the application instructs the sender host to pause the traffic for a second smaller amount of time. The application detects a new set of conditions of the network between the first node and the second node, and applies a new series of quantized pauses to transmission of the traffic based on a new length of pause determined from the new set of conditions.
H04L 47/25 - Commande de fluxCommande de la congestion le débit étant modifié par la source lors de la détection d'un changement des conditions du réseau
16.
QUANTIZED PAUSE FOR A TRAFFIC CONTROL MECHANISM ROBUST TO UNDERLYING NETWORK CONDITIONS
An application determines conditions of the network between a sender host and a receiver host. The application determines, from the conditions, a length of pause to apply. The application transmits the traffic until the length of pause is completely applied to the network using a series of quantized pauses. When the length of pause exceeds a threshold, the application instructs the sender host to pause the traffic for a first amount of time, and where the length of pause does not exceed the threshold, the application instructs the sender host to pause the traffic for a second smaller amount of time. The application detects a new set of conditions of the network between the first node and the second node, and applies a new series of quantized pauses to transmission of the traffic based on a new length of pause determined from the new set of conditions.
H04L 12/50 - Systèmes de commutation de circuits, c.-à-d. systèmes dans lesquels la voie de transmission est stable pendant la communication
H04L 41/00 - Dispositions pour la maintenance, l’administration ou la gestion des réseaux de commutation de données, p. ex. des réseaux de commutation de paquets
H04L 47/00 - Commande du trafic dans les réseaux de commutation de données
17.
DEPLOYING SHADOW BUFFER IN CONTEXT OF CLOCK-SYNCHRONIZED EDGE-BASED NETWORK FUNCTIONS
A regular buffer and a shadow buffer are maintained at a receiver host. Responsive to receiving a data flow from a sender host that is clock-synchronized with the receiver host using a common reference clock, a first indication of data of the data flow is stored to the regular buffer, the shadow buffer is transitioned from an idle state to an active state, and a counter of the shadow buffer is incremented that indicates a unit of data traffic received. A dynamic drain rate is determined based on a number of units of the data removed from the regular buffer per unit of time while the shadow buffer is in the active state, where the shadow buffer reverts to an idle state responsive to a break in the receiver host receiving the data flow. Dwell time is calculated as a function of the counter of the shadow buffer and the dynamic drain rate, and a congestion signal for the data flow is determined based on the dwell time.
H04L 47/56 - Ordonnancement des files d’attente en implémentant un ordonnancement selon le délai
H04L 47/2425 - Trafic caractérisé par des attributs spécifiques, p. ex. la priorité ou QoS pour la prise en charge de spécifications de services, p. ex. SLA
H04L 47/28 - Commande de fluxCommande de la congestion par rapport à des considérations temporelles
H04L 49/9047 - Dispositions de mémoires tampon comprenant plusieurs mémoires tampon, p. ex. des réservoirs de mémoires tampon
18.
Clock syntonization using network effect and/or adaptive stochastic control
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/033 - Commande de vitesse ou de phase au moyen des signaux de code reçus, les signaux ne contenant aucune information de synchronisation particulière en utilisant les transitions du signal reçu pour commander la phase de moyens générateurs du signal de synchronisation, p. ex. en utilisant une boucle verrouillée en phase
G06N 20/10 - Apprentissage automatique utilisant des méthodes à noyaux, p. ex. séparateurs à vaste marge [SVM]
H03L 7/087 - Détails de la boucle verrouillée en phase concernant principalement l'agencement de détection de phase ou de fréquence, y compris le filtrage ou l'amplification de son signal de sortie utilisant au moins deux détecteurs de phase ou un détecteur de fréquence et de phase dans la boucle
19.
Deploying shadow buffer in context of clock-synchronized edge-based network functions
A regular buffer and a shadow buffer are maintained at a receiver host. Responsive to receiving a data flow from a sender host that is clock-synchronized with the receiver host using a common reference clock, a first indication of data of the data flow is stored to the regular buffer, the shadow buffer is transitioned from an idle state to an active state, and a counter of the shadow buffer is incremented that indicates a unit of data traffic received. A dynamic drain rate is determined based on a number of units of the data removed from the regular buffer per unit of time while the shadow buffer is in the active state, where the shadow buffer reverts to an idle state responsive to a break in the receiver host receiving the data flow. Dwell time is calculated as a function of the counter of the shadow buffer and the dynamic drain rate, and a congestion signal for the data flow is determined based on the dwell time.
H04L 47/56 - Ordonnancement des files d’attente en implémentant un ordonnancement selon le délai
H04L 49/9047 - Dispositions de mémoires tampon comprenant plusieurs mémoires tampon, p. ex. des réservoirs de mémoires tampon
H04L 47/2425 - Trafic caractérisé par des attributs spécifiques, p. ex. la priorité ou QoS pour la prise en charge de spécifications de services, p. ex. SLA
H04L 47/28 - Commande de fluxCommande de la congestion par rapport à des considérations temporelles
20.
Virtual device colocation determination using distance matrix aggregations
A device determines whether virtual resources are co-located on a physical resource. The device computes a plurality of distance matrices, each distance matrix of the plurality of distance matrices computed using a different raw input signal. The device combines the plurality of distance matrices into a combined distance matrix. The device determines, using the combined distance matrix, subsets of the virtual resources that are using shared physical hardware. The device outputs indicia of the subsets.
G06F 9/455 - ÉmulationInterprétationSimulation de logiciel, p. ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation
G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
H04L 41/0893 - Affectation de groupes logiques aux éléments de réseau
H04L 43/045 - Traitement des données de surveillance capturées, p. ex. pour la génération de fichiers journaux pour la visualisation graphique des données de surveillance
A device determines whether virtual resources are co-located on a physical resource. The determination is performed by aggregating a plurality of timestamps into a data structure, each timestamp of the plurality of timestamps corresponding to one of a sent time or a receive time of a network packet exchanged between two of the virtual resources, the data structure representing one or more raw signals of distance between sets of the virtual resources that exchanged network packets, the virtual resources synchronized to a common reference clock. The device determines, using the data structure, subsets of sets of virtual resources that are using shared physical hardware. The device outputs indicia of the subsets.
G06F 9/455 - ÉmulationInterprétationSimulation de logiciel, p. ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation
22.
DEPLOYING SHADOW BUFFER IN CONTEXT OF CLOCK-SYNCHRONIZED EDGE-BASED NETWORK FUNCTIONS
A regular buffer and a shadow buffer are maintained at a receiver host. Responsive to receiving a data flow from a sender host that is clock-synchronized with the receiver host using a common reference clock, a first indication of data of the data flow is stored to the regular buffer, the shadow buffer is transitioned from an idle state to an active state, and a counter of the shadow buffer is incremented that indicates a unit of data traffic received.
09 - Appareils et instruments scientifiques et électriques
42 - Services scientifiques, technologiques et industriels, recherche et conception
Produits et services
Downloadable computer software for creating and comparing timestamps with dynamic bounds being customizable parameters; downloadable computer software providing application programming interfaces (APIs) for use in other computer software, namely, function libraries for time measurement and computation of derived values, for creating and comparing timestamps with dynamic bounds being customizable parameters; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API) Software as a service (SAAS) services featuring software for creating and comparing timestamps with dynamic bounds being customizable parameters; Software as a service (SAAS) services featuring software providing application programming interfaces (APIs) for use in other computer software, namely, online non-downloadable software for time measurement and computation of derived values, for creating and comparing timestamps with dynamic bounds being customizable parameters; Software as a service (SAAS) services featuring software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API)
Network traffic is monitored to coordinate control of data flows and detect anomalies. For a data flow transmitted between sender and receiver hosts, pre-defined amounts of sent and received network traffic of the data flow is recorded. The data flow is monitored, based on time stamps of data packets in the network traffic, for an anomaly. Responsive to determining that no anomaly is detected, the recorded sent and received network traffic is overwritten with newly sent and newly received network traffic, respectively. Responsive to determining that an anomaly is detected, the data flow is paused, which causes the sender host to store the recorded sent network traffic to a first buffer and causes the receiver host the store the recorded received network traffic to a second buffer.
H04L 47/12 - Prévention de la congestionRécupération de la congestion
H04L 47/2425 - Trafic caractérisé par des attributs spécifiques, p. ex. la priorité ou QoS pour la prise en charge de spécifications de services, p. ex. SLA
25.
Clock-synchronized edge-based data flow priority assignment
Network traffic is monitored to coordinate control of data flows. Data flows between sender hosts and a receiver host are identified. A first data flow and a second data flow have respective priorities. Delay thresholds are assigned to the first data flow and second data flow based on their respective priorities. One-way delays of data packets of the first and second data flows are monitored relative to the assigned delay thresholds. Responsive to determining that the one-way delay of the first data flow's data packets exceed a first delay threshold, transmissions of the first data flow's data packets are paused for a first amount of time. Responsive to determining that the one-way delay of the second data flow's data packets exceed a second delay threshold, transmissions of the second data flow's packets are paused for a second amount of time that exceeds the first amount of time.
H04L 47/12 - Prévention de la congestionRécupération de la congestion
H04L 47/2425 - Trafic caractérisé par des attributs spécifiques, p. ex. la priorité ou QoS pour la prise en charge de spécifications de services, p. ex. SLA
Network traffic is monitored to coordinate control of data flows and detect anomalies. For a data flow transmitted between sender and receiver hosts, pre-defmed amounts of sent and received network traffic of the data flow is recorded. The data flow is monitored, based on time stamps of data packets in the network traffic, for an anomaly. Responsive to determining that no anomaly is detected, the recorded sent and received network traffic is overwritten with newly sent and newly received network traffic, respectively. Responsive to determining that an anomaly is detected, the data flow is paused, which causes the sender host to store the recorded sent network traffic to a first buffer and causes the receiver host the store the recorded received network traffic to a second buffer.
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/033 - Commande de vitesse ou de phase au moyen des signaux de code reçus, les signaux ne contenant aucune information de synchronisation particulière en utilisant les transitions du signal reçu pour commander la phase de moyens générateurs du signal de synchronisation, p. ex. en utilisant une boucle verrouillée en phase
G06N 20/10 - Apprentissage automatique utilisant des méthodes à noyaux, p. ex. séparateurs à vaste marge [SVM]
H03L 7/087 - Détails de la boucle verrouillée en phase concernant principalement l'agencement de détection de phase ou de fréquence, y compris le filtrage ou l'amplification de son signal de sortie utilisant au moins deux détecteurs de phase ou un détecteur de fréquence et de phase dans la boucle
28.
Time-triggered distribution of messages from a region of networked machines to multiple destinations using gateway-based time perimeters
Systems and methods are disclosed herein for performing a time-triggered distribution of messages from a region of networked machines to multiple destinations. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, wherein each gateway is a machine on a perimeter of the region of networked machines and is connected to transmit messages to multiple destinations. The gateways receive messages from within the region of networked machines for distribution to multiple destinations outside the region of networked machines according to a distribution schedule based on absolute time relative to the reference clock. The gateways perform the distribution of received messages, wherein each gateway determines absolute time based on that gateway's synchronization with the reference clock.
09 - Appareils et instruments scientifiques et électriques
42 - Services scientifiques, technologiques et industriels, recherche et conception
Produits et services
Downloadable computer software for monitoring, correcting,
updating, and synchronizing times relative to a reference
clock across multiple machines; downloadable computer
software for discovery, latency/delay measurement,
monitoring, telemetry, and congestion management of computer
and communication networks; downloadable computer software
for dynamic packet-level, flow-level, and application-level
prioritization, flow and control of computer and
communication networks; downloadable computer software for
establishing accurate, multi-tiered time perimeters to
enforce precise order of execution (FIFO) of incoming data
and simultaneous publishing / release of outgoing data to
clusters of machines; downloadable computer software for
building of scalable, time-sensitive, latency-critical
applications using time-as-a-service API; downloadable
computer software for creating an accurate common timeline
among clusters of machines to monitor, diagnose and improve
performance of distributed applications; downloadable
computer software for reliable, on-time (user specified) and
guaranteed delivery of data on commodity computer and
communication networks; downloadable computer software for
identifying underperforming resources on commodity computer
and communication networks and boosting their performance. Provision of online, non-downloadable computer software for
monitoring, correcting, updating, and synchronizing times
relative to a reference clock across multiple machines;
provision of online, non-downloadable computer software for
discovery, latency/delay measurement, monitoring, telemetry,
and congestion management of computer and communication
networks; provision of online, non-downloadable computer
software for dynamic packet-level, flow-level, and
application-level prioritization, flow and control of
computer and communication networks; provision of online,
non-downloadable computer software for establishing
accurate, multi-tiered time perimeters to enforce precise
order of execution (FIFO) of incoming data and simultaneous
publishing / release of outgoing data to clusters of
machines; provision of online, non-downloadable computer
software for building of scalable, time-sensitive,
latency-critical applications using time-as-a-service API;
provision of online, non-downloadable computer software for
creating an accurate common timeline among clusters of
machines to monitor, diagnose and improve performance of
distributed applications; provision of online,
non-downloadable computer software for reliable, on-time
(user specified) and guaranteed delivery of data on
commodity computer and communication networks; provision of
online, non-downloadable computer software for identifying
underperforming resources on commodity computer and
communication networks and boosting their performance;
managed cloud services featuring the foregoing software;
provision of time-as-a-service APIs for use by others.
09 - Appareils et instruments scientifiques et électriques
42 - Services scientifiques, technologiques et industriels, recherche et conception
Produits et services
(1) Downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise First-In-First-Out order of execution of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service Application Programming Interface; downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; downloadable computer software for reliable and guaranteed delivery of data on commodity computer and communication networks; downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance. (1) Provision of online, non-downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; provision of online, non downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; provision of online, non-downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; provision of online, non-downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise First-In-First-Out order of execution of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; provision of online, non-downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service Application Programming Interface; provision of online, non downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; provision of online, non downloadable computer software for reliable and guaranteed delivery of data on commodity computer and communication networks; provision of online, non-downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance; managed cloud services featuring the foregoing software; provision of time-as-a-service Application Programming Interfaces for use by others.
09 - Appareils et instruments scientifiques et électriques
42 - Services scientifiques, technologiques et industriels, recherche et conception
Produits et services
downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance provision of online, non-downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; provision of online, non-downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; provision of online, non-downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; provision of online, non-downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; provision of online, non-downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); provision of online, non-downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; provision of online, non-downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; provision of online, non-downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance; managed cloud services featuring the foregoing software; provision of time-as-a-service application programming interface (API) for use by others
09 - Appareils et instruments scientifiques et électriques
42 - Services scientifiques, technologiques et industriels, recherche et conception
Produits et services
downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance provision of online, non-downloadable computer software for monitoring, correcting, updating, and synchronizing times relative to a reference clock across multiple machines; provision of online, non-downloadable computer software for discovery, latency and delay measurement, monitoring, telemetry, and congestion management of computer and communication networks; provision of online, non-downloadable computer software for dynamic packet-level, flow-level, and application-level prioritization, flow and control of computer and communication networks; provision of online, non-downloadable computer software for establishing accurate, multi-tiered time perimeters to enforce precise order of execution, first in first out (FIFO), of incoming data and simultaneous publishing and release of outgoing data to clusters of machines; provision of online, non-downloadable computer software for building of scalable, time-sensitive, latency-critical applications using time-as-a-service application programming interface (API); provision of online, non-downloadable computer software for creating an accurate common timeline among clusters of machines to monitor, diagnose and improve performance of distributed applications; provision of online, non-downloadable computer software for reliable, on-time, user specified, and guaranteed delivery of data on commodity computer and communication networks; provision of online, non-downloadable computer software for identifying underperforming resources on commodity computer and communication networks and boosting their performance; managed cloud services featuring the foregoing software; provision of time-as-a-service application programming interface (API) for use by others
33.
Clock syntonization using network effect and/or adaptive stochastic control
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/00 - Dispositions pour synchroniser le récepteur avec l'émetteur
H04L 7/033 - Commande de vitesse ou de phase au moyen des signaux de code reçus, les signaux ne contenant aucune information de synchronisation particulière en utilisant les transitions du signal reçu pour commander la phase de moyens générateurs du signal de synchronisation, p. ex. en utilisant une boucle verrouillée en phase
G06N 20/10 - Apprentissage automatique utilisant des méthodes à noyaux, p. ex. séparateurs à vaste marge [SVM]
H03L 7/087 - Détails de la boucle verrouillée en phase concernant principalement l'agencement de détection de phase ou de fréquence, y compris le filtrage ou l'amplification de son signal de sortie utilisant au moins deux détecteurs de phase ou un détecteur de fréquence et de phase dans la boucle
34.
Time-based processing of messages arriving from multiple gateways using gateway-based time perimeters
Systems and methods are disclosed herein for performing a time-ordered operation on messages transmitted from multiple sources to a region of networked machines. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, where each gateway is a machine on a perimeter of the region of networked machines and is connected to receive messages from multiple sources. The system receives messages that enter the region through one of the gateways, where the gateway timestamps the message. The system then performs the time-ordered operation on the received messages in an order based on an absolute time of entry into the region, where the absolute time of entry is relative to the reference clock and is determined based on the timestamp from the gateway.
G06F 15/16 - Associations de plusieurs calculateurs numériques comportant chacun au moins une unité arithmétique, une unité programme et un registre, p. ex. pour le traitement simultané de plusieurs programmes
H04L 7/00 - Dispositions pour synchroniser le récepteur avec l'émetteur
H04L 12/26 - Dispositions de surveillance; Dispositions de test
35.
Time-triggered distribution of messages from a region of networked machines to multiple destinations using gateway-based time perimeters
Systems and methods are disclosed herein for performing a time-triggered distribution of messages from a region of networked machines to multiple destinations. In an embodiment, the system runs a software-based synchronization process to synchronize each of a plurality of gateways with a reference clock, wherein each gateway is a machine on a perimeter of the region of networked machines and is connected to transmit messages to multiple destinations. The gateways receive messages from within the region of networked machines for distribution to multiple destinations outside the region of networked machines according to a distribution schedule based on absolute time relative to the reference clock. The gateways perform the distribution of received messages, wherein each gateway determines absolute time based on that gateway's synchronization with the reference clock.
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/00 - Dispositions pour synchroniser le récepteur avec l'émetteur
H04L 7/033 - Commande de vitesse ou de phase au moyen des signaux de code reçus, les signaux ne contenant aucune information de synchronisation particulière en utilisant les transitions du signal reçu pour commander la phase de moyens générateurs du signal de synchronisation, p. ex. en utilisant une boucle verrouillée en phase
G06N 20/10 - Apprentissage automatique utilisant des méthodes à noyaux, p. ex. séparateurs à vaste marge [SVM]
H03L 7/087 - Détails de la boucle verrouillée en phase concernant principalement l'agencement de détection de phase ou de fréquence, y compris le filtrage ou l'amplification de son signal de sortie utilisant au moins deux détecteurs de phase ou un détecteur de fréquence et de phase dans la boucle
37.
Clock syntonization using network effect and/or adaptive stochastic control
Systems and methods are disclosed herein for syntonizing machines in a network. A coordinator accesses probe records for probes transmitted at different times between pairs of machines in the mesh network. For different pairs of machines, the coordinator estimates the drift between the pair of machines based on the transit times of probes transmitted between the pair of machines as indicated by the probe records. For different loops of at least three machines in the mesh network, the coordinator calculates a loop drift error based on a sum of the estimated drifts between pairs of machines around the loop and adjusts the estimated absolute drifts of the machines based on the loop drift errors. Here, the absolute drift is defined relative to a drift of a reference machine.
H04L 7/00 - Dispositions pour synchroniser le récepteur avec l'émetteur
H04L 7/033 - Commande de vitesse ou de phase au moyen des signaux de code reçus, les signaux ne contenant aucune information de synchronisation particulière en utilisant les transitions du signal reçu pour commander la phase de moyens générateurs du signal de synchronisation, p. ex. en utilisant une boucle verrouillée en phase
G06N 20/10 - Apprentissage automatique utilisant des méthodes à noyaux, p. ex. séparateurs à vaste marge [SVM]
H03L 7/087 - Détails de la boucle verrouillée en phase concernant principalement l'agencement de détection de phase ou de fréquence, y compris le filtrage ou l'amplification de son signal de sortie utilisant au moins deux détecteurs de phase ou un détecteur de fréquence et de phase dans la boucle
