Abstract: Techniques are described that detect areas with insufficient radio frequency (RF) coverage in a wireless network. A network management system (NMS) determines one or more service level expectation (SLE) metrics for each client device in a wireless network. The SLE metrics are aggregated to each access point (AP) in the wireless network, and each AP is assigned an AP score based on the aggregated SLE metrics. To identify potential coverage holes, the NMS groups APs having poor AP scores. If a root cause of the poor AP scores cannot be automatically resolved and if the poor AP scores persist for a predetermined period of time, the group of APs is determined to represent a true coverage hole. The NMS may generate a notification regarding recommended corrective actions to the customer and/or IT personnel.

Abstract: In some examples, an apparatus uses a blockchain to agree on a time in an information exchange network. A first node includes a processor communicatively coupled to a storage device including instructions. When executed by the processor, the instructions cause the processor to verify a time estimate from each of one or more other node, to determine a time match of a time estimate of the first node with the time estimates from the one or more other node, and if the time match is determined, to commit to the blockchain a transaction that includes a time stamp.

Abstract: A packet transmission method, implemented by a first network device includes determining a first master logical interface, where the first master logical interface is associated with a first virtual network identifier and a first sub-logical interface, and the first sub-logical interface is associated with a second virtual network identifier, and receiving an advertisement packet from a second network device through the first master logical interface, where the advertisement packet includes the first virtual network identifier, first internet protocol (IP) information associated with the first virtual network identifier, the second virtual network identifier, and second IP information associated with the second virtual network identifier.

Abstract: A system comprising: a first subsystem comprising at least one first processor, and a second subsystem comprising one or more second processors. A first program is arranged to run on the at least one first processor, the first program being configured to send data from the first subsystem to the second subsystem. A second program is arranged to run on the one more second processors, the second program being configured to operate on the data content from the first subsystem. The first program is configured to set a checkpoint at one or more points in time. At each checkpoint it records in memory of the first subsystem i) a program state of the second program, comprising a state of one or more registers on each of the second processors at the time of the checkpoint, and ii) a copy of the data content sent to the second subsystem since the respective checkpoint.

Abstract: Disclosed is a method, a device, a system and/or a manufacture of reducing project failure probability through generation, evaluation, and/or dependency structuring of a critical event object. In one embodiment, a system for building a failure dependency hierarchy includes an orchestration server and a network. The orchestration server initiates a session and provisions computing resources. An object generation routine receives a failure event criterion. An object initiation routine then generates a failure event object associated with the failure event criterion. A risk assessment routine generates a risk value by inputting a probability data and an impact data into a risk assessment function. A dependency routine stores in a referential attribute a unique identifier of a second failure event object to define a failure dependency. A user assignment routine associates the unique identifier of a user profile with the failure event object to assign responsibility for preventing the failure event.

Abstract: Managing an application's resource stack, including: detecting, in dependence upon one or more storage system metrics, an occurrence of a storage system performance anomaly; and responsive to detecting the storage system performance anomaly, identifying, in dependence upon codified relationships between one or more storage system metrics and one or more elements in the application stack that are external to the storage system, a root cause of the storage system performance anomaly.

Abstract: Methods and systems for a networked storage environment are provided. One method includes maintaining by a processor of a management console, a plurality of structured objects representing a plurality of resources in a networked storage system for storing and retrieving client data from a plurality of storage devices; receiving by the processor unstructured data from an application programming interface (API) associated with a resource of the networked storage system; parsing by the processor, the unstructured data and generating an identifier hash value based on uniquely identifying fields of the unstructured data for an unstructured object; and generating by the processor a logical index with a configuration index and a performance index for the unstructured object identified by the identifier hash value for responding to user requests for performance information regarding the unstructured object.

Abstract: The disclosed embodiments provide a system that automatically updates a customer-support ticket in an online customer-support system. When the customer-support ticket is created or updated, the system applies a set of triggers, which modify the ticket based on business rules, wherein each trigger performs actions that modify the ticket when conditions for parameters associated with the ticket are satisfied. When applying a trigger to the ticket, the system evaluates the conditions for the trigger by evaluating an associated condition graph, which is a directed graph comprised of condition nodes, wherein each condition node specifies conditions on parameters associated with the ticket. During this evaluation, if a valid path through the condition graph is discovered, which comprises a sequence of satisfied condition nodes from the root node to a null node, the system fires the trigger, which involves performing actions associated with the trigger to update the ticket.

