CN1225863C - Telephone bill combining process method - Google Patents

Abstract

A bill merging method involving telecommunication technology, which controls the waiting time or number of bills to make the merging process easier to control and smoother, and reduces the risk of data congestion of hosts in the network during the merging process Possibility, the present invention introduces the concept of black bills and regularly detects the merging process in real time, forcibly interrupts the merging of bills that occupy network resources for a long time, and uses a cache mechanism to make the merging process smoother. Due to abnormality or power failure, by saving the intermediate state information, the relevant waiting queue Qw list, etc. can be effectively recovered from the original bill data according to the state information, and the complete recovery of the data is guaranteed in principle. The present invention provides a Reliable bill merging processing method can complete part of bill merging generated by hosts in GPRS and WCDMA networks, and solve the problems of lost and repeated bills in the process of bill merging.

Description

Bill merge processing method

technical field

The invention relates to telecommunication technology, in particular to a method for merging bills.

Background technique

For users who occupy network resources for a long time on GPRS and WCDMA networks, the host will generate multiple partial bills for the user, which are divided into the first partial bill, the middle part of the bill and the last partial bill. The partial bills generated by the host Before the bills are sent to the billing center, the CG needs to combine the bills as much as possible to form one bill or several larger partial bills and send them to the billing center for billing processing.

The disadvantage of the prior art is that if the merging process is interrupted due to an abnormality of the CG during the bill merging process, the bills will be lost or repeated. Because a large number of bills need to wait in the memory during the merging process, if the CG terminates abnormally, the bills waiting in the memory will be lost. Because there are a lot of waiting bills, they cannot be saved. If they are saved to disk during the merging process, the performance of the merge will be seriously affected, and the performance requirements may not be met. Therefore, when the CG system is restored, these waiting bills must be retrieved from the memory. Come.

According to the basic requirements of China Mobile General Administration for CGF, the error rate of CG billing processing must be less than 0.001%. The existing technology cannot accurately retrieve the call bills waiting in the memory before the CG abnormality, or cause the call bills to be lost, or Duplicate bills are caused.

Contents of the invention

The purpose of the present invention is to provide a method for merging bills with reliable performance.

The method that the present invention adopts is: this bill merge processing method, it is characterized in that: it adopts the following steps:

The host generates bills, including partial bills and non-partial bills, some of which need to be merged with other bills, and non-partial bills do not need to be merged with other bills, which are called Class A bills; billing gateways package bills , pack the current bill sent by the host into a data packet, and send it to the merging process for merging; then, the billing gateway merges the bill: if the current bill is a type A bill, it will be directly sent to the merged bill storage queue ; If the current bill is a part of the bill and the relevant waiting bill is merged to no longer need to wait for the merge, send the merged result to the merged bill storage queue;

The part of the bills can be divided into B-type bills and C-type bills, where the B-type bills need to continue to be merged with other bills after being merged, and the C-type bills do not need to continue to wait after being merged, and the billing gateway merges the bills. single time,

A) If the current bill is a Class B bill, first look for waiting bills belonging to the same packet data protocol in the waiting queue;

i. If the waiting bill is found, first judge whether the two bills are allowed to be merged;

1) If merging is allowed, first merge the current bill with the waiting bill, the merged result is kept in the waiting queue, and its packet number is the same as that of the original waiting bill, and then judge whether the packet data protocol to which the bill belongs has ended ;

i) If it has ended, then judge whether the combined result needs to continue to wait for other unarrived partial bills of the packet data protocol to which it belongs;

a) If there is no need to continue to wait, then send the merging result to the merged bill storage queue, and the merging process of the current bill ends;

b) If it is necessary to continue to wait, the merged result is kept in the waiting queue until the merge process of the current bill is completed after all part bills of the packet data protocol to which it belongs;

ii) If the packet data protocol to which the bill belongs has not ended, the merged result continues to wait for the subsequent partial bill of the packet data protocol to which the bill belongs, and the merge process of the current bill ends;

2) If merging is not allowed, send the waiting bill to the merged bill storage queue, replace the position of the waiting bill in the waiting queue with the current bill, and continue to wait for the subsequent bill. The package number of the bill is the original waiting bill package number, the merging process of the current bill ends;

ii. If there is no waiting bill, the current bill is directly sent to the waiting queue, and according to whether the current bill belongs to the first partial bill of the packet data protocol, the packet number of the current bill is processed as follows;

1) If the current bill is the first partial bill of the packet data protocol to which it belongs, the packet number of the current bill remains unchanged, and the merging process of the current bill ends;

2) If the current bill is not the first partial bill of the packet data protocol to which it belongs, then adjust the bill package number, and the merging process of the current bill ends;

B) If the current bill is a Class C bill, first look for the bill that is waiting for the current bill in the waiting queue;

i. If the waiting bill is found, first judge whether the two bills are allowed to be merged;

1) If merging is allowed, the current bill and the waiting bill are merged, and the merged result is kept in the waiting queue, and its packet number is the same as that of the original waiting bill, and the data in the merged result already includes the previous bill and the waiting bill. Bills; after the two bills are merged, it is judged whether the merger result needs to continue to wait for other partial bills of the packet data protocol that have not arrived;

01. If there is no need to continue waiting, the merged result is taken out from the waiting queue and sent to the merged bill storage queue, and the merge process of the current bill is completed;

02. If it is necessary to continue waiting, let the merged result stay in the waiting queue for a period of time until all part of the bills of the packet data protocol to which they belong arrive, and the merge process of the current bills ends;

