On the performance of transmitting IP traffic over a shared cellular radio channel with a central scheduling mechanism

LICENTIATE T H E S I S

Luleå University of Technology

Department of Computer Science and Electrical Engineering Division of Systems and Interaction

2006:23|: 02-757|: -c -- 06 ⁄23 -- 

2006:23

On the Performance of Transmitting IP Traffic over a Shared Cellular Radio Channel

with a Central Scheduling Mechanism

Mats Folke

A ^BSTRACT

C ^ONTENTS

T

I

P

P

P

P

R

A CKNOWLEDGEMENTS

T ^HESIS I NTRODUCTION

1 Background

1.1 Congestion control and avoidance

T

I

1.2 History of cellular networks

1. B

T

I

1.3 Scheduling in cellular networks

1.4 Scope of the thesis

2. M

–

2 Methodology – about simulation

T

I

3 Future work

4 Short presentation of the papers

4. S

4.1 On the TCP Minimum Retransmission Timeout in a High-speed Cellular Network

4.1.1 My contribution

4.1.2 Impact

4.2 On the Influence of User Behaviour and Admission Control

on System Performance in HS-DSCH

T

I

4.2.1 My contribution

4.2.2 Impact

4.3 Scheduling Support for Mixed Conversational and Background Traffic over HSDPA

4.3.1 My contribution

4.3.2 Impact

4.4 An NS Module for Simulation of HSDPA

4.4.1 My contribution

4.4.2 Impact

P ^APER

O

TCP M

R

T

...

mats.folke@ltu.se sara.landstrom@ltu.se ulf.bodin@ltu.se

1 Introduction

O

TCP M

R

T

...

2 TCP fundamentals

O

TCP M

R

T

...

3 Method

3.1 Simulation Environment

Mobile nodes 25ms/5Gbps

Traffic sources

3.2 Evaluation metrics

x

O

TCP M

R

T

...

f (x

, x

, · · · , x

) =

 

i=1

x



n 

i=1

x

4 Results

5 Discussion

0 0.05 0.1 0.15 0.2 0.25

0 50 100 150

Share of spurious timeouts

Number of users 0.0s

0.1s 0.2s 0.3s 0.4s 0.5s 1.0s

0 0.05 0.1 0.15 0.2 0.25

0 50 100 150

Share of spurious timeouts

Number of users 0.0s

0.1s 0.2s 0.3s 0.4s 0.5s 1.0s

O

TCP M

R

T

...

0.5 0.55 0.6 0.65 0.7 0.75 0.8

0 50 100 150

Fairness in goodput

Number of users

0.0s 0.1s 0.2s 0.3s 0.4s 0.5s 1.0s

0.5 0.55 0.6 0.65 0.7 0.75 0.8

0 50 100 150

Fairness in goodput

Number of users

0.0s 0.1s 0.2s 0.3s 0.4s 0.5s 1.0s

1e+06 2e+06 3e+06 4e+06 5e+06 6e+06 7e+06

0 50 100 150

Throughput [bits/s]

Number of users 0.0s

0.1s 0.2s 0.3s 0.4s 0.5s 1.0s

1e+06 2e+06 3e+06 4e+06 5e+06 6e+06 7e+06

0 50 100 150

Throughput [bits/s]

Number of users 0.0s

0.1s 0.2s 0.3s 0.4s 0.5s 1.0s

O

TCP M

R

T

...

6 Conclusions

O

TCP M

R

T

...

P ^APER



O

I

U

B

A

C

...

mats.folke@ltu.se ulf.bodin@ltu.se

1 Introduction

O

I

U

B

A

C

...

2 Method

2.1 Simulation Environment

2.1.1 Radio model

2.1.2 User mobility

O

I

U

B

A

C

...

2.1.3 Application and load model

2.2 Evaluation metrics

f (x) =

⎧ ⎪

⎨

⎪ ⎩

0 x < 100000