Abstract: Embodiments of the present invention provide techniques, systems, and methods for crowdsourcing device recognition to collect device information and identification data from a limited number of network devices and then leverage the collected information with machine learning techniques to expand the starting set in way that the prediction of device attributes like device type, device brand, family and model can be applied on billions of devices.

Abstract: A method and system for correcting embedded device errors. The method may include receiving a first log generated by a first device though a first channel, receiving a second log generated by the first device that identifies a malfunction of the first device through a second channel, determining a corrective action to cause the first device to cease the malfunction, based at least in part on the second log and an inference model, and sending a message to a second device based at least in part on the corrective action.

Abstract: Techniques for implementing Byzantine fault tolerance with verifiable secret sharing at constant overhead are provided. In one set of embodiments, a client can determine a secret value s to be shared with N replicas in a distributed system, s being input data for a service operation provided by the N replicas. The client can further encode s into an f-degree polynomial P(x) where f corresponds to a maximum number of faulty replicas in the distributed system, evaluate P(x) at i for i=1 to N resulting in N evaluations P(i), generate at least one f-degree recovery polynomial R(x) based on a distributed pseudo-random function (DPRF) f?(x), and evaluate R(x) at i for i=1 to N resulting in at least N evaluations R(i). The client can then invoke the service operation, the invoking comprising transmitting a message including P(i) and R(i) to each respective replica i.

Abstract: A system includes a first aggregated networking device that is coupled to a second aggregated networking device via an inter-aggregated-networking-device link and that is configured to provide a first portion of a link aggregation to a connected device, The first aggregated networking device receives a first packet via a first aggregated port that is included in the first aggregated networking device and that provides the first portion of the link aggregation to the connected device. The first packet includes first information for synchronizing at least one process running in the first aggregated networking device with respective corresponding processes running in the second aggregated networking device. The first aggregated networking device copies, using a first network processing system, the first packet to provide a first copied packet and provides, using the first network processing system, the first copied packet to the second aggregated networking device via the inter-aggregated-networking-device link.

Abstract: Methods, systems, and computer-readable media for job execution with managed compute environments are disclosed. A specification of a managed compute environment comprises one or more constraints associated with computing resources in the managed compute environment. A queue or other data structure that is associated with the managed compute environment is monitored. The data structure is configured to store jobs. Data indicative of a job is detected in the data structure. One or more computing resources are reserved for the job from a pool of available computing resources. The one or more computing resources are selected for the job based at least in part on the one or more constraints associated with computing resources in the managed compute environment. Execution of the job using the one or more computing resources is initiated.

Abstract: Embodiments relate to an incident handling system for individual components of an overall software system. In particular, an engine receives error data information from a source of error information in a software component. That error information source may comprise a log entry, a formal error message, an exception, or a system crash. In response, the engine queries an underlying metadata description of the software system to receive a query result with additional metadata (e.g., unique artifact identifier, name) relevant to the error. Analysis of the error data and error metadata allows the engine to create an incident that is dispatched to an existing error tracking system, for support ticket creation and handling by the appropriate party. Adapter(s) allow the incident handling system to convert error data into generic form for search/analysis, and then to convert the incident information back into the specific format expected by the existing error tracking system.

Abstract: Described herein are systems and methods for communication in an IoT system. The systems and method utilize a single grammar to communicate data from controller to sensor and points in between. In one embodiment, the systems and method are utilized in a debug mode, where the grammar is in a human-readable format. In a further embodiment, the human-readable grammar is a markup language, composed of tags and metadata.

Abstract: A computer-implemented method according to one aspect includes determining whether an operating system of a node of a distributed computing environment is functioning correctly by sending a first management query to the node; in response to determining that the operating system of the node is not functioning correctly, determining whether the node has an active communication link by sending a second management query to ports associated with the node; and in response to determining that the node has an active communication link, resetting the active communication link for the node by sending a reset request to the ports associated with the node.

Abstract: An object of the present invention is to provide a redundant information processing system that can continue its operation without stopping as much as possible. To achieve this, the information processing system includes multiple storage nodes including processors, memories, and storage devices, as well as a network for connecting the storage nodes. The processor of at least one storage node performs the steps of: obtaining the configuration information of the information processing system; obtaining first failure information related to a first failure occurred in the information processing system; calculating the availability level of the information processing system when a second failure further occurs, based on the configuration information and the first failure information; and controlling the operation of the system based on the availability level. Then, the processor outputs a notification.

