Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

Abstract: A campaign server is disclosed which includes a multi-level queue architecture that isolates campaign processing from the delays and inconsistencies of target population information retrieval and a data streaming service system with latency and error remediation measures are disclosed, where the campaign server and the data consumption system can be part of a consolidated system. The data consumption system may include various components to process one or more offers to one or more customers and component configured to detect an error associated the preparation of the errors and/or ii) initiate a retry attempt to process the one or more offers, and and/or storing an instruction in a storage component of the streaming data system to permanently prohibit an attempt to generate the one or more offers at a subsequent time if the retry attempt expires without processing the one or more offers.

Abstract: A campaign server is disclosed which includes a multi-level queue architecture that isolates campaign processing from the delays and inconsistencies of target population information retrieval and a data streaming service system with latency and error remediation measures are disclosed, where the campaign server and the data consumption system can be part of a consolidated system. The data consumption system may include various components to process one or more offers to one or more customers and component configured to detect an error associated the preparation of the errors and/or ii) initiate a retry attempt to process the one or more offers, and/or storing an instruction in a storage component of the streaming data system to permanently prohibit an attempt to generate the one or more offers at a subsequent time if the retry attempt expires without processing the one or more offers.

Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

Abstract: A campaign server is disclosed which includes a multi-level queue architecture that isolates campaign processing from the delays and inconsistencies of target population information retrieval and a data streaming service system with latency and error remediation measures are disclosed, where the campaign server and the data consumption system can be part of a consolidated system. The data consumption system may include various components to process one or more offers to one or more customers and component configured to detect an error associated the preparation of the errors and/or ii) initiate a retry attempt to process the one or more offers, and and/or storing an instruction in a storage component of the streaming data system to permanently prohibit an attempt to generate the one or more offers at a subsequent time if the retry attempt expires without processing the one or more offers.

Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

Abstract: A campaign server is disclosed which includes a multi-level queue architecture that isolates campaign processing from the delays and inconsistencies of target population information retrieval. Each queue level may be intelligently controlled to provide backpressure in accordance with both processing demands of coupled messaging agents and available resources. Queues may be controlled to speed up or slow down customer information retrieval in accordance with the progress of campaign processing. Customer information is combined with campaign content by a set of messaging agents, each of which independently process a campaign for a target. Because messaging agents operate independently of each other, the potential for bottlenecks often encountered during campaign processing is removed. The set of messaging agents may be dynamically modified during operation to add or remove messaging agents in accordance with the processing needs of a campaign and the available resources of the campaign server.

Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.