METHOD AND APPARATUS FOR CURRENCY EXCHANGE

• US 20090037324A1
• Filed: 08/02/2007
• Published: 02/05/2009
• Est. Priority Date: 08/02/2007
• Status: Abandoned Application

• Current Assignee: Pendle House Limited
• Original Assignee: Jemstone Technologies Limited
• Inventors: Furey, Michael, McLAUGHLIN, BRENDAN
• Application Number:
  US11/833,095
• Publication Number:
  US 20090037324A1
• Time in Patent Office: Days
• US Class Current: 705/39
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 30/08 Auctions

Abstract

A method for exchanging funds between currencies. The method comprises receiving a plurality of requests to exchange funds from one currency to another currency, the plurality of requests comprising a first request to exchange first funds of a first party in a first currency for funds in a second currency, and a second request to exchange second funds of a second party in said second currency for funds in said first currency. The plurality of requests are stored in a queue. A request is selected for processing from said queue based upon queue processing data, wherein the selected request is the first request. Data indicating a match between said first and second requests is generated. At least part of said first funds of said first currency is transferred directly from said first party to said second party. At least part of said second funds of said second currency is transferred directly from said second party to said first party.

Claims

1. A method for exchanging funds between currencies, the method comprising:

receiving a plurality of requests to exchange funds from one currency to another currency, the plurality of requests comprising a first request to exchange first funds of a first party in a first currency for funds in a second currency, and a second request to exchange second funds of a second party in said second currency for funds in said first currency;

storing said plurality of requests in a queue;

selecting a request for processing from said queue based upon queue processing data, wherein said selected request is said first request;

generating data indicating a match between said first and second requests;

transferring at least part of said first funds of said first currency directly from said first party to said second party; and

transferring at least part of said second funds of said second currency directly from said second party to said first party.

2. A method according to claim 1, wherein said queue processing data is arranged to cause selection of a request at a head of the queue.

3. A method according to claim 1, wherein said queue comprises a first in first out queue.

4. A method according to claim 1, further comprising:

ordering said requests in said queue based upon said requests;

5. A method according to claim 4, wherein said ordering is based upon a time at which said requests are made by respective users and/or a time at which said requests are received.

6. A method according to claim 4, wherein at least some of said requests comprise priority data, and said ordering is based upon said priority data.

7. A method according to claim 6, wherein said priority data for a request is at least partially based upon a user making the request.

8. A method according to claim 6, wherein said priority data for a request is at least partially based upon a geographic location of a user making the request.

9. A method according to claim 6, wherein said priority data for a request is at least partially based upon a value of said request.

10. A method according to claim 1, wherein said queue is a plurality of queues, the method comprising:

storing said plurality of requests in a primary queue; and

moving each of said requests to one of a plurality of second queues based upon data associated with a particular request.

11. A method according to claim 10, further comprising selecting one of said second queues to which a request should be moved based upon a source currency of said request.

12. A method according to claim 10, further comprising selecting one of said second queues to which a request should be moved based upon a destination currency of said request.

13. A method according to claim 10, wherein said plurality of second queues comprise a first relatively high priority queue and a second relatively low priority queue, and the method further comprises selecting one of said second queues to which a request should be moved based upon a priority of said request.

14. A method according to claim 1, wherein said queue is a plurality of queues, comprising a plurality of first queues and a plurality of second queues, and storing said requests in said queue comprises, for a particular request:

selecting one of said first queues in which said particular request should be stored;

processing said requests in each of said first queues to determine a second queue into which requests in said first queues should be transferred.

15. A method according to claim 14, wherein said first queue is selected based upon a source currency of the particular request.

16. A method according to claim 14, wherein said second queue is selected based upon a destination currency of the particular request.

17. A method according to claim 1, wherein said first request specifies a first amount in said first currency and said second request specifies a second amount in said second currency.

18. A method according to claim 17, further comprising:

processing said plurality of requests to determine a match between at least two requests.

19. A method according to claim 18, wherein said at least two requests comprise said first request and said second request.

20. A method according to claim 18, wherein processing said plurality of requests of requests to determine a match comprises determining:

(i) whether a source currency of a third request is a destination currency of a fourth request; and

(ii) whether a source currency of the fourth request is a destination currency of the third request.

and a match is determined if but only if conditions (i) and (ii) are satisfied.

21. A method according to claim 20, wherein said third and fourth requests specify corresponding amounts.

22. A method according to claim 21, wherein said corresponding amounts are specified in different currencies with reference to an exchange rate.

23. A method according to claim 18, wherein a third request is matched with a plurality of fourth requests.

24. A method according to claim 23 wherein said third request specifies an amount corresponding to an amount of said plurality of fourth requests.

25. A method according to claim 24, wherein said correspondence is defined with reference to an exchange rate.

26. A method according to claim 1, wherein said method is carried out by a server connected to a computer network.

27. A method according to claim 26, wherein said requests are transmitted to said server over said computer network.

28. A method according to claim 27, wherein said requests are generated by a plurality of user terminals connected to said computer network.

29. A computer program configured to cause a computer to carry out a method for exchanging funds between currencies, the method comprising:

receiving a plurality of requests to exchange funds from one currency to another currency, the plurality of requests comprising a first request to exchange first funds of a first party in a first currency for funds in a second currency, and a second request to exchange second funds of a second party in said second currency for funds in said first currency;

storing said plurality of requests in a queue;

selecting a request for processing from said queue based upon queue processing data, wherein said selected request is said first request;

generating data indicating a match between said first and second requests;

transferring at least part of said first funds of said first currency directly from said first party to said second party; and

transferring at least part of said second funds of said second currency directly from said second party to said first party.

30. A computer readable medium carrying a computer program according to claim 29.

31. A computer apparatus for exchanging funds between currencies, the apparatus comprising:

a program memory storing processor readable instructions; and

a processor configured to read and execute instructions stored in said program memory;

wherein said processor readable instructions comprise instructions controlling the processor to carry out a method for exchanging funds between currencies, the method comprising;

receiving a plurality of requests to exchange funds from one currency to another currency, the plurality of requests comprising a first request to exchange first funds of a first party in a first currency for funds in a second currency, and a second request to exchange second funds of a second party in said second currency for funds in said first currency;

storing said plurality of requests in a queue;

selecting a request for processing from said queue based upon queue processing data, wherein said selected request is said first request;

generating data indicating a match between said first and second requests;

transferring at least part of said first funds of said first currency directly from said first party to said second party; and

transferring at least part of said second funds of said second currency directly from said second party to said first party.

32. A computer apparatus according to claim 31, wherein said apparatus is a server computer connected to a computer network.

33. A computer apparatus according to claim 32, wherein a plurality of user terminals are coupled to said computer network.

34. A computer apparatus according to claim 33, wherein the plurality of user terminals provide said requests to said server computer.