Chicago Mercantile Exchange Inc.

Priteshkumar Soni

Pearce Peck-Walden

Melissa Ann Jenner

Rosa Frenkel

Arkadiusz Koziol

José Antonio Acuña-Rohter

Paul J Callaway

Dennis M Genetski

Sebastian Demian

Fritz Caskey

Andy Ross

Madhur Sirohi

Baris Mestanogullari

Dileep Chakravarthi Konduru

Fred Malabre

Satya Kamineni

Matthew Coffey

Sandeep Sreekumar

Nagesh Reddy

Ari L Studnitzer

Zachary Bonig

Frank Kmiec

Jacques Doornebos

Jose Antonio Acuna-Rohter

Donald Mendelson

A system/process provides fault tolerance to an integrated component system which integrates core components of a transaction processing system into a single processing platform, i.e., a single server, enabling elimination of the network interconnects and associated latencies introduced thereby in favor of much faster interconnects, such as inter-process communication and shared memory communication messaging, where a failure of any one component necessitates failing over the entire system to a backup thereof.

Fault tolerant architecture

Failure recovery in a fault tolerant architecture

A system and method for processing electronic data messages mitigate the transmission of one or more electronic messages including a sequence of data as a plurality of packets characterized by a sequence therebetween corresponding to the sequence of the data of the electronic message, each packet including data indicative of the sequence of that packet relative to the others of the plurality of packets, to a receiving system, prior to the sender determining that the message(s) is/are desired, alone or in conjunction with subsequently canceling or otherwise invalidating the message(s). The system and method mitigate such behavior by adding a timestamp when the packets are received, detecting if at least one of the received augmented packets of the electronic data message was received by the network interface in an order different from the sequence between the plurality of packets, and taking an action with respect to the electronic data message.

Secure message processing protocol

The disclosed embodiments relate generally to efficient data encoding and transmission. An encoding system determines an encoding interval at which to encode different groups of related data in a data structure. The encoding interval for each group encoded together optimizes the amount of newly received information that is encoded and transmitted in a continuous, repeating loop.

Optimization of encoding cycles for object recovery feed

The disclosed embodiments relate to communication of messages from a database to participants whereby messages, or at least a portion of the content thereof, indicative of changes in the database, due to one or more transactions between two or more participants, are structured so as to reduce redundant data therein and prioritize the transmission of that portion of the message which summarizes the event and result thereof. Further, these event reporting messages may further consolidate, or otherwise be combined with, the corresponding directed reporting messages communicated to the particular participants participating in the reported transaction while preserving the anonymity of those participants to which messages are particularly directed.

Exchange feed for trade reporting having reduced redundancy

A computer implemented method for storing and retrieving data elements in a computer memory comprises configuring, by a processor, the computer memory according to a data structure, the data structure including: a data element array including a plurality of sorted data elements, each data element associated with a position in the data element array; and a cluster element array including one or more cluster elements, each cluster element defined by one of one data element from the data element array or a plurality of continuous data elements from the data element array, wherein each cluster element is associated with a cluster code for determining the position of one or more data elements in the data element array, the cluster code correlating each data element defining the cluster element with the position of the data element in the data element array.

Optimized data structure

Disclosed are a system and method, also referred to herein as an architecture, for efficiently communicating a high volume of data from a server over an electronic communications network to geographically disperse recipients, where one or more of those recipients may receive a customized version of that data, e.g., content, timing and/or form. As the data is generated, timing information and/or changes to information regarding customizations is incorporated forming a data stream which is communicated to local data publishers ('LDP's'). Upon receipt, the LDP's extract the data, customization, or timing information and act accordingly when transmitting the received data to the recipients. Customization is applied to update local control databases which specify the customizations for subsequently received data before transmission. By acting on the messages in real time, e.g., as they are received, the LDP's, even if they don't receive the messages at the same time, then perform the same functions in the same relative order relative to the data stream.

Data distribution architecture

The disclosed embodiments relate generally to efficient data transmission and receipt. Specifically, the disclosed embodiments provide systems and methods for selectively combining multiple, disparate message types and transmitting same via one data feed. A consolidation system determines whether data resulting from an event can be combined or merged based on pre-determined message characteristics and state or environment information or should be sent via two separate feeds. The merged message may be backwards-compatible so that data recipient computing systems can easily and selectively decide which portion of the merged data is relevant to the data recipient computing system, only read the relevant portions. Thus, multiple data receivers, which typically consume different message types, can receive and consume the same merged or consolidated message.

Systems and methods for consolidating multiple feed data

Disclosed are a system and method, also referred to herein as an architecture, for efficiently communicating a high volume of data from a server over an electronic communications network to geographically disperse recipients, where one or more of those recipients may receive a customized version of that data, e.g., content, timing and/or form. As the data is generated, timing information and/or changes to information regarding customizations is incorporated forming a data stream which is communicated to local data publishers ('LDP's'). Upon receipt, the LDP' s extract the data, customization, or timing information and act accordingly when transmitting the received data to the recipients. Customization is applied to update local control databases which specify the customizations for subsequently received data before transmission. By acting on the messages in real time, e.g., as they are received, the LDP's, even if they don't receive the messages at the same time, then perform the same functions in the same relative order relative to the data stream.

Growing community of inventors

Naperville, IL, United States of America

Priteshkumar Soni