Charging Information Collection Modeling and Analysis of GPRS Networks

Charging is one of the most important functionalities in a telecommunication service system. In a general packet radio service (GPRS) wireless network, the load of charging information flow depends on the intensity of call traffic and the size of charging records. During busy hours, the GPRS network might not be able to transfer charging records on a timely basis if new charging records are generated too fast. On the other hand, when a call happens, the related charging information must be collected and transferred to the billing system. If a failure of the data link occurs, a secondary data link must be employed to transfer the charging information. However, this redundant operation might result in charging information duplication. This paper formally addresses these two issues. A timed Petri net model is built to support the analysis of the charging system performance versus various factors when the system works in the normal status, which, in particular, gives the maximum supportable busy hour call attempts of the GPRS network. The Petri net approach is also used to model and verify the correctness of the redundancy operation in case a connection failure occurs.

[1]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[2]  Gunnar Heine,et al.  GPRS: Gateway to Third Generation Mobile Networks , 2003 .

[3]  E. Gressier,et al.  A Stochastic Petri Net Model for Ethernet , 1985, PNPM.

[4]  Jiacun Wang,et al.  Timed Petri Nets: Theory and Application , 1998 .

[5]  David Munoz-Rodriguez,et al.  Modeling resource management in cellular systems using Petri nets , 1997 .

[6]  Gang Xu,et al.  Reachability Analysis of Real-Time Systems Using Time Petri Nets , 2000 .

[7]  J. J. Zhu,et al.  Timed Petri nets and their application to communication protocol specification , 1988, MILCOM 88, 21st Century Military Communications - What's Possible?'. Conference record. Military Communications Conference.

[8]  S. Natkin,et al.  Necessary and Sufficient Ergodicity Condition for Open Synchronized Queueing Networks , 1989, IEEE Trans. Software Eng..

[9]  Wlodzimierz M. Zuberek,et al.  Timed Petri nets definitions, properties, and applications , 1991 .

[10]  MengChu Zhou,et al.  THROUGHUT ANALYSIS OF DISCRETE EVENT SYSTEMS BASED ON STOCHASTIC PETRI NETS , 1999 .

[11]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[12]  Kurt Jensen,et al.  Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1 , 1996 .

[13]  Michael K. Molloy Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

[14]  MengChu Zhou,et al.  Petri nets and industrial applications: A tutorial , 1994, IEEE Trans. Ind. Electron..

[15]  Stéphane Natkin,et al.  A Necessary and Sufficient Saturation Condition for Open Synchronized Queueing Networks , 1987, Petri Nets and Performance Models.

[16]  Michael K. Molloy Fast Bounds for Stochastic Petri Nets , 1985, PNPM.

[17]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[18]  Ajmone MarsanMarco,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984 .