Method of transferring funds employing a three-node real-time electronic interlock

• US 5,884,290 A
• Filed: 10/22/1996
• Issued: 03/16/1999
• Est. Priority Date: 10/22/1996
• Status: Expired due to Term

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: McSweeney, Joseph Craig, Smorodinsky, Lev, Thompson, James Walter
• Primary Examiner(s): MacDonald, Allen R.
• Assistant Examiner(s): Irshadullah, M.
• Application Number:
  US08/735,145
• Time in Patent Office: 875 Days
• Field of Search: 705/39, 705/40, 705/44, 705/45, 235/379, 380/24, 379/91.01
• US Class Current: 705/44
• CPC Class Codes: G06Q 20/04 Payment circuits
• CPC Class Codes: G06Q 20/042 characterized in that the payment protocol involves at least one cheque
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/102 Bill distribution or payments
• CPC Class Codes: G06Q 20/382 insuring higher security of transaction
• CPC Class Codes: G06Q 20/40 Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
• CPC Class Codes: G06Q 20/401 Transaction verification
• CPC Class Codes: G06Q 20/403 Solvency checks
• CPC Class Codes: G06Q 40/02 Banking, e.g. interest calculation or account maintenance credit or loans G06Q40/03

Abstract

A method of transferring funds electronically, is performed by a group of N computers X(1) thru X(N) which are intercoupled to each other, and to another computer Y, by a communication channel. Each computer of the group includes multiple customer accounts, and the computer Y includes a net account for each computer of the group. To initiate the transfer of funds between two customer accounts, a customer sends an input request to one of computers X(i) of the group; and this input request specifies that funds F(z) be transferred in a particular direction between a customer account A(r) in computer X(i) and a customer account A(s) in another computer X(j) of the group. For each input request that is received by computer X(i), a respective sequence of electronic control messages is sent on the communication channel among the computers X(i), X(j) and Y. By this sequence of control messages, computer X(i) tests the status of customer account A(r); computer X(j) tests the status of customer account A(s); and computer Y tests the status of the net accounts for computers X(i) and X(j). If all of the tests by the computers X(i) and x(j) are satisfied, then those computers both authorize computer Y to transfer the funds F(z) between the net accounts for computers X(i) and X(j); and if all of the tests by computer Y are satisfied, then computer Y authorizes the computers X(i) and X(j) to transfer the funds F(z) between the customer accounts A(r) and A(s). This authorization from all three computers eliminates the need to reverse a transfer of funds; and consequently, the transferred funds are available for withdrawal immediately after the sequence of messages is completed successfully.

Claims

1. A method, for use with a group of N computers X(1) thru X(N) which are intercoupled to each other, and to another computer Y, by a communication channel;

each computer of said group including multiple customer accounts, and said computer Y including a net account for each computer of said group;

said method operating to exchange funds electronically among said customer accounts, and including the steps of;

receiving electronic input requests in said computers X(1) thru X(N), with each input request that is received in computer X(i) specifying that funds F(z) be transferred in a particular direction between a customer account A(r) in computer X(i) and a customer account A(s) in computer X(j)--where indices i and j, r and s, and z respectively identify particular computers, accounts, and funds;

sending on said communication channel, for each input request received by computer X(i), a respective sequence of electronic control messages by which computers X(i) and X(j) both authorize computer Y to transfer funds F(z) between the net accounts for computers X(i) and X(j), and subsequently, computer Y authorizes computers X(i) and X(j) to transfer funds F(z) between the customer accounts A(r) and A(s) respectively; and

,

transfering said funds F(z) in accounts A(r) and A(s) only after authorization from computer Y is received by computers X(i) and X(j).

2. A method according to claim 1 wherein each sequence of electronic control messages includes a first control message from computer X(i) to computer X(j) which requests that said funds F(z) be transferred in said particular direction between said accounts A(r) and A(s), and a second control message from computer X(j) to computer X(i) which indicates whether the requested funds transfer is accepted or rejected by computer X(j).

3. A method according to claim 2 wherein said second control message indicates that the requested funds transfer is rejected regardless of said particular direction if said account A(s) in computer X(j) has been closed or does not exist.

4. A method according to claim 2 wherein said second control message indicates that the requested funds transfer is rejected if said particular direction is from account A(s) in computer X(j) to account A(r) in computer X(i) and account A(s) has insufficient funds.