2) If merging is not allowed, the waiting bill and the current bill are sent to the merged bill storage queue respectively, and the merging process of the current bill ends;

ii. If the waiting bill is not found, the current bill is directly sent to the merged bill storage queue, and the merge process of the current bill is completed;

After the billing gateway receives the bills sent by the host, the number reaches a predetermined value, or exceeds the time limit before reaching the predetermined number, and sends the bills to the merging process for merging;

Other bills that have not waited in the bill waiting queue for timeout are black bills, and the billing gateway forcibly interrupts the merging of the bills and sends them to the merged bill storage queue;

The bills in the bill waiting queue are regularly detected. When the waiting time exceeds the specified duration or the difference between the packet number and the current packet number received by the merging module is greater than the predetermined value m, it is regarded as waiting for overtime. When the merging module receives When the package number of the bill is assumed to be X, when the following conditions are met, a black bill is generated: X%m=0, where the % symbol represents the remainder after divisibility, and these points that meet the conditions are overtime checkpoints;

When described black bill generation, use following caching mechanism: the black bill that generates on the checkpoint is sent in a temporary queue, and the bill in the temporary queue will generate an adjacent (i.m. (i+1).m) interval is evenly sent to the merged bill storage queue; if the number of bills in the temporary queue generated on the checkpoint is L, then (i.m, (i+1).m) The number of bills that should be taken away from the temporary queue for each bill packet in the interval is:

[L/(m-1)]+1, where “[]” represents the integer part;

