H04L67/1095

MESH NETWORK UPDATE SYSTEM AND METHOD THEREOF
20230073061 · 2023-03-09 ·

A mesh network system includes a plurality of network nodes. The network nodes are communicatively connected to each other to form a mesh structure. The network nodes include a first node and at least one second node. The first node is configured to obtain an update file in response to an update trigger command and send an update notification to the at least one second node respectively. Each of the at least one second node is configured to obtain the update file from the first node in response to the update notification. The first node and the at least one second node perform an update procedure simultaneously according to the update file.

Resource provisioning systems and methods

A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/Furthermore, the device processes the set of queries using the updated set of processors.

Resource provisioning systems and methods

A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/Furthermore, the device processes the set of queries using the updated set of processors.

FAST PROVISIONING OF MACHINES USING NETWORK CLONING

Some embodiments of the invention provide a method for cloning a set of one or more applications implemented by a first set of machines connected through a first logical network that defines a virtual private cloud in a set of one or more datacenters. The method instantiates a cloned, second set of machines that is a replicated copy of the first set of machines. The method identifies a set of network configuration data that configures a set of logical forwarding elements (LFEs) of the first logical network. The method uses the identified set of network configuration data to define a cloned, second logical network to connect the cloned, second set of machines.

Predictive and adaptive queue flushing for real-time data reconciliation between local and remote databases
11599560 · 2023-03-07 · ·

Predictive queue flushing for real-time synchronization of data sets between two data stores, comprising a data synchronization software module that interfaces with each data store, and uses a queue monitor to record and store changes to data on each data store and calculate velocity and acceleration of event arrivals, and a policy manager to manage synchronization, and a query generator to incorporate policies from the policy manager and measurements from the queue monitor to direct the data synchronization software module, flushing the change queue in accordance with the established synchronization policy, yielding synchronized shared data sets.

Predictive and adaptive queue flushing for real-time data reconciliation between local and remote databases
11599560 · 2023-03-07 · ·

Predictive queue flushing for real-time synchronization of data sets between two data stores, comprising a data synchronization software module that interfaces with each data store, and uses a queue monitor to record and store changes to data on each data store and calculate velocity and acceleration of event arrivals, and a policy manager to manage synchronization, and a query generator to incorporate policies from the policy manager and measurements from the queue monitor to direct the data synchronization software module, flushing the change queue in accordance with the established synchronization policy, yielding synchronized shared data sets.

High-throughput algorithm for multiversion concurrency control with globally synchronized time
11601501 · 2023-03-07 · ·

Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.

High-throughput algorithm for multiversion concurrency control with globally synchronized time
11601501 · 2023-03-07 · ·

Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.

Zero-knowledge environment based social networking engine
11637703 · 2023-04-25 · ·

Methods, systems, and apparatus are described providing social networking engines. Specifically, the present specification relates to a method for implementing software containers implementing social network engines that may be configured to act in a zero-knowledge environment. In such implementations, all information pertaining to the social network engine associated with a user that is stored in the container is solely that of a user unless explicitly shared by the user. In some implementations, the containers may be configured to participate in a publish-and-subscribe network in order to share information. In addition, the containers may be provisioned with controls so that global operators may comply with local privacy rules.

Zero-knowledge environment based social networking engine
11637703 · 2023-04-25 · ·

Methods, systems, and apparatus are described providing social networking engines. Specifically, the present specification relates to a method for implementing software containers implementing social network engines that may be configured to act in a zero-knowledge environment. In such implementations, all information pertaining to the social network engine associated with a user that is stored in the container is solely that of a user unless explicitly shared by the user. In some implementations, the containers may be configured to participate in a publish-and-subscribe network in order to share information. In addition, the containers may be provisioned with controls so that global operators may comply with local privacy rules.