Electronic Financial Transaction Routing

• US 20090070246A1
• Filed: 09/10/2007
• Published: 03/12/2009
• Est. Priority Date: 09/10/2007
• Status: Abandoned Application

• Current Assignee: First Data Corporation (Fiserv Incorporated)
• Original Assignee: First Data Corporation (Fiserv Incorporated)
• Inventors: Tieken, Craig A.
• Application Number:
  US11/852,408
• Publication Number:
  US 20090070246A1
• Time in Patent Office: Days
• US Class Current: 705/35
• CPC Class Codes: G06Q 20/04 Payment circuits
• 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/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/405 Establishing or using transaction specific rules
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes
• CPC Class Codes: G07F 19/00 Complete banking systems; Coded card-freed arrangements adapted for dispensing or receiving monies or the like and posting such transactions to existing accounts, e.g. automatic teller machines data processing equipment for bank accounting G06Q40/02

Abstract

Methods and systems for determining a network for settling an electronic transaction at a financial transaction processor is disclosed according to embodiments of the invention. Certain embodiments include receiving a transaction from a merchant. The transaction may includes a bank identification number (BIN) and a geographical state identifier associated the merchant. From the BIN number, the processor can determine if one or more network flags are asserted for the BIN in the network file. If a single network flag is asserted then routing the transaction through a network associated with the network flag. For example, if a state network flag is asserted then routing the transaction through the state associated with the transaction. If a network priority flag is asserted, routing the transaction through associated network. If an issuer priority flag is asserted, routing the transaction through the network associated with the issuer.

Claims

1. A method for determining a network for settling an electronic transaction at a financial transaction processor, the method comprising:

receiving a transaction from a merchant, wherein the transaction includes a bank identification number (BIN) and a geographical state identifier associated the merchant;

determining if one or more network flags are asserted in a BIN network file;

if a single network flag is asserted, routing the transaction through a network associated with the network flag;

if a plurality of network flags are asserted, routing the transaction through the least cost network of the networks associated with the plurality of network flags; and

if no network flags are asserted, routing the transaction through the least cost network.

2. The method according to claim 1, further comprising determining if the geographical state identifier identifies a state requiring state prioritization and routing the transaction through the geographical state network if the geographical state does require state prioritization.

3. The method according to claim 2, wherein a state require state prioritization is selected from the list consisting of Puerto Rico, Nebraska, Iowa and Alaska.

4. A method for determining a network for settling an electronic transaction at a financial transaction processor, the method comprising:

determining whether the network BIN table includes one or more priority flags asserted for networks in relation to the BIN, wherein if more than one network is flagged as priority, routing the electronic transaction through the least cost of the more than one networks, otherwise, routing the transaction through the single priority flagged network; and

determining whether the network BIN table includes one or more valid-flags asserted for networks in relation to the BIN, wherein if more than one network is flagged as valid, routing the electronic transaction through the least cost of the more than one networks, otherwise, routing the transaction through the single valid-flagged network.

5. The method according to claim 4, further comprising determining if the geographical state is a state requiring state prioritization and routing the transaction through the geographical state network if the geographical state does require state prioritization.

6. The method according to claim 4, further comprising determining whether the NYCE network is flagged as valid or priority in a network BIN table for a BIN associated with the electronic transaction, and, if so, routing the transaction through the NYCE network.

7. A computer system for routing a electronic financial transactions comprising:

a network interface;

a processor; and

a memory, wherein the memory comprises;

at least one network BIN table;

instructions to receive an electronic financial transaction from a merchant through the network interface;

instructions to lookup the BIN associated with the electronic financial transaction in the network BIN table;

instructions to determine whether one or more priority flags are asserted in the network BIN table;

instructions to route the electronic financial transaction to a network if a single network is flagged as priority for the BIN associated with the electronic financial transaction; and

instructions to route the electronic financial transaction to the least cost network of the networks flagged as priority, if a more than one network is flagged as priority for the BIN associated with the electronic financial transaction.

8. The computer system for routing an electronic financial transaction according to claim 7, wherein the memory further comprises instructions to determine whether one or more valid flags are asserted in the network BIN table.

9. The computer system for routing an electronic financial transaction according to claim 8, wherein the memory further comprises instructions to route the electronic financial transaction to a network if a single network is flagged as valid for the BIN associated with the electronic financial transaction.

10. The computer system for routing an electronic financial transaction according to claim 8, wherein the memory further comprises instructions to route the electronic financial transaction to the least cost network of the networks flagged as valid, if a more than one network is flagged as valid for the BIN associated with the electronic financial transaction.

11. The computer system for routing an electronic financial transaction according to claim 7, wherein the memory further comprises a state table.

12. The computer system for routing an electronic financial transaction according to claim 11, wherein the memory further comprises instructions to route the electronic financial transaction to the state network specified in the state table if the electronic financial transaction was initiated with a state listed in the state table.

13. The computer system for routing an electronic financial transaction according to claim 7, wherein the electronic financial transaction is routed to the network through the network interface.

14. The computer system for routing an electronic financial transaction according to claim 7, wherein the processor further comprises instructions to route the electronic financial transaction to the least cost network if no network flags are asserted in the network BIN table for the BIN associated with the electronic financial transaction.