DocumentCode
415373
Title
Towards an Erlang-like law for GPRS/EDGE network engineering
Author
Baynat, Bruno ; Eisenmann, Pierre
Author_Institution
Lab. d´´ Informatique de Paris 6, France
Volume
6
fYear
2004
fDate
20-24 June 2004
Firstpage
3689
Abstract
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.
Keywords
Markov processes; discrete time systems; mobile radio; packet radio networks; resource allocation; telecommunication traffic; Erlang law; GPRS-EDGE network engineering; Taylor series; discrete-time Markov chain; general packet radio service; radio resource allocation; Analytical models; Ground penetrating radar; Queueing analysis; Radio link; Resource management; Speech analysis; Taylor series; Telecommunication traffic; Traffic control; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2004 IEEE International Conference on
Print_ISBN
0-7803-8533-0
Type
conf
DOI
10.1109/ICC.2004.1313231
Filename
1313231
Link To Document