Abstract: Aspects of the subject disclosure may include, for example, monitoring network messages at a network edge of a service provider network, wherein the network edge is coupled via a network edge device to a local area network comprising a plurality of network-addressable (IoT) devices, wherein the network edge device is in communication with a service provider network via a transmission medium in which electromagnetic waves comprising the network messages propagate along the transmission medium without requiring an electrical return path. A network-addressable device of the plurality of network-addressable devices is detected to obtain a detected network-addressable device according to the monitoring of the network messages. Information obtained from the detected network-addressable device is evaluated to obtain an evaluation result and a listing of the plurality of network-addressable devices is updated based on the evaluation results. Other embodiments are disclosed.

Abstract: The present invention provides a technology for comprehensive verification of the safety of the design of functions, on the basis of a safety analysis result. The disclosed vehicle control system verification device is equipped with a storage device that stores programs for verifying the safety of the logical architecture of a vehicle control system, and a processor that reads the programs from the storage device and verifies the safety of the logical architecture. On the basis of safety analysis result information that is supplied, the processor executes a process for verifying whether the logical architecture has logical functions corresponding to the safety analysis result.

Abstract: A method for providing self-stabilization of functionality security and privacy to a distributed computer system with self-stabilizing machines, according to which the system periodically and constantly recovers from cyber-attacks performed by an adversary who gained access to the system during a vulnerability window. Then a True Random Number Generator (TRNG) generates a random number from which generating a pair of public and private keys are generated. The public key of the pair is distributed among neighboring machines, to generate a common symmetric secret key. Each machine to exchanges messages with any other machine using messages that are encrypted and decrypted by their established common symmetric secret key, where all keys are generated using random numbers that were generated by the True Random Number Generator.

Abstract: A method and system for intelligently resolving failures recurring in information technology (IT) environments. Specifically, the method and system disclosed herein may be directed to the resolution of persistently-occurring failures observed in data backup and/or data recovery operations. Further, resolution of any given persistently-occurring failure may entail the identification of zero, one, or more solutions (e.g., patches and/or other instructions) based on the analyses of failure-related information and host-related configuration information using machine learning and/or artificial intelligence paradigms. In cases where zero solutions are identified, the conventional and manual investigative route by way of support ticketing may be pursued.

Abstract: Techniques for performing peer discovery in a wireless network are described. A device may perform peer discovery to detect and identify other devices of interest. In an aspect, the device may perform peer discovery based on a hybrid mode that includes autonomous peer discovery and network-assisted peer discovery. In another aspect, the device may perform peer discovery based on a push mode and a pull mode. For the push mode, the device may occasionally transmit and/or receive a peer detection signal. For the pull mode, the device may transmit and/or receive a peer discovery request when triggered. In yet another aspect, the device may perform event-triggered peer discovery (e.g., for the pull mode). In yet another aspect, the device may perform peer discovery using both a downlink spectrum and an uplink spectrum. In yet another aspect, the device may transmit a peer detection signal in a manner to improve detection and/or increase payload.

Abstract: Example apparatus and methods for optimized route invalidation using modified no-path Destination Oriented Directed Acyclic Graph Advertisement Object (DAO) signaling are disclosed. In one example method, a node switching its current parent is adapted to send a regular DAO message. Using the changed signaling, a common ancestor node generates a No-Path destination oriented directed acyclic graph advertisement object message (NPDAO) on behalf of the switching node on receiving a refreshed DAO from an alternate path. The common ancestor node reuses a same Path Sequence from the regular DAO based on which the NPDAO gets generated. The common ancestor node detects routing anomaly using next hop mismatch on reception of the DAO to generate the NPDAO on behalf of the target node. The No-Path DAO traverses downward/downstream along the previous path.

Abstract: An apparatus and method for cyber risk quantification calculated from the likelihood of a cyber-attack on the target enterprise and/or cyber ecosystem based on its security posture. The cyber-attack likelihood can be derived as a probability-based time-to-event (TTE) measure using survivor function analysis. The likelihood probability measure can also be passed to cyber risk frameworks to determine financial impacts of the cyber-attacks. Embodiments of the present invention also relate to an apparatus and method (1) to identify and validate application attack surfaces and protect web applications against business logic-based attacks, sensitive data leakage and privilege escalation attacks; and/or (2) that protects web applications against business logic-based attacks, sensitive data leakage and privilege escalation attacks. This can include implementing an intelligent learning loop using artificial intelligence that creates an ontology-based knowledge base from application request and response sequences.

