Pierre Eisenmann

Towards an Erlang-like law for GPRS/EDGE network engineering

A model for GPRS/EDGE network engineering is developed in order to obtain an Erlang-like law. It is based on a discrete-time Markov chain. It captures the main features of the GPRS/EDGE radio resource allocation and assumes an ON/OFF traffic (infinite sessions with geometric distributions of ON/OFF sizes) performed by a finite number of users over the cell. The Markov chain is simplified by Taylor series expansion and a simple and accurate Erlang-like law is obtained.

Towards an Erlang-Like Formula for the Performance Evaluation of GPRS/EDGE Networks with Finite-Length Sessions

In this paper, we focus on a simple yet important objective: to provide Erlang-like models for GPRS/EDGE radio engineering. To this end, we develop a constructive model based on an original discrete-time Markov process that captures the detailed behavior of the radio allocator when a finite number of users are performing ON/OFF sessions in the cell. After a preliminary focus on infinite-length sessions, which provide a simpler analytical framework, we include finite-length sessions and study their specific effects.

Extended Erlang-B law for performance evaluation of radio resources sharing in GSM/(E)GPRS networks

In this paper, we derive a simple and accurate Erlang-like law for the dimensioning of radio resources in GSM/GPRS/EDGE networks taking into account the voice and data traffic mix in a cell. Resources are assumed to be shared according to the so-called partial partitioning scheme whereby some circuits are dedicated to voice, others to data, and the remaining are shared but voice traffic can preempt them