CN103634125A - Dynamic process combination-based network service billing method - Google Patents

Dynamic process combination-based network service billing method Download PDF

Info

Publication number
CN103634125A
CN103634125A CN201210309488.7A CN201210309488A CN103634125A CN 103634125 A CN103634125 A CN 103634125A CN 201210309488 A CN201210309488 A CN 201210309488A CN 103634125 A CN103634125 A CN 103634125A
Authority
CN
China
Prior art keywords
resource
request
user
billing
network service
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.)
Pending
Application number
CN201210309488.7A
Other languages
Chinese (zh)
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.)
ZHENJIANG RETECH INFORMATION TECHNOLOGY Co Ltd
Original Assignee
ZHENJIANG RETECH INFORMATION TECHNOLOGY 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 ZHENJIANG RETECH INFORMATION TECHNOLOGY Co Ltd filed Critical ZHENJIANG RETECH INFORMATION TECHNOLOGY Co Ltd
Priority to CN201210309488.7A priority Critical patent/CN103634125A/en
Publication of CN103634125A publication Critical patent/CN103634125A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a dynamic process combination-based network service billing method. The dynamic process combination-based network service billing method includes four sub-processes, namely, resource allocation, level selection, resource scheduling system maintenance and clearing implementation. The dynamic process combination-based network service billing method comprises the following specific processes of: firstly, a user initiates a resource request, and a system receives parameters of the resource related demand of the user and quality of service (QoS) and converts the parameters into billing parameters of the system; the system regularly maintains internal resources; the system performs billing according to services of the request of the user, and the billing parameters enter different levels; at the different levels, whether billing parameters of the request belong to the those levels is judged, and if the billing parameters of the request do not exceed threshold values, the request is received; settlement connection is established, and resource utilization quantity of the request of the user is recorded; and settlement and billing are performed on the services. Thus, with the dynamic process combination-based network service billing method of the invention adopted, the personalized demands of the user for network services can be satisfied, and at the same time, the user do not need to pay for waste flow, garbage and waiting time, and only need to pay for authentically effective services; and a fair and reasonable billing method can be provided for existing network services.

Description