x−100000

300000

100000 ≤ x < 400000

1 x ≥ 400000

3 Results

3.1 Without user behaviour modelled

O

I

U

B

A

C

...

10 15 20 25 30 35 40 15 10

25 20 35 30 40 1e+07 1.2e+07 1.4e+07 1.6e+07

Total goodput

Rate Max users

Total goodput

15 10 25 20 35 30 40 10 15 20

25 30 35 40 1000

2000 3000 4000 Total satisfaction

Rate Max users

Total satisfaction

10 15 20 25 30 35 40 15 10

25 20 35 30 40 0 100 200 300 Active users

Rate Max users

Active users

3.2 With user behaviour modelled

O

I

U

B

A

C

...

10 15 20 25 30 35 40 100 150 200

250 300 350400 1e+07

1.2e+07 1.4e+07 1.6e+07

Total goodput

Rate Min thp.

Total goodput

15 10 25 20 35 30 100 40 200150 300250 400350 1000 2000 3000 4000 Total satisfaction

Rate Min thp.

Total satisfaction

10 15 20 25 30 35 40 100 150 200

250 300 350400 0

100 200 300 Active users

Rate Min thp.

Active users

10 15 20 25 30 35 40 15 10

25 20 35 30 40 1e+07 1.5e+07 2e+07 2.5e+07

Total goodput

Rate Max users

Total goodput

15 10 25 20 35 30 40 10 15 20

25 30 35 40 1000

2000 3000 4000 Total satisfaction

Rate Max users

Total satisfaction

10 15 20 25 30 35 40 15 10

25 20 35 30 40 0 100 200 300 Active users

Rate Max users

Active users

O

I

U

B

A

C

...

4 Conclusions

10 15 20 25 30 35 40 100 150 200

250 300 350400 1e+07

1.5e+07 2e+07 2.5e+07

Total goodput

Rate Min thp.

Total goodput

15 10 25 20 35 30 100 40 200150 300250 400350 1000 2000 3000 4000 Total satisfaction

Rate Min thp.

Total satisfaction

10 15 20 25 30 35 40 100 150 200

250 300 350400 0

100 200 300 Active users

Rate Min thp.

Active users

O

I

U

B

A

C

...

P ^APER

S

S

M

C

...

mats.folke@ltu.se sara.landstrom@ltu.se

ulf.bodin@ltu.se stefan.wanstedt@ericsson.com

1 Introduction

S

S

M

C

...

PF

MR MR

MR

MR

2 Methodology

2.1 Metrics

2.2 HS-DSCH model

2.3 Application model

2.3.1 VoIP traffic

S

S

M

C

...

2.3.2 Web traffic

2.3.3 Load model

2.4 Schedulers

PF

i∗ = arg max

i

r

μ

μ

i r

MR

i∗ = arg max

i

{r

(1 + βe

)}.

β MR

μ

PF MR

MR

3 Results

3.1 Cell throughput

MR

MR

MR PF MR PF

MR

MR PF MR

MR

MR

MR PF

MR PF

3.2 User perceived quality

MR

S

S

M

C

...

600000 800000 1e+06 1.2e+06 1.4e+06 1.6e+06 1.8e+06 2e+06 2.2e+06

5 10 15 20 25 30 35

Cell throuhgput [bits/s]

Number of users 40 ms

80 ms 120 ms 160 ms

MR

600000 800000 1e+06 1.2e+06 1.4e+06 1.6e+06 1.8e+06 2e+06 2.2e+06

5 10 15 20 25 30 35

Cell throuhgput [bits/s]

Number of users 40 ms

80 ms 120 ms 160 ms

PF

600000 800000 1e+06 1.2e+06 1.4e+06 1.6e+06 1.8e+06 2e+06 2.2e+06

5 10 15 20 25 30 35

Cell throuhgput [bits/s]

Number of users 40 ms

80 ms 120 ms 160 ms

