Revenue management system and method utilizing database backup

Abstract
A real-time customer relation management system is disclosed. The system can provide increased availability, reduced internal latencies, and reduced data processing and transfer. The system can provide real time processing and batch processing. The system architecture can have an in-memory write-through cache. The cache can store data that would have otherwise been sent to a database. The system can have a backup in-memory write-through cache. The system can use a warm standby, for example, to enhance data backup efficiency.
Description
BACKGROUND OF THE INVENTION

This invention relates to a revenue management system that has an in-memory write-through cache.


Prepaid phone accounts are tracked in real-time by billing and time management hardware and software architectures in communication with the phone network switch. The architecture approves the customer's call if there are sufficient funds in the customer's prepaid account. If the customer runs out of time on his prepaid account during a call, the architecture acts to terminate the call.


These architectures are known as customer relation management (CRM) systems. CRM systems are also used for non-prepaid scenarios, such as for generating bills. CRM systems are also used for other telecommunications, and other network management scenarios.


Prepaid account CRM systems need to have the ability to track accounts in real-time. Available real-time architectures for managing prepaid customer accounts have some existing limitations.


First, the available architectures require high performance and data throughput, thereby leading to relatively high hardware requirements. These architectures, along with their storage and maintenance can be expensive and time-consuming.


Second, requirements for very low system response latencies are difficult to achieve. Transactions in existing architectures involve several round-trips-to the disk-based storage subsystem. The data must be processed by a comparatively large software stack to transform from a relational representation into a physical storage format.


Third, in an available architecture, the data is transferred several times from component to component of the system to retrieve the data, map it from a relational format to an object format, process it with the desired business logic, and then transfer the response to the client.


Fourth, currently available architectures can not provide desired levels of data availability to the public phone network (e.g., the switch). The close connection of a prepaid CRM system to the public network increases the data availability requirements. Being part of the public network, some parts of the system need to have carrier-grade availability.


Also, no single product accomplished both batch processing and real-time processing for telecommunications CRM (e.g., billing) purposes.


BRIEF SUMMARY OF THE INVENTION

A system and method for managing any numerical account information is disclosed. For example, the system and method can be used for managing revenue for telecommunications system. The system and method can be used to manage account balances, such as user accounts for the telecommunications system. Management of account balances can include altering the balance of the account during use, and/or querying the account (e.g., by the account holder or a customer service representative), and/or querying the account to produce a billing statement or perform other accounting features, and/or querying the account to determine whether to authorize use of the account.


The system can be used with an account with an existing balance (e.g., prepaid), an account with a maximum use limit (e.g., capped), a current payment account (e.g., now-pay, for example through the use of a credit card), other types of balance management accounts, or combinations thereof.


The system architecture can be configured to increase performance, and availability and decrease latency. The system and method can manage accounts, for example, for the prepaid wireless markets handling services such as GSM, GPRS and SMS.


The system can have a rating engine, a billing engine, and a first, high-speed, memory (e.g., transaction in memory object store (TIMOS)). The first memory can be a virtual database cache. The first memory can be a typical on-board RAM storage location.


The first memory can be a smart cache. The smart cache can treat different object types different ways. For example, the smart cache can treat reference objects, database-only objects, and transient object differently.


Reference objects can be owned by the database and never updated by the first memory. Reference objects can include dynamic reference objects (e.g., an account balance) that change each call, and static reference objects (e.g., the billing rate for different types of calls) that never or rarely change. Database-only objects can be objects that change one-time or rarely during the call and are not referred to by the connection manager. Transient objects can exist, for example, only in-memory (e.g., in TIMOS). Transient objects can be unwritten to the database. Transient objects can be written to the database, for example, at the end of the call (e.g., credit balance).


The database can have a data dictionary. The data dictionary can by written by the users. The data dictionary can define an object type and what type of object each other is. Customers can edit the data dictionary if so desired.


The new revenue management system can have a high availability. The system can have a warm standby operation by referring to any data remaining in TIMOS. During warm standby, in the case of a loss of data, the system can recreate data from the switch and/or TIMOS when the switch sends re-authorization data (e.g., during long calls) or end-of-call data.


A known failure protection scheme with a high availability (monitor) regularly checking the status of the control manager, TIMOS, data manager, the database manager, and the database is also disclosed.


A self-container failure protection system is disclosed. Each component of the system can check on the status of its immediately downstream component. If the downstream component has failed, or is passing along a failure message regarding a further downstream component failure, the system can take appropriate action, including alerting a user.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a variation of the revenue management system architecture connected to a switch over a network.



FIG. 2 illustrates a variation of the revenue management system architecture connected to a switch over a public network.



FIGS. 3 through 5 illustrate variations of the revenue management system architecture.



FIG. 6 illustrates a variation for a method for using the revenue management system.



FIG. 7 illustrates process flows for variations for methods for using the revenue management system.



FIG. 8 illustrates a variation for a method for using the revenue management system.



FIG. 9 illustrates process flows for variations for methods for using the revenue management system.



FIG. 10 illustrates a variation for a method for using the revenue management system.



FIG. 11 illustrates process flows for variations for methods for using the revenue management system.



FIGS. 12
a through 14 illustrate variations of the revenue management system.





DETAILED DESCRIPTION

A computer-based system and method for managing any numerical account information is disclosed. For example, the system and method can be used for managing revenue for telecommunications system. The system and method can be used to manage account balances, such as user accounts for the telecommunications system. The management of account balances can include altering the balance of the account during use, and/or querying the account (e.g., by the account holder or a customer service representative), and/or querying the account to produce a billing statement or perform other accounting features, and/or querying the account to determine whether to authorize use of the account.



FIG. 1 illustrates a telecommunication device 2, such as a phone, computer, or fax machine, that can be connected through a public telephone network 4 to a switch 6. The telecommunication device 2 can be communicating with a second telecommunication device through the switch 6. The switch 6 can communicate across a network and through a gateway 8 (e.g., having a protocol translator) to the revenue management system 100. The gateway 8 can communicate directly with a business logic module 10 or business logic application (e.g., Portal Infranet, Portal Software, Inc. Cupertino, Calif.). The business logic module 10 can communicate with a database system 12 to determine whether the telecommunication device 2 connected to the switch 6 has permission to connect and/or stay on the line. The database system 12 can have a highly-available Oracle RAC database cluster. The system 100 can utilize Oracle transaction management functionality.