A kind of network service charging method based on dynamic flow combination
Technical field
The present invention relates to a kind of implementation method of service charging, relate in particular to by the accurate-metering of service procedure dynamic combined being carried out to the implementation method of network billing, belong to applications of computer network field.
Background technology
Network billing is a key function in all kinds of services.For meeting user individual, diversified demand, Internet Service Provider provides according to demand the constantly service module of dynamic combined, thereby need to carry out effective charging according to the service of user's request simultaneously.Existing network service main flow charging method has standing charge, based on charge on traffic, based on duration based accounting, based on service quality (QoS) charging.
Standing charge is to disposable software purchase commodity or the usage charges collected of certain network service.These class methods are simple, but the software that user is used is provided with threshold, requires the higher expense of user's one-time payment, and cannot embody the meterage of the use as required principle to network service.
Based on charge on traffic, be to carry out charging according to the real data flow producing after accessing terminal to network, the data traffic that the user charges amount of money is only uploaded to user/downloaded is relevant, and time connected to the network and network insertion speed are irrelevant.And under present case, the contradiction of user to the demand data of large flow and flow restriction, makes user have to constrain self-demand, simultaneously also for junk traffic is checked.
Based on duration based accounting, be, according to user, Operational Visit duration is carried out to timing control to carry out charging according to this Operational Visit duration.But because network congestion causes a large amount of rubbish waiting times, the application of the resource of dissimilar service is simultaneously different, and the actual network traffic data gap of using is also larger, therefore has certain unjustness.
Based on service quality, charging is along with the sharp increase of Internet Users and various network services application, causes network congestion, user cannot obtain satisfied service quality and arise at the historic moment.By network service is fixed a price, the effect of exploitation value lattice mechanism regulation and control resource and user's relation between supply and demand, thereby guarantee resource utilization reach maximum in, meet to greatest extent the requirement of user to service quality.But computer network is a complicated system, by the service quality key of fixing a price, be to set up rational system model, but the existing model demand of complete reaction real system not yet.
Summary of the invention
Goal of the invention: the object of the invention is to provide a kind of network billing method of servicing based on dynamic flow combination for above-mentioned problems of the prior art and deficiency, by the accurate-metering to service procedure dynamic combined, thereby fair and reasonable charging is carried out in the active block service of obtaining according to user.
Technical scheme: a kind of network service charging method based on dynamic flow combination, comprise resource distribution, hierarchy selection, resource scheduling system maintenance and clearing and implement four sub-processes, mainly comprise following steps:
(1) user sends resource request;
(2) system receives the parameter of user resources related needs and relevant service quality (QoS);
(3) system cycle safeguards internal resource;
(4) system starts to carry out charging according to the service of user's request, and billing parameter enters different aspects;
(5) whether the billing parameter set in different aspects judgement request belongs to this level, or the no threshold value that exceeds, and determines whether to accept request; When request is denied, in selected aspect, cannot carry out resource distribution, proceed to step (1), user sends resource request again;
(6) request is allowed to, and sets up clearing and connects, the resource use amount (Q) of recording user request;
(7) service provider, according to user resources use amount (Q), settles accounts charging to business.
Parameter described in step (2) is the billing parameter that resource request parameter that system is sent according to user is converted into system.
Internal resource described in step (3), comprises volume of transmitted data, hard-disk capacity and bandwidth capacity.
Level described in step (5), comprises application layer, operation layer, accepts layer.
Resource use amount (Q) described in step (7) is according to Arthur D. Little (Little) rule, and throughput (f) and user by register system resource obtain the average use duration (T) of resource.
Beneficial effect: the network service charging method based on dynamic flow combination provided by the present invention, by to the Billing Analysis of flow process dynamic combined and design, effectively the dynamic combined of management services module is used, resource use amount to process model is carried out record, thereby realize effective service that user is obtained, carries out charging.Meet user to network service individual demand in, no longer by junk traffic, rubbish stand-by period, paid, but the real effectively service defrayment that oneself is obtained.
Accompanying drawing explanation
Fig. 1 is the workflow diagram of the embodiment of the present invention.
Fig. 2 is the service charging process schematic diagram of the embodiment of the present invention.
Fig. 3 is the clearing implementation process schematic diagram of the embodiment of the present invention.
Fig. 4 is that subsystem model schematic diagram is implemented in the clearing of the embodiment of the present invention.
Fig. 5 is that subsystem model initial condition figure is implemented in the clearing of the embodiment of the present invention.
Fig. 6 is the Markov Chain that subsystem model is implemented in the clearing of the embodiment of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, further illustrate the present invention, should understand these embodiment is only not used in and limits the scope of the invention for the present invention is described, after having read the present invention, those skilled in the art all fall within the application's claims limited range to the modification of the various equivalent form of values of the present invention.
As shown in Figure 1, the step of the network service charging method based on dynamic flow combination is as follows:
(1) user sends resource request;
(2) system receives the parameter of user resources related needs and relevant service quality (QoS);
(3) system cycle safeguards internal resource;
(4) system starts to carry out charging according to the service of user's request, and billing parameter enters different aspects;
(5) whether the billing parameter set in different aspects judgement request belongs to this level, or the no threshold value that exceeds, and determines whether to accept request; When request is denied, in selected aspect, cannot carry out resource distribution, proceed to step (1), user sends resource request again;
(6) request is allowed to, and sets up clearing and connects, the resource use amount (Q) of recording user request;
(7) service provider, according to user resources use amount (Q), settles accounts charging to business.
As shown in Figure 2, introduce Petri net as descriptive tool, more clear expression and the charging of structure flow process, and effectively analyze, wherein in transition, introduce the enforcement speed of obeying random distribution, for simplifying charging process, adopt alternative transition to represent decomposable subnet processing procedure: the maintenance of resource distribution, hierarchy selection, resource scheduling system and clearing are implemented simultaneously; Atom transition t1, t2, the result of t3 and the judgement of t4 presentation logic; The charging factor representation being associated with resource use amount the charging processed of process require:
User sends resource request, and with transition, D represents, produces user's request vector mark;
System is carried out resource distribution according to user's request, and with transition, E represents, produces a customer requirements vector mark;
Periodically the conservation of resources represents with transition U, and scheduling of resource database is modified;
Charge system is carried out charging according to the service of user's request, and billing parameter enters different aspects, and with transition, F represents, can select to enter application layer, operation layer, bearing bed;
Whether the charging factor set in different aspects judgement request belongs to this level charging factor range, or whether institute's required parameter scope exceed threshold value, and determines whether to accept request, and represents refusal respectively with transition t1, and transition t2 represents acceptance;
When request is denied, cannot carry out resource distribution, by certain factor in transition t3 representational level, can not guarantee the requirement that resource is distributed, request is rejected;
When request is allowed to, prepare to implement clearing, each factor obtains the request that resource is distributed, with transition G, represent settlement process execution respectively, come into effect the charge accounting process of this level, in t4 representational level, each factor can guarantee the requirement that resource is distributed, and request is accepted;
The H of storehouse institute is comprising user's request vector mark r, comprises the parameter of resource dependency demand and relevant service quality (QoS) in vector element;
The resource vector mark r* that the I of storehouse institute comprises customer requirements, comprises the parameters such as customer requirements and resource capacity in vector element;
The S of storehouse institute comprises resource status vector sign l, comprises the parameters such as volume of transmitted data, hard-disk capacity and bandwidth capacity situation in vector element;
The L of storehouse institute comprises hierarchy selection vector mark P, is comprising the parameters such as formation of the charging factor and level in vector element;
The P of storehouse institute comprises " implementing clearing " cell vector sign m, is comprising the parameters such as data transmission rate, cpu performance, memory size and bandwidth requirement in vector element;
The N of storehouse institute comprises " clearing are concluded " vector sign x, is comprising vectorial m, the parameters such as the factor of transmission settlement information and confirmation in vector element;
The M of storehouse institute refusal requires queue, comprises vector sign r;
The Z of storehouse institute receives and requires queue, comprises vector sign s, and vector element comprises vectorial l and r.
For operation and the processing of complex flow are described in further detail, alternative transition in Fig. 2 are further expanded into a subnet, the clearing connection procedure of take is as shown in Figure 3 example, will settle accounts connection procedure (transition C) and be expanded into a subnet, and implementation step is as follows:
(1) request is implemented parameter and is sent to selected charging aspect, and with transition, t5 represents, implements parameter m for k and delivers to k the clearing factor along selected aspect;
(2) in selected aspect, settling accounts factor positive or negative resource distributes, with transition t6, represent that a clearing factor in selected aspect has negated the resource of the distribution that requires respectively, t7 represents that in selected aspect settles accounts the resource that the factor has been confirmed the distribution that requires;
(3) in selected aspect, settle accounts the factor and all provided while answering to NACK messages and all clearing factors, with transition t8, represent that level selection is denied;
(4) now, the state value that all clearing factors that give confirmation are recovered them is original value, with transition t9, represents that it is original value that all clearing factors that give confirmation are recovered their state values;
(5) when giving acknowledge information, while representing that with transition t4 all clearing factors of selected aspect all give confirmation, it can be implemented, and final arrival settled accounts request queue;
P1 is intermediate node, and P2 is for negating, and P3 is for affirming, P4 is negative acknowledge, and P5, for recovering, settles accounts the resource use amount that obtains this subnet by parameter m, and then realizes independent resource and serve clearing.
In order to obtain user resources request in the resource use amount (Q) of subnet shown in Fig. 3, according to Little rule, need to obtain in advance throughput (f) and the average use duration (T) of user to resource of system resource.From the angle of being convenient to calculate, need to construct Markov Chain in the hope of the probability of stability, therefore build model schematic diagram as shown in Figure 4; K=6 is got in supposition simultaneously, and k1=2, thereby obtains subnet system model initial condition as shown in Figure 5, and according to the reachable set algorithm of stochastic Petri net, list clearing and implement the state conversion of subsystem model, obtain Markov chain as shown in Figure 6, use λ i to represent the speed of transition ti;
M (x) represents the sign of position x, that is the sign number that comprises under M in sign of position x, and it is as follows that the speed of each transition is set: λ 5=λ, λ 4=λ 3=λ 8=λ 6=10 λ, λ 9=k λ/M (p5)=3 λ/M (p5), λ 7/ λ 6=n or λ 7=n λ 6=10n λ.We can draw the probability of stability, thereby calculate the throughput of transition t5, and throughput approximately equivalent substitutes the enforcement speed of transition C.Thereby the steady probability of the state of acquisition M0 and the throughput of transition t5 are:
Figure 396572DEST_PATH_IMAGE001
Ti is i the time that client uses resource in system, [0, t] interior user, uses total duration that the average duration of resource is all users divided by total number of users, and the average duration of the client of stable state is: ;
Thereby the resource use amount that draws Fig. 4 is:
Figure 155767DEST_PATH_IMAGE003
Accordingly, can settle accounts according to resource use amount.Service provider, according to the use amount of resource and corresponding cost, draws this service price, and finally can settle accounts charging for this business.