MRmin

600000 800000 1e+06 1.2e+06 1.4e+06 1.6e+06 1.8e+06 2e+06 2.2e+06

5 10 15 20 25 30 35

Cell throuhgput [bits/s]

Number of users 40 ms

80 ms 120 ms 160 ms

MRdelay

S

S

M

C

...

MR PF

PF PF

MR

MR

MR

MR

MR PF

MR

MR

MR

3.3 Web users with throughputs lower than 15 kbps

MR

PF

MR MR

4 Discussion and conclusions

PF MR

MR

MR

0 0.2 0.4 0.6 0.8 1

5 10 15 20 25 30 35

Ratio of satisfied users

Number of users

VoIP traffic Web traffic

MR

0 0.2 0.4 0.6 0.8 1

5 10 15 20 25 30 35

Ratio of satisfied users

Number of users VoIP traffic, 40 ms

PF

S

S

M

C

...

0 0.2 0.4 0.6 0.8 1

5 10 15 20 25 30 35

Ratio of satisfied users

Number of users VoIP traffic, 40 ms

MRmin

0 0.2 0.4 0.6 0.8 1

5 10 15 20 25 30 35

Ratio of satisfied users

Number of users Web traffic 40 ms

Web traffic 80 ms Web traffic 120 ms Web traffic 160 ms VoIP 160 ms VoIP 120 ms VoIP 80 ms VoIP 40 ms

MRdelay

MR

MR

MR

MR

PF

PF PF

S

S

M

C

...

P ^APER

A

NS M

S

HSDPA

mats.folke@ltu.se sara.landstrom@ltu.se

1 Introduction

1.1 Simulation of wireless systems

A

NS M

S

HSDPA

2 HSDPA

2.1 Media Access Control

A

NS M

S

HSDPA

Core Network

RNC RLC MAC

Node B MAC−hs

PHY

Node B MAC−hs

PHY

UE UE UE UE UE

2.1.1 Fast Link Adaptation

2.1.2 Transport block selection process

R(t) = (0.2 ∗ x(t)

+ B) log

(1 + 10

)

R(t) x(t)

B

k

A

NS M

S

HSDPA

k

2.1.3 Fast Hybrid ARQ

2.1.4 Fast Scheduling

i

r

i r

r

i d

d

i

S

i S

i∗

A

NS M

S

HSDPA

i∗ = arg max

i

{S

}.

i∗ = arg max

i

{r

}.

i∗ = arg max

i

r

r

.

r

r

r

r

i∗ = arg max

i

S

S

.

i∗ = arg max

i

{r

(1 + βe

)}.

r

r

r

β

i∗ =

⎧ ⎨

⎩ arg max

i

{r

} d

< d

, arg max

i

{d

+ R

}

R

d

d

2.2 Radio Link Control

2.3 Cell selection

A

NS M

S

HSDPA

2.3.1 Admission control

3 Propagation environment

•

•

•

3.1 Path loss, shadowing, and multi-path fading

P L(d)[dB] = P L(d

) + 10n log

 d d

 + X

n n X

σ d d

3.2 Interference

A

NS M

S

HSDPA

0 50 100 150 200 250 300 350

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Autocorrelation profile for shadowing

Distance moved between updates of the shadowing values [metres]

Autocorrelation

Correlation Distance 40 metres 1/e

α

α = 0.6 α = 0.9

3.3 Block error rates

3.4 Cell planning

4 Mobility

A

NS M

S

HSDPA

5 Limitations and Future Work

http://www.3gpp.org

http://www.arib.or.jp/

english/

http://www.

sm.luth.se/csee/csn/mobivin/Wikka/HSSim

http://www.etsi.org

http://www.gsmworld.com

http://www.itu.org

http://www.isi.edu/

nsnam/ns

http://seacorn.ptinovacao.pt/

http:

//www.ti-wmc.nl/eurane/

http://www.unsystem.org