Patent classifications
H04L67/1048
Systems and Methods for Feature Support Customization Based On Data Source Capability
Systems, methods, and techniques for supporting feature customization based on data source capability. A first request is received from an external entity to provision an instance of an application. An application service of a plurality of application services is identified to be implemented to fulfill the first request. A configuration of the application corresponding to the application service is determined. Customization information regarding states of a set of features of the application instance is obtained as a result of determining that a customization is associated with the external entity. A modified configuration is generated for the application based on the customization information and the configuration. An application instance is provisioned to the external entity over the one or more networks having the modified configuration.
Distributed dynamic architecture for error correction
Various systems and methods may be used to implement a software defined industrial system. For example, an orchestrated system of distributed nodes may run an application, including modules implemented on the distributed nodes. The orchestrated system may include an orchestration server, a first node executing a first module, and a second node executing a second module. In response to the second node failing, the second module may be redeployed to a replacement node (e.g., the first node or a different node). The replacement mode may be determined by the first node or another node, for example based on connections to or from the second node.
Data deduplication in blockchain platforms
A method for deduplicating a distributed ledger, a blockchain, and a computer program product. One embodiment may comprise splitting a new block on a distributed ledger into a plurality of partitions, comparing the plurality of partitions to a deduplication (dedup) map, replacing a first partition of the plurality of partitions with a first reference to the dedup map to produce a transformed block, and communicating the transformed block via a network interface to one or more peers.
Management of devices in a smart environment
A processor may analyze an external device for one or more activity data collection devices. A processor may identify an activity the external device will perform in a protected boundary using the one or more activity data collection devices. A processor may deactivate the one or more activity data collection devices associated with the external device. A processor may generate activity data based, at least in part, on the activity and the protected boundary. A processor may output the activity data to the external device. In some embodiments, the external device may perform the activity using the activity data.
Decommissioning, re-commissioning, and commissioning new metadata nodes in a working distributed data storage system
In a running distributed data storage system that actively processes I/Os, metadata nodes are commissioned and decommissioned without taking down the storage system and without introducing interruptions to metadata or payload data I/O. The inflow of reads and writes continues without interruption even while new metadata nodes are in the process of being added and/or removed and the strong consistency of the system is guaranteed. Commissioning and decommissioning nodes within the running system enables streamlined replacement of permanently failed nodes and advantageously enables the system to adapt elastically to workload changes. An illustrative distributed barrier logic (the “view change barrier”) controls a multi-state process that controls a coordinated step-wise progression of the metadata nodes from an old view to a new normal. Rules for I/O handling govern each state until the state machine loop has been traversed and the system reaches its new normal.
Methods and systems for privacy preserving inference generation in a distributed computing environment
Certain aspects of the present disclosure provide techniques for performing inferences in a distributed computing environment. An example method generally includes receiving a request to perform an inference with respect to a set of input data. One or more client devices are selected for use in performing the inference with respect to the set of input data. A request to perform the inference is transmitted to the selected one or more client devices. The request generally includes an anonymized, vectorized version of the set of input data such that the selected one or more client devices are to perform the inference based on anonymized data. An inference response is received from each of the selected one or more client devices. An aggregated inference response is generated based on the inference response received from each respective client device of the selected one or more client devices and a reputation score associated with the respective client device, and the aggregated inference response is output to a requesting service.
DISTRIBUTED DYNAMIC ARCHITECTURE FOR ERROR CORRECTION
Various systems and methods may be used to implement a software defined industrial system. For example, an orchestrated system of distributed nodes may run an application, including modules implemented on the distributed nodes. The orchestrated system may include an orchestration server, a first node executing a first module, and a second node executing a second module. In response to the second node failing, the second module may be redeployed to a replacement node (e.g., the first node or a different node). The replacement mode may be determined by the first node or another node, for example based on connections to or from the second node.
Method for changing member in distributed system and distributed system
A method for changing a member in a distributed system, includes requesting, by a first target node, a node address set from a management server, where the node address set includes first addresses of all nodes in the distributed system, sending, by the first target node, a join request to a master node in the distributed system when the node address set does not comprise a second address of the first target node, adding, by the master node, the second address to the node address set, and instructing all slave nodes in the distributed system to add the second address to a corresponding local member list.
Changing a master node in a wired local area network and related systems, methods, and devices
Various embodiments relate to a wired local area network (WLAN) including a shared transmission medium (e.g., a 10SPE network). A method may include detecting an event in a WLAN including physical level collision avoidance (PLCA). The method may also include disabling a beacon of a first node operating as a master of the WLAN in response to the event. Further, the method may include enabling a second node to operate as the master of the WLAN.
Minimizing the impact of malfunctioning peers on blockchain
A computer-implemented system and related method address malfunctioning peers in a blockchain, the method comprising receiving endorsement results from peers in the blockchain, where the endorsement results are for one or more transactions in the blockchain. The endorsement results include successful and failed endorsements. The method further comprises distributing the successful and failed endorsements to two or more endorsement collectors, determining which peers are successful endorsement peers (SEPs) that provided successful endorsements, and which peers are failed endorsement peers (FEPs) that provided failed endorsements. A reputation score is calculated for each peer based on endorsement information from the endorsement collectors. The reputation score is then sent to at least one of a client and a system administrator. This reputation score is then used to determine peer selection in a subsequent transaction.