# US 8,788,565 B2 · Dynamic and distributed queueing and processing system

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

- Number: US 8,788,565 B2
- Document ID: US8788565B2
- Status: Granted
- Kind: B2
- Application number: 11/482,481
- Filed: 2006-07-06
- Published: 2007-01-18
- Granted: 2014-07-22
- Earliest claimed: 2005-07-18
- Applicants: Wayne Bevan
- Inventors: Wayne Bevan
- Web page: https://patentgrep.com/patent/US8788565B2

## CPC

- G06F 3/1214: {at the submitting node}
- G06F 3/126: {Job scheduling, e.g. queuing, determine appropriate device}
- G06F 3/1288: {in client-server-printer device configuration}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A data processing network for processing work items according to a business process has one or more processing boundaries having connection to a data transfer network, one or more communication brokers distributed among and executable on the one or more processing boundaries, and a plurality of electronic queues distributed among the one or more processing boundaries, the queues managed by the one or more communications brokers.

## Claims

### Claim 1

A method for configuring and deploying a pre-defined queue network comprising the acts of:
(a) using an object modeling tool executing from a non-transitory machine-readable medium on a first computing appliance, selecting a set of queues for the queue network from a larger set of pre-programmed queues and instantiating the queue network by creating flow paths between the queues, the queues comprising programmed processes for moving defined work objects sequentially from queue input to queue output, and the flow paths comprising software mechanisms for moving defined work objects from queue output of one queue to queue input of another;
(b) deploying the queue network defined in step (a) to individual ones of a plurality of processing nodes, each processing node comprising a processing unit and coupled data storage, the processor nodes connected to the first computing appliance by a digital network.

### Claim 2 (depends on 1)

The method of claim 1, wherein in act (a), the object modeling tool is a GUI and the specified queues include, but are not limited to, one or more conduit queues, one or more workflow queues, and one or more user queues and external application integration instances to enable external access to those queues.

### Claim 3 (depends on 1)

The method of claim 1 wherein in act (a), creating flow paths includes identifying basic queues, super queues and all of the allowable flow paths for work objects between the queues in the network.

### Claim 4 (depends on 3)

The method of claim 3 wherein basic queues are used to form the basis of all other defined queues used in a queue network, and super queues are enhanced versions of basic queues.

### Claim 5 (depends on 4)

The method of claim 4 wherein basic queues and super queues are elements that couple conduit, workflow and user queues together to form a queue network.

### Claim 6 (depends on 1)

The method of claim 1, wherein in act (b), each of the processing boundaries host one or more instances of a communications broker.

### Claim 7 (depends on 6)

The method of claim 6 wherein the totality of communications brokers within a topology coordinates and orchestrates interactions with external systems.

### Claim 8 (depends on 1)

The method of claim 1 wherein in act (b), the digital network by which the plurality of processing boundaries are interconnected is the Internet network, an Ethernet network, a municipal area network (MAN), a corporate or private wide area network (WAN), or a combination of these and any sub-networks.