Abstract: Technologies for link capability estimation are disclosed. A compute device may determine a maximum radio bitrate for a certain connection, such as an LTE connection to a specific cell antenna. The compute device may also determine a maximum downlink bitrate for that connection, and store both the maximum radio bitrate and the maximum downlink bitrate in a database on the compute device. At a later time, an application of the compute device may want to know an estimate of the current maximum downlink bitrate, such as for the purpose of selecting a bitrate in streaming a video. The compute device can determine the current maximum radio bitrate, and look for similar entries in the database. Based on entries in the database, a link capability estimation can be determined and provided to the application.

Abstract: A wireless communication apparatus includes a communication unit configured to register another wireless communication apparatus and wirelessly communicate with the other wireless communication apparatus, an acquisition unit configured to acquire information indicating a type of the other wireless communication apparatus after the other wireless communication apparatus is registered, an output control unit configured to cause an output unit to output an alert based on the information indicating the type of the other wireless communication apparatus, the information being acquired by the acquisition unit, and a restriction unit configured to restrict an operation to be performed on the other wireless communication apparatus from the wireless communication apparatus in a case where a predetermined signal is not received after the output control unit has caused the output unit to output the alert.

Abstract: Automatic Dependent Surveillance Broadcast (ADS-B) is one of the most prominent air traffic surveillance technologies. It can be used not only as a complement in existing radar-based technologies to locate aircraft, but also as a replacement in areas without radar coverage. However, a major flaw in the deployment of this technology is it reliance on clear-text, open broadcast of messages, which makes it vulnerable to attackers. A solution to this vulnerability is ADS-Bsec, a holistic framework that solves the root cause of ADS-B problems by enforcing authenticity and integrity in ADS-B messages. This is accomplished without changing the message format and, along with a proper key exchange mechanism. The framework also leverages results from radio-location add risk-adaptive techniques in order to prevent attacks targeting ADS-B. ADS-Bsec is a promising framework for integrating ADS-B to NextGen infrastructure in a secure and affordable fashion.

Abstract: In an embodiment, the arrangement and method enable the accessing of certain stored information by utilizing algorithms. The validity of the algorithms and/or retrieved data are determined by a validity management module. If the algorithm and/or the retrieved data is determined by the validity management module to be invalid, the algorithm and/or the retrieved data may be updated, whereby self-correction occurs dynamically over time with changing stored information. In another embodiment, the arrangement and method enable networked computer systems each including a standardized database access system having hyper objects employing embedded algorithms or rules for accessing information across the network in a standardized manner, even though the networked computer system databases may employ different schema and formats. Each computer system operates independently, and yet is able to dynamically self-correct when invalid algorithms or data is determined.

Abstract: An information processing apparatus including: a processor configured to: receive halted virtual machine information that identifies a first virtual machine to be halted in a plurality of virtual machines that execute requests each being distributed to one of the plurality of virtual machines, receive, from a second virtual machine, specified session identification that identifies a specified session associated with a second request to be executed by the second virtual machine when the second virtual machine does not hold, specified session information taken over from a first request to the second request, the first request being associated with the specified session and having been executed specified one of the plurality of virtual machines other than the second virtual machine, request, when detecting the specified one of the plurality of the virtual machines is the first virtual machine, transmission of the specified session information held in the first virtual machine.

Abstract: A method for distributing non-transactional workload in the form of online analytical processing (OLAP) load across multiple database servers comprises receiving, at a scheduler server, a plurality of asynchronous work requests, adding, by the scheduler server, each of the received asynchronous work requests to a work list queue as a work item, and determining, by a scheduler module of the scheduler server, a first work item from the work list queue to select for performance by the first thread of the application server. In accordance with one or more preferred implementations, the first work item is selected utilizing a methodology which determines a number of work items in the work list queue having a processing status that are assigned to a database server, and based thereon determines whether an additional work request can be assigned to that database server without exceeding a request threshold for that database server.

Abstract: A network includes a first tier of servers, a second tier of servers and a third tier of servers. The first tier of servers comprises a plurality of primary servers capable of responding to requests. The plurality of primary servers includes at least one dynamic server having a load share characteristic that is dynamically altered during a first period in time and at least one static server having a constant load share characteristic during the first period in time. The second tier of servers includes at least two first layer overflow servers. Each of the first layer overflow servers is configured to provide response duties in the event that one or more of the primary servers is unavailable or overloaded. The third tier of servers comprising at least two second layer overflow servers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain and performed by a first node of N nodes in a view change protocol. The method includes: multicasting a view change message to at least some of the N nodes; obtaining, respectively from at least Q second nodes of the N nodes, at least Q echo messages each comprising: a consistent current view known to the second node indicating a primary node designated among the N nodes, and a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q echo messages, ending the view change protocol.

