# US 2017/0257280 A1 · Reliably Updating a Messaging System

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0257280 A1
- Document ID: US20170257280A1
- Status: Published application
- Kind: A1
- Application number: 15/598,641
- Filed: 2017-05-18
- Published: 2017-09-07
- Earliest claimed: 2015-01-29
- Assignees: BlackRock Institutional Trust Company, N.A.
- Applicants: BlackRock Institutional Trust Company, N.A.
- Inventors: Elliot Hamburger; Jonathan S. Harris; Jeffrey A. Litvin; Sauhard Sahi; John D. Valois; Ara Basil
- Web page: https://patentgrep.com/patent/US20170257280A1

## CPC

- H04L 51/23: Reliability checks, e.g. acknowledgments or fault reporting
- G06F 15/167: using a common memory, e.g. mailbox
- H04L 41/20: {Network management software packages}
- H04L 51/56: Unified messaging, e.g. interactions between e-mail, instant messaging or converged IP messaging [CPM]
- H04L 63/0442: {wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption (cryptographic mechanisms or cryptographic arrangements for public-key encryption H04L9/30)}
- H04L 67/1004: Server selection for load balancing
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A messaging system enables client applications to send and receive messages. The messaging system includes independent component programs performing different functions of the messaging system. The component programs include persistent connection managers that maintain connections with the client applications, a dispatcher that establishes connections, and a message router that sends received messages to recipient applications through corresponding connections. The connection managers share a state memory containing a received message and a completion state associated with the received message. The messaging system retains the message until the completion state fulfills a completion condition. The messaging systems supports live deployment of updates the message router and dispatcher because the state of the messaging system is stored independently from memory allocated to these component programs, so they may be restarted without loss of messages, connections or other state information.

## Claims

### Claim 1

A method of routing messages within a messaging system comprising component programs including a message router and a plurality of connection managers, the router and the connection managers connected via queues associated with each connection manager, the method comprising:
sending, from the first of the connection managers to the associated first queue, at least one message, one of the messages either including or followed by a round complete flag;
sending, from another of the connection managers to its associated queue, at least one message, one of the messages either including or followed by the round complete flag;
reading, at the message router, messages from the first queue until the round complete flag is read; and
responsive to reading the round complete flag from the first queue,
reading, at the message router, messages from a second queue associated with the other connection manager until the round complete flag is read; and
responsive to reading the round complete flag from the second queue, reading, at the message router, messages from yet another queue associated with yet another of the connection managers.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
reading a client message at the first connection manager from a client application that has a connection with the first connection manager;
responsive to the first queue being full, storing the client message in an internal queue associated with the first connection manager.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
responsive to the first queue having space available for new messages, forwarding a message in the internal queue to the first queue.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
responsive to the internal queue being full, reading one additional message from each client application having a connection with the first connection manager; and
adding the one additional message from each client application to the internal queue despite the additional messages putting the internal queue over capacity.

### Claim 5 (depends on 2)

The method of claim 2, wherein the internal queue is full, the method further comprising:
reading a dispatcher message at the first connection manager from a socket connection with the dispatcher; and
adding the dispatcher message to the internal queue regardless of whether the internal queue is full or over capacity.

### Claim 6 (depends on 2)

The method of claim 2, the method further comprising:
evaluating a size of the internal queue, the size comprising a count of client messages but not dispatcher messages in the internal queue; and
responsive to the size of the internal queue being less than a full capacity of the internal queue, reading messages from the client applications that have connections with the first connection manager.

### Claim 7 (depends on 1)

The method of claim 1, wherein the queues connecting each connection manager with the router are inter process communication (IPC) queues.

### Claim 8 (depends on 1)

The method of claim 1, wherein sending the at least one message by the first connection manager comprises:
reading one message from each of the client applications having a connection with the first connection manager until all of the connections have been read from or until the first queue is filled.

### Claim 9 (depends on 2)

The method of claim 2, wherein responsive to the first queue being filled, the method comprises:
adding, by the first connection manager, one or more remaining unread connections of the connections to a pending list;
checking, by the first connection manager, the first queue to infer whether the message router can process more messages; and
responsive to inferring that the message router can process more messages,
sending, from the first connection manager to the first queue, at least one additional message read from one of the remaining connections in the pending list until the pending list is emptied of remaining connections or until the first queue is filled again.

### Claim 10 (depends on 9)

The method of claim 9, wherein inferring whether the message router can process more messages comprises checking the first queue to determine at least one from the group consisting of whether the first queue is full, and how many messages are queued in the first queue.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
responsive to the pending list being empty of remaining connections, sending the round complete flag along with a last of the additional messages, or as a separate message after the last additional message.

### Claim 12 (depends on 11)

The method of claim 11, wherein responsive to the first queue being filled again, the method comprises:
resuming sending additional messages from the remaining connections in the pending list from the first connection manager to the first queue in subsequent select rounds until the pending list is emptied.

### Claim 13

A system, comprising:
one or more messaging servers comprising a set of component program modules, the component programs comprising:
a dispatcher, configured to, responsive to receiving a connection request from a client application, establish a network connection with the client application and transfer the connection;
a plurality of connection managers, configured to process and transfer messages between client applications, wherein a connection manager is communicatively coupled to a client application by the network connection transferred by the dispatcher, wherein the communication manager is communicatively coupled to the dispatcher by a separate connection;
a message router, configured to generate routing instructions used by the connection managers to direct messages sent between client applications, wherein the message router is communicatively coupled to the dispatcher by a socket connection, wherein the message router is connected to each of the plurality of connection managers through a plurality of messaging queues; and
a state store, configured to store information about states of connections as well as routing states of the messages and delivery states of the messages, wherein the state store is independent from memory allocated to the component program modules, wherein the state store is communicatively coupled to each of the component program modules by memory connections between each of the component program modules and the state store.

### Claim 14 (depends on 13)

The system of claim 13, wherein the dispatcher is coupled to the connection manager by a first transport-layer network and the connection manager is coupled to the client application by a second transport-layer network.

### Claim 15 (depends on 13)

The system of claim 13, wherein the dispatcher is communicatively coupled to the connection manager using a plurality of IPC socket connections.

### Claim 16 (depends on 13)

The system of claim 13, wherein each messaging queue has a first in, first out queue.

### Claim 17 (depends on 13)

The system of claim 13, wherein the dispatcher is configured to select the connection manager according to a load balancing mechanism.

### Claim 18 (depends on 13)

The system of claim 13, wherein the connection manager is configured to notify the message router of a received message by forwarding a reference to the message to its associated messaging queue.

### Claim 19 (depends on 18)

The system of claim 18, wherein the reference to the message includes at least one of a message handle and a message header.

### Claim 20 (depends on 13)

The system of claim 13, wherein the state store contains a table of connection states describing the network connections.
