An Analytical Model For Best Effort Traffic in WiMAXNetworks

International Journal of Advance Foundation and Research in Computer (IJAFRC)
Volume 1, Issue 4, April 214! I""# 2$4% & 4%'$

( ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+
An Anal.tical /odel for 0est 1ffort 2raffic in 3i/A4
#et,or5s
Swati Sahu, Anjulata Yadav, Shekhar Sharma
Department Of Electronics and Telecommunication Engineering
S.G.S. Institute of Technology and Science, Indore, India
swati03.sahugmail.com , yadawan!ulatarediffmail.com , she"har.sgsitsgmail.com

A 0 " 2 R A C 2
3i/A4 is 6ased on standard I111 %2!17 and it is a ver. promisin+ technolo+. for 6road6and
,ireless access due to its middle ran+e access, hi+h data rates, mo6ile access, hi+h scala6ilit. and
convenient deplo.ment! 3i/A4 desi+ned to support different t.pe of application li5e voice, video
and data! 2o support different t.pes of application, there is various service classes defined in
3i/A4! 0est 1ffort is one of the service class ,hich supports ,e6 traffic! In this paper, anal.tical
model has 6een presented for mono and multi profile ,e6 traffic 6ased on /ar5ov chain anal.sis!
In this model /a8imum "ustained 2raffic Rate (/"2R) ,hich is one of the 9o" (9ualit. of service)
parameter associated ,ith the 01 service class is ta5en into account! 2his model provides closed
form e8pressions +ivin+ all the performance parameters such as avera+e instantaneous user
throu+hput, avera+e num6er of active users and avera+e resource utili:ation! 2his model allo,s
the 3i/A4 net,or5 operator and manufacturer to find the minimum num6er of users in a cell
that +ive '; avera+e resource utili:ation and the ma8imum num6er of users in the cell can also
6e found that +uarantee the minimum throu+hput threshold!

Inde8 2erms< 3i/A4, /ar5ov Chain, "chedulin+, =F>/A, /"2R, 9o"!

I! I#2R=>?C2I=#