When the bill of the packet data protocol on the checkpoint is sent to the temporary queue, if the merging module is merging a bill, the packet number of the bill is Y, Y∈[(k.m, (k+1).m), And there is no corresponding waiting bill in the waiting queue, first judge whether the current bill belongs to the first partial bill of the packet data protocol; if the current bill is the first partial bill of the packet data protocol to which it belongs, then put the current bill Send it to the waiting queue as a new node, and set the packet number of the bill to Y, that is, the current packet number of the bill; if the current bill is not the first partial bill of the packet data protocol to which it belongs, take the current bill as the new Send the node in the waiting queue, and adjust the packet number of the bill to k.m, which is the previous checkpoint immediately adjacent to Y;

The bill newly arrives, there is no corresponding waiting bill in the waiting queue, and the bill is the first partial bill of the packet data protocol, then the bill is added to the head of the waiting queue, and the The packet number is set to the current packet number of the bill; if the bill does not have a corresponding waiting bill in the waiting queue, and the bill is not the first partial bill of the packet data protocol, then add the bill to the tail of the waiting queue , and adjust the packet number of the bill to the packet number of the previous timeout checkpoint that is currently approaching;

If said checkpoint generates a temporary queue on k.m, check the packet number of the bill from the tail of the waiting queue to the head direction, if the packet number of the bill is less than or equal to the packet number of the previous overtime checkpoint (k- 1).m, then move the bill to the head of the temporary queue; if the packet number of a bill is found to be greater than the packet number (k-1).m of the previous timeout checkpoint, the process of generating the temporary queue ends ; When taking out the bills from the temporary queue, start from the tail, and take the bills sequentially towards the head, and take a certain number of bills each time. Assuming that the number of bills in the temporary queue generated initially is L, then take each time from the temporary queue The number of bills is: [L/(m-1)]+1, where “[]” represents the integer part, and m is the predetermined value of the maximum packet number difference that the bill is waiting in the memory;

Due to abnormality or power failure during the merging process of the bills, the waiting queue list in the memory will be completely lost, and by saving the intermediate state information, the waiting queue list in the memory will be restored from the original bill data according to the state information when starting;

When the bills are merged, an index table is established on the basis of the waiting queue, and the search is performed in the index table;

The index table adopts a hash table, and whenever a new bill is entered in the queue, a new index node is added to the index table, and when a node is deleted, the corresponding node in the index table is deleted.

The beneficial effects of the present invention are: in the present invention, the waiting time of the dialogue list or the quantity of the waiting list is controlled, so that the merging process is easier to control and smoother, and reduces the possibility of data congestion of the host in the network during the merging process The present invention introduces the concept of black bills and regularly detects the merging process in real time, and forcibly interrupts the merging of bills that occupy network resources for a long time, which effectively improves the working reliability of the present invention, and uses a cache mechanism to make the merging process Smoother, for bills due to abnormality or power failure during the merging process, by saving the intermediate state information, the relevant waiting queue Qw list can be effectively restored from the original bill data according to the state information, and the data is preserved in principle Therefore, the present invention provides a reliable bill merging processing method, which can complete the merging of part of the bills generated by the host in the GPRS and WCDMA networks, and solve the lost bills and repeated calls in the bill merging process. single question.

Description of drawings

Fig. 1 is a schematic diagram of the merging process of the present invention;

Figure 2 is a schematic diagram of a checkpoint;

Fig. 3 is a schematic diagram of bill merging;

Fig. 4 is a schematic diagram of failure point recovery;

Fig. 5 is the recovery schematic diagram of waiting queue Qw;

Fig. 6 is the recovery schematic diagram of waiting queue Qw;

FIG. 7 is a schematic diagram of recovery of the temporary queue Qt.

Detailed ways

Below according to accompanying drawing and embodiment the present invention will be described in further detail:

Explanation of related concepts:

CG: Charging Gateway, Charging Gateway;

Packet Data Protocol PDP: Packet Data Protocol, Packet Data Protocol;

Each user may correspond to multiple packet data protocol PDPs in the host, and the host generates bills for each packet data protocol PDP. This algorithm limits each packet data protocol PDP to have at most one bill waiting in the CG system.

GGSN: Gateway GPRS Support Node, Gateway GPRS Support Node;

SGSN: Serving GPRS Support Node, Serving GPRS Support Node;

CDR: Detailed call list, Call Detail Record;

G-CDR: the detailed call list generated by the gateway GPRS support node, Gateway GPRS SupportNode Call Detail Record;

M-CDR: Mobility Management-Call DetailRecord;

S-CDR: Serving GPRS SupportNode Call Detail Record generated by the serving GPRS support node;

S-SMO-CDR: Short Message Mobile Originated Call List, SGSN delivered Short MessageMobile Originated Call Detail Record;

S-SMT-CDR: Short message mobile terminated call list, SGSN delivered Short messageMobile Terminated Call Detail Record;

BP: bill package, Bill Package;

The bills generated by the switch or the host are sent to the CG in real time (through the GTP’ protocol), and some bills are sent each time, and the follow-up bills are sent after the confirmation of the CG. After CG receives the bills sent by the host, when the number of received bills reaches a predetermined value, or exceeds the time limit before reaching the predetermined number, it will pack the received bills in a data packet, and then send them for merging The process is merged, and this data package is called a bill package. Each bill packet is endowed by the CG with a unique incremental sequence number, which is called the packet number of the bill packet (without considering wrapping of the packet number).

A bill package can contain multiple bills, or no bills, which is called an empty bill package.

Bills in the same bill package have the same package number.

Qw: waiting queue, Queue waiting

The principle of merging multiple partial bills of a packet data protocol PDP is: let the bills that arrive first wait in the memory, and the partial bills that arrive later are merged with the waiting bills. When all partial bills of the packet data protocol PDP arrive After the CG completes the merge, the merged result enters the subsequent processing flow.

Each packet data protocol PDP has at most one bill waiting in the memory of the CG system, and all these waiting bills of the packet data protocol PDP form a queue, which is called the waiting queue Qw.

Queue for bill storage after merging is completed Qok: queue for bill storage after merging is completed, Queue0K:

The CG temporarily stores the merged bills or the bills that do not need to be merged (for example, a single bill that does not need to be merged) in a buffer, and the queue formed by these bills is called the merged bill storage queue Qok.

According to Fig. 1, Fig. 2, Fig. 3, Fig. 4, Fig. 5, Fig. 6 and Fig. 7,

The host generates bills, including partial bills and non-partial bills. Partial bills need to be merged with other bills, and non-partial bills do not need to be merged with other bills. It is called A-type bills, and the host is only a packet data The protocol PDP generates a bill; the billing gateway CG packs the bill, packs the current bill sent by the host into a data packet, and sends it to the merging process for merging; then, the billing gateway CG merges the bills: if the current bill If it is a class A bill, it will be directly sent to the merged bill storage queue Qok; if the current bill is a partial bill and the relevant waiting bills are merged until there is no need to continue waiting for the merge, the merged result will be sent to the merged bill Storage queue Qok.

Wherein, the partial bills generated by the host include the first partial bill, the middle partial bill, and the last partial bill.

First partial CDR: The host generates multiple CDRs for a packet data protocol PDP, and the first generated one is called the first partial CDR.

Last partial CDR: The host generates multiple CDRs for a packet data protocol PDP, and the last generated one is called the last partial CDR.

Intermediate part of the bill: the host generates multiple bills for a packet data protocol PDP, except for the first and last generated bills, other bills are called the middle part of the bill.

Some bills can be divided into type B bills and type C bills, where type B bills need to be merged with other bills after being merged, and type C bills do not need to wait after being merged.

In this way, the bills are divided into three types according to the type:

Class A bills: No need to combine bills; for example, single bills of S-CDR, G-CDR, M-CDR generated by WCDMA and GPRS hosts and S-SMO-CDR, S-SMT-CDR (the host will not Generate partial bills for SMS bills).

Type B bills: It is necessary to wait for the merging of the subsequent part of the bills, and may need to merge with the existing part of the bills, including the first part of the bills and the middle part of the bills; such as the S-CDR generated by the WCDMA and GPRS host, The middle part of the bill and the first part of the bill of G-CDR and M-CDR.

Type C bills: It needs to be merged with the previous partial bills, but does not need to wait for the merged bills; such as the last partial bills of S-CDR, G-CDR, and M-CDR generated by WCDMA and GPRS hosts.

After the billing gateway CG receives the bills sent by the host, the number reaches a predetermined value, or exceeds the time limit before reaching the predetermined number, it packs the received bills in a data packet and sends them to the merge process for merging;

The following descriptions are formatted according to the following rules: Paragraphs with the same indentation describe parallel operations; on the basis of the indentation of this paragraph, the next indented paragraph is the follow-up operation of the description in this paragraph. When billing gateway CG merges bills, as shown in Figure 1:

A) For the A-type bills, directly send the merged bills to the storage queue Qok;

B) for B class bill, at first according to the key field of current bill, search and wait for the bill of current bill in waiting queue Qw, promptly search the bill that belongs to same packet data protocol PDP;

i. If the waiting bill is found, first judge whether the two bills are allowed to be merged;

