研究生：許家豪指導教授：柯開維　博士

1

多媒體行動通訊網路具動態重配置之可適性資源

管理機制及效能分析 Adaptive resource management with dynamic reallocation for layered encoded multimedia on wireless mobile communication network研究生：許家豪

指導教授：柯開維　博士

2

Outline

Introduction Background Multimedia Streaming Service Call admission Control policy for Multimedia

Service Numerical Result Conclusion and Future work

3

Introduction

Network model ： Single-media and multirate Multimedia and multirate

Propose three policies to allocate resources ： AO (Adaptive Only) ADRF (Adaptive and Dynamic Reallocation Finally) ADRA (Adaptive and Dynamic Reallocation

Anytime)

4

Introduction (cont.)

In this thesis ： Create a scenario of multimedia streaming service

on wireless mobile communication network. Use these policies to promote resource utilization

and protect handover call. Do numerical analysis performance for different

policies.

5

Background

Wireless communication network introduction.

Wireless resources allocation methods. MDP (Markov Decision Process) introduction.

6

Wireless communication network introduction

7

Wireless Resource allocation method The unit of resources allocation in each

system ：

2G 2.5G 3G

GSM GPRS WCDMA

Time Slot Radio Block Spreading Factor

8

MDP introduction

Like a Markov Process. Transition depends on the action. Every state has various options (actions). Each option associates a “reward”. Find a optimal policy, so as to maximize

rewards. (solved by LP)

9

Multimedia streaming Service Streaming is a process of playing a file while it

is still downloading. Layered encoding (multirate and adaptive) ：

A technique to convert a file into a compressed, streaming format.

e.g. ： H.263, MPEG-2, and MPEG-4. Consume lots of bandwidth resources.

e.g. ： video phone, video-on-demand

10

Streaming service architecture

RTSP (TCP)RTP (UDP)HTTP (TCP)FTP(TCP)

Networkcomponents

Proxy

RTSP/RTPSDP

HTTPFTP

Content creation machines

IP

Streaming servers

Webservers

IP

SMIL,Images,

textStreams

IP network

11

Scenario

For example, adaptive and reallocation resources

Base station (do

some things)

System Web

Term

inal

user

（travele

r

）

Streaming server

Wireless transmission

Select multimedia

file

Get file from streaming

server

Return multimedia

file

Inform encoding

rate

12

Main issues

Design a dynamic and adaptive resource allocation strategy to Lower blocking probability ：

new and handover call (especially) Increase resources utilization ：

allocated bandwidth resourcesU % =

total bandwidth resources

13

Outline


Service Numerical Result Conclusion and Futurework

14

Network model

Base station

15

Network model (cont.)

1 Each base station provides :

bandwidth resources.

classes of media.

encoding method (means different rates).

2 Class- media in each cell (independent)

new a

i i

C

m

k k

i

、

、：rriving calls follow Poisson process.

average session time and dwell time are

exponentially distribution.

16


,

,

,

,

3 Arrival rate of class- new call

Arrival rate of class- handover call

Average session time of class- call 1/

Average dwell time of class- call 1/

4 Any user use

i n

i h

i s

i h

i

i

i

i

、：

：

：

：

、 ,

,1 , , , , 1

,

s bandwidth ,

,..., ,..., |

for 1 and 1 1i

i j

i i l i k i l i l

i j

i

b

b b b b bb

i m l k

17


1

,1 , , ,

,

System state present as ( ,..., ,..., ) and

,..., ,..., , means the number of class-

users who use bandwidth .

We get state space of the sys

tem

|

i

Ti m

i i i j i k i j

i j

x x x x i

b

X X X X

X

XΩ

6、

7、：

, , ,1 1

and 0

for all 1 and 1

ikm

i j i j i ji j

i

b x C x

i m j k

18

MDP-based Call Admission Control

, , , , ,

,

1, , , , 1, , , , , ,

, ,

