CA2529634A1 - Cost minimization of services provided by multiple service providers - Google Patents
Cost minimization of services provided by multiple service providers Download PDFInfo
- Publication number
- CA2529634A1 CA2529634A1 CA002529634A CA2529634A CA2529634A1 CA 2529634 A1 CA2529634 A1 CA 2529634A1 CA 002529634 A CA002529634 A CA 002529634A CA 2529634 A CA2529634 A CA 2529634A CA 2529634 A1 CA2529634 A1 CA 2529634A1
- Authority
- CA
- Canada
- Prior art keywords
- tier
- sps
- utilization
- pricing structure
- tiered pricing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
- H04L12/1485—Tariff-related aspects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
- H04L12/1442—Charging, metering or billing arrangements for data wireline or wireless communications at network operator level
- H04L12/145—Charging, metering or billing arrangements for data wireline or wireless communications at network operator level trading network capacity or selecting route based on tariff
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
- H04M15/41—Billing record details, i.e. parameters, identifiers, structure of call data record [CDR]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
- H04M15/49—Connection to several service providers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
- H04M15/80—Rating or billing plans; Tariff determination aspects
Abstract
A technique for efficiently and accurately minimizing costs associated with services provided by a plurality of service providers (SPs) that bill for their services based on a tiered cost structure. Target tiers are generated based on the utilization of the SPs' services and the SPs' cost structures.
Utilization of the SPs' services is monitored. A momentary target utilization rate (MTUR) is generated for each SP based on the cumulated utilization of the SP's service and the SP's target tier. Utilization of the SPs' services is distributed based on the generated MTURs in a manner that minimizes cost. If the utilization of the SPs' services indicates the MTURs have been exceeded, new target tiers and MTURs are generated and utilization of the SPs' services is redistributed among the SPs in a manner that minimizes cost.
Utilization of the SPs' services is monitored. A momentary target utilization rate (MTUR) is generated for each SP based on the cumulated utilization of the SP's service and the SP's target tier. Utilization of the SPs' services is distributed based on the generated MTURs in a manner that minimizes cost. If the utilization of the SPs' services indicates the MTURs have been exceeded, new target tiers and MTURs are generated and utilization of the SPs' services is redistributed among the SPs in a manner that minimizes cost.
Claims (20)
1.~A method for minimizing costs associated with services provided by a plurality of service providers (SPs) wherein each SP charges for utilization of its service based on a tiered pricing structure comprising one or more tiers and wherein each tier corre-lates to an amount of service provided by the SP and a cost, the method comprising the steps of:
generating a target tier for each SP based on a utilization of the SP's service wherein the target tier represents a tier contained in the SP's tiered pricing structure;
generating a momentary target utilization rate (MTUR) for each SP based on the generated target tier for the SP and utilization of the SP's service wherein the MTUR
represents a cumulative utilization of a SP's service at a particular instance of time; and distributing utilization of the SPs' services among the SPs based on the MTUR
and tiered pricing structure of each SP in a manner that minimizes the cost of the serv-ices provided by the SPs.
generating a target tier for each SP based on a utilization of the SP's service wherein the target tier represents a tier contained in the SP's tiered pricing structure;
generating a momentary target utilization rate (MTUR) for each SP based on the generated target tier for the SP and utilization of the SP's service wherein the MTUR
represents a cumulative utilization of a SP's service at a particular instance of time; and distributing utilization of the SPs' services among the SPs based on the MTUR
and tiered pricing structure of each SP in a manner that minimizes the cost of the serv-ices provided by the SPs.
2. ~A method as defined in claim 1 comprising the step of:
collecting measurement data that represents the utilization of the SPs' services.
collecting measurement data that represents the utilization of the SPs' services.
3.~A method as defined in claim 2 wherein the data is collected over a billing pe-riod and wherein the billing period comprises one or more rollup periods.
4. ~A method as defined in claim 3 comprising the step of:
generating one or more rollup values from measurement data collected during a rollup period.
generating one or more rollup values from measurement data collected during a rollup period.
5. ~A method as defined in claim 4 wherein each of the SPs' services is associated with a discard calculation method that determines a number of rollup values that are discarded from the billing period.
6. ~A method as defined in claim 4 comprising the step of:
-25-~
for the first N/P + 1 rollup periods in the billing period, distributing demand among the SPs in a manner that minimizes the cost of the services provided by the SPs as indicated by the SPs' tiered pricing structures and the measurement data, wherein N
is a number of discarded rollup values in the billing period and P is a number of rollup values generated per rollup period.
-25-~
for the first N/P + 1 rollup periods in the billing period, distributing demand among the SPs in a manner that minimizes the cost of the services provided by the SPs as indicated by the SPs' tiered pricing structures and the measurement data, wherein N
is a number of discarded rollup values in the billing period and P is a number of rollup values generated per rollup period.
7. ~A method as defined in claim 4 comprising the step of:
placing the one or more rollup values in an ordered set (M).
placing the one or more rollup values in an ordered set (M).
8. ~A method as defined in claim 7 comprising the step of generating a target tier that is a tier in an SP's cost structure associated with a M(N + 1) value in the ordered set, wherein N is a number of discarded rollup values in the billing period.
9. ~A method as defined in claim 8 comprising the steps of:
determining if a tier in the SP's tiered pricing structure associated with a M(N +
1) - J) value in the ordered set matches a tier in the SP's tiered pricing structure associ-ated with the M(N + 1) value in the ordered set, wherein J is a number of rollup values to be generated in the billing period; and if so, generating a target tier that is a maximum tier.
determining if a tier in the SP's tiered pricing structure associated with a M(N +
1) - J) value in the ordered set matches a tier in the SP's tiered pricing structure associ-ated with the M(N + 1) value in the ordered set, wherein J is a number of rollup values to be generated in the billing period; and if so, generating a target tier that is a maximum tier.
10. ~A method as defined in claim 3 comprising the steps of:
collecting first measurement data that represent a first utilization of an SP's service;
generating a first rollup value from the first measurement data;
placing the first rollup value in a first ordered set (M');
collecting second measurement data that represent a second utilization of the SP's service;
generating a second rollup value from the second measurement data; and placing the second rollup value in a second ordered set (M").
collecting first measurement data that represent a first utilization of an SP's service;
generating a first rollup value from the first measurement data;
placing the first rollup value in a first ordered set (M');
collecting second measurement data that represent a second utilization of the SP's service;
generating a second rollup value from the second measurement data; and placing the second rollup value in a second ordered set (M").
11. ~A method as defined in claim 10 wherein the first measurement data is a count of egress octets transferred over a data link coupled to the SP and the second measure-ment data is a count of ingress octets transferred over the data link.
12. ~A method as defined in claim 10 comprising the steps of:
determining if a tier in the SP's tiered pricing structure associated with a M'(N
+ 1) value in the first ordered set is greater than a tier in the SP's tiered pricing structure associated with a M"(N + 1) value in the second ordered set, wherein N is a number of discarded rollup values;
if so, generating a target tier that is the tier in the SP's tiered pricing structure associated with the M'(N + 1) value in the first ordered set; and otherwise, generating a target tier that is the tier in the SP's tiered pricing structure associated with the M"(N + 1) value in the second ordered set.
determining if a tier in the SP's tiered pricing structure associated with a M'(N
+ 1) value in the first ordered set is greater than a tier in the SP's tiered pricing structure associated with a M"(N + 1) value in the second ordered set, wherein N is a number of discarded rollup values;
if so, generating a target tier that is the tier in the SP's tiered pricing structure associated with the M'(N + 1) value in the first ordered set; and otherwise, generating a target tier that is the tier in the SP's tiered pricing structure associated with the M"(N + 1) value in the second ordered set.
13. ~A method as defined in claim 10 comprising the steps of:~~
determining if a tier in the SP's tiered pricing structure associated with a M'((N
+ 1) - J) value in the first ordered set matches a tier in the SP's tiered pricing structure associated with a M'(N + 1) value in the first order set, wherein N is a number of dis-~
carded rollup values and J is a number of rollup values yet to be collected in the billing period;
if so, generating a target tier that is a maximum tier;~
determining if the tier in the SP's tiered pricing structure associated with the M'((N + 1) - J) value in the first ordered set is greater than a tier in the SP's tiered pricing structure associated with a M"(N + 1) value in the second ordered set;
and if so, generating a target tier that is the tier in the SP's pricing structure associ-ated with the larger of the tiers in the SP's tiered pricing structure associated with the M'(N + 1) and M"(N + 1) values, otherwise, generating a target tier that is a maximum tier.
determining if a tier in the SP's tiered pricing structure associated with a M'((N
+ 1) - J) value in the first ordered set matches a tier in the SP's tiered pricing structure associated with a M'(N + 1) value in the first order set, wherein N is a number of dis-~
carded rollup values and J is a number of rollup values yet to be collected in the billing period;
if so, generating a target tier that is a maximum tier;~
determining if the tier in the SP's tiered pricing structure associated with the M'((N + 1) - J) value in the first ordered set is greater than a tier in the SP's tiered pricing structure associated with a M"(N + 1) value in the second ordered set;
and if so, generating a target tier that is the tier in the SP's pricing structure associ-ated with the larger of the tiers in the SP's tiered pricing structure associated with the M'(N + 1) and M"(N + 1) values, otherwise, generating a target tier that is a maximum tier.
14. ~A method as defined in claim 10 comprising the steps of:
determining if a tier in the SP's tiered pricing structure associated with a M"((N
+ 1) - J) value in the second ordered set matches a tier in the SP's tiered pricing struc-ture associated with a M"(N + 1) value in the second order set, wherein N is a number of discarded rollup values and J is a number of rollup values yet to be collected in the billing period;
if so, generating a target tier that is a maximum tier;
determining if the tier in the SP's tiered pricing structure associated with the M"((N + 1) - J) value in the second ordered set is greater than a tier in the SP's tiered pricing structure associated with a M'(N + 1) value in the first ordered set;
and if so, generating a target tier that is the tier in the SP's pricing structure associ-ated with the larger of the tiers in the SP's tiered pricing structure associated with of the M'(N + 1) and M"(N + 1) values, otherwise, generating a value that is a maximum tier.
determining if a tier in the SP's tiered pricing structure associated with a M"((N
+ 1) - J) value in the second ordered set matches a tier in the SP's tiered pricing struc-ture associated with a M"(N + 1) value in the second order set, wherein N is a number of discarded rollup values and J is a number of rollup values yet to be collected in the billing period;
if so, generating a target tier that is a maximum tier;
determining if the tier in the SP's tiered pricing structure associated with the M"((N + 1) - J) value in the second ordered set is greater than a tier in the SP's tiered pricing structure associated with a M'(N + 1) value in the first ordered set;
and if so, generating a target tier that is the tier in the SP's pricing structure associ-ated with the larger of the tiers in the SP's tiered pricing structure associated with of the M'(N + 1) and M"(N + 1) values, otherwise, generating a value that is a maximum tier.
15. ~A system comprising:
connections coupled to a plurality of service providers (SPs) and configured to enable access to services provided by the SPs wherein each SP charges for utilization of its service based on a tiered pricing structure comprising one or more tiers and wherein each tier correlates to an amount of service provided by the SP and a cost;
means for generating a target tier for each SP based on a utilization of the SP's service wherein the target tier represents a tier contained in the SP's tiered pricing structure;
means for generating a momentary target utilization rate (MTUR) for each SP
based on the generated target tier for the SP and utilization of the SP's service wherein the MTUR represents a cumulative utilization of the SP's services at a particular in-stance of time; and means for distributing utilization of the SPs' services among the SPs based on the MTUR and tiered pricing structure of each SP in a manner that minimizes the cost of the services provided by the SPs.
connections coupled to a plurality of service providers (SPs) and configured to enable access to services provided by the SPs wherein each SP charges for utilization of its service based on a tiered pricing structure comprising one or more tiers and wherein each tier correlates to an amount of service provided by the SP and a cost;
means for generating a target tier for each SP based on a utilization of the SP's service wherein the target tier represents a tier contained in the SP's tiered pricing structure;
means for generating a momentary target utilization rate (MTUR) for each SP
based on the generated target tier for the SP and utilization of the SP's service wherein the MTUR represents a cumulative utilization of the SP's services at a particular in-stance of time; and means for distributing utilization of the SPs' services among the SPs based on the MTUR and tiered pricing structure of each SP in a manner that minimizes the cost of the services provided by the SPs.
16. ~An intermediate node comprising:
one or more connections coupled to a plurality of service providers (SPs) and configured to enable access to services provided by the SPs wherein each SP
charges for utilization of its service based on a tiered pricing structure comprising one or more tiers and wherein each tier correlates to an amount of service provided by the SP and a cost; and a processor configured to:
monitor utilization of the SPs' services, generate a target tier for each SP based on a utilization of the SP's serv-ice wherein the target tier represents a tier contained in the SP's tiered pricing structure, generate a momentary target utilization rate (MTUR) for each SP based on the generated target tier for the SP and the utilization of the SP's service wherein the MTUR represents a cumulative utilization of the SP's service at a particular instance of time and distribute utilization of the SPs' services among the SPs based on the MTUR and tiered pricing structure of each SP in a manner that minimizes the cost of the services provided by the SPs.
one or more connections coupled to a plurality of service providers (SPs) and configured to enable access to services provided by the SPs wherein each SP
charges for utilization of its service based on a tiered pricing structure comprising one or more tiers and wherein each tier correlates to an amount of service provided by the SP and a cost; and a processor configured to:
monitor utilization of the SPs' services, generate a target tier for each SP based on a utilization of the SP's serv-ice wherein the target tier represents a tier contained in the SP's tiered pricing structure, generate a momentary target utilization rate (MTUR) for each SP based on the generated target tier for the SP and the utilization of the SP's service wherein the MTUR represents a cumulative utilization of the SP's service at a particular instance of time and distribute utilization of the SPs' services among the SPs based on the MTUR and tiered pricing structure of each SP in a manner that minimizes the cost of the services provided by the SPs.
17. ~An intermediate node as defined in claim 16 wherein the processor is config-ured to collect measurement data that represents the utilization of the SPs' services.
18. ~An intermediate node as defined in claim 17 wherein the data is collected over a billing period and wherein the billing period comprises one or more rollup periods.
19. ~An intermediate node as defined in claim 18 wherein the processor is config-ured to generate one or more rollup values from the measurement data collected during a rollup period.
20. ~A computer readable medium containing computer executable instructions for execution in a processor for performing the steps of generating a target tier for each SP in a plurality of SPs based on a utilization of an SP's service wherein the target tier represents a tier contained in the SP's tiered pricing structure;
generating a momentary target utilization rate (MTUR) for each SP in the plu-rality of SPs based on the generated target tier for the SP and the utilization of the SP's service wherein the MTUR represents a cumulative utilization of the SP's services at a particular instance of time; and~
distributing utilization of the SPs' services among the SPs in the plurality of SPs based on the MTUR and tiered pricing structure of each SP in a manner that minimizes the cost of the services provided by the SPs.
generating a momentary target utilization rate (MTUR) for each SP in the plu-rality of SPs based on the generated target tier for the SP and the utilization of the SP's service wherein the MTUR represents a cumulative utilization of the SP's services at a particular instance of time; and~
distributing utilization of the SPs' services among the SPs in the plurality of SPs based on the MTUR and tiered pricing structure of each SP in a manner that minimizes the cost of the services provided by the SPs.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/631,682 | 2003-07-31 | ||
US10/631,682 US7257560B2 (en) | 2003-07-31 | 2003-07-31 | Cost minimization of services provided by multiple service providers |
PCT/US2004/023328 WO2005013049A2 (en) | 2003-07-31 | 2004-07-20 | Cost minimization of services by multiple providers |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2529634A1 true CA2529634A1 (en) | 2005-02-10 |
CA2529634C CA2529634C (en) | 2010-09-07 |
Family
ID=34104167
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA2529634A Expired - Fee Related CA2529634C (en) | 2003-07-31 | 2004-07-20 | Cost minimization of services provided by multiple service providers |
Country Status (6)
Country | Link |
---|---|
US (2) | US7257560B2 (en) |
EP (1) | EP1654615A4 (en) |
CN (1) | CN101019150A (en) |
AU (1) | AU2004262270A1 (en) |
CA (1) | CA2529634C (en) |
WO (1) | WO2005013049A2 (en) |
Families Citing this family (32)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8392285B2 (en) | 1996-11-12 | 2013-03-05 | Syncada Llc | Multi-supplier transaction and payment programmed processing approach with at least one supplier |
US8396811B1 (en) | 1999-02-26 | 2013-03-12 | Syncada Llc | Validation approach for auditing a vendor-based transaction |
US20080172314A1 (en) | 1996-11-12 | 2008-07-17 | Hahn-Carlson Dean W | Financial institution-based transaction processing system and approach |
US20070055582A1 (en) | 1996-11-12 | 2007-03-08 | Hahn-Carlson Dean W | Transaction processing with core and distributor processor implementations |
EP1508111A4 (en) * | 2002-05-10 | 2006-06-07 | Us Bancorp | Automated transaction processing system and approach |
US8165969B2 (en) * | 2003-07-31 | 2012-04-24 | Cisco Technology, Inc. | Route optimization of services provided by one or more service providers for combined links |
US20050112530A1 (en) * | 2003-11-25 | 2005-05-26 | International Business Machines Corporation | Computer-implemented method, system and program product for performing branched rollup for shared learning competencies in a learning environment |
US8126999B2 (en) | 2004-02-06 | 2012-02-28 | Microsoft Corporation | Network DNA |
US7937557B2 (en) * | 2004-03-16 | 2011-05-03 | Vns Portfolio Llc | System and method for intercommunication between computers in an array |
US8489720B1 (en) * | 2004-03-31 | 2013-07-16 | Blue Coat Systems, Inc. | Cost-aware, bandwidth management systems adaptive to network conditions |
AU2005255453B2 (en) | 2004-06-09 | 2007-11-08 | Syncada Llc | Financial institution-based transaction processing system and approach |
AU2005255456B2 (en) | 2004-06-09 | 2007-09-13 | Syncada Llc | Order-resource fulfillment and management system and approach |
US8762238B2 (en) | 2004-06-09 | 2014-06-24 | Syncada Llc | Recurring transaction processing system and approach |
US7593366B2 (en) | 2004-12-30 | 2009-09-22 | Intel Corporation | Wireless network facilitator and monitor |
US7904695B2 (en) * | 2006-02-16 | 2011-03-08 | Vns Portfolio Llc | Asynchronous power saving computer |
US20070043672A1 (en) * | 2005-08-16 | 2007-02-22 | Bea Systems, Inc. | Per unit basis software licensing model |
US7626941B1 (en) * | 2005-12-30 | 2009-12-01 | At&T Corp. | Method and apparatus for analyzing proposed service features in a communication network |
US7966481B2 (en) | 2006-02-16 | 2011-06-21 | Vns Portfolio Llc | Computer system and method for executing port communications without interrupting the receiving computer |
US7617383B2 (en) * | 2006-02-16 | 2009-11-10 | Vns Portfolio Llc | Circular register arrays of a computer |
US7904615B2 (en) | 2006-02-16 | 2011-03-08 | Vns Portfolio Llc | Asynchronous computer communication |
US7536493B2 (en) * | 2006-04-12 | 2009-05-19 | International Business Machines Corporation | Method and apparatus for identifying a service processor with current setting information |
US8712884B2 (en) | 2006-10-06 | 2014-04-29 | Syncada Llc | Transaction finance processing system and approach |
US20080270751A1 (en) * | 2007-04-27 | 2008-10-30 | Technology Properties Limited | System and method for processing data in a pipeline of computers |
US8751337B2 (en) | 2008-01-25 | 2014-06-10 | Syncada Llc | Inventory-based payment processing system and approach |
US20100023730A1 (en) * | 2008-07-24 | 2010-01-28 | Vns Portfolio Llc | Circular Register Arrays of a Computer |
US8687621B2 (en) * | 2009-06-04 | 2014-04-01 | Cisco Technology, Inc. | Dynamically right-sizing prefixes for network and application performance |
US8862714B2 (en) * | 2010-03-15 | 2014-10-14 | Electronics And Telecommunications Research Institute | Apparatus and method for virtualizing of network device |
US20120158561A1 (en) * | 2010-12-17 | 2012-06-21 | The Bank Of New York Mellon, A New York Banking Corporation | System and method for real estate investment management and analysis |
US9277482B2 (en) | 2011-11-10 | 2016-03-01 | Cisco Technology, Inc. | Adaptive reoptimization rate for unstable network topologies |
CN106416138A (en) * | 2013-12-31 | 2017-02-15 | 班德韦斯克公司 | Systems and methods for allocating alternative network access resources |
US20150339691A1 (en) * | 2014-05-23 | 2015-11-26 | Moose Loop Holdings, LLC | Systems and Methods for Adjusting Prices for a Service |
US10045211B2 (en) | 2015-09-29 | 2018-08-07 | Bandwidthx Inc. | Authentication and authorization of mobile devices for usage of access points in an alternative network |
Family Cites Families (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US599565A (en) * | 1898-02-22 | kintner | ||
US4878245A (en) * | 1986-01-29 | 1989-10-31 | Bradley Graham C | Control and metering system for pay television over a cable network |
CA2123068C (en) * | 1994-05-06 | 1998-04-14 | Thomas A. Gray | Adaptive method for allocating calls |
US6167389A (en) * | 1996-12-23 | 2000-12-26 | Comverge Technologies, Inc. | Method and apparatus using distributed intelligence for applying real time pricing and time of use rates in wide area network including a headend and subscriber |
US6240462B1 (en) * | 1997-10-14 | 2001-05-29 | At&T | System for providing enhanced grade of service for connections over a large network |
US5999565A (en) * | 1997-10-15 | 1999-12-07 | Cisco Technology, Inc. | Data communication using a modifiable number of XDSL modems |
US6546017B1 (en) * | 1999-03-05 | 2003-04-08 | Cisco Technology, Inc. | Technique for supporting tiers of traffic priority levels in a packet-switched network |
US6577597B1 (en) * | 1999-06-29 | 2003-06-10 | Cisco Technology, Inc. | Dynamic adjustment of network elements using a feedback-based adaptive technique |
US6584502B1 (en) * | 1999-06-29 | 2003-06-24 | Cisco Technology, Inc. | Technique for providing automatic event notification of changing network conditions to network elements in an adaptive, feedback-based data network |
US6505244B1 (en) * | 1999-06-29 | 2003-01-07 | Cisco Technology Inc. | Policy engine which supports application specific plug-ins for enforcing policies in a feedback-based, adaptive data network |
US20020049617A1 (en) * | 1999-12-30 | 2002-04-25 | Choicelinx Corporation | System and method for facilitating selection of benefits |
US20010034677A1 (en) * | 2000-02-25 | 2001-10-25 | Jay Farhat | Method and system to normalize transaction data pertaining to accesses to a service provided via a plurality of service providers |
JP2001297178A (en) * | 2000-03-01 | 2001-10-26 | Ge Medical Systems Global Technology Co Llc | Method and system for determining price incorporating customer valuation considerations |
FI112148B (en) * | 2000-07-24 | 2003-10-31 | Stonesoft Oyj | Procedure for checking data transfer |
EP1188684B1 (en) * | 2000-09-15 | 2004-03-17 | Societe Des Produits Nestle S.A. | Refill container for food product and device for receiving such a container |
US20020198850A1 (en) * | 2001-06-26 | 2002-12-26 | International Business Machines Corporation | System and method for dynamic price determination in differentiated services computer networks |
US6895441B1 (en) * | 2001-07-30 | 2005-05-17 | Atrica Ireland Ltd. | Path rerouting mechanism utilizing multiple link bandwidth allocations |
EP1508111A4 (en) * | 2002-05-10 | 2006-06-07 | Us Bancorp | Automated transaction processing system and approach |
US8165969B2 (en) | 2003-07-31 | 2012-04-24 | Cisco Technology, Inc. | Route optimization of services provided by one or more service providers for combined links |
-
2003
- 2003-07-31 US US10/631,682 patent/US7257560B2/en active Active
-
2004
- 2004-07-20 EP EP04778702A patent/EP1654615A4/en not_active Withdrawn
- 2004-07-20 CN CNA2004800216180A patent/CN101019150A/en active Pending
- 2004-07-20 WO PCT/US2004/023328 patent/WO2005013049A2/en active Application Filing
- 2004-07-20 AU AU2004262270A patent/AU2004262270A1/en not_active Abandoned
- 2004-07-20 CA CA2529634A patent/CA2529634C/en not_active Expired - Fee Related
-
2007
- 2007-07-13 US US11/777,807 patent/US7920479B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
US20050027548A1 (en) | 2005-02-03 |
CN101019150A (en) | 2007-08-15 |
US7920479B2 (en) | 2011-04-05 |
US20080015914A1 (en) | 2008-01-17 |
CA2529634C (en) | 2010-09-07 |
US7257560B2 (en) | 2007-08-14 |
WO2005013049A3 (en) | 2007-04-12 |
EP1654615A2 (en) | 2006-05-10 |
AU2004262270A1 (en) | 2005-02-10 |
EP1654615A4 (en) | 2012-12-26 |
WO2005013049A2 (en) | 2005-02-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2529634A1 (en) | Cost minimization of services provided by multiple service providers | |
CN106484540B (en) | A kind of resource allocation method and device | |
MXPA02005546A (en) | Method and system for processing records in a communications system. | |
US8407348B2 (en) | Monitoring network usage | |
CN101155085B (en) | Method and device for real-time flux prediction and real-time flux monitoring and early warning | |
WO2004072813A3 (en) | System and method for managing and processing of telecommunications invoices | |
US7907527B2 (en) | Methods, systems, and computer program products for grooming traffic on a shared network facility based on a peak utilization analysis of the shared network facility | |
CN1408155A (en) | Method and arrangement for performing analysis of data network | |
AU1750700A (en) | Accounting and billing based on network use | |
EP0903890A2 (en) | Monitoring network traffic | |
CN103414608B (en) | Rapid web flow collection statistical system and method | |
CN104317695A (en) | Self-service equipment monitoring method and self-service equipment monitoring device | |
CN110493017A (en) | A kind of charge on traffic method and system | |
JP2003178040A (en) | Web site constitution determination supporting method | |
RU2008107954A (en) | METHOD FOR CALCULATING THE RATE OF SALES AND COMPUTER-REVEALABLE RECORDING MEANS | |
CN115630116A (en) | Building informatization resource display system and method based on Internet of things | |
EP2465283B1 (en) | Estimation method and device for loss rates in a packetized network | |
CN113298671A (en) | Electric power big data monitoring system | |
CN110363434B (en) | Method and device for determining delivery place of self-service teller machine | |
CN105045910B (en) | Application candidate set generation method and device and service equipment | |
Jia et al. | Nitrogen status diagnosis of rice by using a digital camera | |
CN108182537A (en) | Electric taxi quick charge station service characteristic analysis method based on queueing theory | |
CN102612058A (en) | Method and device for determining performance index statistical result | |
Ackere et al. | Simulation and queueing theory applied to a single-server queue with advertising and balking | |
CN110798850B (en) | Operator network access method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |
Effective date: 20180720 |