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

Baynat, Bruno; Eisenmann, Pierre

doi:10.1109/icc.2004.1313231

Cited by 15 publications

(31 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This constraint defines a maximum throughput the network interface can reach or a maximum number of resource units that can be used by the MS. This characteristic has been introduced in the case of (E)GPRS networks [9] and consists in reducing the departure rates of the first states of the Markov chain. The same idea can be applied to our WiMAX model.…”

Section: Discussion Of the Modeling Assumptionsmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Analytical Model for the Dimensioning of WiMAX Networks

et al. 2009

View full text Add to dashboard Cite

Abstract. This paper tackles the challenging task of developing a simple and accurate analytical model for performance evaluation of WiMAX networks. The need for accurate and fast-computing tools is of primary importance to face complex and exhaustive dimensioning issues for this promising access technology. In this paper, we present a generic Markovian model developed for three usual scheduling policies (slot sharing fairness, throughput fairness and opportunistic scheduling) that provides closed-form expressions for all the required performance parameters at a click speed. This model is compared in depth with realistic simulations that show its accuracy and robustness regarding the different modeling assumptions. Finally, the speed of our analytical tool allows us to carry on dimensioning studies that require several thousands of evaluations, which would not be tractable with any simulation tool.

show abstract

Section: Discussion Of the Modeling Assumptionsmentioning

confidence: 99%

“…As a result, a blocking can occur when a new transfer demand arrives and the limit is reached. The blocking probability can be derived easily from the Markov chain [9]. 3.…”

Section: Discussion Of the Modeling Assumptionsmentioning

confidence: 99%

An Efficient Analytical Model for the Dimensioning of WiMAX Networks

et al. 2009

View full text Add to dashboard Cite

show abstract

“…In order to relax assumption 1, we can express the number of data slots, N S (n), as a function of n, the number of active users. This dependency can easily be integrated into the model by replacing N S by N S (n) (and N n S by n i=1 N S (i)) in the expressions of the departure rates µ(n), of the steady states probabilities π(n) and of the average utilisation ratioŪ (relations (7,28) for the full-capacity policies or relations (35, 36, 38) for the throttling policy). 2.…”

Section: Discussion Of the Modeling Assumptionsmentioning

confidence: 99%

“…In the context of (E)GPRS networks, we have studied similar processor sharing systems [7,5], and provided extensions to finite length sessions, where each mobile generates an ON/OFF traffic during a session and does not generate any traffic during an inter-session. We have shown in [7] that a very simple transformation of the traffic characteristics that increases the OFF periods by a portion of the inter-session period, enables us to transform the resulting bidimensional model into a linear Erlang-like model, with very good accuracy. The accuracy of this transformation is related to the insensibility of the average performance parameters with regards to the traffic distributions, that comes from the processor sharing policy (see the next point).…”

Section: Discussion Of the Modeling Assumptionsmentioning

confidence: 99%

An efficient analytical model for the dimensioning of WiMAX networks supporting multi-profile best effort traffic

Doirieux¹,

Baynat²,

Maqbool

et al. 2010

Computer Communications

View full text Add to dashboard Cite

This paper tackles the challenging task of developing a simple and accurate analytical model for performance evaluation of WiMAX networks. The need for accurate and fast-computing tools is of primary importance to face complex and exhaustive dimensioning issues for this promising access technology. In this paper, we present a generic Markovian model developed for three usual scheduling policies (slot sharing fairness, throughput fairness and opportunistic scheduling) that provides closed-form expressions for all the required performance parameters instantaneously. We also present and evaluate the performance of a fourth policy, called throttling policy, that limits the maximum user throughput and makes use of the Maximum Sustained Traffic Rate (MSTR) parameter foreseen by the standard. At last, we extend these studies to multi-profile traffic patterns. The proposed models are compared in depth with realistic simulations that show their accuracy and robustness regarding the different modeling assumptions. Finally, the speed of our analytical tools allows us to carry on dimensioning studies that require several thousands of evaluations, which would not be tractable with any simulation tool.

show abstract

“…So, we have developed a model based on an original constructive description of GPRS/ EDGE with a discrete-time Markovian model at the granularity of the GPRS radio block (note that all previously mentioned works have developed continuous-time models). This first model is presented in [1]. The original contribution of our work in [1 J is the detailed description of the GPRS/EDGE system in a discrete-time model which has allowed the derivation of a formula that has the simplicity of Erlang's B and C laws for voice but which applies to GPRS j EDGE.…”

Section: Introductionmentioning

confidence: 99%

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

Baynat

Boussetta

Eisenmann³

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. 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 discretetime Markov process that captures the detailed behavior of the radio allocator when a finite nurober 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.

show abstract

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

Cited by 15 publications

References 13 publications

An Efficient Analytical Model for the Dimensioning of WiMAX Networks

An Efficient Analytical Model for the Dimensioning of WiMAX Networks

An efficient analytical model for the dimensioning of WiMAX networks supporting multi-profile best effort traffic

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

Contact Info

Product

Resources

About