1 At the decision epoch, the action space containing all

possible decisions

,..., , ,..., , ,

where

the reaction for a

i j i j i j i j i j

i j

n b nm b h b hm b qi b

ni b

A

A a a a a a

a

X X X X X

X

、：

：

,

,

, ,

, ,

class- new call arrives.

the reaction for a class- handover call arrives.

the reaction for a class- call departs.

and 1 and 1

i j

i j

hi b

qi b

i

i

a i

a i

i m j k

X

X

：

：

19

MDP-based Call Admission Control (cont.)

,

,

, ,

, ,

1

2 The action space of state is and it is a subset of .

3 if => 0 ; otherwise 1

if => 0 ; otherwise 1 .

4 Next state ,..., ,..., : present st

i j

i j

ni b ni ni

hi b hi hi

i m

A

a d d

a d d

X

X

X

X A

0

0

Y Y Y Y

、、

、

,

,

,

, ,

, ,

, ,

ate

, if a class-i media new call arrives

, if a class-i media handover call arrives ,

, if a class-i media call departs

i j

i j

i j

i ni b

i i hi b

i qi b

X

X

X

X

x a

Y x a

x a

1 , 1 ii m j k

20

LP (Linear Programming) Equation

, the average sojourn time in state when

action is chosen.

| , the transition probability that at the next

decision epoch the system will be state if

P

X a X

a

Y X a

Y

：

：

the present state is and the action is taken.

, the expected reward obtained until the net decision

epoch given that the action is taken by the state .

, the long

r

u

X a

X a

a X

X a

：

：

-run fraction time at which the state making

action , and the set of , collectively determines

the policy. called "decision variable"

u

X

a X a

21

LP (Linear Programming) Equation (cont.)

,

Maximize

, , ,

Subject to

, , 1

, ( | , ) , ,

1 , , , where 1

, 0 , ,

A

A

A A

hi i BHA

U r u

u

u P u

d u P i m

u

X

X

Y X

X

x Ω a

X Ω a

a X Ω a

X Ω a

X a X a X a

X a X a

Y a Y X a X a Y Ω

X a X a

X a X Ω

：

：

A Xa

22

Call Admission Control policy

We propose three call admission control policies ： AO (Adaptive Only) ADRF (Adaptive and Dynamic Reallocation

Finally) ADRA (Adaptive and Dynamic Reallocation

Anytime) 、 and are depend on which

policy is chosen.,, , i jni ba X ,, , i jhi ba X ,, , i jqi ba X

23

AO - when a new/handover call arrives

Remaining resource :

?

Call admissionCall blocked

NO

YES Adaptive resource allocation

Originating call

,1ib

= (0,0) and call arrival => (1,0) or (0,1)ix

24

AO - when a call departs

Call departure

System retrieve the released resources

25

ADRF - when a new/handover call arrives

Remaining resource :

?

?

Call admission

Resource reallocation

Call blocked

NO

YES

YES

NO

Adaptive resource allocation

Originating call

, ,11

/ik

i j i ij

x c b

,1 ib

= (1,2) => (0,3)or(1,2)or (2,1)or(3,0)ix

26

ADRF – when a call departs


Call departure

Reallocate bandwidth to the calls of class-i media

ic

27

ADRA - when a new/handover call arrives

?

Call admission

Resource reallocation

Call blocked

YES

NO

Adaptive resource allocation

Originating call

, ,11

/ik

i j i ij

x c b

28

ADRA – when a call departs


Call departure

Reallocate bandwidth to the calls of class-i media

ic

29

Possible AO ：

if reject the new call : 1 if accept the new call : 2

ADRF ：if reject the new call : 1if accept the new call if : 2 if : 3

ADRA ：if reject the new call : 1 if accept the new call : 3

, ,1 , ,

, ,

, , ,1 1

,1 , ,

, ,1

1

2 ,..., ,..., ,

where 1 and 0 , ,