1) If merging is allowed, the current bill and the waiting bill are merged, and the merged result is kept in the waiting queue Qw, and its packet number is the same as that of the original waiting bill, and the data in the merged result already includes the current bill and Wait for the bill, after the two bills are merged, then judge whether the packet data protocol PDP to which the bill belongs has ended;

i) If the packet data protocol PDP to which the bill belongs has ended, then judge whether the merging result needs to continue to wait for other unreached partial bills of the packet data protocol PDP to which the bill belongs;

a) If there is no need to continue to wait, then the merged result is sent to the merged bill storage queue Qok, and the merge process of the current bill is completed;

b) If it is necessary to continue to wait, then allow the merging result to stay in the waiting queue Qw for a period of time until all part of the bills of the packet data protocol PDP to which the bills belong arrive, and the merging process of the current bills ends;

ii) If the packet data protocol PDP to which the bill belongs is not over, the merging result continues to wait for the subsequent part of the bill of the packet data protocol PDP to which the bill belongs, and the merging process of the current bill ends;

2) If merging is not allowed, the waiting bills are sent to the merged bill storage queue Qok, and the current bills are used to replace the position of the waiting bills in the waiting queue Qw, and continue to wait for the follow-up bills. The package number of the bills is the original waiting The package number of the bill, the merging process of the current bill is over;

ii. If there is no waiting bill, then directly send the current bill to the waiting queue Qw, and process the packet number of the current bill in the following manner according to whether the current bill belongs to the first partial bill of the packet data protocol PDP;

1) If the current bill is the first partial bill of the packet data protocol PDP to which it belongs, the packet number of the current bill remains unchanged, and the merging process of the current bill ends;

2) If the current bill is not the first partial bill of the packet data protocol PDP to which it belongs, then adjust the bill package number according to the rules, and the merging process of the current bill ends;

C) to the C class bill, at first in the waiting queue Qw, look for the bill that is waiting for the current bill;

i. If the waiting bill is found, first judge whether the two bills are allowed to be merged;

1) If merging is allowed, the current bill and the waiting bill are merged, and the merged result is kept in the waiting queue Qw, and its packet number is the same as that of the original waiting bill, and the data in the merged result already includes the previous bill and Waiting for the bills; after the two bills are merged, it is judged whether the merger result needs to continue to wait for other partial bills of the packet data protocol PDP that have not arrived.

01. No need to continue to wait, then take out the merging result from the waiting queue Qw and send it to the bill storage queue Qok when the merging is completed, and the merging process of the current bill ends;

02. If it is necessary to continue to wait, then let the merged result stay in the waiting queue Qw for a period of time until all part of the bills of the packet data protocol PDP to which they belong arrive, and the merge process of the current bills ends;

2) If merging is not allowed, the waiting bills and the current bills are sent to the merged bill storage queue Qok respectively, and the merging process of the current bills ends.

ii. If the waiting bill is not found, the current bill is directly sent to the merged bill storage queue Qok, and the merge process of the current bill is completed.

The above is the basic flow of bill merging, in which additional merging rules are allowed, including version V1.2.0 of "GPRS Charging Gateway Technical Specifications" issued by the General Office of Mobile, and additional merging rules required by equipment suppliers according to their own characteristics.

The billing gateway CG pre-processes to generate a bill package, and assigns a unique incremental sequence number, and then sends it to the merging process for merging. Therefore, what the merging process receives is the bill packet with the sequence number incremented.

The merging process merges the bills in one bill package each time, and then merges the next bill pack after merging one bill pack (the package number is increased by 1).

In the above process, other bills that have not waited for timeout in the bill waiting queue are black bills, and the billing gateway forcibly interrupts the merging of the bills, and sends them to the merged bill storage queue.

That is, when judging whether the merging result needs to continue to wait for other unarrived partial bills of the packet data protocol PDP to which it belongs, when it is necessary to continue waiting, if the bill is in the waiting queue Qw, the waiting time exceeds a specified duration or the merging module receives When the bill packet number exceeds the predetermined value of the bill packet number in the waiting queue Qw, in order to reduce the data volume of the bill in the waiting queue Qw queue and limit the waiting time of the bill in the memory, the bills are forcibly interrupted and merged, and the The bills sent and merged are stored in the queue Qok, and those bills that are forcibly sent away are black bills.

When the difference between the packet number of the bill in the waiting queue Qw and the current packet number received by the merging module is greater than the predetermined value m, it is regarded as the bill waiting for overtime, and the merging module periodically detects the bill waiting for the timeout in the waiting queue Qw. When the merging module receives If the packet number of the bill is assumed to be X, a black bill will be generated when the following conditions are met: X%m=0, where the % sign represents the remainder after divisibility, and these points that meet the conditions are overtime checkpoints, such as As shown in Figure 2, the dots represent the points that meet the conditions. At these points, the merging module checks whether there is a waiting timeout bill in the waiting queue Qw, and all overtime bills are black bills that must be interrupted and merged;

For example, the package number of the bill packet arriving at the merging module starts from 1, and when the packet number reaches m, the merging module checks whether there is a bill waiting in the waiting queue Qw for overtime before merging the bill packet, and there is no bill waiting at this moment Timeout, no black call list will be generated;