Claims (5)

1. the network service charging method based on dynamic flow combination, is characterized in that, comprises resource distribution, hierarchy selection, resource scheduling system maintenance and clearing and implements Four processes, mainly comprises the steps:
(1) user sends resource request;
(2) system receives the parameter of user resources related needs and relevant service quality (QoS);
(3) system cycle safeguards internal resource;
(4) system starts to carry out charging according to the service of user's request, and billing parameter enters different aspects;
(5) whether the billing parameter set in different aspects judgement request belongs to this level, or the no threshold value that exceeds, and determines whether to accept request; When request is denied, in selected aspect, cannot carry out resource distribution, proceed to step (1), user sends resource request again;
(6) request is allowed to, and sets up clearing and connects, the resource use amount (Q) of recording user request;
(7) service provider, according to user resources use amount (Q), settles accounts charging to business.
2. the network service charging method based on dynamic combined as claimed in claim 1, is characterized in that: parameter described in step (2) is the billing parameter that resource request parameter that system is sent according to user is converted into system.
3. the network service charging method based on dynamic combined as claimed in claim 1, is characterized in that: internal resource described in step (3), comprises volume of transmitted data, hard-disk capacity and bandwidth capacity.
4. the network service charging method based on dynamic combined as claimed in claim 1, is characterized in that: the level described in step (5), comprises application layer, operation layer, accepts layer.
5. the network service charging method based on dynamic combined as claimed in claim 1, it is characterized in that: the resource use amount (Q) described in step (7) is according to Arthur D. Little (Little) rule, throughput (f) and user by register system resource obtain the average use duration (T) of resource.
CN201210309488.7A 2012-08-28 2012-08-28 Dynamic process combination-based network service billing method Pending CN103634125A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210309488.7A CN103634125A (en) 2012-08-28 2012-08-28 Dynamic process combination-based network service billing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210309488.7A CN103634125A (en) 2012-08-28 2012-08-28 Dynamic process combination-based network service billing method