1 and

3 ,..., ,..., ,

where 0 +1 , 1

i

i i

i

i

i i i j i k

i j i z

k k

i l i l i ll l

Ti i i i

i i i j i k

k

i j i ll

N N N

N N z j

x N x

c

N N N

N x

0

N

x N B

N

、

、

、

, , ,

1 1

,

1 and

i i

i

k k

i l i l i ll l

Ti i i i

j k

x N x

c

x N B

,, , i jni ba X

,1residue capacity ib


30

Possible AO ：

if reject the new call : 1 if accept the new call : 2

ADRF ：if reject the new call : 1if accept the new call if : 2 if : 3

ADRA ：if reject the new call : 1 if accept the new call : 3

,1 , ,

,

, , ,1 1

,1 , ,

, ,1

1

2 ,..., ,..., ,

where 0 1 , 1 ,

1 and

3 ,..., ,..., ,

where 0 +1 , 1

i

i i

i

i

i i i j i k

i j i

k k

i l i l i ll l

Ti i i i

i i i j i k

k

i j i ll

H H H

H j k

x H x

c

H H H

H x

0

H

x H B

H

、

、

、

, , ,

1 1

,

1 and

i i

i

k k

i l i l i ll l

Ti i i i

j k

x H x

c

x H B



,, , i jhi ba X

31

Possible AO ：

if : 1

if : 2 ADRF ：

if : 1

if : 3 ADRA ：

if : 1

if : 3

,1 , ,

, ,

, , ,1 1

,1 , ,

, ,1

, , ,1

1

2 ,..., ,..., ,

where 1 and 0 ,

1

3 ,..., ,..., ,

where 0 1 , 1 ,

1 an

i

i i

i

i

i i i j i k

i j i z

k k

i l i l i ll l

i i i j i k

k

i j i l il

k

i l i l i ll

Q Q Q

Q Q z j

x Q x

Q Q Q

Q x j k

x Q x

0

Q

Q

、

、

、

1

d

ik

l

Ti i i ic

x Q B

, 0i jx

,, , i jqi ba X

, 0i jx

, 0i jx

, 0i jx

, 0i jx

, 0i jx

32

ADRA policy

1 2 1,1 1,2 2,1 2,218 , 2 , 2 , , , , 2,6 , 4,8C m k k b b b b

33

Outline


Service Numerical Result Conclusion and Future work

34

Multimedia and multirate - parameters setting

35

Adjust normalized offered load

, , ,0.2 ~ 1.6 , 0.01 , 0.5i BH i h i nP

0

0.1

0.2

0.3

0.4

0.5

0.6

0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8

Normalized Offered Load

Util

izatio

n

AO ADRF ADRA

, ,,

1 , ,i

mi n i h

i ki i s i h

b

C

, , ,0.2 ~ 1.6 , 0.01 , 0.5i BH i h i nP

36

Adjust

,i BHP

0

0.2

0.4

0.6

0.8

0 0.01 0.02 0.03 0.04 0.05

Handover Call Blocking Probability

Utiliz

atio

n

AO ADRF ADRA

,i BHP

, , ,1.5 , 0.01 ~ 0.045 , 0.5i BH i h i nP

37

No protection for handover call

0

0.2

0.4

0.6

0.8

1

0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8

Normalized Offered Load

Util

izatio

n

AO ADRF ADRA

, , ,0.2 ~ 1.6 , , 0.5i BH i h i nP

38

Conclusion and Future work We propose three call admission control

policy : AO, ADRF and ADRA. Through numerical analysis ：

In single-media and multirate model ：AO policy is the worst strategy. ADRF and ADRA are the best strategies.

In multimedia and multirate model ：AO policy is the worst strategy, ADRA is the best strategy.

Future work ： Add guard channel strategy.

研 究 生：許家豪 指導教授：柯開維 博士

Documents

研究生：許家豪指導教授：柯開維　博士