When the packet number reaches 2m, the merging module checks whether there is a bill in the waiting queue Qw and waits for timeout. At this time, all packet data protocol PDPs that start before m are waiting for the bills in the waiting queue Qw to be considered as waiting for timeout. It starts before m, and when it reaches 2m, the packet data protocol PDP is still not finished, so there is still a packet data protocol PDP bill in the waiting queue Qw. For the packet data protocol PDP that has ended before reaching 2m, there are no these packet data protocol PDP bills in the waiting queue Qw when reaching 2m, these overtime bills are forcibly interrupted and merged, and sent as black bills to the merged bill storage queue Qok. The packet data protocol PDP bill starting from the interval (m, 2m) will wait for timeout when the 3m bill packet arrives, if the packet data protocol PDP has not ended when the packet number reaches 3m;

When the packet number reaches 3m, the merging module checks whether there is a bill in the waiting queue Qw and waits for timeout. At this time, all packet data protocol PDPs that start before 2m wait for the bills in the waiting queue Qw are considered to be waiting for timeout. If these timeouts The bill is forcibly interrupted and merged, and sent as a black bill to the bill storage queue Qok after the merge is completed;

As shown in Figure 3, it is the same process for the single package after 3m; when the package number reaches i.m, the merge module will group all the groups starting from (i-1).m before (including (i-1).m) Data protocol PDP bills are sent as black bills to merged bill storage queue Qok; the black bills generated at each checkpoint are packet data protocols spanning at least one [i.m, (i+1).m] interval PDP bill;

If the additional rules are not considered, the bills of the packet data protocol PDP scattered in the interval [Y, (i+2).m] are merged with the first part of the bills of the packet data protocol PDP in the bill packet Y, and when When the packet number reaches (i+2).m, the combined result is sent as a black bill to the bill storage queue Qok after the merge is completed. The additional rules mentioned here may cause the packet data protocol PDP bill to be interrupted and merged in advance, such as Bills arrive out of order, or there is a limit on the maximum number of merged bills, etc. According to the basic process, although the bills may be interrupted and merged in advance, the package number of the bill will not change before the black bill is generated;

The packet data protocol PDP is scattered in the interval [(i+2).m, (i+3).m], and the bills are all related to the first part of the packet data protocol PDP in the bill packet (i+2).m. Bills are merged, and when the packet number reaches (i+3).m, the merged result is sent as a black bill to the bill storage queue Qok when the merge is completed;

By analogy, the dialog sheets are merged.

If there are a lot of ultra-long packet data protocol PDPs when generating black bills on the "checkpoint", it will cause too many bills to be generated in the merged bill storage queue Qok, which is called "data explosion". In order to eliminate this outburst situation and make the bills be sent to the merged bill storage queue Qok as smoothly as possible, the following caching mechanism is used: the black bills generated on the checkpoint are not directly sent to the merged bill storage queue Qok, Instead, it is sent to a temporary queue Qt, and the bills in the temporary queue Qt will be evenly sent into the merged area in a (i.m, (i+1).m) interval immediately after the checkpoint that generates the temporary queue Qt. The bill is stored in the queue Qok; if the number of bills in the temporary queue Qt generated on the checkpoint is L, each bill packet in the interval (i.m, (i+1).m) should be taken away from the temporary queue Qt The number of bills is: [L/(m-1)]+1, where "[]" represents the integer part; for example, in Figure 2, the bills in the temporary queue Qt generated at point 2.m will be in the interval (2 .m, 3.m) are evenly sent away.

Considering that the packet data protocol PDP bills are much sparser than the bill packets generated by the network module, that is to say, in the packet number range spanned by the packet data protocol PDP, not every bill packet will have a packet data protocol PDP bill.

As shown in Figure 3, a packet data protocol PDP starts at Y and terminates after (i+4).m, if there is no bill of the packet data protocol PDP in the bill packet (i+2).m, investigate Let’s take a look at the process of generating a black call list:

A) When the packet number reaches (i+2).m, because the packet number of the packet data protocol PDP bill is before (i+1).m (the packet number is Y), it is considered that the bill waits for overtime, thereby It is sent to the temporary queue Qt as a black call ticket.

B) Because there is no PDP bill in the bill packet (i+2).m, when the packet number (i+3).m, the packet number of the packet data protocol PDP bill is not in (i +2).m, so it will not be considered that the bill waiting timed out. However, this is an ultra-long packet data protocol PDP bill that spans the interval [(i+2).m, (i+3).m] and should be sent to the temporary queue Qt as a black bill.

In order to ensure that the packet data protocol PDP bills are sent to the temporary queue Qt at the (i+3).m checkpoint, the following rules are set:

When the packet data protocol PDP bill on the checkpoint is sent to the temporary queue Qt, if the merging module is merging a bill, the packet number of the bill is Y, Y∈[(k.m, (k+1).m), and If there is no corresponding waiting bill in the waiting queue Qw, first judge whether the current bill belongs to the first partial bill of the packet data protocol PDP; if the current bill is the first partial bill of the packet data protocol PDP to which it belongs, then the The bill is sent to the waiting queue Qw as a new node, and the packet number of the bill is set to Y, that is, the current packet number of the bill; if the current bill is not the first partial bill of the packet data protocol PDP to which it belongs, then the current The bill is sent to Qw as a new node, and the packet number of the bill is adjusted to k.m, which is the previous checkpoint immediately adjacent to Y; according to the above rules, as shown in Figure 3, when the packet data protocol PDP is scattered in the interval When the first partial bill of [(i+2).m, (i+3).m] appears, its packet number is adjusted to (i+2).m, so as to ensure that it is in (i+3).m The PDP bill on the checkpoint is sent to the temporary queue Qt.

If the checkpoint generates a temporary queue Qt on k.m, check the packet number of the bill from the tail of the waiting queue Qw to the head direction, if the packet number of the bill is less than or equal to the packet number of the previous timeout checkpoint (k-1 ).m, the bill is moved to the head of the temporary queue Qt; if the packet number of a bill is found to be greater than the packet number (k-1).m of the previous timeout checkpoint, the process of generating the temporary queue Qt End; when taking out the bills from the temporary queue Qt, start from the tail, and take the bills sequentially toward the head, each time a certain number of bills are taken, assuming that the number of bills in the initially generated temporary queue Qt is L, then each time from the temporary The number of bills to be fetched in the queue Qt is: [L/(m-1)]+1, where “[]” represents the integer part, and m is the maximum packet number difference predetermined value of the bills waiting in the memory.

If the CG is abnormal or powered off during the merging process, all the waiting queue Qw lists in the memory will be lost. Because the list can be very large, it is inefficient or even impossible to save the list on disk. A feasible way is to save some state and restore it from the original bill data according to the state information at startup.

Assume that the merging module fails at a certain moment of operation. Before the failure, the record package saved by the storage module is n, as shown in Figure 4. After the merging module completes the merging of the nth package of bills, the merged result is placed in the merging The finished bill storage queue Qok and the bill packet number n have been successfully saved by the storage module. When the system recovers, it is necessary to restore the waiting queue Qw queue and temporary queue Qt queue at n;

Let's examine the process of recovering the waiting queue Qw and the temporary queue Qt queue at n places: from n-(n%m)-2.m, re-merge all bill packets, and re-merge before reaching n (including n), all merged results (the bills placed in the merged bill storage queue Qok) are discarded, and the merged results are saved after exceeding n.

The recovery results of the waiting queue Qw and the temporary queue Qt are discussed below for various situations.

1. Recovery of Qw

It is required that the bills contained in the waiting queue Qw before the failure and the waiting queue Qw generated by recovery must be the same, and the bills in the two Qws have a one-to-one correspondence.

Let’s examine a packet data protocol PDP separately. If each packet data protocol PDP in the waiting queue Qw can guarantee that the bills before the failure and the bills generated by recovery are the same, it is guaranteed that the Qw in the two cases is the same. , the recovery process cannot introduce a new packet data protocol PDP into Qw or lose the packet data protocol PDP that should appear in the waiting queue Qw, and the newly arrived bill has no corresponding waiting bill in the waiting queue Qw, and the bill is For the first partial bill of the packet data protocol PDP, the bill is added to the head of the waiting queue Qw queue, and the packet number of the bill is set as the current packet number of the bill; if the bill is in the waiting queue Qw there is no The corresponding waiting bill, and the bill is not the first partial bill of the packet data protocol PDP, then add the bill to the tail of the waiting queue Qw queue, and adjust the packet number of the bill to be the current adjacent previous timeout checkpoint package number.

First examine the types of the packet data protocol PDP that may appear in an interval [k.m, (k+1).m]. As shown in Figure 5, the packet data protocol PDP (two cases) terminated in the interval arrives at ( k+1).m has been terminated before, and the bills are sent to the merged bill storage queue Qok.

In this way, the packet data protocol PDP that crosses the interval is forcibly interrupted and merged when it reaches (k+1).m, and the bill is sent to the temporary queue Qt. The bill scattered after (k+1).m is added to Qw as a new node, and the bill packet number is adjusted; it starts from the packet data protocol PDP in the interval, and the packet data spans (k+1).m The protocol PDP bill is still waiting for the follow-up bill in Qw, because it has not timed out yet.

As shown in Figure 5 and Figure 6, the failure point is at n and the recovery point is at i.m: the packet data protocol PDP that has ended before reaching n, because it ends naturally, so it is not considered, and it is not marked in the figure, because it is in the normal merge process In , these packet data protocol PDP bills have been saved and discarded during the recovery process;

For the packet data protocol PDP that starts from the interval (i.m, n) and ends after n, the normal merging process and recovery process are the same, so the bills of this part of the packet data protocol PDP in the waiting queue Qw must be the same, that is, in Figure 6 Call sheet after recovery point.

PDPs that start before i.m and end after n, because they are forcibly interrupted at least when they reach (i+1).m, are scattered in the interval [(i+1).m,n] The merging process of bills is also the same under normal conditions and during recovery, so the bills of this part of the packet data protocol PDP in the waiting queue Qw must be the same.

Because the scattered positions of the packet data protocol PDP bills in the bill packet are fixed, so whether it is a normal merge process or a recovery process, when the point (i+2).m is reached, all packet data protocol PDP bills are waiting The relative positions in the queue Qw are the same; similarly when n is reached, the relative positions of all packet data protocol PDP bills in the waiting queue Qw are also the same; there is such a point in the waiting queue Qw: all the words before this point The bills are bills with adjusted package numbers, and after this point, the bills and package numbers are in order (from small to large).

To sum up, after the recovery process, the waiting queue Qw is correctly recovered.

2. Recovery of temporary queue Qt

As shown in Figure 5, a temporary queue Qt will be generated at points i.m, (i+1).m, (i+2).m, and (i+3).m. The bills in the temporary queue Qt generated by point i.m are evenly sent to the merged bill storage queue Qok in the interval (i.m, (i+1).m); the bills in the temporary queue Qt generated by point (i+1).m The bills in the interval ((i+1).m, (i+2).m) are evenly sent to the merged bill storage queue Qok; the bills in the temporary queue Qt generated at (i+2).m point will be In the interval ((i+2).m, (i+3).m), the merged bills are evenly sent to the storage queue Qok, and when n is reached, only part of the bills in the temporary queue Qt are sent to the merged bills and stored Queue Qok, the remaining part needs to be restored when it is restored.

As shown in Figure 7, a temporary queue Qt is generated at point (i+2).m, and when it reaches n, it is the grid part that is sent to the merged bill storage queue Qok, and the bar part needs to be restored.

Consider operating the temporary queue Qt according to the following rules: when generating the temporary queue Qt at the timeout checkpoint k.m, check the packet number of the bill from the tail of the waiting queue Qw to the head. If the packet number of the bill is less than (or equal to) the packet number (k-1).m of the previous timeout checkpoint, the bill is moved to the head of the temporary queue Qt. If find that the packet number of a bill is greater than the packet number (k-1).m of the previous overtime checkpoint, then the process of generating the temporary queue Qt ends; when taking out the bill from the temporary queue Qt, start from the tail and move forward Take the bills sequentially in the department direction, each time a certain number of bills are taken (assuming that the number of bills in the temporary queue Qt initially generated is L, then the number of bills taken from the temporary queue Qt each time is: [L/(m-1) ]+1, "[]" means to take the integer part, m is the difference between the maximum packet number waiting for the bill in the memory).

Because no matter it is a normal merging process or a recovery process, the relative positions of all packet data protocol PDP bills in the waiting queue Qw are the same when (i+2). ). The relative position of the bill in the temporary queue Qt generated from Qw at point m is also the same (a temporary queue Qt is also generated at point (i+1).m, but before reaching (i+2).m The bills have all been sent to the merged bill storage queue Qok. When n is reached, the relative position of the bills in the temporary queue Qt and the number of bills must be the same, and the data of each bill is also the same.

It can be seen from the above discussion that at (i+2).m, including this point until n, the waiting queue Qw and temporary queue Qt at any point are exactly the same in the normal merge process and recovery process.

To sum up, the temporary queue Qt is correctly restored during recovery.

When CG is merging bills, there will be a large number of bills waiting in the memory, and the speed of searching out qualified bills from a large number of bills will greatly affect the speed of CG processing bills. In order to improve the search speed, in An index table is established on the basis of Qw, and the search is performed in the index table. The index table is implemented by a hash table, or called a HASH table, or a hash table. A new index node is added to the table, and when a node is deleted from Qw, the corresponding node in the index table is deleted.

The present invention is effective for both real-time online call list merging and offline merging, and its principle and control process are consistent with the above, which will not be repeated here.

Claims (11)

1. telephone bill combining process method, it is characterized in that: it adopts following steps:

Main frame generates ticket, comprises partial CDR and non-partial CDR, and wherein partial CDR need merge with other ticket, and non-partial CDR does not need to merge with other ticket, claims the category-A ticket; Charging gateway packing ticket, the current ticket that main frame is sent here is packaged in the packet, send the merging flow process to merge; Then, charging gateway Consolidate CDR:, then directly deliver to and merge the ticket of finishing and deposit formation if current ticket is the category-A ticket; Be incorporated into when not needing continuation etc. to be combined with relevant wait ticket if current ticket is a partial CDR, amalgamation result delivered to the ticket that merging finishes deposit formation;

Described partial CDR can be divided into category-B ticket and C class ticket, and wherein the category-B ticket needs to continue after merging to merge with other tickets, after merging, C class ticket do not need to continue to wait for, and during the charging gateway Consolidate CDR,

A) if current ticket is the category-B ticket, at first search the wait ticket that belongs to same packet data protocol at waiting list;