Due to the increasing demand of internet population, the interest in broadband wireless access has
increased dramatically in recent few years. This encourages manufacturer and academic researcher
towards the development of !!!"#$.%& based 'i(A) networks. 'i(A) operates at a high fre*uency at
a high fre*uency of $+%% ,-. and %#+&& ,-. for /on 0ine 1f Sight 2/01S3 and 0ine 1f Sight 201S3
transmission respectively 4%5.Theoretically, 'i(A) 6ase Station 26S3 can provide coverage are for
wireless access in the range of 7# km for fi8ed Subscriber Station 2SS3 and 7 to %# km for (obile Station
2(S3 with ma8imum of data rate up to 9# (bps 4$5.

1ne of the most important features of 'i(A) is to support of :uality of Service 2:oS3 to different type of
traffic such as ;oice 1ver < 2;1<3, =ile Transfer <rotocol 2=T<3, video streaming, http etc. n order to
facilitate :oS features to different applications, the network traffics are categori.ed into five different
types of service> ?nsolicited ,rant Service 2?,S3, real time <olling Service 2rt<S3, e8tended real time
<olling Service 2ert<S3, non real time polling service 2nrt<S3 and 6est !ffort 26!3. (ost of the web traffic
falls into the 6! service class. !ach service class has different network characteristics and :oS
re*uirements. (ST@ is one of the :oS parameter associated with 6! service. This is not a guaranteed rate
but an upper bound 4$5.This parameter defines the peak information rate of the service. The rate is
e8pressed in bits per second. The procedure to implement this rate has been left open in the standard. n
this paper, (ST@ is taken into account while deriving the e8pression for performance parameter. This
implies the implementation of a throttling scheduling policy 4A5 that regulates the user peak data rate.

(1 ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+

!!! "#$.%& defines the specifications for (AB and <hysical layers of 'i(A) networks. <hysical layer
considers two types of transmission techni*ues 1rthogonal =re*uency division (ultiple8ing 21=D(3 and
1rthogonal =re*uency division (ultiple Access 21=D(A3. 6oth of these techni*ues have fre*uency band
below %% ,-. and use Time Division Duple8ing 2TDD3 and fre*uency Division Duple8ing 2=DD3 as its
duple8ing technology. 1=D( divides the available spectrum into a number of parallel orthogonal
subcarriers then the available subcarriers are grouped into subset of subcarriers called sub+channel.
Different sub+channels can be allocated to different mobile stations depending on their channel
conditions and data re*uirement. There are several sub+channeli.ation schemes defined in mobile
'i(A) 4$5. Distributed subcarrier permutation is most preferable sub+channeli.ation scheme in which
subcarriers are pseudo randomly distributed across the fre*uency spectrum. <artial ?sage of SubBarriers
2<?SB3 is a type of Distributed subcarrier scheme.

Slot allocation is also another responsibility of the <-Y layer. Slot is a minimum time Cfre*uency resource
that can be allocated by a 'i(A) to a given link 4$5.=or <?SB, every slot is made over $ symbol and one
subchannel. n TDD mode the frame is divided into two subframes> a downlink frame followed by a
uplink frame after a small guard interval.

Another important feature of mobile 'i(A) is that it supports adaptive modulation and coding schemes
2(BS3 enabling it to vary (BS according to the channel conditions. 'i(A) (BS can be changed on a
burst by burst basis per link, depending on the channel condition. (ost critical part of the (AB layer is
the scheduling. Scheduling mechanism makes decision that how to allocate available resources among
the users to meet the :oS re*uirements.

The rest of the paper is organi.ed is as follows> section $ describes the related work of performance
analysis of 6! traffic in 'i(A). Section A defines the assumptions made for the analytical model. The
proposed (arkov Bhain model for mono and multi profile traffic are describes in the section D ./umerical
results are presented in section 7.Bonclusion and area of future research are finally drawn in section &.
II! R1@A21> 3=RA
(any research efforts have been dedicated to performance evaluation of traffic scheduling schemes. Eim
and Yeom in 4"5 have presented a comprehensive performance analysis of 6! traffic in !!! "#$.%&
networks. =irst, they have derived two re*uest+based bandwidth allocation schemes, and then compared
them with a scheme for bandwidth allocation without re*uest. Authors of 4F5 have presented a fair
resource scheduling scheme for 6! traffic and have analy.ed the system performance with the help of
simulations. n 4%#5, authors have proposed a 'eighted <roportional =air 2'<=3 scheduling for 6! traffic
of 'i(A). Analytical e8pressions have been derived for different performance metrics.

'hile considering the 6! traffic, users may generate traffic of different profiles 2characteri.ed by the
volume of data generated and reading time3 475. n 4%%5 the performance of multi+profile internet traffic
for a 'i(A) cell using packet level simulations has been studied. They have evaluated the throughput
performance in a cell while considering the number of users, modulation schemes to be used by users
and data rate re*uired by users using System 0evel Simulation 2S0S3.

An analytical model for 6! traffic without considering (ST@ has been proposed in 4&5. n the paper 4A5,
authors have put forward an analytical model for mono and multi profile traffic taking (ST@ into
account. The author considered D (BS techni*ue :<SE G, :<SE+AHD, %&:A(+%H$ and %&:A(+AHD. n
this paper, similar analytical model as 4A5 has been considered with & (BS schemes> :<SE+%H$, :<SE+

AHD, %&:A(+%H$, %&:A(+AHD, &D :A(+$HA, &D:A(+AHD and also behavior of the model is observed for
higher and lower loads 2% (b, A(b and &(b3 and for different (ST@ re*uirement.
III! "B"21/ >1"CRIC2I=#
n this section, 'i(A) scheduling mechanism is discussed briefly and then throttling scheduling policy
has been introduced. To develop an analytical model, some assumptions have been made. =inally,
assumptions have been discussed.

$!1 3i/A4 schedulin+ mechanism

Scheduling is the main component of the (AB layer that assures :oS to various service classes. The (AB
scheduling Services are adopted to determine which packet will be served first in a specific *ueue to
guarantee its :oS re*uirement. Scheduling architecture should ensure good use of bandwidth, maintain
the fairness among users, and satisfy the re*uirements of :oS. Two types of scheduling schemes are
supported by 'i(A) i.e. uplink re*uestHgrant scheduling and downlink scheduling. Scheduling
algorithm can be implemented in the 6S as well as in the (Ss.6S has to deal with the both uplink and
downlink traffics and hence two schedulers are needed at the 6S to schedule the packet transmission in
downlink and uplink subframe and one scheduler at the SS for uplink to apportion the assigned 6' to its
connections. The scheduling decision for the downlink traffic is relatively simple as only the 6S transmits
during the downlink sub frame and the *ueue information is located in the 6S. n this paper, a throttling
scheduling policy has been introduced as 6S scheduler.
$!2 2hrottlin+ schedulin+ polic.

n this scheduling policy 4A5, there is a limit on ma8imum achievable instantaneous user throughput and
in a TDD frame, the user can be allocated only the number of slots re*uired to guarantee its (ST@. f a
mobile is in outage it does not receive any slot and its throughput is degraded temporarily. f at a given
time the total number of available slots is not enough to satisfy the (ST@ of all active users, they all see
their throughputs e*ually degraded. After ensuring that each active user attains his ma8imum
throughput, if there are still resources available in the frame these resources go unused.

$!$ /odelin+ assumptions

A single 'i(A) cell is considered that handle traffic of 6! service class. The number of (S in a
cell is represented by /.
The overhead in the TDD frame is assumed to be constant and hence number of slots available for
data transmission in TDD frame is constant and it is denoted by /s.
The number of (S allowed to be in active transfers is not limited i.e. no blocking can occur and all
connection demand will be accepted.
6ased on the radio link *uality, (S can change the (BS very often.t is assumed that (S change
its coding scheme at every frame. At each time step, any (S has probability p" to use #$S".
-anover condition is not taken into consideration.
Since only 6est !ffort traffic is taken into account, each mobile station 2out of /3 is assumed to
generate an infinite length 1/H1== elastic traffic. 1/H1== periods representing web+page
downloads and the intermediate reading times. 1/ period depend on the system load and
characteri.ed by their si.e and 1== period 2reading time3 is characteri.ed by its duration.
6oth 1/ si.e and 1== duration are e8ponentially distributed.

($ ) * 214, IJAFRC All Ri+hts Reserved
IV! /=#=&2RAFFIC A#A@B2ICA@ /=>1@
The proposed analytical model for 6! traffic of 'i(A) is based on a Bontinuous Time (arkov Bhain
2BT(B3 made of / I % states 4A5. This BT(B is shown in

Fi+ure 1 Deneral C2/C ,ith state

At any instant state n of this chain 2#
2i.e., (S that are in 1/ period3.
A transition out of a generic state n to a state n I % occurs when a mobile in 1
into the 1/ period for data transfer, this transition is called
given by 2/ Jn3, where is defined as >
The departure from a state n to a
transfer. f there are n active (S at a given
represented as K2n3.
>eparture rate< =irstly some *uantities are defined to calculate the departure rate
n order to compensate losses due to outage
6it @ate 2D6@3 is considered
The number of slots per frame g

given that g# L #.
The average number of slots per frame
(ST@ can thus be determined as 4
1nce is obtained, the departure rate of

/ow the performance parameter will be derived using the departure rate.

Performance Parameters

There are three performance parameters for which formulae could
Volume 1, Issue 4, April 214!

* 214, IJAFRC All Ri+hts Reserved
2RAFFIC A#A@B2ICA@ /=>1@
ytical model for 6! traffic of 'i(A) is based on a Bontinuous Time (arkov Bhain
5. This BT(B is shown in =igure. %.
1 Deneral C2/C ,ith state&dependent departure rates!
state n of this chain 2# M n M /3 corresponds to the total number of
A transition out of a generic state n to a state n I % occurs when a mobile in 1
for data transfer, this transition is called arrival transition and arrival rate is
is defined as > L %H . -ere represents the average 1== period.
departure from a state n to a state nJ% occurs when a mobile in 1/ period, completes its
er. f there are n active (S at a given time, this departure rate
=irstly some *uantities are defined to calculate the departure rate
losses due to outage, an increased instantaneous bit rate called Delive
6it @ate 2D6@3 is considered which is given as4A5>

The number of slots per frame gk re*uired by a (S, using (BSk, to attain its D6@ is found as 4A

The average number of slots per frame re*uired by a (S, using E different (BS, to reali.e its
(ST@ can thus be determined as 4A5

is obtained, the departure rate of throttling scheme is given as 4A5>

/ow the performance parameter will be derived using the departure rate.
There are three performance parameters for which formulae could be derived from the
,,,!i-afrc!or+
ytical model for 6! traffic of 'i(A) is based on a Bontinuous Time (arkov Bhain

dependent departure rates!
/3 corresponds to the total number of concurrent active (S
A transition out of a generic state n to a state n I % occurs when a mobile in 1== period enters
arrival transition and arrival rate is
represents the average 1== period.
in 1/ period, completes its
when m mobiles are is
=irstly some *uantities are defined to calculate the departure rate>
tantaneous bit rate called Delivered
2%3
to attain its D6@ is found as 4A5
2$3
re*uired by a (S, using E different (BS, to reali.e its
2A3
5>
2D3
be derived from the model. These

parameters are> average instantaneous resource utili.ation of TDD frame u
, average number of an active

user
and average instantaneous user throughput during 1/ period X
.n order to find the e8pressions

for these parameters, stationary state probabilities N2n3 can be obtained from the birth and death
structure of (arkov chain shown in =igure. % .Steady state probability of the =igure.% can be written as
4%$5

n(n) =
Nz(N -1)z . (N -n +1)z(N -n)z . z n(u)
p(1)p(2) . p(n)

n(n) =
N! z
n
(N -n)! p(i)
n
=1
n(u)
<utting the value of p(i) from e*. 2D3

n(n) =
N! z
n
(N -n)!
p
n
n!
N
s
mox(ig , N
s
)
n
=1
n(u)
273
'here p =
x
cn
t
c]]
MS1R

Since
n(n) = 1
n>0

n(u) =
1
1 +_
N!
(N -n)! n!
N
s
mox(ig , N
s
)
n
=1
N
n=1

2&3
The average number of active users can now be written as>
= nn(n)
N
n=1

293
Average /umbers of departures per unit of time is given by 4A5>
= p(n)n(n)
N
n=1

2"3
=rom littleOs law, average duration t
on
of an 1/ period+
t
on
=

2F3
And average throughput X
obtained by each mobile in active transfers

X
=
x
on
t
on

2%#3
The average instantaneous resource utili.ation 2of TDD frame3 is given as 4A5>


(' ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+

u
=
ng
max(ng , N
s
)
n(n)
N
n=1

2%%3

V! /?@2I&CR=FI@1 2RAFFIC A#A@B2ICA@ /=>1@

=or analytical modelling (ulti profile 6! traffic is considered. (ulti profile traffic contain different class
of users and each class is characterised by a specific traffic profile. /ow some assumptions have been
made for the multi profile modelling 4A5.
The users are divided into @ classes of traffic, each one having a specific profile
2(ST@r, x
on
, t
o]]
3, rL%,$P@ =or a given class r , the average si.e of 1/ data volumes 2in bits3 , re*uired
(ST@ and the average duration of 1== periods are denoted by x
on
,(ST@r and t
o]]
respectively. -ence,
a traffic profile of a generic class r will be denoted by>
p
=
x
on
t
o]]
HSIR

=irstly, the profile of each class 2x
on
, (ST@r , t
o]]
3 is transformed into an e*uivalent profile such that
4A5>
x
on
t
o]]
HSIR
=
x
on
t'
o]]
HSIR

After this transformation, the mobile of the e*uivalent system have the same average 1/ si.e x
on
but
different 1== period t'
o]]
.'ith this transformation, the e*uivalent system can be modelled as multiclass

closed *ueuing network with two station 2=igure .$3.
The station % is the nfinite Server 2S3 stationQ this station has as many servers as re*uired. This
station models mobiles in 1== periods and has class dependent service rate
= t'
o]]
.
The active (S are modelled by station $ called <rocessor Sharing 2<S3 .This station has class
independent service rate or departure rate K 2n3 with n as the number of active (S. ?nlike for
conventional schemes, the e8pression of mono+profile traffic to calculate K 2n3 2!*. D3 cannot be
directly used here. The e*uation to find K 2n3 for station <S is written below 4A5
p(n) =
N
s
mox(g (n), N
s
)
n
HSIR
x
on

2%$3
where (ST@ and x
on
are related to e*uivalent multi+class after profiles and g (n) is average number of
slots per frame needed by n active mobiles to obtain their (ST@ re*uirement. To estimate g (n) , firstly
g
the average number of slots needed by mobile of class r is defined

g
= p
k
BR
I
P
m
k
K
k=1

2%A3
'here p
k
is the stationary probability for (S of class r using (BSk and


BR
=
HSIR
1 -p
0

2%D3

Second, the probability o
(n) that an active (S belongs to class r, when there are n active (S, has to be
estimated. o
(n) can be calculated by considering a multi+dimensional (arkov chain which states

corresponds to the detailed distribution of the current active mobiles of each class in the system. Author
of 4A5 presented a linear appro8imate solution to estimate o
(n) and it is described as follows>

/ow if it is known that n L /, where N = N
1
+N
2
+N
then o
(n) can be written as>

o
(n) = N
N

And for n L %, the probabilityo
(1) can be appro8imated as>

o
(1) =
N
_ N
R
=1

After calculating the above two limiting values, let o
(n) is a linear function of n such that>

o
(n) = on +b

'here o =
u
r
(N)-u
r
(1)
N-1
and b =
Nu
r
(1)-u
r
(N)
N-1

The e*uation for g (n), can now be e8pressed as>
g (n) = _ no
(n)
R
=1
g

After transformation of parameters, the closed *ueuing network shown in =igure. $ can now be handled
using e8tension of the 6B(< theorem for stations with state+dependent rates 4%A5.
0et population vector denoted by N
= (N
1
, N
2
N
R
), here /@ represents the number of (S of
class @.The steady state probabilities are written as>
n(n) = n(n
1
, n
2
) =
1
0
1
(n
1
)
2
(
2
)
-ere n
= (n
1
. n
R
) , ni@ represents the number of class+@ (S presents in station i .

1
(n
1
) =
1
n
11
! . . n
1R
!
1
1
n
11
. .
R
n
1R

2
(n
2
) =
(n
21
++n
2R
)!
n
21
! . . n
2R
!
1
p(k)
n
2
k=1

and , is a normali.ation constant presented as>

0 =
1
(n
1
)
2
(n
2
)
n
1
+n
2
=N


(E ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+

Fi+ure 2 Closed&9ueuin+ #et,or5

Performance parameter:

/ow, the e8pressions for performance parameters are derived using steady+state probabilities. The
average number of active (S of class r active mobiles is given by>

= n
2
n(n
1
, n
2
)
n
1
+n
2
=N

2%73
The average number of class r mobiles completing their download per unit time, can be written as>

= p
n
1
+n
2
=N
(n
2
)n(n
1
, n
2
)
2%&3
where p(n
2
) is the departure rate 4A5of class r (S when there are n
2
active (S and is given as>

p
(n
2
) =
N
s
mox(g (n
2
), N
s
)
n
2
HSIR
x
on

2%93
g (n
2
) is given by g (n
2
) = _ n
2
g
R
=1

The average instantaneous throughput 4A5 for class+r (S is written as>

X
=
x
on
on

2%"3
where t
on
on is obtained through 0ittleOs law i.e. t
on
r

At the end, parameter u
4A5 is given by following e*uation>

u
=
g (n
2
)
mox(g (n
2
), N
s
)
n(n
1
, n
2
)
n
1
+n
2
=N

2%F3

VI! #?/1RICA@ R1"?@2

This section e8amines the proposed analytical model. The results of average active number of users,

(% ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+
average throughput and average utili.ation of TDD frame are evaluated under different number of
mobile stations. All the system related parameters are listed in table%.A single 'i(A) cell. The number
of slots depends on the system bandwidth, the frame duration, the downlinkHuplink ratio, the subcarrier
permutation 2<?SB, =?SB, A(B3, and the protocol overhead 2preamble, =B-, maps3.The subcarrier
permutation <?SB is considered and it is assumed that protocol overhead is of fi8ed length 2$ symbols3
although in reality it is a function of the number of scheduled users.

2a6le 1! ".stem Carameters
Carameter Value
/umber of cell is system %
System 6andwidth %#(-.
DownlinkHuplink ratio in a TDD frame $HA
Duration of a TDD frame I
P
7ms
/umber of data slots per TDD frame D7#

n table $ traffic parameters for mono and multi profile traffic are listed. n this analytical model, it is
assumed that 1/ data volume and 1== duration are e8ponentially distributed. =or mono+profile traffic,
the behaviour of the model is observed for high data volume and low data volume 2&(bits and %
(bits3.=or multi+profile traffic, the total number of users / is divided e*ually among two classes.

2a6le 2! 2raffic parameters
Carameter /ono&traffic /ulti traffic
Class1 Class 2
(ST@ 7%$,%#$D,$#D" %#$D $#D"
12x
on
|Hbits] : A A
t
o]]
|Scc] A A &

'ireless channel parameters are summari.ed in table A.The table lists different (BS with their
respective number of bits transmitted per slot and stationary probabilities 4D5.

2a6le $! Channel Carameters
Channel state
F,1GAH
/C" and =uta+e 0its per slot

"tationar.
pro6a6ilit.
# 1utage m
0
L # #.#D
% :<SE+%H$ m
1
L D" #.$&
$ :<SE+AHD m
2
L 9$ #.%"
A %&:A(+%H$ m
3
L F& #.$D
D %&:A(+AHD m
4
L%DD #.%D
7 &D:A(+$HA m
5
L %F$ #.#$
& &D:A(+AHD m
6
L $%& #.%&7

=igure.A+F respectively show the plot for average number of active users, average instantaneous
throughput and the average channel utili.ation for mono profile traffic and multi traffic profile .

/ono&2raffic anal.sis> =igure A shows the variation of active number in accordance with the number of
users present in the cell. t can be seen that the number of active users in the cell increase linearly as with
the number of (S present in the cell i.e. the rate of increment of the number of active users is linear.

(( ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+
=igure. D Show the graph between average instantaneous user throughputs for mono+traffic different
values of (ST@. The graph shows that as the number of (S in the cell is less, throughput is higher for (S
which has high (ST@ re*uirement but as the number of (S increases in the cell, throughput degraded for
all (S irrespective of their (ST@. =igure. 7 shows the variation of average resource utili.ation for mono
traffic with the number of users. ?tili.ation of resources increases with increase in number of users.
=orm =igure.& one more important thing can be observed that the analytical model performs well under
low 2%(63, medium 2A(b3 and high 2&(b3 load traffic condition. t can be also observed that throughput
is high for low load.

Fi+ure $ Avera+e num6er of active users, mono Fi+ure 4 Avera+e instantaneous user throu+hput &
traffic(/"2RI'1256ps, x
un
= 3Mb, t
uJJ
= 3se) mono&traffic different values of /"2R( x
un
=
$/6, t
uJJ
= 3 se)

Fi+ure ' Avera+e resource utili:ation, mono Fi+ure 7 Avera+e instantaneous user throu+hput
traffic, (/"2RI'12 56ps, x
un
= 3Mb,) mono&traffic different loads ( x
un
= 1Mb, $/6
t
uII
= 3se ) and 7 /6, /"2RI24% A6ps, t
uII
= 3se)

0
10
20
30
40
50
0 10 20 30 40 50
A
v
e
r
a
+
e

n
u
m
6
e
r

o
f

a
c
t
i
v
e

m
o
6
i
l
e
s
#um6er of ?sers
0
0.5
1
1.5
2
2.5
0 10 20 30 40 50
A
v
e
r
a
+
e

i
n
s
t
a
n
t
e
o
u
s

t
h
r
o
u
+
h
t
p
u
t
F
/
6
p
s
H
#um6er of ?sers
MSTR=1024Kbps
MSTR=512Kbps
MSTR=2048Kbps
0
0.2
0.4
0.6
0.8
1
0 10 20 30 40 50
A
v
e
r
a
+
e

n
u
m
6
e
r

o
f

a
c
t
i
v
e

m
o
6
i
l
e
s
#um6er of ?sers
0
0.5
1
1.5
2
2.5
0 10 20 30 40 50
A
v
e
r
a
+
e

i
n
s
t
a
n
t
e
o
u
s

t
h
r
o
u
+
h
t
p
u
t
F
/
6
p
s
H
#um6er of ?sers
Xon=3Mb
Xon=1Mb
Xon=6Mb

1 ) * 214, IJAFRC All Ri+hts Reserved ,,,!i-afrc!or+

Fi+ure E Avera+e num6er of active users, multi& Fi+ure % Avera+e instantaneous user throu+hput,
profile, (x
un
1
= x
un
2
= 3Mb, t
II
1
= 3se, multi&Crofile ( x
un
1
= x
un
2
= 3Mb, t
II
1
= 3se,
t
uII
2
= se, MSTR
1
= 512 Kbps, t
uJJ
2
= se , MSTR
1
= 512Kbps and
MSTR
2
I124 A6ps) MSTR
2
I124 A6ps)

Fi+ure ( Avera+e resource utili:ation, multi&profile, (x
un
1
= x
un
2
= 3Mb, t
JJ
1
= 3se, t
uJJ
2
= se,
MSTR
1
= 512Kbps , MSTR
2
I124 A6ps)

/ulti&traffic Anal.sis+ =igure 9 Shows the variation of active users with the total number of users
present in cell. 'ith the same number of (S present in the cell, class % has more active number of (S
than class $.The reason is that the (ST@ re*uirement of the class % (S is less than the class $ and also,
hence departure rate of class % (S will be higher than the class $ and therefore the steady state
probability for $ different class of (S. Therefore the active number of (S is different for different class of
(S. =rom =igure.", it can be observed that X
1
and X
2
are not e*ual. =rom e*uation 2%F3 it is clear that
when a mobile belonging to class % enters the <S *ueue ,its probability to find a given number of mobiles
already present in the *ueue 2 n$%3 is different from the one of a mobile of class $2n$$3. As such, the
mobiles of each class donOt get the e8act same amount of resource and hence result into different
throughputs.
=igure.F shows the variation of average resource utili.ation with the number of users. t can be observed
that as number of user increases frame utili.ation increases and when the users are more than $7,
utili.ation is nearly %##R.

VII! C=#C@?"I=# A#> F?2?R1 3=RA"

n this paper, an analytical model using Bontinuous Time (arkov Bhain 2BT(B3 has been developed to
0
5
10
15
20
0 10 20 30 40
A
v
e
r
a
+
e

i
n
s
t
a
n
t
e
o
u
s

t
h
r
o
u
+
h
t
p
u
t
F
/
6
p
s
H
#um6er of ?sers
Class1
Class 2
0
0.5
1
1.5
2
2.5
0 10 20 30 40
A
v
e
r
a
+
e

i
n
s
t
a
n
t
e
o
u
s

t
h
r
o
u
+
h
t
p
u
t
F
/
6
p
s
H
#um6er of ?sers
Class1
Class 2
0
0.2
0.4
0.6
0.8
1
1.2
0 10 20 30 40
A
v
e
r
a
g
e

u
t
i
l
i
z
a
t
i
o
n
Number of usersN= N
1
+N
2
(N
1
= N
1
)

evaluate the performance parameter for 6! traffic in 'i(A) networks. This model takes into account the
:oS parameter (ST@ and multi profile web traffic and provide closed+form e8pressions giving all the
re*uired parameters such as average throughput, average resource utili.ation and average number of
active users. t can be concluded from the papers that as number of users increases, utili.ation of
resources increases but throughput decreases. =rom the paper, minimum number of users in the cell can
be found that gives more than 7#R average resource utili.ation. 'i(A) developer or manufacturer
decides certain minimum throughput threshold in the cell. The ma8imum number of users in the cell can
also be found that guarantee the minimum throughput threshold.

There are several aspects possible for future study. 1ne e8tension would be validate the model through
simulation. n this model (ST@ is taken into consideration, another e8tension would be considering
other :oS parameter to obtain the performance parameter. Analytical model has been developed only for
6! service class, another area of future wok will be integrating other service classes into the model.

VIII! R1F1R1#C1"

4%5 !!!, !!! standard for local and metropolitan area networks <art %&> Air interface for fi8ed and
mobile broadband wireless access systems 2amendment and corrigendum to !!! Std "#$.%&+
$##D3, $##7, ?@0 reference Shttp>HHstandards.ieee.orgHgetieee"#$HdownloadH"#$.%&e+
$##7.pdfT.

4$5 Ueffrey ,. Andrews, 2$##93 V%undamentals of &i#'( )nderstanding *road+and &ireless
,etwor"ingW, S6/ #+%A+$$$77$+$,D9" pages, <rentice -all Bommunications !ngineering and
!merging Technologies Series, te8t printed in the ?nited States in 'estford, (assachusetts. =irst
printing, =ebruary $##9.

4A5 6. 6aynat, S. Doirieu8, ,. /ogueira, (. (a*bool, and (. Boupechou8, VAn Analytical (odel for
'i(A) /etworks with (ultiple Traffic <rofiles and Throttling <olicy,W in <roc. of 'i1pt, Uune
$##F. 41nline5. Available> http>HHperso.telecom+paristech.frH~coupechoHpublisH'i1pt#F.pdf.

4D5 (. (a*bool, (. Boupechou8 and <. ,odlewski, VBomparison of ;arious =re*uency @euse <atterns
for 'i(A) /etworks with Adaptive 6eamforming,W in <roc. of !!! ;TB Spring, (ay $##".
41nline5. Available> http>HHperso.telecom+paristech.frHcoupechoHpublisHvtc#"spring%.pdf

475 6. 6aynat, S. Doirieu8, ,. /ogueira, (. (a*bool and (. Boupechou8,VAn !fficient Analytical (odel
for 'i(A) /etworks with (ultiple Traffic <rofiles,W in <roc. of AB(H!THBST '<A'/, 1ctober
$##". 41nline5. Available> http>HHperso.telecom+paristech.frHcoupechoHpublisHiwpawn#".pdf

4&5 6. 6aynat, ,. /ogueira, (. (a*bool, and (. Boupechou8, VAn !fficient Analytical (odel for the
Dimensioning of 'i(A) /etworks,W in <roc. of "th =<+TB& /etworking Bonference, (ay $##F.
41nline5. Available>http>HHperso.telecom+paristech.frHcoupechoHpublisHnetworking#F.pdf.

495 E. @amadas and @. Uain, V'i(A) System !valuation (ethodology,W'i(A) =orum, Tech. @ep.,
Uanuary $##9.

4"5 S. Eim and . Yeom, V<erformance Analysis of 6est !ffort Traffic in !!! "#$.%& /etworks,W !!!
Transactions on (obile Bomputing, $##".


4F5 ,. 0eonardi, A. 6a..i, ,. <asolini, and 1. Andrisano, V!!!"#$.%&e 6est !ffort <erformance
nvestigation,W in <roc. of !!! BB, Uune $##9.

4%#5 =. -ou, U. She, <.+-. -o, and ). Shen, V<erformance Analysis of 'eighted <roportional =airness
Scheduling in !!! "#$.%& /etworks,W in <roc. 1f !!! BB, (ay $##".

4%%5 D. Sivchenko, /. 6ayer, 6. )u, ;. @akocevic, and U. -abermann, Vnternet Traffic <erformance in
!!! "#$.%& /etworks,W in <roc. of %$th !uropean 'ireless Bonference, April $##&

4%$5 E.S.Trivedi,W<robability and Statistics with @eliability, :ueuing, and Bomputer science
ApplicationsWS6/"%+$#A+#7#"+& <rentice+-all of ndia private limited,Delhi <ublication+$##&

4%A5 =. 6askett, E. Bhandy, @. (unt., and =. <alacios, V1pen Blosed and (i8ed /etworks of :ueues with
Different Blasses of Bustomers,W Uournal of the Association of Bomputing (achinery, April %F97.

4%D5 !!! Standard for 0ocal and (etropolitan Area /etworks <art %&> Air nterface for =i8ed
6roadband 'ireless Access Systems, 2$##D3. S
http>HHpubs.cs.uct.ac..aHarchiveH#####7%%H#%H"#$+%&Airnterface.pdfT

4%75 http>HHpastel.archives+ouvertes.frHdocsH##H7#H%DH#7H<D=HThesisX(a*boolX$##F.pdf

An Analytical Model For Best Effort Traffic in WiMAXNetworks

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

An Analytical Model For Best Effort Traffic in WiMAXNetworks

Enviado por

Direitos autorais:

Formatos disponíveis

International Journal of Advance Foundation and Research in Computer (IJAFRC)

Volume 1, Issue 4, April 214! I""# 2$4% & 4%'$

, average number of an active

and average instantaneous user throughput during 1/ period X

.n order to find the e8pressions

obtained by each mobile in active transfers

.'ith this transformation, the e*uivalent system can be modelled as multiclass

the average number of slots needed by mobile of class r is defined

(n) can be calculated by considering a multi+dimensional (arkov chain which states

(n) and it is described as follows>

(n) can be written as>

(1) can be appro8imated as>

(n) is a linear function of n such that>

on is obtained through 0ittleOs law i.e. t

4A5 is given by following e*uation>

Você também pode gostar