Routing data based on comparative income values

• US 20050286704A1
• Filed: 08/15/2005
• Published: 12/29/2005
• Est. Priority Date: 12/28/2000
• Status: Active Grant

• Current Assignee: AT&T Intellectual Property, Inc. (AT&T, Inc.)
• Original Assignee: Bellsouth Intellectual Property Corporation (AT&T, Inc.)
• Inventors: Enzmann, Mark, Price, Dennis
• Granted Patent: US 7,257,219 B2
• Time in Patent Office: Days
• US Class Current: 379/221.01
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/124 using a combination of metrics
• CPC Class Codes: H04M 15/00 Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
• CPC Class Codes: H04M 15/50 for cross-charging network operators
• CPC Class Codes: H04M 15/58 based on statistics of usage or network monitoring
• CPC Class Codes: H04M 15/8044 Least cost routing
• CPC Class Codes: H04M 15/90 using Intelligent Networks [IN] or Advanced Intelligent Networks [AIN]
• CPC Class Codes: H04M 2207/12 intelligent networks
• CPC Class Codes: H04M 2215/016 Billing using Intelligent Networks [IN] or Advanced Intelligent Networks [AIN]
• CPC Class Codes: H04M 2215/0188 Network monitoring; statistics on usage on called/calling number
• CPC Class Codes: H04M 2215/42 Least cost routing, i.e. provision for selecting the lowest cost tariff
• CPC Class Codes: H04M 2215/52 Interconnection, inter-exchange, reseller billing, billing agreements between different operators, e.g. billing identifier added on the CDR in order to cross charge the other operator, inter-operator accounting, reconciliation, bill directly resellers customers
• CPC Class Codes: H04M 2215/745 Least cost routing, e.g. Automatic or manual, call by call or by preselection
• CPC Class Codes: H04Q 3/0029 Provisions for intelligent networking

Abstract

To select routing of communications in a network with a plurality of paths between a first location and a second location, a routing choice is determined from among the plurality of paths based at least in part upon at least one of a communication-success amount of monetary relevance for each of the plurality of paths and a communication-failure amount of monetary relevance for each of the plurality of paths, and further upon at least one of a likelihood of successfully completing communication for each of the plurality of paths and a likelihood of failing to complete communication for each of the plurality of paths. At least one routing device is informed of the determined routing choice, whereby the routing device can select routing information for routing the data between the first location and the second location based on the determined routing choice.

Claims

1. A method of selecting routing of communications in a network with a plurality of paths between a first location and a second location, the method comprising:

determining a routing choice from among the plurality of paths based at least in part upon at least one of a communication-success amount of monetary relevance for each of the plurality of paths and a communication-failure amount of monetary relevance for each of the plurality of paths and further upon at least one of a likelihood of successfully completing communication for each of the plurality of paths and a likelihood of failing to complete communication for each of the plurality of paths; and

informing at least one routing device of the determined routing choice, whereby the routing device can select routing information for routing the data between the first location and the second location based on the determined routing choice.

2. The method of claim 1 for selecting routing of computer data packets in a computer data network with a plurality of data paths between a first location and a second location, the method comprising determining a routing choice from among the plurality of data paths based at least in part upon at least one of a likelihood of successfully completing communication for each data packet for each of the plurality of paths based on compiled packet delivery success metrics and a likelihood of failing to complete communication for each data packet for each of the plurality of paths based on compiled packet delivery failure metrics.

3. The method of claim 1 further comprising selecting the routing information and routing the data between the first location and the second location based on the determined routing choice.

4. The method of claim 1 comprising further determining the routing choice based at least in part upon any perceived liability for failing to complete communications between the first location and the second location, the perceived liability deriving from at least one of a service agreement, a regulatory requirement, and an obligation incumbent in a type of service provided.

5. The method of claim 1 comprising determining a routing choice based at least in part upon at least one of a likelihood of successfully completing communication for each of the plurality of paths and a likelihood of failing to complete communication for each of the plurality of paths, each likelihood being based at least in part on at least one of an expected value and a variance as derived based on a probability distribution function.

6. The method of claim 1 further comprising:

transmitting the determined routing choice to a routing device; and

routing the communications at the routing device according to the transmitted routing choice.

7. The method of claim 1 comprising determining a routing choice from among the plurality of paths based at least in part upon at least one of a communication-success amount of monetary relevance for each of the plurality of paths and a communication-failure amount of monetary relevance for each of the plurality of paths, each communication-success amount and each communications-failure amount selected from a group consisting of least cost per minute, most cost per minute, least revenue per minute, most revenue per minute, least profit per minute, and most profit per minute.

8. The method of claim 1 comprising determining the routing choice based on values obtained from a database.

9. The method of claim 8 further comprising storing the values in the database.

10. The method of claim 9 further comprising updating the database periodically with updated values.

11. The method of claim 9 further comprising updating the database periodically with updated values as obtained from a surveillance system that monitors for such values.

12. The method of claim 1, wherein selecting the routing information further comprises:

determining a first routing choice for routing the communications by way of a first path;

determining a second routing choice for routing the communications by way of a second path; and

informing at least one routing device of the first and second determined routing choices, whereby the routing device can select from among the first and second determined routing choices and select routing information for routing the data packets between the first location and the second location based on the selected routing choice.

13. The method of claim 1 wherein selecting the routing information further comprises:

determining a preferred routing choice for routing the communications by way of a preferred path;

determining an alternative routing choice for routing the communications by way of an alternative path; and

informing at least one routing device of the preferred and alternative determined routing choices, whereby the routing device firstly select routing information for routing the data between the first location and the second location based on the preferred routing choice and then secondly selects routing information for routing the data between the first location and the second location based on the alternative routing choice if the data is not successfully communicated based on the preferred routing choice.