Auditing and optimizing communication path routes
AssigneeWavecode, Inc.
InventorsBrian Todd Yakman, Scott Leonard Heber, Eduardo Alberto Outeda
Life of this patent
Estimating the term…
Abstract
Example embodiments of the present invention may include a method and apparatus configured determine an optimal routing path to route a call through a network. One example method may include retrieving and parsing a routing table and storing the parsed routing information in a routing database. The method may also include determining a plurality of routes that could be used to route the call through the network by applying at least one cost metric to the plurality of determined routes. The method may also include determining an order of the plurality of routes used to route the call, and create a route used to route the call based on the determined order of the plurality of routes.
Claims20
A method, comprising:
- parsing at least one routing table;
- determining an order of a plurality of routes that could be used to route a call;
- creating at least one rule set used to determine the order of the plurality of routes, the rule set comprising at least one number plan area code/numbering (NPA/NXX) range;
- determining whether at least one specific numerical value is identified in the at least one NPA/NXX range to determine the optimal routing path;
- determining a price value of the optimal routing path based on the identified specific numerical value of the NPA/NXX range;
- and
- creating a route used to route the call by applying the at least one rule set, the determined order of the plurality of routes, the identified specific numerical value of the NPA/NXX range, and the price value of the optimal routing path.
An apparatus, comprising:
- a memory;
- and
- a processor communicably coupled to the memory, the processor configured to:
- parse at least one routing table;
- determine an order of a plurality of routes that could be used to route a call;
- create at least one rule set used to determine the order of the plurality of routes, the rule set comprising at least one number plan area code/numbering (NPA/NXX) range;
- determine whether at least one specific numerical value is identified in the at least one NPA/NXX range to determine the optimal routing path;
- determine a price value of the optimal routing path based on the identified specific numerical value of the NPA/NXX range;
- and
- create a route used to route the call by applying the at least one rule set, the determined order of the plurality of routes, the identified specific numerical value of the NPA/NXX range, and the price value of the optimal routing path.
A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform:
- parsing at least one routing table;
- determining an order of a plurality of routes that could be used to route a call;
- creating at least one rule set used to determine the order of the plurality of routes, the rule set comprising at least one number plan area code/numbering (NPA/NXX) range;
- determining whether at least one specific numerical value is identified in the at least one NPA/NXX range to determine the optimal routing path;
- determining a price value of the optimal routing path based on the identified specific numerical value of the NPA/NXX range;
- and
- creating a route used to route the call by applying the at least one rule set, the determined order of the plurality of routes, the identified specific numerical value of the NPA/NXX range, and the price value of the optimal routing path.
Dependencies are inferred from the claim text.