Abstract: Described are devices, systems and techniques for implementing atomic memory objects in a multi-writer, multi-reader setting. In an embodiment, the devices, systems and techniques use maximum distance separable (MDS) codes, and may be specifically designed to optimize a total storage cost for a given fault-tolerance requirement. Also described is an embodiment to handle the case where some of the servers can return erroneous coded elements during a read operation.

Abstract: Embodiments of this application provide a method performed at a computing device for dealing with an abnormality of an application program. The method includes: recording scene information obtained during operation of an application program; receiving abnormality indication information indicating that an abnormality occurs to the application program; in response, extracting, from the recorded scene information, corresponding scene information, where the application program is divided into a plurality of functional modules, each of the functional modules has a plurality of user interfaces (UI), each functional module having a respective unique tag and each US having a respective unique identifier ID, and the recorded scene information including a life cycle node of an operation page that exists during the operation of the application program, and a TAG and an ID corresponding to the operation page; and performing abnormality analysis according to the extracted scene information.

Abstract: This application discloses a node device operation method, a work status switching apparatus, a node device, and a medium, and relates to the field of network technologies. The method includes: receiving voting requests of a plurality of node devices, a quantity of the plurality of node devices being greater than half a quantity of node devices in a system; obtaining cycle length information and latest log indexes from the voting requests of the plurality of node devices if a current node device operates in a leader state; and switching a current work status from the leader state to a follower state or a candidate state if all the cycle length information in the voting requests of the plurality of node devices is greater than cycle length information of the current node device and all the latest log indexes in the voting requests of the plurality of node devices are not less than a latest log index of the current node device.

Abstract: Certain aspects of the present disclosure relate to user access to an application service that references user account information and previous user action information. One example method may include receiving, via a receiver device, user input information to access an application, the user input information including at least one action request and authorizing the user to access the application. The method may also include storing the user input information as part of a contextual history information record in a database memory, generating a response message to the selected at least one action request based on the contextual history information, and forwarding the response message to the user via a transmitter device.

Abstract: A dynamic approach to optimizing configuration of network parameters is presented. By gathering operational contexts and aggregating optimized network performance data against a baseline, a training data set may be generated. Client-side policies are determined, in part, by applying machine learning techniques on the training data set to achieve desired outcomes. Data delivery strategies are compiled at user devices to deliver content using the optimized network configuration values based on the operating contexts.

Abstract: A method includes identifying costs associated with different outcomes of a failure prediction algorithm. The algorithm is configured to predict one or more faults with at least one piece of industrial equipment. The different outcomes include both successful and unsuccessful predictions by the algorithm. The method also includes identifying a threshold value for the algorithm using the costs, where the threshold value is used by the failure prediction algorithm to identify whether maintenance of the at least one piece of industrial equipment is needed. The method further includes providing the threshold value to the algorithm. The threshold value is selected such that a net positive economic benefit is obtained from use of the threshold value with the failure prediction algorithm. In addition, the method can include generating a signal indicating whether maintenance is needed based on a comparison of an indicator value calculated using the algorithm and the threshold value.

Abstract: A method, apparatus and program storage device for scheduling the performance of maintenance tasks to maintain a system environment is disclosed. A parameter for a computer system is monitored to detect a need to perform at least one maintenance task. At least one maintenance task is performed when the monitoring detects the need to perform at least one maintenance task or at least once within a predetermined period.

Abstract: Examples described relate to identifying a potentially erroneous device in an IoT network. In an example, data from a device in an IoT network. The data may be analyzed against a classification of previous data from the plurality of devices, wherein the classification classifies the previous data as one of an erroneous data, a potentially erroneous data, or a normal data. If the data from the device represents the erroneous data, the device may be included in a set of potentially erroneous devices. A cluster of the device may be determined in a cluster classification. If the device belongs to the erroneous cluster in the cluster classification, associated devices in the erroneous cluster may be added to the set of potentially erroneous devices. If a threshold amount of devices in the set of potentially erroneous devices is higher than a pre-defined value, a notification may be generated.