Publications (1)

Publication Number Publication Date
CN103634125A true CN103634125A (en) 2014-03-12

Family

ID=50214784

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210309488.7A Pending CN103634125A (en) 2012-08-28 2012-08-28 Dynamic process combination-based network service billing method

Country Status (1)

Country Link
CN (1) CN103634125A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105915997A (en) * 2016-04-11 2016-08-31 广州酷狗计算机科技有限公司 Control part display method and device
CN107358531A (en) * 2016-05-09 2017-11-17 平安科技(深圳)有限公司 premium settlement method and device
CN112905945A (en) * 2019-11-19 2021-06-04 中移物联网有限公司 Charging method, charging device and readable storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588946A (en) * 2004-09-14 2005-03-02 北京邮电大学 Managing system for providing service quality assuranced on internet and its realizing method
WO2006080667A1 (en) * 2004-09-30 2006-08-03 Kt Corporation Apparatus and method for integrated billing management by real-time session management in wire/wireless integrated service network
CN101242568A (en) * 2007-02-09 2008-08-13 华为技术有限公司 A method and system for service quality negotiation in wireless communication network
CN101335629A (en) * 2007-06-29 2008-12-31 华为技术有限公司 Charging method and system, charging apparatus, related decision-making equipment and network appliance
CN101945367A (en) * 2009-07-08 2011-01-12 中兴通讯股份有限公司 Charging method and device for evolved packet system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1588946A (en) * 2004-09-14 2005-03-02 北京邮电大学 Managing system for providing service quality assuranced on internet and its realizing method
WO2006080667A1 (en) * 2004-09-30 2006-08-03 Kt Corporation Apparatus and method for integrated billing management by real-time session management in wire/wireless integrated service network
CN101242568A (en) * 2007-02-09 2008-08-13 华为技术有限公司 A method and system for service quality negotiation in wireless communication network
CN101335629A (en) * 2007-06-29 2008-12-31 华为技术有限公司 Charging method and system, charging apparatus, related decision-making equipment and network appliance
CN101945367A (en) * 2009-07-08 2011-01-12 中兴通讯股份有限公司 Charging method and device for evolved packet system

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105915997A (en) * 2016-04-11 2016-08-31 广州酷狗计算机科技有限公司 Control part display method and device
CN105915997B (en) * 2016-04-11 2018-12-21 广州酷狗计算机科技有限公司 Control display methods and device
CN107358531A (en) * 2016-05-09 2017-11-17 平安科技(深圳)有限公司 premium settlement method and device
CN112905945A (en) * 2019-11-19 2021-06-04 中移物联网有限公司 Charging method, charging device and readable storage medium
CN112905945B (en) * 2019-11-19 2023-08-15 中移物联网有限公司 Charging method, device and readable storage medium