I. if find the wait ticket, judge earlier whether two tickets allow to merge;

1) if allow to merge, earlier current ticket is merged with waiting for ticket, amalgamation result is retained in the waiting list, and its Bale No. waits for that with original the Bale No. of ticket is identical, judges then whether the packet data protocol under the ticket finishes;

I) if finish, judge again amalgamation result whether need to continue to wait under the partial CDR of other no shows of packet data protocol;

A) if do not need to continue to wait for that then the ticket that send merging to finish is deposited formation to amalgamation result, the merging process of current ticket finishes;

B) if need continue to wait for, then allow amalgamation result be retained in the waiting list, arrive the merging process end of the current tickets in back up to all partial CDRs of affiliated packet data protocol;

Ii) if packet data protocol does not finish under the ticket, then amalgamation result continues to wait for the further part ticket of the affiliated packet data protocol of ticket, and the merging process of current ticket finishes;

2) do not deposit formation if do not allow to merge the ticket that then send merging to finish to the wait ticket, replace the position of wait ticket in waiting list with current ticket, continue to wait for follow-up ticket, the Bale No. of ticket is original Bale No. of waiting for ticket, and the merging process of current ticket finishes;

Ii. if there is not the ticket waiting for, then directly send waiting list current ticket, and according to current ticket whether under first partial CDR of packet data protocol, handle the Bale No. of current ticket in the following manner:

1) if current ticket is a first partial CDR of affiliated packet data protocol, then the Bale No. of current ticket is constant, and the merging process of current ticket finishes;

2) if current ticket is not a first partial CDR of affiliated packet data protocol, then adjust the ticket Bale No., the merging process of current ticket finishes;

B) if current ticket is a C class ticket, at first in waiting list, search the ticket of waiting for current ticket;

I. if find the wait ticket, judge earlier then whether two tickets allow to merge;

