Method for managing information and rendering discounts转让专利
申请号 : US11505621
文献号 : US08086486B2
文献日 : 2011-12-27
发明人 : Chase A. Hafner , William R. Mutschler , Brian J. Walker , David S. Joyce
申请人 : Chase A. Hafner , William R. Mutschler , Brian J. Walker , David S. Joyce
摘要 :
权利要求 :
What is claimed is:
说明书 :
This is a continuation of application(s) Ser. No. 09/421,038 filed on Oct. 20, 1999 now abandoned.
The present invention relates to a method for managing information and rendering discounts in a billing system.
In many lines of business, and particularly in the telecommunications industries, managing information for a large number of customers may become quite complicated. Further, customer bills are often adjusted by various discounts. Applying the discounts to the bills, particularly in the telecommunications industries, may quickly become complicated due to the large number of customers and the large amounts of data for each customer during a particular billing period.
In an existing method for rendering discounts, a complex application specific software package is developed to render discounts in a particular billing system having a highly defined structure. The application specific software package is developed for a single company to use for their customers, and is tailored to meet the specific needs of that company. As such, developing a discount rendering software package is expensive, and takes a lot of time. As such, it is not feasible to change the way in which discounts are rendered very often, because the software package is so application specific that it is sometimes necessary to develop an entire new application specific software package in order to revise the discount rendering technique. Further, because the package generally is implemented for use with a highly defined billing structure, these applications are generally not usable by others than the company that the particular package is designed for.
For the foregoing reasons, there is a need for a method for managing information and rendering discounts in a billing system that is more easily modified and may be ported to different platforms without excessive difficulties.
It is, therefore, an object of the present invention to provide a method for managing information and rendering discounts in a billing system that utilizes a rule-based engine configured to accumulate data and render discounts.
In carrying out the above object, a method for managing information and rendering discounts in a billing system is provided. The method comprises receiving a record including data, establishing a rule-based accumulation engine, and processing the record. The record is processed with the accumulation engine to accumulate the data in a plurality of pre-determined target accumulators. The method further comprises establishing a rule-based discount engine, and processing the plurality of target accumulators. The plurality of target accumulators are processed with the discount engine to render discounts applicable to the customer.
In a preferred embodiment, the record has a record type and establishing the accumulation engine further comprises establishing a rule table that directs the accumulation engine based on the record type. Further, preferably, at least one rule is established for processing a record by performing a sequence of operations to the data, with the rules table directing the accumulation engine to apply the at least one rule when dictated by the record type. Still further, preferably, at least one function is established for processing a record, with the rules table directing the accumulation engine to apply the at least one function when dictated by the record type. Even further, preferably, the rules table directs the accumulation engine to pass the data directly to a target accumulator when dictated by the record type.
In a preferred embodiment, the record includes at least one source field, and receiving the record further comprises assigning a logical name to a source field. The accumulation engine processes is the record using the logical name. As such, the accumulation and discount engines are not limited by the format of incoming data, because logical names are assigned to incoming data source fields to place the data in a standard format for the rules-based engines.
In one implementation, establishing the discount engine further comprises establishing at least one rule for processing the record to evaluate discount qualification and at least one rule for processing the record to evaluate discount applications. Further, in one implementation, establishing the discount engine further comprises establishing at least one simple rule for processing the record. Still further, establishing the discount engine preferably further comprises establishing at least one compound rule for processing the record. The at least one compound rule is composed of a plurality of simple rules, with the discount engine applying the compound rule by recursively applying simple rules.
Further, in carrying out the present invention, a discount system for managing information and rendering discounts in a billing system is provided. The system comprises a rule-based engine configured to receive a customer record including data, and process the record to accumulate the data in a plurality of predetermined target accumulators. The rule-based engine is further configured to process the plurality of target accumulators to render discounts applicable to the customer.
Still further, in carrying out the present invention, a computer readable storage medium having information stored thereon representing instructions executable by a computer to manage information and render discounts in a billing system is provided. The computer readable storage medium further comprises instructions for receiving a customer record including data, instructions for establishing a rule-based accumulation engine, and instructions for processing the record with the accumulation engine to accumulate the data in a plurality of predetermined target accumulators. The computer readable storage medium further comprises instructions for establishing a rule-based discount engine, and instructions for processing the plurality of target accumulators with the discount engine to render discounts applicable to the customer.
In a preferred embodiment, the computer readable storage medium further comprises instructions for establishing a rules table and rules and functions that are applied as directed by the rules table as dictated by record type. Further, preferably, logical names are assigned to source fields. Still further, the computer readable storage medium further comprises instructions for evaluating discount qualification, and evaluating discount applications using simple rules and compound rules that are performed by recursive application simple rules.
The advantages associated with embodiments of the present invention are numerous. For example, embodiments of the present invention provide a method, system, and computer instructions for managing information and rendering discounts in a billing system that utilizes a rule-based engine to process the billing information. Advantageously, using a rule-based approach simplifies steps involved in changing the way discounts are applied and adding additional functionality. Further, preferred embodiments assign logical names to source data fields so that the rule-based engine or engines be ported to many different billing platforms without excessive difficulties. Advantageously, the present invention provides a rule-based engine for billing applications with far more flexibility than the non-rule-based application specific programs in the prior art.
The above object and other objects, features, and advantages of the present invention are readily apparent from the following detailed description of the best mode for carrying out the invention when taken in connection with the accompanying drawings.
With reference to
Accumulator driver process 14 includes account information gathering process 16 and data gathering process 18, in addition to accumulator posting process 20. Account information and other data, such as data representing telecommunication services, are received as data records at data record process 22. These data records are processed by the accumulator engine at accumulator rule process 24. Processing includes target accumulator calculation process 26 and optionally includes tiered product processing 28.
Discount driver process 30 includes discount qualification process 32, discount calculation process 34, and discount posting process 36. Qualification and calculation are controlled by the rule router 38. Rule router 38, based on information in target accumulators, calls on simple qualification rule evaluation process 40, compound rule evaluation process 42, simple application rule process 44, and compound application rule process 46 to process the data and render discounts which are posted at discount posting process 36.
With reference to
As shown in
The following examples make reference to the above tables, and the critical table portions are reproduced again, below. Also, refer to the later listed record layouts for the values used in the accumulation examples below. The tables CDFLS10T (block 62) and CDEFS10T (block 64) house the logical names and displacements per record per region. These tables make this process unique in the fact a logical name is assigned to a source field. The logical name can be attached to any field within a given record across the REGION with the same meaning or content. The accumulation criteria table thus can use logical names when building its criteria and does not care about the physical aspect. The join with the CDEF10T table allow attaching the displacements into a unique record with the given logical name. This process allows for great flexibility, enhances performance, allows table updates rather than source code changes, and is a great improvement over existing systems.
Following are some simple examples showing the accumulation process:
Region: C (Central Region)
Input Record: 210 (Direct Dialed Call Detail Record
Step 1:
The first two rows on ACCRU10T (block 70) are applicable for a 210 record in region C. Row 1 refers to field CALL-DUR (call duration) and points to accumulation rule R0000001.
Step 2:
Table ACCCR10T is accessed for all criteria ids with a rule equal to R0000001.
ENTY-CD=MTT
MSG-TYP=1
Process:
Criteria id 001 is false, take the false compare and point to criteria id 002.
Criteria id 002 is true, take true compare and point to criteria id 003.
Criteria id 003 is true, and since no next criteria id, accumulation answer is group 1.
Step 3:
Accumulate CALL-DUR into group id 1 (ACCGP10T) list of accumulation fields. Accumulate by rules on TARAC10T (target accumulators).
Step 4:
Go to step 1 and repeat for all rules present on ACCRU10T.
210 Record Layout
Region: C (Central Region)
Input Record: B61 (Monthly service USOC record)
This process shows how a FUNCTION name can be used in the ACCRU10T (block 70) table to show another way to accumulate data.
Step 1:
The following row on ACCRU10T (block 70) is applicable for a B61 record in region C. This row is accumulating the usoc charge stored in CRB-B61-LSJRC. The Accumulation Engine recognizes that the function name is populated and calls that function dynamically.
This particular function was built specifically for usoc product records. It accumulates the specific usoc based on an entry in the Tiered product table (TIGLP11V; see below). It can accumulate the money only, keep track of the “count” of usocs of that kind, or both. The accumulation is controlled in this case by this function call. The proper logical names are used in the source code to extract the correct fields off of the input record.
B61 Record:
Example TIGLPL11V for Tiered Processing
Region: C (Central Region)
Input Record: EI (Account Master Record)
This process shows how an ACCUMULATOR name can be used to accumulate a given field DIRECTLY from the rules table. This is a third way, and very efficient way, to state what needs to be accumulated off of a given record. When the accumr name is populated, the Accumulation engine goes directly to the structure saved internal to the program and makes an update. In this case the accumulator name is TYPSRV and the value stored in UF-EI-CLSER is accumulated based on rules on the target accumulator table.
With reference to
The CDE Discount Rules evaluation process will walk a tree structure, interpreting the compound and simple rules contained within the tree. One or more simple rules make up a compound rule. The simple rules can be grouped together with =, <, >, <=, >=, <>, ( ), )( logical operands. Compound rules are grouped together with AND & OR conditions. The process will use the Rule Router to control invocation of Simple and Compound Rules Evaluation, with recursive calls in the compound area. The Rule Router acts as a traffic cop in the interpretation of rules. Each Compound rule will either point to another Compound rule or to a Simple rule. The Simple rules ask the business questions that will be associated with a discount plan(e.g. Customer has more than $100.00 in Local Service). In order for the tree structure to be complete, the tree must end with Simple rules(the legs of the tree may not end in Compound rules). The rules evaluation process within the CDE will walk the tree structures from left to right. Each leg of the tree will be interpreted. The CDE will follow the path of walking down to the lowest level and then working its way back up to the top tree structure. The rules evaluation process will always be aware of the AND & OR conditions trying to be satisfied in the Compound rules. Should a simple rule evaluate False and the combined condition in the Compound rule require True, the rules evaluation process will stop and go up to the next level as the lower process result has already been determined.
The Rule Router is unique to rules processing. Most rules evaluation processes simply invoke the rules evaluation(Simple or Compound rule)routines and then return a result. With the complexity in the CDE requirements, the Rule Router allows us to generate complex tree conditions to meet the needs of the business. Asking many questions about an account in order to render a discount, and have those questions grouped together and dependant on one another. The tree conditions may go to an unlimited depth (only limited by business requirements).
With reference to
As shown in
As mentioned previously, a rules table implementation may provide several different ways of processing a data record such as rule criteria base processing 242, tiered product processing 244, or direct placement into a tiered accumulator 246. On the other side of convergent driver 226 is the discount engine with the flow beginning at discount request 250. At 252, discount qualification takes place, with a list of potential plans being generated at 254 and qualification rules being applied at 256. Discounts are calulcated or rendered at 260 by applying application rules 262 as described previously. Thereafter, any discount limits are applied at 264, and journal entries are calculated at 266.
Although a particular implementation of the present invention has been described, along with preferred features for the rule-based system such as the use of a straight-through accumulator engine and a recursive discount rendering engine, embodiments of the present invention may be implemented in a variety of different ways other than that specific example described above. As best shown in
In
It is appreciated, that embodiments of the present invention may be implemented as software in a computer readable storage medium. The computer readable storage medium may take any form. For example, magnetic or optical media may be used to store instructions, executable by a computer for managing information and rendering discounts in accordance with the present invention. As shown in
It is to be appreciated that the present invention, for the very first time, uses a rule-based system to manage customer information and render billing discounts. Advantageously, a rule-based system greatly expands billing system capabilities compared to existing application specific software packages. The present invention allows a system administrator to dynamically define how to accumulate billed infromation items, apply discount rules (in IF THEN ELSE logic patterns) to generate threshold, tiered, flat, percentage discounts, as well as loyalty points and electronic coupons. The invention provides the capability to combine billed charges from different sources and affiliates, interrogate those charges, and apply discounts based on these charges.
In summary, a preferred embodiment for a particular application, which the inventors found to be useful and to be a suitable exemplary implementation, has three main components:
1. Billed Information/Item Accumulation
This portion of the engine is rule-based, allows the business to define what items (facts) they would like to know about a customer and the charges that customer has incurred. Being that it is rule-based and externalized, changes can be quickly made to the type of data to be accumulated. Note—based on the definition of these accumulators, the discount engine gains additional capabilities (e.g., if you define where a customer resides, the engine can calculate geography based discounts, if you define how long a customer has been with the company, the engine can calculate tenure based discounts, etc.)
The accumulator engine portion of CD was developed to be a rule-based engine that was to process many accumulator transactions. These transactions or record identifiers were housed in an accumulator rule table that was to drive the accumulation process due to the volume of transactions, a method was used to design the internal structures to facilitate quick access to accumulation data and/or criteria. The process that was designed used a concept of an internal storage sequence number that was able to allow the software to directly look up the information and greatly improve performance. Another key component included multiple data displacement tables that allowed us to externalize data displacements in regard to accumulator transactions, which enabled us the ability to respond to a business change more quickly by external table updates versus hard-coded software enhancements.
2. Discount Qualification
This portion of the engine is also rule-based, it allows the business to define what conditions must be present in order to render a discount. The rules are based on if then else structures so they can be understood by a non-technical individual.
3. Discount Rendering
This portion of the engine is rule-based as well, it applies the rules for rendering a discount. The rules are based on if then else structures so they can be understood by a non-technical individual.
The following applies to both discount qualification and rendering rules:
Rules are categorized into two parts—simple rules (ability to ask simple questions, X =Y, etc. using +, <, >, <>, ( ), )( logical operators) and compound rules (ability to group simple rules together using AND & OR logic). Rules processing allows you to define any depth to the simple and compound rules using a modified b-tree structure. The rules engine is constructed to process each logical leg of the rules tree and then based on evaluated conditions exit the structure or continue processing the remaining leg—this allows for efficient processing.
Overall Concept:
The overall engine concept was constructed to allow the business to quickly act and re-act in an ever changing competitive environment. The engine was designed for maximum flexibility and to allow the business to build their own rules without technical intervention using the technical structures depicted above.
Business Capabilities:
The CDE was designed and has the ability to perform the following: auto qualification of discount plans, subscription based discount plans, bundling and package discounting, location discounting, flat dollar based discounts, percentage based discounts, tiered discounting, tenure discounting, threshold discounting for usage and non-usage items, prepay discounts, average based discounting, accumulated spending discounting, long term (more than one month) discounting, date, day and time of week discounting, geography based discounting, contract discounting, affinity discounting, tethering, customer referral discounting, loyalty point processing, electronic couponing, revenue and financial tracking and management, and journaling of discounts and management of bookings.
While the best mode for carrying out the invention has been described in detail, those familiar with the art to which this invention relates will recognize various alternative designs and embodiments for practicing the invention as defined by the following claims.