Channel Allocation for GPRS

From: IEEE Tran. Veh. Technol., Vol. 50, no. 2,

2001.
Author: P. Lin and Y.-B. Lin
CSIE, NTU & CSIE, NCTU
Outline
Introduction
GPRS architecture
Packet data logical channel
Channel allocation schemes
System model
Analysis results
Simulation method
Performance
Conclusion
Introduction
GPRS shares GSM frequency bands with
telephone and circuit-switched data traffic
GPRS uses the same TDMA/ FDMA
structure as that of GSM to form physical
channels
Allocation of channel for GPRS is flexible
where one to eight channels can be
allocated to a user or one channel can be
shared by several users
GPRS architecture
Packet data logical channel
Packet data traffic channel (PDTCH)
Employed for transferring of user data
Packet broadcast control channel (PBCCH)
Broadcast control
Packet common control channel (PCCCH)
The packet random access channel (PRACH)
The packet paging channel (PPCH)
The packet access grant channel (PAGCH)
The packet notification channel (PNCH)
Packet dedicated control channels
The packet associated control channel (PACCH)
The packet timing advance control channel (PTCCH)
Packet data logical channel (contd)
Group Name Direction Function
PTC PDTCH Downlink and uplink Data

PBCCH PBCCH Downlink Broadcast
PCCCH PRACH Uplink Random access
PPCH Downlink Paging
PAGCH Downlink Access grant
PNCH Downlink Multicast
PDCH PTCCH Downlink and uplink Timing advance
PACCH Downlink and uplink

Associated control
Dynamic allocation: uplink data transfer
Dynamic allocation: downlink data transfer
Channel allocation schemes:
Fixed Resource Allocation (FRA):
For a data request of K channels, the BS assigns exact K
channels to GPRS packet request
Dynamic Resource Allocation (DRA):
For a data request of K channels, DRA allocates at most K
channels to the request
Fixed Resource Allocation with Queue Capability (FRAQ)
FRAQ_N: a queue for the new calls only
FRAQ_H: a queue for the handoff calls only
FRAQ_NH: a queue for both new and handoff calls
Dynamic Resource Allocation with Queue Capability (DRAQ)
DRAQ_N: similar to FRAQ_N
DRAQ_H: similar to FRAQ_H
DRAQ_NH: similar to FRAQ_NH
A GPRS data request specifies K channels for
transmission
The GSM voice call arrival and GPRS packet
requests to a cell form Poisson streams with
rates and , respectively
The voice call holding time and packet
transmission time are exponentially distributed
with mean times and ,
respectively
System model
v

