Telecommunication price-based routing apparatus, system and method
AssigneeLevel 3 Communications, LLC
InventorsWilliam Gray, Binchao Chen, Peder Hans Engebretson
Life of this patent
Estimating the term…
Abstract
Aspects of the present disclosure relate to telecommunications networks, processing and routing calls between networks, a computing system and methodologies for optimizing pricing particularly in situations with massive amounts of data, processing call volume data, deseasonalizing data, minutes of use data, establishing and distributing pricing data for use in routing decisions, among other features and advantages.
Claims6
A method for routing telecommunications traffic comprising:
- in a telecommunication network with a plurality of carrier destinations with a connected network, identifying a subset of the plurality of carrier destinations to institute at least one price change for carrying traffic for the connected network;
- and
- providing for loading the at least one price change for the subset of the plurality of carrier destinations into a least cost routing system of the connected network such that traffic between the telecommunication network and the connected network at the subset of the plurality of carrier destinations will be at the at least one price change,
- wherein providing for loading, based on the probability of call volume change, at least one second price change into the least cost routing system when the probability meets a threshold indicative of a significant negative change associated with a margin after the at least one price change being negative relative to a margin before the at least one price change.
A system for routing telecommunication traffic comprising:
- a telecommunication network with a plurality of carrier destinations with a connected network;
- and
- at least one computing device connected to the telecommunication network, the at least one computing device operable to:
- identify a subset of the plurality of carrier destinations to institute at least one price change for carrying traffic for the connected network;
- and
- provide for loading the at least one price change for the subset of the plurality of carrier destinations into a least cost routing system of the connected network such that traffic between the telecommunication network and the connected network at the subset of the plurality of carrier destinations will be at the at least one price change,
- wherein providing for loading, based on the probability of call volume change, at least one second price change into the routing system when the probability meets a threshold indicative of a significant negative change associated with a margin after the at least one price change being negative relative to a margin before the at least one price change.
A non-transitory computer readable medium encoded with instructions for routing telecommunication traffic, the instructions, executable by a computing device, comprising:
- in a telecommunication network with a plurality of carrier destinations with a connected network, identifying a subset of the plurality of carrier destinations to institute at least one price change for carrying traffic for the connected network;
- and
- providing for loading the at least one price change for the subset of the plurality of carrier destinations into a least cost routing system of the connected network such that traffic between the telecommunication network and the connected network at the subset of the plurality of carrier destinations will be at the at least one price change,
- wherein providing for loading, based on the probability of call volume change, at least one second price change into the least cost routing system when the probability meets a threshold indicative of a significant negative change associated with a margin after the at least one price change being negative relative to a margin before the at least one price change.
Dependencies are inferred from the claim text.