CN1311586A - Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes - Google Patents

Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes Download PDF

Info

Publication number
CN1311586A
CN1311586A CN 00111792 CN00111792A CN1311586A CN 1311586 A CN1311586 A CN 1311586A CN 00111792 CN00111792 CN 00111792 CN 00111792 A CN00111792 A CN 00111792A CN 1311586 A CN1311586 A CN 1311586A
Authority
CN
China
Prior art keywords
data packet
node
packet
send
msu
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN 00111792
Other languages
Chinese (zh)
Other versions
CN1110925C (en
Inventor
秦奋
朱寅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Shanghai Bell Co Ltd
Original Assignee
Alcatel Lucent Shanghai Bell Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alcatel Lucent Shanghai Bell Co Ltd filed Critical Alcatel Lucent Shanghai Bell Co Ltd
Priority to CN00111792A priority Critical patent/CN1110925C/en
Publication of CN1311586A publication Critical patent/CN1311586A/en
Application granted granted Critical
Publication of CN1110925C publication Critical patent/CN1110925C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A charging method used for collecting the fees of receiving/transmitting data packet node from one or several related adjacent data packet nodes includes: to set up a collected list and a detail list; to proceed sampling for the data packet and fill them in the detail list; to proceed statistics for the detail list to establish a sampling statics tabes; to calculate the total amount and/or the total length of the data packets according with each charging requirement and receiving/transmitting by the charge data packet point for a related adjacent data packet point. Said method can save internal storage, increase charge efficiency and ensure the calculation precisely.

Description

Data packet node collects/sends out the charging method of packet expense to adjacent node
The present invention relates to a kind of charging method, specifically, the present invention relates to be used for certain data packet node and collect the charging method that receives or send the expense of packet to one or more relevant adjacent data packet nodes.
Now, this communication common carrier appears more and more, they are specialized between telephone connection communication service, net and connect communication service, or the like, for example, IP(Internet Protocol) (IP) bag and the ATM(Asynchronous Transfer Mode) cell that are transmitted in the Message Signal Unit (MSU) that transmits on the signalling system No.7 link, connect between being used to net, or the like.Below, the signals that continue such as above-mentioned MSU, IP bag and ATM cell are referred to as packet.
Fig. 1 is illustrated in the schematic diagram that transmits MSU in the communication service on the signalling system No.7 link.As shown in Figure 1, from source node (OPC) (for example with MSU, be positioned at a signaling node (SP) in Shanghai) be sent to the process of destination node (DPC) (for example, being arranged in the signaling node in Pekinese), respectively through 3 Signaling Transfer Point: STP1, STP2 and STP3.And these 3 Signalling Transfer Points belong to 3 communication common carriers (OP), that is: OP1, OP2 and OP3.Therefore, this 3 communication common carriers occur and collected/sent out the expense of MSU mutually, perhaps collected/sent out the problem of the expense of MSU between communication common carrier and source node or destination node and the communication common carrier, for example, communication common carrier OP1 collects the charges to OP2, perhaps the problem of collecting the charges to source node.Owing in the process of connecting a phone, transmit a plurality of MSU, so the traffic of MSU is very huge.If charge according to the method that the method for chargeing one by one with existing phone is similar, the information of wanting each bar MSU of detail record (for example, the type of MSU, source node, a destination node and receipts/time, or the like), this will consume a large amount of computer resources and the complexity of chargeing, so that influence normal MSU processing capacity.
The objective of the invention is to, provide a kind of and can save computer resource, improve charging efficiency and guarantee the packet charging method of charging accuracy.
The invention provides a kind of certain data packet node that is used for and collect the charging method that receives or send the expense of packet, comprise the following steps: to one or more relevant adjacent data packet nodes
(a) set up summary sheet, wherein said summary sheet comprises described relevant adjacent data packet node at least, described certain data packet node receives each described relevant adjacent data packet node packet total amount that send or that send to it and/or its total length in metering period;
(b) set up detail list, wherein said detail list comprises that at least described relevant adjacent data packet node, concrete charge require to receive each described relevant adjacent data packet node each data packet length that send or that send to it with described certain data packet node in described metering period;
(c) in described metering period, the packet that is received or sent by described certain data packet node is sampled, and insert described detail list according to the particular content of described each packet that samples;
(d) in described metering period, described detail list is added up, produce the sampling statistical form, wherein said sampling statistical form comprise described relevant adjacent data packet node, described concrete charge requirement, sampling gained receive by described certain data packet node that each described relevant adjacent data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring;
(e) according to described sampling statistical form, for each described relevant adjacent data packet node, calculate by the sampling gained pass through that described certain data packet node receives or send meet packet total amount that the every kind charge of described concrete charge in requiring require and/or its total length account for the sampling gained for corresponding each described relevant adjacent data packet node, the packet total amount that receives or send by described certain data packet node and/or ratio of its total length; With
(f) ratio that will draw by step (e) be recorded in the described summary sheet, for corresponding each described relevant adjacent data packet node, the actual data packet total amount and/or its total length that are received or sent by described certain data packet node multiply each other, thereby draw receive by described certain data packet node that each described relevant corresponding data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring, can collect the charges according to this packet total amount and/or its total length then.
As seen, adopt charging method of the present invention, because (for example to N packet, MSU) once sampling, and list its details in detail list, by detail list is added up, combine with summary sheet, calculate required packet total amount and/or its total length, and,, therefore reduced the processing data packets amount greatly so a packet to 1/N calculates in charging process of the present invention according to they charges, thereby saved the calculator memory resource, improved efficient.Again because general metering period is longer, for example, every month or annual; And the packet total amount is huger, and for example, a hundreds of thousands packet is so as taking suitable sampling density N, can prove that the confidence level of charging method of the present invention is very high by statistic law.Therefore, charging method of the present invention has also guaranteed necessary charging accuracy.
Below, in conjunction with the accompanying drawings, by detailed description of the present invention, characteristic of the present invention, advantage and purpose will be apparent.
Fig. 1 is illustrated in the schematic diagram that transmits MSU in the communication service on the signalling system No.7 link;
Fig. 2 is the schematic layout pattern that adopts the example network node of packet charging method of the present invention; With
Fig. 3 distributes with bernoulli to prove the diagrammatic sketch of confidence level of the present invention.
Below, describe preferred embodiment of the present invention in detail with reference to accompanying drawing.
Fig. 2 is the schematic layout pattern that adopts the example network node of packet charging method of the present invention.In Fig. 2, the packet of transmission is Message Signal Unit (MSU).In the figure, the node of packet expense is collected/sent out to certain data packet node promptly, to other data packet nodes, is STP0 (hereinafter, it being called this Signalling Transfer Point).The adjacent data packet node, that is, the data packet node adjacent with certain data packet node STP0 is STP1, STP2, STP3 and STP4 (hereinafter, they being called adjacent Signalling Transfer Point).Source node, that is, the node of the packet that starts is SP1 and SP2.Destination node promptly, finally receives the node of packet, is SP3 and SP4.It should be noted that above-mentioned data packet node comprises packet transit point, source node and destination node.
In first preferred embodiment, this Signalling Transfer Point STP0 collects the charges to them with the different of the different of the destination node that finally receives MSU and corresponding M SU number and length according to receiving respectively from the signaling type of the MSU of adjacent transit point STP1 and STP2, the source node of originating MS U.Wherein, will be adjacent and belong to different communication company with certain data packet node STP0, and with the adjacent data packet node of certain data packet node STP0 generation expense relation, STP1 and STP2, be called relevant adjacent data packet node (hereinafter, being called relevant adjacent Signalling Transfer Point).
Below, according to charging method of the present invention, specify the charging calculation procedure of present embodiment:
(a) set up summary sheet (seeing Table 1), wherein said summary sheet comprises described relevant adjacent data packet node at least, described certain data packet node receives each described relevant adjacent data packet node packet total amount that send or that send to it and/or its total length in metering period.
In the summary sheet of this embodiment (promptly, following table 1), comprise relevant adjacent Signalling Transfer Point (ADJ), total amount (MSU_NBR) and the total length (MSU_LEN (bytes)) thereof of STP1 and STP2, this Signalling Transfer Point STP0 receives in the charge cycle the MSU that comes adjacent Signalling Transfer Point STP1 of auto-correlation and STP2 respectively.
????ADJ ????MSU_NBR ????MSU_LEN(bytes)
????STP1 ????150,000 ????7,800,000
????STP2 ????170,000 ????9,000,000
Table 1
(b) set up detail list (seeing Table 2), wherein said detail list comprises that at least described relevant adjacent data packet node, concrete charge require to receive each described relevant adjacent data packet node each data packet length that send or that send to it with described certain data packet node in described metering period.
In this embodiment, detail list (table 2) comprises that the concrete charge of relevant adjacent Signalling Transfer Point (ADJ) requires the length (MSU_LEN (bytes)) of (the different of type (SIO), source node (OPC) and destination node (DPC) according to MUS are charged) and each MSU that comes adjacent Signalling Transfer Point STP1 of auto-correlation or STP2 that this Signalling Transfer Point STP0 receives in metering period.
(c) in described metering period, the packet that is received or sent by described certain data packet node is sampled, and insert described detail list (following table 2) according to the particular content of described each packet that samples.
In this embodiment, to per 10 MSU once sampling (sampling density N=10), then, the concrete condition of every MSU according to the sampling gained, promptly, send the type (SIO) of relevant adjacent data bag transit point (ADJ), the MSU of this MSU, send source node (OPC) and the destination node (DPC) of final this MSU of reception and the length (MSU_LEN (bytes)) of MSU of this MSU at first, relevant information is inserted detail list.In this detail list, the specifying information of a MSU of every row record.
????ADJ ????SIO ????OPC ????DPC ?MSU_LEN(b ????ytes)
????STP2 ????84 ????SP1 ????SP3 ????30
????STP1 ????85 ????SP1 ????SP3 ????80
????STP2 ????84 ????SP2 ????SP4 ????30
????STP2 ????84 ????SP1 ????SP4 ????30
????STP2 ????85 ????SP2 ????SP3 ????80
????STP2 ????85 ????SP2 ????SP4 ????80
????STP1 ????85 ????SP1 ????SP4 ????80
????STP2 ????85 ????SP1 ????SP4 ????80
????STP1 ????84 ????SP2 ????SP3 ????20
????STP1 ????84 ????SP2 ????SP4 ????20
????STP1 ????85 ????SP2 ????SP4 ????80
????STP2 ????84 ????SP2 ????SP3 ????20
????STP1 ????85 ????SP2 ????SP3 ????80
????STP2 ????85 ????SP1 ????SP3 ????80
????STP1 ????84 ????SP1 ????SP4 ????20
Table 2
As seen, even in metering period, to per 10 MSU once sampling, but because the total amount of MSU is very big, so detail list is a very huge form, and table 2 is listed wherein one section.
(d) in described metering period, described detail list is added up, produce sampling statistical form (seeing Table 3), wherein said sampling statistical form comprise described relevant adjacent data packet node, described concrete charge requirement, sampling gained receive by described certain data packet node that each described relevant adjacent data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring.
Detail list is added up, refer to, information according to ADJ, SIO, OPC and the DPC of every the MSU that in a metering period, samples that in detail list, is write down, accumulate number and the length of the identical MSU of above-mentioned information, calculate total amount and the total length thereof of all identical MSU of ADJ, the SIO, OPC and the DPC information that in a metering period, sample.For example, accumulation and calculate samples in a metering period, and the MSU total amount that relevant adjacent data bag transit point is that STP0, signaling type are 84, source node and destination node are respectively SP1 and SP3 is 2,010, and its total length is 40,200 bytes.Produce the sampling statistical form as mentioned above, as shown in table 3:
????ADJ ????SIO ????OPC ????DPC ???MSU_NBR ?MSU_LEN(bytes)
????STP1 ????84 ????SP1 ????SP3 ????2,010 ????40,200
????STP1 ????84 ????SP1 ????SP4 ????990 ????19,800
????STP1 ????84 ????SP2 ????SP3 ????1,490 ????29,800
????STP1 ????84 ????SP2 ????SP4 ????2,505 ????50,100
????STP2 ????84 ????SP1 ????SP3 ????805 ????24,150
????STP2 ????84 ????SP1 ????SP4 ????1,200 ????36,000
????STP2 ????84 ????SP2 ????SP3 ????1,590 ????47,700
????STP2 ????84 ????SP2 ????SP4 ????2,410 ????72,300
????STP1 ????85 ????SP1 ????SP3 ????1,512 ????120,960
????STP1 ????85 ????SP1 ????SP4 ????1,494 ????119,520
????STP1 ????85 ????SP2 ????SP3 ????2,500 ????200,000
????STP1 ????85 ????SP2 ????SP4 ????2,501 ????200,080
????STP2 ????85 ????SP1 ????SP3 ????1,501 ????120,080
????STP2 ????85 ????SP1 ????SP4 ????2,992 ????239,360
????STP2 ????85 ????SP2 ????SP3 ????1,500 ????120,000
????STP2 ????85 ????SP2 ????SP4 ????3,005 ????240,400
Table 1
(e) according to described sampling statistical form, for each described relevant adjacent data packet node, calculate by the sampling gained pass through that described certain data packet node receives or send meet packet total amount that the every kind charge of described concrete charge in requiring require and/or its total length account for the sampling gained for corresponding each described relevant adjacent data packet node, the packet total amount that receives or send by described certain data packet node and/or ratio of its total length.
In this embodiment, for example, for relevant adjacent data bag transit point STP1, calculating by the sampling gained pass through that notebook data bag transit point STP0 receives meet signaling type SIO=84, MSU sum and its total length of source node OPC=SP1 and destination node DPC=SP3,2010 and 40,200, account for packet total amount and its total length of the next autocorrelative signaling data bag transit point STP1 that receives by notebook data bag transit point STP0, the ratio of 2010+1490+2505+990+1512+1494+2500+2501 and 40200+29800+50100+19800+120960+119520+200000+200080: R MSU _ NBR = 2010 2010 + 1490 + 2505 + 990 + 1512 + 1494 + 2500 + 2501 = 2010 15002 = 13.398 % R MSU _ LEN = 40200 40200 + 29800 + 50100 + 19800 + 120960 + 119520 + 200000 + 200080 = 40200 780460 = 5.151%
The rest may be inferred, the every kind of charge that meets from each relevant adjacent data bag transit point (STP1 or STP2) that receives through notebook data bag transit point STP0 that can calculate by the sampling gained requires the MSU total amount of (requiring according to the different charge of MSU type, source node and destination node in the present embodiment) and/or its total length to account for the MSU total amount of the next self-corresponding relevant adjacent data bag transit point that receives through notebook data bag transit point STP0 of sampling gained and/or the ratio of its total length.Then,
(f) ratio that will draw by step (e) be recorded in the described summary sheet, for corresponding each described relevant adjacent data packet node, the actual data packet total amount and/or its total length that are received or sent by described certain data packet node multiply each other, thereby draw receive by described certain data packet node that each described relevant corresponding data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring, can collect the charges according to this packet total amount and/or its total length then.
According to above-mentioned example, the MSU that will in step (e), draw respectively sum ratio 13.398% and total length ratio 5.151% be recorded in the summary sheet (table 1) by notebook data bag transit point STP0 actual reception to the MSU total amount (S from STP1 MSU_NBR) 150,000 and total length (S MSU_LEN) 7,800,000 multiply each other, draw the type that meets MSU of coming auto-correlation adjacent data bag transit point STP1 that receives by notebook data bag transit point STP0 and be 84, source node is that SP1 and destination node are that MSU total amount and the total length that the charge of SP3 requires is:
MSU_NBR=R MSU_NBR *S MSU_NBR=13.398% *150000=20097 (individual)
MSU_LEN=R MSU_LEN *S MSU_LEN=5.151% *7800000=401778 (byte)
Then, the communication common carrier at STP0 place according to the MSU number that is drawn and length and concrete SIO, OPC and DPC information, is collected corresponding cost to the communication common carrier at STP1 place.The rest may be inferred, can calculate required each MSU sum and total length according to said method, and collect the charges to the communication common carrier at relevant adjacent data bag transit point place according to concrete expenses standard.
In this embodiment, the size of used sampling density N is that quantity and the desired charging precision of the MSU that send according to the inherent communication links of metering period, unit interval determined.Wherein, many more as the quantity of metering period MSU long more, that send at communication links in the unit interval, desired charging precision is low more, and N is then big more so, and vice versa.
Below, equally with reference to Fig. 2, illustrate according to second preferred embodiment of the present invention.
In a second embodiment, this Signalling Transfer Point STP0 is different according to the type of the asynchronism(-nization) of the MSU that sends to relevant adjacent Signalling Transfer Point STP3 and STP4 and MSU, and the sum of corresponding M SU and total length, collect corresponding expense to above-mentioned relevant adjacent Signalling Transfer Point STP3 and STP4.Wherein, described asynchronism(-nization) is meant, the time that receives MSU is between 7:00~21:00 or between 21:00~next day 7:00.
(a) set up summary sheet (seeing Table 4), wherein said summary sheet comprises described relevant adjacent data packet node at least, described certain data packet node receives each described relevant adjacent data packet node packet total amount that send or that send to it and/or its total length in metering period;
In the summary sheet (following table 4) of this embodiment, comprise relevant adjacent Signalling Transfer Point (ADJ), STP3 is with STP4, this Signalling Transfer Point STP0 sends to total amount (MSU_NBR) and the total length (MSU_LEN (bytes)) thereof of the MSU of relevant adjacent Signalling Transfer Point STP3 and STP4 in the charge cycle.
????ADJ ????MSU_NBR ????MSU_LEN(bytes)
????STP3 ????150,000 ????7,800,000
????STP4 ????170,000 ????9,000,000
Table 4
(b) set up detail list (seeing Table 5), wherein said detail list comprises that at least described relevant adjacent data packet node, concrete charge require to receive each described relevant adjacent data packet node each data packet length that send or that send to it with described certain data packet node in described metering period;
In a second embodiment, detail list (table 5) comprises that relevant adjacent Signalling Transfer Point (ADJ), concrete charge require (according to the different charges with time of reception (TIME) of type (SIO) of the MSU that receives, if wherein chargeable time is between 7:00~21:00, in detail list, it is designated as 1 so; If chargeable time is at 21:00~next day 7:00, in detail list, it is designated as 0 so) send to the length (MSU_LEN (bytes)) of each MSU of relevant adjacent Signalling Transfer Point STP3 or STP4 with this Signalling Transfer Point STP0 in metering period.
(c) in described metering period, the packet that is received or sent by described certain data packet node is sampled, and insert described detail list (table 5) according to the particular content of described each packet that samples;
In this embodiment, the MSU that is sent by this Signalling Transfer Point STP0 is sampled, per 10 MSU once sampling (that is, sampling density N=10), and insert described detail list according to the particular content of described each MSU that samples, as shown in table 5:
????ADJ ????SIO ????TIME ?MSU_LEN(byt ????es)
????STP4 ????84 ????1 ????30
????STP3 ????85 ????1 ????30
????STP4 ????84 ????0 ????30
????STP4 ????84 ????1 ????40
????STP4 ????85 ????0 ????80
????STP4 ????85 ????0 ????80
????STP3 ????85 ????1 ????80
????STP4 ????85 ????1 ????80
????STP3 ????84 ????1 ????20
????STP3 ????84 ????0 ????20
????STP3 ????85 ????0 ????80
????STP4 ????84 ????1 ????20
????STP3 ????85 ????1 ????60
????STP4 ????85 ????1 ????40
????STP3 ????84 ????1 ????20
Table 5
(d) in described metering period, described detail list is added up, produce sampling statistical form (seeing Table 6), wherein said sampling statistical form comprise described relevant adjacent data packet node, described concrete charge requirement, sampling gained receive by described certain data packet node that each described relevant adjacent data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring;
In a second embodiment, in metering period, detail list is added up, according to ADJ, the SIO of every the MSU that in a metering period, samples that in detail list, is write down and the information of TIME, accumulate number and the length of the identical MSU of above-mentioned information, calculate total amount and the total length thereof of the ADJ, the SIO that in a metering period, the are sampled MSU all identical, produce the sampling statistical form with TIME information, as shown in table 6:
????ADJ ????SIO ??TIME ???MSU_NBR ?MSU_LEN(bytes)
????STP3 ????84 ????1 ????4,995 ????90,300
????STP3 ????84 ????0 ????2,000 ????49,600
????STP3 ????85 ????1 ????5,897 ????482,000
????STP3 ????85 ????0 ????2,102 ????157,800
????STP4 ????84 ????1 ????4,156 ????125,000
????STP4 ????84 ????0 ????1,842 ????54,990
????STP4 ????85 ????1 ????6,995 ????559,900
????STP4 ????85 ????0 ????2,001 ????160,000
Table 6
(e) according to described sampling statistical form, for each described relevant adjacent data packet node, calculate by the sampling gained pass through that described certain data packet node receives or send meet packet total amount that the every kind charge of described concrete charge in requiring require and/or its total length account for the sampling gained for corresponding each described relevant adjacent data packet node, the packet total amount that receives or send by described certain data packet node and/or ratio of its total length.
In this embodiment, for example, for relevant adjacent Signalling Transfer Point STP3, calculating is by the MSU sum and its total length that meet signaling type SIO=84, TIME=1 that this Signalling Transfer Point STP0 sends that pass through of sampling gained, 4,995 and 90,300, account for MSU total amount and its total length of sending to relevant adjacent signaling data bag transit point STP3 by this Signalling Transfer Point STP0, the ratio of 4995+2000+5897+2102 and 90300+49600+482000+157800: R MSU _ NBR = 4995 4995 + 2000 + 5897 + 2102 = 4995 14994 = 33.313 % R MSU _ LEN = 90300 90300 + 49600 + 48200 + 157800 = 90300 779700 = 11.581 %
The rest may be inferred, can calculate by the sampling gained by this Signalling Transfer Point STP0 send to each relevant adjacent Signalling Transfer Point (STP3 or STP4) meet that every kind of charge requires that the MSU total amount of (requiring according to the different charge of MSU type TIME in the present embodiment) and/or its total length account for the sampling gained send to the MSU total amount of corresponding relevant adjacent Signalling Transfer Point and/or the ratio of its total length through this Signalling Transfer Point STP0.Then,
(f) ratio that will draw by step (e) be recorded in the described summary sheet, for corresponding each described relevant adjacent data packet node, the actual data packet total amount and/or its total length that are received or sent by described certain data packet node multiply each other, thereby draw receive by described certain data packet node that each described relevant corresponding data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring, can collect the charges according to this packet total amount and/or its total length then.
According to above-mentioned example, the MSU sum ratio 33.313% that will in step (e), draw respectively and total length ratio 11.581% and the MSU total amount (S that is recorded in the summary sheet (table 4) by the actual STP3 of sending to of this Signalling Transfer Point STPO MSU_NBR) 150,000 and total length (S MSU_LEN) 7,800,000 multiply each other, the MSU total amount and the total length that draw the type that meets MSU that sends to relevant adjacent Signalling Transfer Point STP3 by this Signalling Transfer Point STPO and be 84, the charge of TIME=1 (that is, time of reception is in 7:00~21:00 scope) require are:
MSU_NBR=R MSU_NBR *S MSU_NBR=33.313% *150000=49969 (individual)
MSU_LEN=R MSU_LEN *S MSU_LEN=11.581% *7800000=903318 (byte)
Then, the communication common carrier at STP0 place according to the MSU number that is drawn and length and concrete SIO and TIME information, is collected corresponding cost to the communication common carrier at STP3 place.The rest may be inferred, can calculate required each MSU sum and total length according to said method, and collect the charges to the communication common carrier at relevant adjacent Signalling Transfer Point place according to concrete expenses standard.
From top embodiment as seen, because per 10 MSU once sampling, and list in the detail list, the information of every MSU of this and detail record is compared, and has reduced required memory span greatly.Below, prove that by calculating confidence level of the present invention employing the present invention can also guarantee accuracy.
Confidence level of the present invention is meant under the situation of predetermined metering period, sampling density N, and a certain charge of concrete charge in requiring that meet that may sample requires and drop on the MSU sum in the accuracy rating that goes out according to the accuracy computation by charge communication common carrier regulation and/or the probability of total length.Below, with reference to Fig. 3, add up to example with the MSU among first embodiment, calculate confidence level of the present invention.
Suppose:
N----sampling density, promptly every N bar MSU once sampling;
T----metering period length;
The average telephone traffic load of F----;
L MSU----average MSU length;
X TotalTotal MSU number in----given metering period T;
S TotalSampling sum in----given metering period T;
The specific OSI﹠amp of C1----; OPC﹠amp; The combination of DPC, that is, and a certain specific charge requirement;
K----X TotalIn meet the shared ratio of MSU sum of C1 combination, different relatively T is a constant;
x RMeet specific OSI﹠amp in----metering period T; OPC﹠amp; The MSU sum of DPC combination C1;
x SWhat sample in----metering period T meets specific OSI﹠amp; OPC﹠amp; The MSU sum of DPC combination C1;
P----x SProbability distribution;
P----confidence level according to this embodiment of the invention.
Wherein definition:
x Crit=x R/N。
The method of so this sampling meets Bernoulli test, and what may sample meets specific OSI﹠amp; OPC﹠amp; The probability density of the various MSU sums of DPC combination C1 meets Bernoulli and distributes, that is: p { x S = x } = C S Total x ( k ) x ( 1 - k ) S Total - x = f ( S Total , x ) - - - - - ( 1 )
Confidence level according to this embodiment of the invention shows as and may sample the probability that meets particular combinations C1 and drop on the MSU sum in the accuracy rating that is calculated according to the precision (Accu) by charge communication common carrier regulation: P = Σ x = x 1 x 2 p { x S = x } - - - - - ( 2 )
It is the area of dash area among Fig. 3.
Wherein, calculate above-mentioned accuracy rating by following formula:
Figure A0011179200143
In view of the above, can calculate confidence level of the present invention.With certain abominable situation is example.Abominable situation is meant the situation that influences the charging confidence level, is meant total traffic here seldom, and certain specific OSI﹠amp; OPC﹠amp; The ratio that the telephone traffic of DPC combination C1 is actual to account for total traffic is seldom situation also.For example: F=0.05Erlk=5%
Get L MSU=20bytes=160bits
1. when getting N=10,
If T=1 days=86400s, then: X Total = F * T L MSU = 0.05 * 64 * 1024 * 86400 160 = 1769472
x R=X Total *k=1769472 *0.05=88474????? S Total = X Total N = 176947
x Crit=x R/N=8847
Have according to formula (1) and formula (2):
Precision is greater than 95% as requested, and then if confidence level is 0.999998 T=1 month=2592000s, then: X Total = F * T L MSU = 0.05 * 64 * 1024 * 2592000 160 = 53084160
x R=X Total *k=53084160 *0.05=2654208??????? S Total = X Total N = 5308416
x Crit=x R/N=265421
Have according to formula (1) and formula (2):
Precision is greater than 98% as requested, and then confidence level is 1.0000002. when getting N=100,
If T=1 days=86400s, then: S Total = X Total N = 17695
x Crit=x R/N=885
Have according to formula (1) and formula (2):
Precision is greater than 95% as requested, and then if confidence level is 0.875216 T=1 month=2592000s, then: S Total = X Total N = 530842
x Crit=x R/N=26542
Have according to formula (1) and formula (2):
Precision is greater than 95% as requested, and then confidence level is 0.999999;
Precision is greater than 98% as requested, and then confidence level is 0.999164.
Following table has provided under the situation of different predetermined sampling densities and metering period, and precision is 95% or 98% o'clock as requested, and confidence level of the present invention is as follows:
????N T=24hours (precision 95%) T=1Week (precision 95%) T=1Mon (precision 95%) T=1Mon (precision 98%)
????10 ????0.999998 ????1.000000 ????1.000000 ????1.000000
????100 ????0.875216 ????0.999945 ????0.999999 ????0.999164
????200 ????0.727703 ????0.995610 ????0.999999 ????0.981949
????300 ????0.613640 ????0.980558 ????0.999998 ????0.945796
????400 ????0.572537 ????0.956697 ????0.999970 ????0.904851
????500 ????0.487849 ????0.927015 ????0.999814 ????0.866314
????1000 ????0.376785 ????0.791471 ????0.991673 ????0.713334
Can see that when metering period is longer this method can satisfy the requirement of charging precision with quite high probability.This is for generally being with the moon or year being can save the computer resource that 1~2 order of magnitude is used to charge between two communication common carriers chargeing of unit.
Having enumerated two embodiment above, it should be noted that for those skilled in the art that, is conspicuous for various changes of the present invention and modification, and these variations do not depart from design of the present invention and concept.Such as, communication common carrier can for example, can only be charged according to the sum of MSU or charge or charge according to other expenses standards according to sum and the total length thereof of MSU as mentioned above according to the needs regulation expenses standard of oneself.And for example, communication common carrier can be to the charge of the communication common carrier under the relevant adjacent data packet node (as STP1 among Fig. 2 and STP2) that receives MSU, also can charge to the communication common carrier under the relevant adjacent data packet node (as STP3 among Fig. 2 and STP4) that sends MSU, even can be simultaneously to the relevant adjacent data packet node charge that receives and send MSU.What be also pointed out that is, though in the above-described embodiments, be the communication common carrier charge of communication common carrier under relevant adjacent data bag transit point under certain packet transit point, but the present invention can be used for the situation of (as the SP3 among Fig. 2 and STP3 or STP4) of collecting the charges between packet transit point and source node (as the STP1 among Fig. 2 and SP1 or SP2) or destination node and the packet transit point equally, and need not to carry out innovation and creation.Therefore, the embodiment shown in the present invention is not limited to here, but limited by appended claims.

Claims (9)

1. one kind is used for certain data packet node and collects the charging method that receives or send the expense of packet to one or more relevant adjacent data packet nodes, it is characterized in that described method comprises the following steps:
(a) set up summary sheet, wherein said summary sheet comprises described relevant adjacent data packet node at least, described certain data packet node receives each described relevant adjacent data packet node packet total amount that send or that send to it and/or its total length in metering period;
(b) set up detail list, wherein said detail list comprises that at least described relevant adjacent data packet node, concrete charge require to receive each described relevant adjacent data packet node each data packet length that send or that send to it with described certain data packet node in described metering period;
(c) in described metering period, the packet that is received or sent by described certain data packet node is sampled, and insert described detail list according to the particular content of described each packet that samples;
(d) in described metering period, described detail list is added up, produce the sampling statistical form, wherein said sampling statistical form comprise described relevant adjacent data packet node, described concrete charge requirement, sampling gained receive by described certain data packet node that each described relevant adjacent data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring;
(e) according to described sampling statistical form, for each described relevant adjacent data packet node, calculate by the sampling gained pass through that described certain data packet node receives or send meet packet total amount that the every kind charge of described concrete charge in requiring require and/or its total length account for the sampling gained for corresponding each described relevant adjacent data packet node, the packet total amount that receives or send by described certain data packet node and/or ratio of its total length; With
(f) ratio that will draw by step (e) be recorded in the described summary sheet, for corresponding each described relevant adjacent data packet node, the actual data packet total amount and/or its total length that are received or sent by described certain data packet node multiply each other, thereby draw receive by described certain data packet node that each described relevant corresponding data packet node is sent or send to it meet every kind packet total amount and/or its total length that charge require of described concrete charge in requiring, can collect the charges according to this packet total amount and/or its total length then.
2. charging method as claimed in claim 1 is characterized in that described packet is meant the data message that transmits in diverse network, comprises Signaling System Number 7 or other signaling messages, IP(Internet Protocol) bag, Asynchronous Transfer Mode cell, or the like.
3. charging method as claimed in claim 1 is characterized in that, described certain data packet node can be the packet transit point, also can be source node or destination node.
4. charging method as claimed in claim 1 is characterized in that, to every N the packet once sampling that receives or send through described certain data packet node.
5. charging method as claimed in claim 4, it is characterized in that, the size of sampling density N depends on described quantity of data packets and the desired charging precision that transmits on described metering period, the inherent data link of unit interval, it is long more wherein to work as described metering period, the described quantity of data packets charging precision many more and described requirement that inherent communication links of unit interval send is low more, and described sampling density N is big more.
6. charging method as claimed in claim 1 is characterized in that, described concrete charge requires to comprise described type of data packet, reception or sends source node and destination node, the reception of described packet or send time period of described packet, or the like.
7. charging method as claimed in claim 6 is characterized in that, if rooting is charged according to the difference of type of data packet, so described detail list also comprises type of data packet.
8. charging method as claimed in claim 4, it is characterized in that, if rooting is according to the source node that receives or send described packet or destination node or both difference charges furthermore, so described detail list also comprises the source node that receives or send described packet or destination node or both furthermore.
9. charging method as claimed in claim 6, it is characterized in that, charge if rooting belongs to different time sections according to the time that receives or send described packet, so described detail list also comprises the time period mark under the time that receives or send described packet.
CN00111792A 2000-03-02 2000-03-02 Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes Expired - Lifetime CN1110925C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN00111792A CN1110925C (en) 2000-03-02 2000-03-02 Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN00111792A CN1110925C (en) 2000-03-02 2000-03-02 Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes

Publications (2)

Publication Number Publication Date
CN1311586A true CN1311586A (en) 2001-09-05
CN1110925C CN1110925C (en) 2003-06-04

Family

ID=4581688

Family Applications (1)

Application Number Title Priority Date Filing Date
CN00111792A Expired - Lifetime CN1110925C (en) 2000-03-02 2000-03-02 Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes

Country Status (1)

Country Link
CN (1) CN1110925C (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101924846A (en) * 2010-08-31 2010-12-22 北京云快线软件服务有限公司 Real-time charging method
CN101924638A (en) * 2010-08-31 2010-12-22 北京云快线软件服务有限公司 Real-time charging system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1194747A (en) * 1996-04-12 1998-09-30 纳特科通讯公司 Method for conveying data between a plurality of geographically-remote sender and recipient sites
GB2320852B (en) * 1998-02-06 2000-02-23 Orange Personal Comm Serv Ltd Telecommunications

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101924846A (en) * 2010-08-31 2010-12-22 北京云快线软件服务有限公司 Real-time charging method
CN101924638A (en) * 2010-08-31 2010-12-22 北京云快线软件服务有限公司 Real-time charging system

Also Published As

Publication number Publication date
CN1110925C (en) 2003-06-04

Similar Documents

Publication Publication Date Title
CN1812374B (en) Method and apparatus for managing packet data resources
US20040048630A1 (en) Allocation of radio resources in a CDMA2000 cellular system
CN1333984A (en) Determining subscriber demands on communiations system
CN1505347A (en) Measurement architecture to obtain per-hop one-way packet loss and delay in multi-class service networks
CN105721354A (en) Network-on-chip interconnection method and device
CN110247816A (en) Index monitoring method and device
CN1373586A (en) Universal internetwork charge method
CN100421514C (en) Method for distributing block domain data service radio channels
CN101043689A (en) Calling analytical method and apparatus
CN100340093C (en) Speech sound business real time recording and analysis system and its method
CN113891336B (en) Communication network frequency-reducing network-exiting method, device, computer equipment and storage medium
CN1199487C (en) Radio communication system charge method
CN1110925C (en) Charging method for collecting fee of receiving/transmitting data packet from data packet node to adjacent nodes
CN1547340A (en) A method for wireless network optimization of CDMA system
CN1926805A (en) System and method for quality condition analysis of access network supporting broad band telecommunication service
CN1905745A (en) Carrier configuration regulating method based on wireless network dynamic load capacity
CN1262021A (en) Resource estimation for variable bit rate data sources
CN105357694A (en) 4G user data message processing method and system
CN101064697A (en) Apparatus and method for realizing asynchronous transmission mode network service quality control
CN107864097B (en) Power utilization data distribution method and system
CN103796220A (en) Method and device for assessing wireless data service carrying efficiency
CN107426634B (en) A kind of evaluating method of centralized meter-reading system communication
CN1277370C (en) A charging method of switch-in network
CN114125936B (en) Resource scheduling method, device and storage medium
CN106911594B (en) Method for improving communication efficiency of mesh network application

Legal Events

Date Code Title Description
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C06 Publication
PB01 Publication
C14 Grant of patent or utility model
GR01 Patent grant
C56 Change in the name or address of the patentee

Owner name: BEIER AERKATE CO., LTD., SHANGHAI

Free format text: FORMER NAME: BELL CO.,LTD., SHANGHAI

Owner name: SHANGHAI ALCATEL-LUCENT CO., LTD.

Free format text: FORMER NAME: BEIER AERKATE CO., LTD., SHANGHAI

CP01 Change in the name or title of a patent holder

Address after: 201206 No. 388 Nanjing Road, Jinqiao Development Zone, Shanghai, Pudong

Patentee after: ALCATEL-LUCENT SHANGHAI BELL Co.,Ltd.

Address before: 201206 No. 388 Nanjing Road, Jinqiao Development Zone, Shanghai, Pudong

Patentee before: Shanghai Bell Alcatel Co.,Ltd.

Address after: 201206 No. 388 Nanjing Road, Jinqiao Development Zone, Shanghai, Pudong

Patentee after: Shanghai Bell Alcatel Co.,Ltd.

Address before: 201206 No. 388 Nanjing Road, Jinqiao Development Zone, Shanghai, Pudong

Patentee before: Shanghai Bell Co.,Ltd.

CP01 Change in the name or title of a patent holder
CP01 Change in the name or title of a patent holder

Address after: 201206 No. 388 Nanjing Road, Jinqiao Development Zone, Shanghai, Pudong

Patentee after: NOKIA SHANGHAI BELL Co.,Ltd.

Address before: 201206 No. 388 Nanjing Road, Jinqiao Development Zone, Shanghai, Pudong

Patentee before: ALCATEL-LUCENT SHANGHAI BELL Co.,Ltd.

CX01 Expiry of patent term
CX01 Expiry of patent term

Granted publication date: 20030604