p
/ 1
v
/ 1
: the residence time of voice user at a cell j, which are
independent and identically distributed random
variables with a general function with mean
j m
t
,
v c
t
,
v c v
t u
v v c v c
e u t f
,
) (
, ,

=
: the voice call holding time, which is assumed to be
exponentially distributed with the density function
j m
t
,

1
) (
, j m m
t f
The timimg diagram
vh

bv
P
bp
P
: the new call blocking probability for the GSM
: dropping/ blocking probability for the GPRS
: voice handoff call arrival rate to a cell
v

: GSM voice user mobility rate

: probability that a GSM voice call is not completed (either blocked
or forced to terminate)
ncv
P
: the GSM voice call traffic load v

: the GPRS packet call traffic load

Analytic model for FRA
)] ( ) 1 ( 1 [
)] ( 1 )[ 1 (
*
v m fv v
v v
*
m bv v
vh
u f P u
u f P


=
q

)] ( ) 1 ( 1 [
)] ( 1 )[ ( ) ( [
1 ) (
*
v m fv v
v
*
m v
*
m bv fv bv v
v
v
v
u f P u
u f u f P P + P
u

=
j m
st
t
j m m m
dt e t f s f
j m
j m
, ,
*
,
0 ,
) ( ) (

}
=
=
where
(1)
(2)
Analytic model for FRA (contd)
)
!
)(
!
( ) (
1
p
n
p
v
n
v
n n
G n p
p
v

=
(3)
(4)
)
`

s s s s s + =
K
C
n and C n C Kn n n n S
p v p v p v FRA
0 , 0 , ) , (
fv
v m fv v
v v
*
m bv v
bv
fv
v
h v
bv nc
P
u f P u
u f P
P
P P P
v

+ =
|
|
.
|

\
|
+ =
)] ( ) 1 ( 1 [
)] ( 1 )[ 1 (

*
,
q

state space : FRA

S
stationary probability:
Analytic model for FRA (contd)

s s s s = + e
=
} 0 , 0 , )| , {(
) (
K
C
n C n C Kn n n n n
bv
p v p v p v
n p P

s s s s s + < e
=
} 0 0 {(
) (
K
C
n C, n C, Kn n K )|C ,n n n
bp
p v p v p v
n p P
] )
!
)(
!
[(

e
=
FRA
p
v
S n
p
n
p
v
n
v
n n
G

p
p p
=
where
(5)
(7)
(6)
The iterative algorithm for FRA
Step 1: Select an initial value for
Step 2:
Step 3: Compute and using (2) and (4)-(7)
Step 4: Compute using (1)
Step 5: If then go to step 2. Otherwise
,go to step 6. Note that is a predefined threshold
say
Step 6: The values for , and converge. Compute
from (3)
vh

vh old vh

,
bp
P
bv
P
ncv
P
vh

vh old vh vh
-
,
7
10

vh

bv
P
bp
P
o
Analytic model for DRA
} 0 ,
2
0
,
3
0 , 0
, 2 3 0 | ) , , , {(
C l and
C
k
C
j C i
C l k j i l k j i S
DRA
s s
(

s s
(

+ + + =
v v v
u M + =
vh v v
+ =
v v v
u M + = where
The state transition for DRA
Lets consider the case when K=3
Analytic model for DRA (contd)
The balance equations for the Markov process are expressed:
1 , , ,
, 1 , , , , 1 , , , , 1
1 , , , 1 , 1 , , 2 , , 1 , 3 , , , 1
, , , 3 2 1
) 1 (
) 1 ( 2 ) 1 ( 3 ) 1 (
) 2 3
+
+ + +

+ + +
+
+
+ + + + + +
+ + + + A =
+ + + + + + + A
l k j i p
l k j i p l k j i p l k j i v
l k j i p l k j i p l k j i p l k j i v
l k j i p p p p p p v v
l
k j M i
l k j iM
t
t t t
t o t o t o t
t o o o o
Analytic model for DRA (contd)
{
} C l
and
C
k
C
j C i
C l k j i l k j i E
s s
(

s
(

= + + + =
0
,
2
0 ,
3
0 , 0
, 2 3 0 | ) , , , (
1

e
= = =
1
) , , , (
, , ,
E l k j i
l k j i fv bv bp
P P P t
: the set of the states where no free channel is available
1
E
Analytic model for FRAQ
}
(

s s + s s
+ s + s =
K
C
y Q C x
Q C Ky y x S
N FRAQ
0 , 0
, x 0 | ) , {(
_
C Ky < + s x 0 : I Case
Analytic model for FRAQ (contd)
C Ky = + x : II Case
Q C Ky + < + < x 0 : III Case
Analytic model for FRAQ (contd)


=
+
=
|
|
.
|

\
|
=
K C
y
Ky Q C
Ky C x
y x fv
P
0
,
t
{ }
(

s s + s s + s + < =
K
C
y Q C x Q C Ky x K C y x E 0 , 0 , | ) , (
2

e
=
2
) , (
,
E y x
y x bp
P t


=
+
=
|
|
.
|

\
|
+ + +
+ +
=
K C
y
Ky Q C
Ky C x
v v
y x v
bv
Ky C x M Ky C
Ky C x
P
0
,
) 1 ( ) (
) 1 (
q
t q
: a packet request is dropped if the number of free channels
is smaller than K
2
E
Simulation method
We consider a 6x6 wrapped mesh cell
structure
The model follows the discrete event
simulation approach
6X6 wrapped mesh cell structure
Performance of FRA ( )
Performance of GPRS data rate: increase as K
increase
Effects of packet size :in Fig. 6(b)
Effect of voice call arrival: in Fig. 6(c)
Effect of voice user mobility: in Fig. 6(d)
voice user mobility has no apparent effect on

bp
P
bp
P
bp
P
Performance of FRA ( )
Effect of packet size: in Fig. 7(b)
Effect of voice call arrival: in Fig. 7(c)
packet request have less chance to served as K
increases, and decreases as K increases
Effect of voice user mobility: in Fig. 7(d)
high mobility, handoffs are more likely to occur in a
voice call,thus for high mobility is larger



ncv
P
ncv
P
ncv
P
Comparison for the FRA and DRA
algorithms
Performance of
DRA algorithms (with or without queueing)
always outperform FRA (with or without
queueing)
Performance of
the DRAQ_NH outperforms other algorithms

ncv
P
bp
P
Effect of the variations of the distribution
for input parameters
The average number of channels assigned
to packet transmission
The average waiting time for the accepted
voice call request
Conclusion
The dynamic allocation effectively increases
the GPRS packet acceptance rate and
queueing mechanisms significantly reduce
the voice call incompletion probability