1) if allowing to merge then merges current ticket and wait ticket, the result of merging is retained in the waiting list, and its Bale No. waits for that with original the Bale No. of ticket is identical, and the data in the amalgamation result have comprised preceding ticket and waited for ticket; Two tickets merge finish after, judge again amalgamation result whether need to continue to wait under the partial CDR of other no shows of packet data protocol;

01., then amalgamation result is taken out from waiting list and send and merge the ticket of finishing and deposit formation, the merging process end of current ticket if do not need continue to wait for;

02. if need to continue to wait for, then allow amalgamation result stay a period of time in waiting list, up to all partial CDRs arrival of affiliated packet data protocol, the merging process of current ticket finishes again;

2) if do not allow to merge, then merge the ticket of finishing and deposit formation waiting for that ticket and current ticket send respectively, the merging process of current ticket finishes;

Ii. if do not find the wait ticket, then the ticket that directly send merging to finish current ticket is deposited formation, and the merging process of current ticket finishes.

2. telephone bill combining process method according to claim 1, it is characterized in that: quantity reached a predetermined value after described charging gateway was received the ticket that main frame sends here, perhaps before reaching predetermined quantity, surpass time restriction, sent the merging flow process to merge.

3. telephone bill combining process method according to claim 1 is characterized in that: other not in the ticket waiting list ticket of wait timeout be the argot list, charging gateway interrupts the merging of this ticket by force, and is sent to and merges the ticket finish and deposit formation.

4. telephone bill combining process method according to claim 3, it is characterized in that: the ticket in the described ticket waiting list is regularly detected, when the stand-by period surpasses current Bale No. difference that regulation duration or Bale No. and merging module receive greater than predetermined value m, be considered as wait timeout, when the Bale No. that merges the ticket that module receives, when being assumed to be X, when satisfying following conditions, generate argot list: X%m=0, remainder after the % symbology is divided exactly in this formula, these points that satisfy condition are overtime checkpoint.

5. telephone bill combining process method according to claim 4 is characterized in that: when described argot list generates, use following caching mechanism:

The argot list that generates on the checkpoint is delivered in the interim formation, is sent into equably in (i.m, (i+1) .m) interval that the ticket in the interim formation will be close to later in the checkpoint that generates this interim formation to merge the ticket of finishing and deposit in the formation;

If the ticket number is L in the interim formation that generates on the checkpoint, then the ticket number that each ticket bag should be taken away from interim formation in (i.m, (i+1) .m) interval is: [L/ (m-1)]+1, " [] " expression round numbers part in the formula.

6. telephone bill combining process method according to claim 5, it is characterized in that: when the ticket of packet data protocol is sent interim formation on the described checkpoint, merging a ticket if merge module, the Bale No. of ticket is Y, Y ∈ [(k.m, (k+1) .m), and in waiting list the not corresponding ticket of waiting for, judge earlier whether first partial CDR of affiliated packet data protocol of current ticket;

If current ticket is first partial CDR of affiliated packet data protocol, then send waiting list current ticket as new node, and the Bale No. of ticket is set to Y, i.e. the current Bale No. of ticket;

If current ticket is not first partial CDR of affiliated packet data protocol, then current ticket sent in the waiting list as new node, and the Bale No. of ticket is adjusted into k.m, be i.e. the checkpoint, front that is close to Y.

7. telephone bill combining process method according to claim 4, it is characterized in that: described ticket newly arrives, in waiting list, there is not corresponding wait ticket, and ticket is a first partial CDR of packet data protocol, then ticket is increased to the head of waiting list, and the Bale No. of ticket is set to the current Bale No. of ticket; If this ticket does not have corresponding wait ticket at waiting list, and ticket is not a first partial CDR of packet data protocol (PDP), then ticket is increased to the waiting list rear of queue, and the Bale No. of adjustment ticket is the current previous time-out check point Bale No. that closes on.

8. according to claim 5 or 6 described telephone bill combining process methods, it is characterized in that: described checkpoint is if when generating interim formation on k.m, check the Bale No. of ticket to cephalad direction from the afterbody of waiting list, if the Bale No. of ticket is less than or equal to Bale No. (k-1) .m of previous time-out check point, then ticket is moved to the head of interim formation; If find Bale No. (k-1) .m of the Bale No. of a ticket greater than previous time-out check point, the process that then generates interim formation finishes;

When from interim formation, taking out ticket from afterbody, get ticket to the cephalad direction order, get the ticket of some at every turn, suppose that the ticket number is L in the initial interim formation that generates, then get ticket quantity from interim formation is at every turn: [L/ (m-1)]+1, " [] " expression round numbers part in the formula, m is the maximum Bale No. difference predetermined value that ticket is waited in internal memory.

9. according to claim 4 or 5 or 6 described telephone bill combining process methods; it is characterized in that: described ticket in merging process because unusual or power down; waiting list tabulation in the internal memory will all be lost; by preserving intermediateness information, the waiting list that recovers from the Original CDR data in the internal memory according to state information when starting is tabulated.

10. according to claim 4 or 5 or 6 described telephone bill combining process methods, it is characterized in that: described ticket is set up a concordance list on the basis of waiting list when merging, carry out in concordance list in the time of search.

11. telephone bill combining process method according to claim 10, it is characterized in that: described concordance list adopts hash table, when in the waiting list formation, entering new ticket, just in concordance list, increase new index node, and when node of deletion from waiting list, just delete the respective nodes in the concordance list.

Images