Architecture for anonymous trading system
First Claim
Patent Images
1. A computer trading system for trading fungible instruments, comprising:
- a communication network for transmitting deal related information messages comprising deal related information;
a plurality of order input devices connected to the network for generating price quotation messages comprising orders; and
a plurality of nodes connected to the network in a distributed arrangement and arranged to distribute deal information messages throughout the network, message distribution between nodes being via canonical paths between nodes, where a canonical path is the optimal route between a pair of nodes and wherein;
i. A canonical path between two given nodes is commutative;
ii. Where a canonical path between two given nodes includes one or more further nodes, the canonical path between the further nodes and each of the given nodes is the same as the sub-path between the given node and the further node that forms part of the canonical path between the given nodes; and
iii. The canonical path between each node and itself is empty.
11 Assignments
0 Petitions
Accused Products
Abstract
An anonymous trading system comprises a network of broker nodes, each of which have an equal status and can match orders, initiate deals and distribute prices. Trading agents are connected to some or all of the broker nodes. The network is arranged to conform to a series of rules and in a preferred embodiment the brokers are arranged as a clique tree.
66 Citations
29 Claims
-
1. A computer trading system for trading fungible instruments, comprising:
-
a communication network for transmitting deal related information messages comprising deal related information; a plurality of order input devices connected to the network for generating price quotation messages comprising orders; and a plurality of nodes connected to the network in a distributed arrangement and arranged to distribute deal information messages throughout the network, message distribution between nodes being via canonical paths between nodes, where a canonical path is the optimal route between a pair of nodes and wherein; i. A canonical path between two given nodes is commutative; ii. Where a canonical path between two given nodes includes one or more further nodes, the canonical path between the further nodes and each of the given nodes is the same as the sub-path between the given node and the further node that forms part of the canonical path between the given nodes; and iii. The canonical path between each node and itself is empty. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29)
-
Specification