FIG. 2 illustrates that the gateway 8 can be a part of the revenue management system 100. The gateway 8 can interface between the business logic module 10 and an intelligent network (IN) service control point system (SCP) 14. The service control point system 14 can facilitate communication between the switch 6 and the gateway 8. The SCP system 14 can be-software or a remote computer database within the network that receives queries, for example from service switching points (SSP), in order to process applications, such as 800 and LNP number lookups and calling card verification. The SCP system 14 can process the applications utilizing the customer management system 100. The gateway 8 can be a high-speed protocol translator from the IN SCP to the remainder of the revenue management system 100.



FIG. 3 illustrates that the business logic module 10 can have one or more rating connection managers (CM) 16a and 16b, a first memory data manager 18 (e.g., TIMOS Data Manager (DMT) from Portal Software, Inc.), and one or more second memory data managers 20a and 20b (e.g., Oracle Data Manager (DM Oracle). The second memory data managers 20a and 20b can communicate with the database system 12 or other second memory system. The database system 12 can have one or more database clusters 22a and 22b (e.g., Oracle Real Application Clusters), for example, providing high availability and scalability for databases running on the cluster. The database clusters 22a and 22b can support one or more databases 24.


The business logic module can be accessed via the gateway 8 and/or via a manual access application 26. The manual access application 26 can be operated manually or automatically. The manual access application 26 can be configured, for example, to be used by billing software to generate invoices, and/or by a customer service representative to check on account status, and/or by the account-holder to check account status.


The revenue management system 100 can have a first memory (e.g., TIMOS) and a second memory (e.g., database). The first memory can be, for example, in and/or in communication with the first memory data manager 18. The first memory can be configured to have faster, slower, and/or the same read, and/or write, and/or re-write speeds (e.g., access speeds) as the second memory. The first memory can be an in-memory data store and database cache dedicated to high-speed rating and authorization requirements.


The first memory can be solid state memory, such as system memory (e.g., RAM) or one or more hard drives, for example with fast access speeds. Requests for data in the first memory can be processed faster than requests for data in a second memory.


The first data in a first data object can be stored in the first memory in the format used by the business logic module 10 (e.g., Portal Infranet, Portal Software, Inc.). The first data can be left untranslated before storage in the first memory. The internal search and storage algorithms can be optimized for in-first-memory data. Storing the first data in the first memory can, for example, eliminate the round trip to the second memory (e.g., one or more databases, such as on database servers), and can speed the process of storing, editing and/or querying the first data. Object creation or updates for the first data objects can require no access of the second memory. Updates for the first data objects can be performed in the first memory. The system can have, for example, a reduced throughput and/or latency.


The first memory data objects (e.g., transient objects) can be stored in the first memory and/or the second memory. For example, the first memory data objects can be stored not in the database and not be persisted in the first memory. The first memory objects can, for example, exist only in the process heap memory of the first memory. The first memory objects can be, for example, managed in a transactional manner (e.g., like the other memory objects).


First memory data objects can be removed from the first memory by shutdown of the first memory or the business logic executing a delete operation on the first memory data object. The store for first memory data objects can be a fixed size, for example, determined during startup of the first memory process.


The first memory data manager 18 can be configured to improve access times and latency on moving and/or writing and/or editing and/or deleting and/or querying objects.


The second memory can be in and/or in communication with the second memory data manager 20. Requests for second memory data objects can be sent to the second memory data manager 20. The second memory, for example, can be a disk-based (e.g., on one or more hard drives) database. The database can be a relational database (RDBMS).


The system can have low access second memory data objects (e.g., database-only objects). The low access second memory data objects can be stored primarily and/or exclusively in the second memory (e.g., one or more databases). The low access second memory data objects can be stored in the first memory none of the time, or some of the time.


The first memory data manager can access the low access second memory data object type via a pass-through mode. For example, requests can be forwarded to the second memory data manager (e.g., DM-Oracle), and responses can be forwarded back to the first memory data manager.


The high access second memory data objects (e.g., reference objects) can be updated seldom and not during high-speed session processing. The high access second memory data objects can be stored (cached) in a first memory reference object cache (ROC). The high access second memory data objects can grow in number in relation to growth in the subscriber base.


The high access second memory data objects can exist in the first memory an equal amount of time as length of the first memory process. A newly started first memory instance can contain no high access second memory data objects.


Updating and creating high access second memory data objects can be performed in the second memory and in the first memory in the high access second memory data objects can be updated or created asynchronously or synchronously in the second memory and the first memory.


The high access second memory data objects can be static or dynamic. The static high access second memory data objects can be queried, updated, created, or deleted at irregular intervals. The static high access second memory data objects can be, for example, subscriber information such as the list of subscribed services and the chosen tariff plans.


The dynamic high access second memory data objects can be touched (e.g., queried, updated, created, deleted) after the completion of each session. The dynamic high access second memory data objects can be, for example, the monetary and non-monetary balances belonging to a subscriber account.


A standby-first memory (e.g., for a high availability variation that can have an active first memory and a backup, standby first memory) can preload the static high access second memory data objects. Changes of static reference objects can be propagated from the active first memory to the standby first memory.


The gateway 8 can directly communicate with the business logic module 10. For example, during a customer's use of the telecommunication network, the gateway 8 can communicate with a first connection manager (CM) 16a. The gateway 8 can pass requests to the CM 16a, for example, calling the appropriate business logic routines depending on the type of request that is indicated from the IN SCP 14. The gateway 8 can be nearly stateless. The gateway 8 can provide fast failover capabilities, for example, accompanied by a degraded mode of operation that is used when the lower architecture layers become unavailable. The gateway 8 can perform authentication, authorization and accounting procedures.


Events received by the CM can be rated via an embedded rating engine using the data provided from the first memory data manager 18 (e.g., DM TIMOS cache) and the database system 12. The rating engine can produce rates for customer use of the telecommunications network under the specific conditions that apply (e.g., time of day, day of week, network used). The rating engine can cache pricing objects itself, for example, in order to reduce the number of network roundtrips necessary to complete the rating phase. The rating engine can perform zoning and discounting rating.


Based on the object type, the first memory data manager 18 can pass the request to the database system 12, query the first memory data manager 18 reference object cache or accesses the first memory (e.g., in-memory store) for transient objects. The object types and their locations can be defined in a business logic database (e.g., Infranet Data Dictionary by Portal Software, Inc.), which can be in the database system 12. Traffic for objects not in the first memory can be allowed to bypass the by accessing the database manager 20, for example, in the same way a commonly used system without the first data manager would be configured. The data integrity of the first memory can be ensured by a platform-managed synchronization mechanism that can propagate the necessary updates to the first memory. The first memory can have one or more caches.



FIGS. 4
a and 4b illustrate variations of the revenue management system 100. The gateway 8 can act as a high-speed protocol translator as well as an SLA monitor with fallback capabilities. The CM 16 can receive requests from the gateway 8. The CM 16 can have the authorization, authentication and accounting business logic (e.g., for delivery to the gateway 8). The CM 16 can call operational codes on the first data manager 18. The CM 16 can be replaced with another client, such as a migration tool. The CM 16 can have a realtime pipeline (RTP) 28. The RTP 28 can be configured to adjust the rating, for example by discounting and zoning the rate. The RTP 28 can be optionally used by the CM 16 while rating.


The first data manager 18 can have a data migratory subsystem 30. The data manager subsystem 30 can be used to fill the high access second memory object cache after start or fail over.


The first data manager 18 can have a directory server 32. The directory server 32 can be configured to identify the correct first memory/second memory combinations in scaled scenarios with more second memory instances than first memory instances or more first memory instances than second memory instances. The directory server 32 can enable the gateway instances and CM instances to be independent of the number of first memory instances. The number and location of gateway and CM processes can be flexibility and scalability with respect to the number and location of first memory instances.



FIG. 4
a shows that the elements of the architecture of the business logic module can all be standalone. FIG. 4b illustrates that the numerous elements of the architecture can be integrated.



FIG. 5 illustrates that the first memory 102 can have a reference object cache (ROC) 34 and a transient object store (TOC) 36. The ROC 34 can be managed by a separate set of rules than the TOC 36. The ROC 34 and the TOC 36 can be in the same or different parts of the first memory 102. The first memory 102 can be part of, or separate but in communication with, the first memory data manager 18. The ROC 34 can be configured to cache high access second memory data objects (e.g., reference objects). The TOC 36 can be configured to store first memory data objects (e.g., transient objects).



FIG. 6 illustrates a method for accessing a first memory data in the TOC 36. The CM 16 can send, shown by arrow 38, a request to the first data manager 18. The request can apply to the first memory data. The first data manager 18 can analyze the request 38. The first data manager 18 can conclude that the request applies to the first memory. The first data manager 18 can apply or execute the request on the TOC 36. The first data manager 18 can generate a reply and send, shown by arrow 40, the reply to the CM 16.



FIG. 7 illustrates flows of various requests from the CM 16 and the replies to the requests. The instructions are shown as create, update, delete and search/read (i.e., query). The request from the CM 16 can be, respectively, create the first data object, update the first data object, delete the first data object, and search/read the first data object. (The numbers of the requests and replies illustrate an exemplary chronological order.) The first data manager 18 can convert or otherwise translate the request from the CM 16 to a first data manager instruction, such as add the first data object, change the first data object, remove the first data object, and find the first data object, respectively. The first data manager 18 can apply or execute the first data manager instruction on the TOC 36. The first data manager 18 can then return a reply. The replies can include the data searched, and/or confirmation that the task was completed successfully, and/or an error code and or error explanation.



FIG. 8 illustrates a method for accessing high access memory data in the ROC 34 and in the database system 12. The CM 16 can send, shown by arrow 38, a request to the first data manager 18. The request can apply to the high access second memory data. The first data manager 18 can analyze the request 38. The first data manager 18 can conclude that the request applies to the high access second memory data. The first data manager 18 can determine whether the high access second memory data is in the ROC 34. If the first data manager 34 determines that the high access second memory data is in the ROC 34, the first data manager 18 can apply or execute the request on the high access second data in the ROC 34. The first data manager 18 can send the request to the second data manager 20. The second data manager 20 can apply or execute the request on the high access second data in the database system 12. The database system 12 and/or the second data manager 20 and/or the first data manager 18 can generate one or more replies. The replies can be sent, shown by arrow 40, directly or via the first data manager 18 to the CM 16.



FIG. 9 illustrates flows of various requests from the CM and the replies to the requests. The exemplary instructions are shown as create, update, delete, simple and complex searches/reads (i.e., query). The request from the CM 16 can be, respectively, create the first data object, update the first data object, delete the first data object, and search/read the first data object. (The numbers of the requests and replies illustrate an exemplary chronological order.) The first data manager 20 can convert or otherwise translate the request from the CM 16 to a first data manager instruction, such as add the first data object, change the first data object, remove the first data object, and find the first data object, respectively. The first data manager can then apply or execute the translated request on the high access second data in the ROC 34.


The first data manager 18 can send the request to the second data manager 20 and/or the CM 16 can send the request directly to the second data manager 20. The second data manager 20 can convert or otherwise translate the request to a second data manager instruction, such as insert the row of data, update the row of data, delete the row of data, and select the row or rows of data, respectively (with no response shown for a simple search/read, although the second data manager can perform simple searching). The second data manager 20 can apply or execute the request on the high access second data in the database system 12. The second data manager 20, and/or the database system 12 and/or the first data manager 20 can then return a reply. The replies can include the data searched, and/or confirmation that the task was completed successfully, and/or an error code and or error explanation.



FIG. 10 illustrates a method for accessing low access memory data in the database system 12. The CM 16 can send, shown by arrow 38, a request to the first data manager 18, and/or directly to the second data manager 18. The request can apply to the high access second memory data. The first data manager 18 can analyze the request 38. The first data manager 18 can conclude that the request applies to the low access second memory data. The first data manager 18 can send the request to the second data manager 20. The second data manager 20 can apply or execute the request on the high access second data in the database system 12. The database system 12 and/or the second data manager 20 can generate one or more replies. The replies can be sent, shown by arrow 40, directly or via the first data manager 18 to the CM 16.



FIG. 11 illustrates flows of various requests from the CM and the replies to the requests. The exemplary instructions are shown as create, update, delete, and searches/read (i.e., query). The request from the CM 16 can be, respectively, create the first data object, update the first data object, delete the first data object, and search/read the first data object. (The numbers of the requests and replies illustrate an exemplary chronological order.) The first data manager 18 can send the request to the second data manager 20. The second data manager 20 can convert or otherwise translate the request to a second data manager instruction, such as insert the row of data, update the row of data, delete the row of data, and select the row or rows of data, respectively. The second data manager 20 can apply or execute the request on the high access second data in the database system 12. The second data manager 20, and/or the database system 12 and/or the first data manager 20 can then return a reply. The replies can include the data searched, and/or confirmation that the task was completed successfully, and/or an error code and or error explanation.


The CM 16 can send requests directly to the desired data manager 18 or 20 and/or the CM 16 can tag the request and the first data manager 18 can analyze the tag to determine whether to apply and/or execute the request and/or whether to send the request to the second data manager. The tag can be the substance of the request (i.e., the requested action) and/or additional data solely to communicate the desired final location of the request.


The first memory data objects of this category can be created, updated or deleted in the high-speed access path of the revenue management system 100. Examples of the first memory data objects include active session objects and resource reservation objects.


The first memory data objects can be analyzed using, for example, logical predicates (e.g., equals, not equals). Queries executed on first memory data can specify an index to use to satisfy the query. The index can be a hash to enable fast value lookup. The index can be a single column index. Predicates on other columns can be supported by filtering the result set to find matches.


Requests for the first memory data objects can be passed to a standard heap memory area. The requests can be created, changed and deleted within transactions.


The first memory data objects can be limited to particular object, such as business object types.


The high access second memory data objects can be accessed only in a read-only mode in the high-speed access path. An example of the high access second memory data objects is customer account information.


The ROC 34 can be filled on demand. This means that requests can be redirected to the database system 12 if the high access second memory data object is not found in the ROC 34. If the request is a read of an entire object, the ROC 34 can be filled or cached by the reply (e.g., as the reply passes through the first data manger 18 on the reply's route back to the CM 16 from the second data manager 20). Partial object requests (‘read_fields’) of the high access second memory data objects can be cached in a similar manner to that performed for the entire object.


The high access second memory data objects can be fully queried. Simple queries involving basic logical operators (e.g., equals, not equals) can be performed by the first data manager 18 on the high access second memory data objects in the ROC 34. Complex queries (e.g., involving joins to other objects, or operators such as ‘like’ or ‘in’) can be performed by the second data manager 20 on the high access second memory data objects in the database system 12.


The dynamic high access second memory data objects can be loaded by the data migrator 30 after a failover.


The static high access second memory data objects can be loaded by the data migrator 30 immediately after the backup first memory system has been started. The static high access second memory data objects can be synchronized with the database via the first memory synchronization system.


The low access second memory data objects can be absent from the first memory. Requests for the low access second memory data objects can be routed directly from first data manager 18 to the second data manager 20. The low access second memory data objects can be fully queried.


The first data manager can allow reading of the first data values during a write operation. The first data manager can have the write operation take place on a scratchpad of data that is only visible to the writing transaction. The first data manager can serialize the first data while the update is moved to main memory at the commit time.


The first data manager can have a read committed isolation. The read committed isolation makes all committed updates available to transactions even if the commit takes place after the transaction is started. Read committed isolation can prevent “dirty” reads (i.e., the first data manager preserves the earlier first data value for reading during pending changes to the first data value).


The first data manager can support or not support statement or transaction level consistent reads.


The revenue management system 100 can be configured to route any traffic not related to session handling can be routed to and/or away from the first memory data manager 18. A synchronization system can be used to send updates to the first memory data manager 18. The synchronization system can automatically propagate changes affecting objects stored in the first memory to all the first memory instances caching the particular object or object type.


The revenue management system 100 can have a convergence system. The convergence system can load batch data via the first data manager 18 into the revenue management system 100, for example, to share any data of batch origin, such as balances between prepaid and postpaid accounts.


The data capacity of a first memory instance can be lower than data the capacity of a second memory (e.g., database) instance. One second memory instance can support several shared-nothing instances of the first memory. (The commonly used term is m:n (m—first memory instances/n—second memory instances)).


The first memory data manager 18 can reduce the latency for objects first memory data manager 18 handles, and at the same time enabling increased throughput of the system 100.


For installation of first memory data manager 18, the first memory data manager 18 can be configured to be inserted between the CM 16 component and second memory data manager 20 component. The introduction of the first memory data manager 18 can change the access characteristics of some object types for a pre-existing revenue management system that did not have the first memory data manager 18. Installation of the first memory data manager 18 can be configured to be transparent (e.g., not change object types). The system 100 can be configured so that the higher-level business logic architecture layers cannot tell first memory data manager 18 is present. However, the business logic can be changed to utilize the first memory data manager 18. These changes can be ignored by the system 100 if the first memory data manager 18 is not present.


The first memory data manager 18 can be installed in an existing revenue management system. For example, the first memory data manager 18 can be physically installed (e.g., mounting hardware and/or loading software onto the appropriate computer-readable medium) and the base software can be configured.


After the installation of the base software, the first data can then be migrated into the first memory data manager 18. The first memory data object residencies stored in the data dictionary can take effect, loading the first data onto the first data manager 18 during use. The residencies can be part of the default business logic module 10 installation (having no effect when the first memory data manager 18 is not present) or can be loaded onto the business logic module 10 during the installation of the first memory data manager 18.


Reference objects can be migrated by loading into the first data manager 18 when accessed for the first time and/or pushed into the first memory data manager 18 by the data migratory 30.


Data objects can be redefined as first memory data objects (or low access or high access second memory data objects) by deploying the data object via the normal mechanism, and then updating the residency type in the data dictionary.


After a process startup, the first memory data manager 18 can have an empty ROC 34. A separate data migration thread can push all high access second memory data in the ROC 34. The static high access second memory data objects can be loaded into the ROC 34. For example, a first memory data manager 18 in backup mode can load only the static high access second memory data objects into the ROC 34.


The data migrator 30 can provide a notification hook to signal the end of the migration and/or startup phase to other processes. The first memory data manager 18 can be operational immediately after start (e.g., before the migratory tool sends the notification hook), for example, with an empty cache. The first request after startup for a specific first data object can trigger that first data object to be loaded into the cache (e.g., if the data migrator 30 has not yet loaded the desired first data object already).


Upon a system shutdown, the first data manager 18 can close the process log file, and release used memory. The high access second memory data objects can be unaffected by shutdown (e.g., remaining stored on the second memory).


The revenue management system 100 can provide hooks to verify and monitor performance. The revenue management system 100 can log performance data on a regular basis and/or make performance data available via an embedded web server. A signal can be sent to the second memory data manager to collect desired data (e.g., for some parts of the system).


The revenue management system 100 can create system logs that can monitor operation of the revenue management system 100. A log monitoring GUI (e.g., Pipeline log viewer) can be used. Business logic style pin-logging can, for example, aid debugging and diagnosis.


The first memory data manager 18 can have a pipeline framework tracing model. Additional trace information can be collected from subsystems of the revenue management system 100 on a case by case basis.



FIGS. 12
a, 12b and 12c illustrate that the revenue management system 100 can be scalable to large scale expansion.


The revenue management system 100 can have multiple second memory locations (e.g., databases 24a, 24b and 24c). The revenue management system 100 can have separate instances of the first memory data manager 18a-18i, and the second memory data manager 20a-201. Pairs of sets of first memory data managers and second memory data manager, for example, 18a, 18b, 20a, and 20b can be formed into high availability (HA) pairs 42. The HA pairs 42 can have active and backup first data managers 18a and 18b, respectively, for example, and active and backup second data managers 20a and 20b, respectively, for example.


The revenue management system 100 can have a capacity partitioning scheme.


Each second memory (e.g., database 24) instance can be associated (i.e., in communication) with one or more first memory data manager 18 instances. The revenue management system can be configured so no data is stored in overlapping second memory instances (n Timos instances: 1 database). The business logic module can have several, independent databases (m). The combination of TIMOS/databases can be referred to as m:n configuration.


The CM 16a-16e can lookup in the directory server 32 to identify the first memory data manager 18 and second memory data manager 20 (or database 24) combination applicable for a certain object.


The revenue management system 100 can have account migration tools. The account migration tools can move subscriber data from one first and/or second memory location (e.g., database 24 and/or first memory data manager 18) to another first and/or second memory location.


Multiple second memory data managers 20 can communicate with the same database clusters 22. All the databases can be managed with one database cluster 22 (e.g., one RAC cluster) (not shown).


The SCPs 14, gateways 8 and CMs 16 can each be associated to multiple first. memory data managers 18. The gateway 8 can support load balancing over several CMs 16. The CMs 16 can use the directory server 32 to route the requests to the correct first memory data managers 18.


The database system 12 can run multiple database schemes in one RAC cluster 22. The revenue management system 100 can be configured to associate a dedicated set of resources to just one SCP 14 or group of SCPs 14.



FIG. 12
b illustrates that the first memory data managers 18c and 18d can communicate directly with the database system 12, for example with the database clusters 22a and 22b.



FIG. 12
c illustrates that the revenue management system can have two or more database systems 12a and 12b.



FIG. 13 illustrates a failure protection scheme with a high availability monitor 44 regularly checking the status of the control manager, the first memory in the first memory data manager 18, the second memory data manager 20, the database cluster, and the database 24.



FIG. 14 illustrates a self-contained failure protection system. Each component of the revenue management system 100 can check on the status of its immediately downstream component (e.g., the second memory data manager 20 is immediately downstream of the first memory data manager 18). If the immediately downstream component has failed, or is sending a failure message regarding a further downstream component failure, the revenue management system can take appropriate action, including alerting a user that a failure has occurred. The revenue management system 100 can be absent of a separate monitor component checking for system failures.


The revenue management system 100 can have a high availability. The revenue management system 100 can have a warm standby operation by referring to any data remaining in the first memory (e.g., TIMOS). During warm standby, in the case of a loss of data (e.g., during a system failure), the revenue management system 100 can recreate data from the switch 6 and/or the first memory when the switch 6 sends re-authorization data (e.g., during long calls) or end-of-call data. The database system 24 can store the latest static high access second memory data before a loss of data. The static high access second memory data can be recovered to the first memory from the database system 24 after a loss of data in the first memory.


In the revenue management system 100, higher layers (i.e., more stable during a system failure, such as the database) of architecture with very high availabilities can partially or completely backup lower layers (i.e., less stable during a system failure, such as a solid state RAM variation of the first memory) with lesser availabilities in case of failures.


The revenue management system 100 can have spare, unused hardware and software such as backup data managers in the high availability pairs 42, as shown in FIGS. 12a through 12c. The high availability pair 42 can have active and a backup first data managers 18 and active and backup second data managers 20. The backup data managers can copy from the respective active data managers, for example during a period of no other activity with the active data manager and/or from a sketchpad, and/or the last available data from the active data manager. In case of failure of an element, the backup or other inactive elements will be able to restore data and/or take over the additional load.


U.S. patent application Ser. No. 10/394,409 filed 21 Mar. 2003, and U.S. patent application Ser. No. 11/478,558 filed 28 Jun. 2006 are incorporated by reference herein in their entireties.


Accessing can include querying, updating, creating, deleting and combinations thereof. Querying, updating, creating, and deleting for any data can be interchanged with each other as disclosed.


It is apparent to one skilled in the art that various changes and modifications can be made to this disclosure, and equivalents employed, without departing from the spirit and scope of the invention. System and architecture are used as interchangeable terms, both referring to one or more hardware and software components in communication. All elements shown herein can be software and/or hardware components. Elements shown with any embodiment are exemplary for the specific embodiment and can be used on other embodiments within this disclosure.

Claims
  • 1. A computer-based telecommunications network account management system comprising: a first memory having a first memory access speed and storing one or more transient objects related to a communication on the telecommunications network, wherein the first memory manages the transient objects per communication and wherein the transient objects are not persisted;a second memory having a second memory access speed and storing one or more reference objects related to the communication, wherein the second memory persists the reference objects; anda first memory manager configured to route a first request for a first object to the first memory, and configured to route a second request for a second object not to the first memory,wherein the first memory has a faster access speed than the second memory, wherein routing the first request for the first object to the first memory and routing the second request for the second object to the second memory are performed based on an object type for each of the first object and the second object and wherein the object types for the first object and the second object are defined in a user defined data dictionary stored in the second memory and wherein the data dictionary stores a user defined object type for the first object and a user defined object type for the second object.
  • 2. The system of claim 1, further comprising a second memory manager configured to route the second object to the second memory.
  • 3. The system of claim 1, wherein the second memory comprises a hard drive.
  • 4. The system of claim 1, wherein the first memory comprises solid state memory.
  • 5. The system of claim 1, wherein the first memory comprises Random Access Memory (RAM).
  • 6. The system of claim 1, wherein the second memory comprises a relational database.
  • 7. The system of claim 1, further comprising a database cluster.
  • 8. The system of claim 1, further comprising a gateway configured to interface with a telecommunications network.
  • 9. The system of claim 1, wherein the first request comprises a query.
  • 10. The system of claim 9, wherein the second request comprises a query.
  • 11. The system of claim 1, wherein the first request comprises a request to write.
  • 12. The system of claim 11, wherein the second request comprises a request to write.
  • 13. The system of claim 1, wherein the object type for the first object comprises a transient object.
  • 14. The system of claim 13, wherein the object type for the second object comprises a reference object.
  • 15. A method for managing a telecommunications network account, the method comprising: storing in a first memory having a first memory access speed one or more transient objects related to a communication on the telecommunications network, wherein the first memory manages the transient objects per communication and wherein the transient objects are not persisted;storing in a second memory having a second memory access speed one or more reference objects related to the communication, wherein the second memory persists the reference objects;routing by a first memory manager a first request for a first object to the first memory; androuting by the first memory manager a second request for a second object not to the first memory,wherein the first memory has a faster access speed than the second memory, wherein routing the first request for the first object to the first memory and routing the second request for the second object to the second memory are performed based on an object type for each of the first object and the second object and wherein the object types for the first object and the second object are defined in a user defined data dictionary stored in the second memory and wherein the data dictionary stores a user defined object type for the first object and a user defined object type for the second object.
  • 16. The method of claim 15, further comprising routing by a second memory manager the second object to the second memory.
  • 17. The method of claim 15, wherein the second memory comprises a hard drive.
  • 18. The method of claim 15, wherein the first memory comprises solid state memory.
  • 19. The method of claim 15, wherein the first memory comprises Random Access Memory (RAM).
  • 20. The method of claim 15, wherein the second memory comprises a relational database.
  • 21. The method of claim 15, wherein the first request comprises a query.
  • 22. The method of claim 21, wherein the second request comprises a query.
  • 23. The method of claim 15, wherein the first request comprises a request to write.
  • 24. The method of claim 23, wherein the second request comprises a request to write.
  • 25. The method of claim 15, wherein the object type for the first object comprises a transient object.
  • 26. The method of claim 25, wherein the object type for the second object comprises a reference object.
  • 27. A computer-readable memory having stored thereon a sequence of instruction which, when executed by a processor, cause the processor to manage a telecommunications network account by: storing in a first memory having a first memory access speed one or more transient objects related to a communication on the telecommunications network, wherein the first memory manages the transient objects per communication and wherein the transient objects are not persisted;storing in a second memory having a second memory access speed one or more reference objects related to the communication, wherein the second memory persists the reference objects;routing by a first memory manager a first request for a first object to the first memory; androuting by the first memory manager a second request for a second object not to the first memory,wherein the first memory has a faster access speed than the second memory, wherein routing the first request for the first object to the first memory and routing the second request for the second object to the second memory are performed based on an object type for each of the first object and the second object and wherein the object types for the first object and the second object are defined in a user defined data dictionary stored in the second memory and wherein the data dictionary stores a user defined object type for the first object and a user defined object type for the second object.
  • 28. The computer-readable memory of claim 27, further comprising routing by a second memory manager the second object to the second memory.
  • 29. The computer-readable memory of claim 27, wherein the second memory comprises a hard drive.
  • 30. The computer-readable memory of claim 27, wherein the first memory comprises solid state memory.
  • 31. The computer-readable memory of claim 27, wherein the first memory comprises Random Access Memory (RAM).
  • 32. The computer-readable memory of claim 27, wherein the second memory comprises a relational database.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 60/703,687 filed 28 July 2005 which is herein incorporated by reference in its entirety.

US Referenced Citations (252)
Number Name Date Kind
4430530 Kandell et al. Feb 1984 A
4831582 Miller et al. May 1989 A
4849884 Axelrod et al. Jul 1989 A
4868743 Nishio Sep 1989 A
4918593 Huber Apr 1990 A
4968873 Dethloff et al. Nov 1990 A
5006978 Neches Apr 1991 A
5010485 Bigari Apr 1991 A
5036389 Morales Jul 1991 A
5043872 Cheng et al. Aug 1991 A
5163148 Walls Nov 1992 A
5212787 Baker et al. May 1993 A
5220501 Lawlor et al. Jun 1993 A
5224034 Katz et al. Jun 1993 A
5241670 Eastridge et al. Aug 1993 A
5291583 Bapat Mar 1994 A
5295256 Bapat Mar 1994 A
5305389 Palmer Apr 1994 A
5313664 Sugiyama et al. May 1994 A
5386413 McAuley et al. Jan 1995 A
5426780 Gerull et al. Jun 1995 A
5448623 Wiedeman et al. Sep 1995 A
5448727 Annevelink Sep 1995 A
5450477 Amarant et al. Sep 1995 A
5452451 Akizawa et al. Sep 1995 A
5469497 Pierce et al. Nov 1995 A
5475585 Bush Dec 1995 A
5475838 Fehskens et al. Dec 1995 A
5483445 Pickering Jan 1996 A
5495609 Scott Feb 1996 A
5499367 Bamford et al. Mar 1996 A
5499371 Henninger et al. Mar 1996 A
5504885 Alashqur Apr 1996 A
5506966 Ban Apr 1996 A
5517555 Amadon et al. May 1996 A
5523942 Tyler et al. Jun 1996 A
5530853 Schell et al. Jun 1996 A
5544302 Nguyen Aug 1996 A
5548749 Kroenke et al. Aug 1996 A
5555444 Diekelman Sep 1996 A
5560005 Hoover et al. Sep 1996 A
5579375 Ginter Nov 1996 A
5590395 Diekelman et al. Dec 1996 A
5613012 Hoffman et al. Mar 1997 A
5615109 Eder Mar 1997 A
5615249 Solondz Mar 1997 A
5615362 Jensen et al. Mar 1997 A
5627979 Chang et al. May 1997 A
5644736 Healy et al. Jul 1997 A
5649118 Carlisle et al. Jul 1997 A
5666648 Stuart Sep 1997 A
5677945 Mullins et al. Oct 1997 A
5684965 Pickering Nov 1997 A
5694598 Durand et al. Dec 1997 A
5706516 Chang et al. Jan 1998 A
5717924 Kawai Feb 1998 A
5732400 Mandler et al. Mar 1998 A
5737414 Walker et al. Apr 1998 A
5745754 Lagarde et al. Apr 1998 A
5765159 Srinivasan Jun 1998 A
5778189 Kimura et al. Jul 1998 A
5797137 Golshani et al. Aug 1998 A
5799072 Vulcan et al. Aug 1998 A
5799087 Rosen Aug 1998 A
5806061 Chaudhuri et al. Sep 1998 A
5809503 Aoshima Sep 1998 A
5822747 Graefe et al. Oct 1998 A
5832068 Smith Nov 1998 A
5842220 De Groot et al. Nov 1998 A
5845206 Castiel et al. Dec 1998 A
5845274 Chadha et al. Dec 1998 A
5850544 Parvathaneny et al. Dec 1998 A
5852820 Burrows Dec 1998 A
5854835 Montgomery et al. Dec 1998 A
5864845 Voorhees et al. Jan 1999 A
5870473 Boesch et al. Feb 1999 A
5870724 Lawlor et al. Feb 1999 A
5873093 Williamson et al. Feb 1999 A
5875435 Brown Feb 1999 A
5883584 Langemann et al. Mar 1999 A
5884290 Smorodinsky et al. Mar 1999 A
5893108 Srinivasan et al. Apr 1999 A
5898762 Katz Apr 1999 A
5909440 Ferguson et al. Jun 1999 A
5913164 Pawa et al. Jun 1999 A
5915253 Christiansen Jun 1999 A
5920629 Rosen Jul 1999 A
5924094 Sutter Jul 1999 A
5937406 Balabine et al. Aug 1999 A
5960416 Block Sep 1999 A
5963648 Rosen Oct 1999 A
5966649 Gulliford et al. Oct 1999 A
5970417 Toyryla et al. Oct 1999 A
5974407 Sacks Oct 1999 A
5974441 Rogers et al. Oct 1999 A
5974506 Sicola et al. Oct 1999 A
5983223 Perlman Nov 1999 A
5987233 Humphrey Nov 1999 A
6005926 Mashinsky Dec 1999 A
6011795 Varghese et al. Jan 2000 A
6012057 Mayer et al. Jan 2000 A
6016341 Lim Jan 2000 A
6021409 Burrows Feb 2000 A
6032132 Nelson Feb 2000 A
6035326 Miles et al. Mar 2000 A
6047067 Rosen Apr 2000 A
6047267 Owens et al. Apr 2000 A
6047284 Owens et al. Apr 2000 A
6058173 Penfield et al. May 2000 A
6058375 Park May 2000 A
6061679 Bournas et al. May 2000 A
6061763 Rubin et al. May 2000 A
6067574 Tzeng May 2000 A
6070051 Astrom et al. May 2000 A
6075796 Katseff et al. Jun 2000 A
6078897 Rubin et al. Jun 2000 A
6092055 Owens et al. Jul 2000 A
6112190 Fletcher et al. Aug 2000 A
6112304 Clawson Aug 2000 A
6141759 Braddy Oct 2000 A
6154765 Hart Nov 2000 A
6170014 Darago et al. Jan 2001 B1
6185225 Proctor Feb 2001 B1
6185557 Liu Feb 2001 B1
6223172 Hunter et al. Apr 2001 B1
6236972 Shkedy May 2001 B1
6236988 Aldred May 2001 B1
6243760 Armbruster et al. Jun 2001 B1
6266660 Liu et al. Jul 2001 B1
6311185 Markowitz et al. Oct 2001 B1
6311186 MeLampy et al. Oct 2001 B1
6314365 Smith Nov 2001 B1
6321205 Eder Nov 2001 B1
6341272 Randle Jan 2002 B1
6347340 Coelho et al. Feb 2002 B1
6351778 Orton et al. Feb 2002 B1
6356897 Gusack Mar 2002 B1
6377938 Block et al. Apr 2002 B1
6377957 Jeyaraman Apr 2002 B1
6381228 Prieto et al. Apr 2002 B1
6381605 Kothuri et al. Apr 2002 B1
6381607 Wu et al. Apr 2002 B1
6400729 Shimadoi et al. Jun 2002 B1
6400925 Tirabassi et al. Jun 2002 B1
6401098 Moulin Jun 2002 B1
6415323 McCanne et al. Jul 2002 B1
6427172 Thacker et al. Jul 2002 B1
6429812 Hoffberg Aug 2002 B1
6442652 Laboy et al. Aug 2002 B1
6446068 Kortge Sep 2002 B1
6477651 Teal Nov 2002 B1
6481752 DeJoseph Nov 2002 B1
6490592 St. Denis et al. Dec 2002 B1
6494367 Zacharias Dec 2002 B1
6529915 Owens et al. Mar 2003 B1
6532283 Ingram Mar 2003 B1
6553336 Johnson et al. Apr 2003 B1
6563800 Salo et al. May 2003 B1
6564047 Steele et al. May 2003 B1
6564247 Todorov May 2003 B1
6567408 Li et al. May 2003 B1
6658415 Brown et al. Dec 2003 B1
6658463 Dillon et al. Dec 2003 B1
6662180 Aref et al. Dec 2003 B1
6662184 Friedberg Dec 2003 B1
6678675 Rothrock Jan 2004 B1
6700869 Falco et al. Mar 2004 B1
6725052 Raith Apr 2004 B1
6735631 Oehrke et al. May 2004 B1
6901507 Wishneusky May 2005 B2
6907429 Carneal et al. Jun 2005 B2
6947440 Chatterjee et al. Sep 2005 B2
6950867 Strohwig et al. Sep 2005 B1
6973057 Forslow Dec 2005 B1
6999569 Risafi et al. Feb 2006 B2
7003280 Pelaez et al. Feb 2006 B2
7058773 Frye et al. Jun 2006 B1
7089262 Owens et al. Aug 2006 B2
7181537 Costa-Requena et al. Feb 2007 B2
7233918 Ye et al. Jun 2007 B1
7246102 McDaniel et al. Jul 2007 B2
7257611 Shankar et al. Aug 2007 B1
7391784 Renkel Jun 2008 B1
7395262 Rothrock Jul 2008 B1
7406471 Shankar et al. Jul 2008 B1
7729925 Maritzen et al. Jun 2010 B2
7792714 Mills et al. Sep 2010 B1
6041323 Kubota Mar 2011 A1
20010005372 Cave et al. Jun 2001 A1
20010025273 Walker et al. Sep 2001 A1
20010034704 Farhat et al. Oct 2001 A1
20010056362 Hanagan et al. Dec 2001 A1
20020059163 Smith May 2002 A1
20020073082 Duvillier et al. Jun 2002 A1
20020082881 Price et al. Jun 2002 A1
20020087469 Ganesan et al. Jul 2002 A1
20020106064 Bekkevold et al. Aug 2002 A1
20030014361 Klatt et al. Jan 2003 A1
20030014656 Ault et al. Jan 2003 A1
20030061537 Cha et al. Mar 2003 A1
20030076940 Manto Apr 2003 A1
20030078056 Takatori et al. Apr 2003 A1
20030097547 Wishneusky May 2003 A1
20030105799 Kahn et al. Jun 2003 A1
20030118039 Nishi et al. Jun 2003 A1
20030133552 Pillai et al. Jul 2003 A1
20030172145 Nguyen Sep 2003 A1
20030202521 Havinis et al. Oct 2003 A1
20030202638 Eringis et al. Oct 2003 A1
20040002918 McCarthy et al. Jan 2004 A1
20040018829 Raman et al. Jan 2004 A1
20040062106 Ramesh et al. Apr 2004 A1
20040073500 Owen et al. Apr 2004 A1
20040132427 Lee et al. Jul 2004 A1
20040153407 Clubb et al. Aug 2004 A1
20050018689 Chudoba Jan 2005 A1
20050026558 Stura et al. Feb 2005 A1
20050033847 Roy Feb 2005 A1
20050036487 Srikrishna Feb 2005 A1
20050065880 Amato et al. Mar 2005 A1
20050075957 Pincus et al. Apr 2005 A1
20050091156 Hailwood et al. Apr 2005 A1
20050107066 Erskine et al. May 2005 A1
20050113062 Pelaez et al. May 2005 A1
20050120350 Ni et al. Jun 2005 A1
20050125305 Benco et al. Jun 2005 A1
20050144099 Deb et al. Jun 2005 A1
20050187841 Grear et al. Aug 2005 A1
20050238154 Heaton et al. Oct 2005 A1
20060010057 Bradway et al. Jan 2006 A1
20060015363 Allu et al. Jan 2006 A1
20060035637 Westman Feb 2006 A1
20060045250 Cai et al. Mar 2006 A1
20060056607 Halkosaari Mar 2006 A1
20060148446 Karlsson Jul 2006 A1
20060168303 Oyama et al. Jul 2006 A1
20060190478 Owens et al. Aug 2006 A1
20060248010 Krishnamoorthy et al. Nov 2006 A1
20060251226 Hogan et al. Nov 2006 A1
20070091874 Rockel Apr 2007 A1
20070100981 Adamczyk et al. May 2007 A1
20070110083 Krishnamoorthy et al. May 2007 A1
20070133575 Cai et al. Jun 2007 A1
20070198283 Labuda Aug 2007 A1
20070288367 Krishnamoorthy et al. Dec 2007 A1
20070288368 Krishnamoorthy et al. Dec 2007 A1
20080033873 Krishnamoorthy et al. Feb 2008 A1
20080033874 Krishnamoorthy et al. Feb 2008 A1
20080040267 Krishnamoorthy et al. Feb 2008 A1
20080126230 Bellora et al. May 2008 A1
20080215474 Graham Sep 2008 A1
20080311883 Bellora et al. Dec 2008 A1
Foreign Referenced Citations (8)
Number Date Country
63402 Jul 1982 GB
WO 9504960 Feb 1995 WO
WO 9527255 Oct 1995 WO
WO 9634350 Oct 1996 WO
WO 9703406 Jan 1997 WO
WO 9852131 Nov 1998 WO
WO 2007002841 Jan 2007 WO
WO 2007016412 Feb 2007 WO
Related Publications (1)
Number Date Country
20070198283 A1 Aug 2007 US
Provisional Applications (1)
Number Date Country
60703687 Jul 2005 US