Abstract: Techniques for implementing linear view-change with optimistic responsiveness in a BFT protocol running on a distributed system comprising n replicas are provided. According to one set of embodiments, the replicas can execute, during a view v of the BFT protocol, a first voting round comprising communicating instances of a first type of COMMIT certificate among the replicas. Further, when 2f+1 instances of the first type of COMMIT certificate associated with view v have been received by the replicas, the replicas can execute a second voting round comprising communicating instances of a second type of COMMIT certificate among the replicas. If 2f+1 instances of the second type of COMMIT certificate associated with view v are not received by the replicas within a predetermined timeout period, a view change can be initiated from view v to a view v+1.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain and performed by a first node of N nodes in a view change protocol. The method includes: multicasting a view change message to at least some of the N nodes; obtaining, respectively from at least Q second nodes of the N nodes, at least Q echo messages each comprising: a consistent current view known to the second node indicating a primary node designated among the N nodes, and a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q echo messages, ending the view change protocol.

Abstract: Techniques for implementing linear view-change in a Byzantine Fault Tolerant (BFT) protocol running on a distributed system comprising n replicas are provided. According to one set of embodiments, at a time of performing a view-change from a current view number v to a new view number v+1, a replica in the n replicas corresponding to a new proposer for new view number v+1 can generate a PREPARE message comprising a single COMMIT certificate, where the single COMMIT certificate is the highest COMMIT certificate the new proposer is aware of. The new proposer can then transmit the PREPARE message with the single COMMIT certificate to all other replicas in the n replicas.

Abstract: A computer implemented method for validating a device during installation to a software defined network (SDN). The method comprises receiving data associated with the device during installation thereof. Validating the device using the received data. Providing a master SDN controller for controlling the SDN network. Generating a co-controller by a master SDN controller containing device validation data. Dispatching the co-controller to the device during installation. Controlling installation of the device to the software defined network based on the device validation data.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain maintained by a number (N) of nodes and performed by a first node of the N nodes that is in a view change protocol. The method includes: obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, wherein the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q first messages, ending the view change protocol.

Abstract: A method for byzantine fault-tolerant replication of data on a plurality of n servers includes performing, by a primary node (PN), a prepare procedure that includes computing a prepare message including a unique identifier and multicasting the prepare message to the REPN. The method further includes performing, by the PN, a commit procedure that includes receiving, from each of a portion of the REPN, a prepare message reply signature part and aggregating each of the prepare message reply signature parts to generate a prepare message reply aggregated signature, checking the validity of the prepare message reply aggregated signature, and upon determining that the prepare message reply aggregated signature is valid, computing a commit message including the prepare message reply aggregated signature and multicasting the commit message to the REPN. The method further includes transmitting, to the client, the commit message reply aggregated signature.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain maintained by a number (N) of nodes and performed by a first node of the N nodes that is in a view change protocol. The method includes: obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, wherein the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q first messages, ending the view change protocol.

Abstract: Techniques for implementing Byzantine fault tolerance with verifiable secret sharing at constant overhead are provided. In one set of embodiments, a client can determine a secret value s to be shared with N replicas in a distributed system, s being input data for a service operation provided by the N replicas. The client can further encode s into an f-degree polynomial P(x) where f corresponds to a maximum number of faulty replicas in the distributed system, evaluate P(x) at i for i=1 to N resulting in N evaluations P(i), generate at least one f-degree recovery polynomial R(x) based on a distributed pseudo-random function (DPRF) f?(x), and evaluate R(x) at i for i=1 to N resulting in at least N evaluations R(i). The client can then invoke the service operation, the invoking comprising transmitting a message including P(i) and R(i) to each respective replica i.

Abstract: A system can include a processor configured to generate a query for a workflow results table, the query including query criteria to include records not having an associated child in the workflow results table and having a value indicating an unsuccessful status. The processor can be further configured to execute the query against the workflow results table to identify at least one activity record having a value indicating an unsuccessful status for the execution of at least one respective workflow activity. The processor can be further configured to generate a graph of workflow activity records between the at least one activity record and a root workflow activity record using context information associated with the workflow activity records. The processor can be further configured to determine an automated remedial action based on the graph of workflow activity records and to execute the remedial action.

Abstract: Various metrics as may be deployed in an active, passive, or hybrid validation architecture are disclosed. A computing device configured to monitor network game activity may identify an inconsistency between user game data and a particular game metric governing a particular aspect of the network gaming environment. Upon identification of an inconsistency between game data and a game metric, which may indicative of illicit game play, a validation process (e.g., active, passive, and/or hybrid) may be implemented to further confirm the existence of illicit game. Alternatively, an action to maintain integrity of the gaming community may be executed without further confirmation whereby a purportedly illicit game device may be ejected from the network.