5. A method according to claim 2 wherein in response to an acceptance in said second control message, said sequence of electronic control messages further includes a third control message from computer X(i) to said computer Y, which requests that funds F(z) be transferred in said particular direction between the net accounts for computers X(i) and X(j), and a fourth control message that is from said computer Y to at least one of said computers X(i) and X(s), which indicates that said funds F(z) have been transferred between said net accounts for computers X(i) and X(j).

6. A method according to claim 5 wherein in response to said fourth control message, computers X(i) and X(j) transfer said funds F(z) between said accounts A(r) and A(s).

7. A method according to claim 5 wherein prior to sending said fourth control message, computer Y stores a record which verifies that a transfer of said funds F(z) in said particular direction between accounts A(r) in computer X(i) and account A(s) in computer X(j) was authorized by computers X(i) and X(j) via X(i).

8. A method according to claim 1 wherein each sequence of electronic control messages includes a first control message from computer X(i) to computer X(j) which requests that said funds F(z) be transferred in said particular direction between said accounts A(r) and A(s), and a second control message from computer X(j) to computer Y or computer X(i) which indicates respectively that the requested funds transfer is accepted or rejected by computer X(j).

9. A method according to claim 8 wherein said second control message is to computer X(i) and indicates that the requested funds transfer is rejected regardless of said particular direction if said account A(s) in computer X(j) has been closed or does not exist.

10. A method according to claim 8 wherein said second control message is to computer X(i) and indicates that the requested funds transfer is rejected if said particular direction is from account A(s) in computer X(j) to account A(r) in computer X(i) and account A(s) has insufficient funds.

11. A method according to claim 8 wherein in response to an acceptance in said second control message to computer Y, said sequence of electronic control messages further includes a third control message that is from said computer Y to at least one of said computers X(i) and X(j), which indicates that said funds F(z) have been transferred between said net accounts for computers X(i) and X(j).

12. A method according to claim 11 wherein in response to said third control message, computers X(i) and X(j) transfer said funds F(z) between said accounts A(r) and A(s).

13. A method according to claim 11 wherein prior to sending said third control message, computer Y stores a record which verifies that a transfer of said funds F(z) in said particular direction between accounts A(r) in computer X(i) and account A(s) in computer X(j) was authorized by computers X(j) and X(i) via X(j).

14. A method according to claim 1 wherein each sequence of electronic control messages includes a first control message from computer X(i) to computer X(j) which requests that said funds F(z) be transferred in said particular direction between said accounts A(r) and A(s), a second control message from computer X(j) to computer X(i) which indicates whether the requested funds transfer is accepted or rejected by computer X(j), and a third control message from computer X(j) to computer Y if the requested funds transfer is accepted by computer X(j).

15. A method according to claim 14 wherein said second control message indicates that the requested funds transfer is rejected regardless of said particular direction if said account A(s) in computer X(j) has been closed or does not exist.

16. A method according to claim 14 wherein said second control message indicates that the requested funds transfer is rejected if said particular direction is from account A(s) in computer X(j) to account A(r) in computer X(i) and account A(s) has insufficient funds.

17. A method according to claim 14 wherein in response to an acceptance in said second control message, said sequence of electronic control messages further includes a fourth control message from computer X(i) to said computer Y, which requests that funds F(z) be transferred in said particular direction between the net accounts for computers X(i) and X(j), and a fifth control message from said computer Y to at least one of said computers X(i) and X(j), which indicates that in response to said third and fourth control messages, said funds F(z) have been transferred between said net accounts for computers X(i) and X(j).

18. A method according to claim 17 wherein in response to said fifth control message, computers X(i) and X(j) transfer said funds F(z) between said accounts A(r) and A(s).

19. A method according to claim 17 wherein prior to sending said fifth control message, computer Y stores a record which verifies that a transfer of said funds F(z) in said particular direction between accounts A(r) in computer X(i) and account A(s) in computer X(j) was authorized by computers directly by X(i) and X(j).

20. A method according to claim 1 wherein in each computer X(i), hundreds of said input requests are received;

and in response thereto, a corresponding number of said control message sequences occur on said communication channel, before said settling step is performed.

21. A method according to claim 1 wherein before said settling step, one subset of said control message sequences add funds to a particular customer account and another subset of said control message sequences subtract funds to that said particular account.

22. A method according to claim 1 wherein said settling step is performed at a rate of less than once every hour whereas each sequence of control messages occurs in less than five minutes.

23. A method according to claim 1 wherein said particular direction is selectable, by each input request, to be from account A(r) to account A(s) or vice-versa.

24. A method according to claim 1 wherein said particular direction is predetermined to be from account A(s) to account A(r).

25. A method according to claim 1 wherein said particular direction is predetermined to be from account A(r) to account A(s).