Similar Documents

Publication Publication Date Title
Li et al. Price incentive-based charging navigation strategy for electric vehicles
Yao et al. A real-time charging scheme for demand response in electric vehicle parking station
Ye et al. Towards cost minimization with renewable energy sharing in cooperative residential communities
Hua et al. Joint infrastructure planning and fleet management for one-way electric car sharing under time-varying uncertain demand
CN101216855B (en) Message kind business accumulated data caching method and system
Gkatzelis et al. Optimal cost-sharing in general resource selection games
Chow et al. Activity-based market equilibrium for capacitated multimodal transport systems
CN104778076B (en) A kind of cloud service workflow schedule method
CN111091224A (en) Electric vehicle charging electric energy transaction method based on block chain technology
CN102281290A (en) Emulation system and method for a PaaS (Platform-as-a-service) cloud platform
JP2012517639A (en) Method and system for calculating charges online based on user service volume
Zhao et al. Data-driven robust optimal allocation of shared parking spaces strategy considering uncertainty of public users’ and owners’ arrival and departure: An agent-based approach
Randhawa et al. Usage restriction and subscription services: Operational benefits with rational users
CN102426590A (en) Quality evaluation method and device
CN101945370A (en) Method and system for implementing dynamic strategy control
CN109066660A (en) A kind of power distribution network congestion management and decreasing loss method and apparatus based on optimal reconfiguration
CN108281989A (en) A kind of wind-powered electricity generation Economic Dispatch method and device
CN111585798B (en) Network resource parameter configuration method, device and computer readable storage medium
CN103634125A (en) Dynamic process combination-based network service billing method
Shi et al. Lyapunov optimization in online battery energy storage system control for commercial buildings
US20220176841A1 (en) Methods and systems for optimal pricing and charging control of a plug-in electric vehicle charging station
CN106982126A (en) A kind of resource-sharing charging method and message accounting, memory bank
CN1795663B (en) Method and system for controlling prepaid data services
CN103632279A (en) Mobile internet advertisement automatically publishing method and apparatus based on fuzzy clustering technology
Huang The value-of-information in matching with queues

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20140312