Adaptive Computation Offloading for Mobile Edge Computing - - PowerPoint PPT Presentation

adaptive computation offloading for mobile edge computing
SMART_READER_LITE
LIVE PREVIEW

Adaptive Computation Offloading for Mobile Edge Computing - - PowerPoint PPT Presentation

Adaptive Computation Offloading for Mobile Edge Computing Environment Houssemeddine MAZOUZI Direction Nadjib ACHIR, Khaled BOUSSETTA L2TI, Institut Galile, Universit Paris 13 Journe MAGI Calcul scientifique 3 juillet 2018 1/21 Outline


slide-1
SLIDE 1

1/21

Adaptive Computation Offloading for Mobile Edge Computing Environment

Houssemeddine MAZOUZI

Direction

Nadjib ACHIR, Khaled BOUSSETTA

L2TI, Institut Galilée, Université Paris 13

Journée MAGI Calcul scientifique 3 juillet 2018

slide-2
SLIDE 2

2/21

Outline

  • 1. Context
  • 2. Mobile Edge Computing (MEC)
  • 3. Computation offloading in MEC
  • 4. Our offloading approach
  • 5. Conclusion
slide-3
SLIDE 3

3/21

Nowadays Mobile Devices

slide-4
SLIDE 4

4/21

What is the problem?

⇒ how to extend the capacity

  • f mobile

device?

User satisfaction on Galaxy S5. Rating system: (1) Very Dissatisfactory (5) Very Satisfactory [1]

.

[1]

  • M. Halpern, Y. Zhu, and V. J. Reddi, “Mobile cpu’s rise to power: Quantifying the impact of generational mobile cpu design trends on performance,

energy, and user satisfaction”, in High Performance Computer Architecture (HPCA), 2016 IEEE International Symposium on, IEEE, 2016, pp. 64–76

slide-5
SLIDE 5

4/21

What is the problem?

⇒ how to extend the capacity

  • f mobile

device?

User satisfaction on Galaxy S5. Rating system: (1) Very Dissatisfactory (5) Very Satisfactory [1]

.

[1]

  • M. Halpern, Y. Zhu, and V. J. Reddi, “Mobile cpu’s rise to power: Quantifying the impact of generational mobile cpu design trends on performance,

energy, and user satisfaction”, in High Performance Computer Architecture (HPCA), 2016 IEEE International Symposium on, IEEE, 2016, pp. 64–76

slide-6
SLIDE 6

5/21

The new emerging computing paradigm: Mobile Cloud Computing

◮ End-to-end network latency to the closest AWS data center using wired network 20-30 ms, up to 50-150 ms on 4G mobile network. ◮ Ambiant occlusion requires end-to-end delays under 20 ms !!!!! ◮ What the hell !! Even the cloud is not enough!

slide-7
SLIDE 7

5/21

The new emerging computing paradigm: Mobile Cloud Computing

◮ End-to-end network latency to the closest AWS data center using wired network 20-30 ms, up to 50-150 ms on 4G mobile network. ◮ Ambiant occlusion requires end-to-end delays under 20 ms !!!!! ◮ What the hell !! Even the cloud is not enough!

slide-8
SLIDE 8

5/21

The new emerging computing paradigm: Mobile Cloud Computing

◮ End-to-end network latency to the closest AWS data center using wired network 20-30 ms, up to 50-150 ms on 4G mobile network. ◮ Ambiant occlusion requires end-to-end delays under 20 ms !!!!! ◮ What the hell !! Even the cloud is not enough!

slide-9
SLIDE 9

6/21

The new emerging computing paradigm: extension

Internet

Operator Network

Cloud

Edge Node

Network Latency

Reduced Latency through Mobile Edge Computing

Virtual Reality World

Mobile Edge Computing Environment

⇒ Ultra-low latency. ⇒ Small capacity.

slide-10
SLIDE 10

6/21

The new emerging computing paradigm: extension

Internet

Operator Network

Cloud

Edge Node

Network Latency

Reduced Latency through Mobile Edge Computing

Virtual Reality World

Mobile Edge Computing Environment

⇒ Ultra-low latency. ⇒ Small capacity.

slide-11
SLIDE 11

7/21

The new emerging computing paradigm: MEC Challenges

  • 1. Placement of the Edge Server (cloudlet) in the network
  • 2. Selection of the Edge Server for whom a user offloads its computation
  • 3. Model of the mobile application: define the offloadable parts, offloading

condition, virtualization technology

  • 4. Computing resource allocation at the edge server
  • 5. Bandwidth allocation
slide-12
SLIDE 12

7/21

The new emerging computing paradigm: MEC Challenges

  • 1. Placement of the Edge Server (cloudlet) in the network
  • 2. Selection of the Edge Server for whom a user offloads its computation
  • 3. Model of the mobile application: define the offloadable parts, offloading

condition, virtualization technology

  • 4. Computing resource allocation at the edge server
  • 5. Bandwidth allocation
slide-13
SLIDE 13

8/21

Computation offloading: model of the application

Edge Server Mobile Device Task transmitted from to mobile device Dependencies: data, parameters, ... Local part Remote part (task) Remote part (task) The app computation requirement The amount

  • f

the computation to offload

Determine the remote part: ⇒ At the design time: static offloading decision app ⇒ At the runtime: dynamic offloading decision app

slide-14
SLIDE 14

8/21

Computation offloading: model of the application

Edge Server Mobile Device Task transmitted from to mobile device Dependencies: data, parameters, ... Local part Remote part (task) Remote part (task) The app computation requirement The amount

  • f

the computation to offload

Determine the remote part: ⇒ At the design time: static offloading decision app ⇒ At the runtime: dynamic offloading decision app

slide-15
SLIDE 15

9/21

Large MEC: Computation offloading

edge server

A c c e s s P

  • i

n t ( W i F i )

slide-16
SLIDE 16

9/21

Large MEC: Computation offloading

A c c e s s P

  • i

n t ( W i F i )

Static o

  • ading

decision app

Edge server

Dynamic O

  • ading

decision app

slide-17
SLIDE 17

9/21

Large MEC: Computation offloading

A c c e s s P

  • i

n t ( W i F i )

Which user should o

  • ad? How much computation?

And to which edge server?

slide-18
SLIDE 18

10/21

Our Offloading Policy

⇒ Goal: Determine which user should offload, select an edge server and the amount of the computation to offload. ◮ Allocate the bandwidth to each user. ◮ minimize the offloading cost: cost = β ∗ Energy + (1 − β) ∗ Time ◮ assumptions:

⇒ For static offloading decision: aum,n = 1, the whole computation must be offloaded to MEC. ⇒ For dynamic offloading decision: aum,n ∈ [0, 1], we must find its optimal value.

slide-19
SLIDE 19

11/21

Problem Formulation: multi-user multi-edge server offloading

Minimize M

m

Nm

n

Zum,n C1 : K

k=1 xum,n,k ≤ 1, ∀m ∈ M, um,n ∈ Nm

⇒ Each task can be offload to at most one Edge server C2 : yum,n − K

k=1 xum,n,k ≤ 0, ∀m ∈ M, um,n ∈ Nm

⇒ Static offloading Decision app must be offloaded C3 : Tum,n ≤ tum,n, ∀m ∈ M, um,n ∈ Nm ⇒ QoS constraint C4 : xum,n,k ≤ gum,n,k, ∀m ∈ M, um,n ∈ Nm, k ∈ K ⇒ Edge server support Constraint C5 : M

m (Nm n

xum,n,k ∗ ck) ≤ Fk, ∀k ∈ K ⇒ Edge server capacity C6 : xum,n,k ∈ {0, 1}, ∀m ∈ M, um,n ∈ Nm, k ∈ K C7 : aum,n ∈ [0, 1], aum,n ≥ yum,n, ∀m ∈ M, um,n ∈ Nm This problem is NP-hard.

slide-20
SLIDE 20

11/21

Problem Formulation: multi-user multi-edge server offloading

Minimize M

m

Nm

n

Zum,n C1 : K

k=1 xum,n,k ≤ 1, ∀m ∈ M, um,n ∈ Nm

⇒ Each task can be offload to at most one Edge server C2 : yum,n − K

k=1 xum,n,k ≤ 0, ∀m ∈ M, um,n ∈ Nm

⇒ Static offloading Decision app must be offloaded C3 : Tum,n ≤ tum,n, ∀m ∈ M, um,n ∈ Nm ⇒ QoS constraint C4 : xum,n,k ≤ gum,n,k, ∀m ∈ M, um,n ∈ Nm, k ∈ K ⇒ Edge server support Constraint C5 : M

m (Nm n

xum,n,k ∗ ck) ≤ Fk, ∀k ∈ K ⇒ Edge server capacity C6 : xum,n,k ∈ {0, 1}, ∀m ∈ M, um,n ∈ Nm, k ∈ K C7 : aum,n ∈ [0, 1], aum,n ≥ yum,n, ∀m ∈ M, um,n ∈ Nm This problem is NP-hard.

slide-21
SLIDE 21

12/21

Our proposal: DM2-ECOP algorithm

slide-22
SLIDE 22

12/21

Our proposal: DM2-ECOP algorithm

slide-23
SLIDE 23

12/21

Our proposal: DM2-ECOP algorithm

MEC Computation Offloading manager Local offloading manager 1 Local offloading manager M

subproblem 1:

  • ffloading decision

and cloudlet selection Lagrangian multipliers subproblem M:

  • ffloading decision

and cloudlet selection Lagrangian multipliers Local Offloading Requests Local Offloading Requests

slide-24
SLIDE 24

13/21

DM2-ECOP: Local offloading manager

1- Estimate the bandwidth allocation to each user using Bianchi model: wum,n = Bm(πm) πm

◮ Bm: is the estimated bandwidth at the AP m ◮ πm: is the number of users that offload

2- For each Static offloading decision task, select the cloudlet that minimizes Ze

um,n,k + λkck.

slide-25
SLIDE 25

14/21

DM2-ECOP: Local offloading manager

3- For each Dynamic offloading decision task, compute the offloading priority: ξum,n = Zl

um,n − min k∈K(Ze um,n,k);

under aum,n = 1 4- Sort dynamic offloading decision apps in decreasing order of ξum,n 5- Select the cloudlet k that minimizes Ze

um,n,k + λkck

6- Compute the optimal value of aum,n 7- when the offloaded task is equal to πm, all the remaining apps will be performed locally

slide-26
SLIDE 26

15/21

DM2-ECOP: find the optimal amount of computation to offload

⇒ For each user, the optimal aum,n is the solution of: min(Ze

um,n,k + Zl um,n)

Subject to: aum,n ∈ [0, 1]. ⇒ the optimal value of aum,n is 1 if and only if : ψum,n < µum,n ⇒ Where:

◮ ψum,n = upum,n γum,n ◮ µum,n = wum,n · [κ · f 3

um,n · ck · βum,n + (1 − βum,n) · (ck − fum,n) − βum,n · Pidle um,n · fum,n]

ck · fum,n · (Ptx/rx

um,n · βum,n + 1 − βum,n)

slide-27
SLIDE 27

15/21

DM2-ECOP: find the optimal amount of computation to offload

⇒ For each user, the optimal aum,n is the solution of: min(Ze

um,n,k + Zl um,n)

Subject to: aum,n ∈ [0, 1]. ⇒ the optimal value of aum,n is 1 if and only if : ψum,n < µum,n ⇒ Where:

◮ ψum,n = upum,n γum,n ◮ µum,n = wum,n · [κ · f 3

um,n · ck · βum,n + (1 − βum,n) · (ck − fum,n) − βum,n · Pidle um,n · fum,n]

ck · fum,n · (Ptx/rx

um,n · βum,n + 1 − βum,n)

slide-28
SLIDE 28

16/21

Testbed

Application γum,n upum,n dwum,n tum,n

(Giga CPU cycles) (Kilobyte) (Byte) (Second)

static offloading decision tasks FACE 12.3 62 60 5 SPEECH 15 243 50 5.1 OBJECT 44.6 73 50 13 dynamic offloading decision tasks Linpack 50 10240 120 62.5 CPUBENCH 3.36 80 80 4.21 PI BENCH 130 10240 200 163 ◮ 20 access point and 4 edge servers. ◮ WiFi Bandwidth: 150 Mbps. ◮ Access delay : 5 ms ◮ Internet delay: 200 ms ◮ compared to offloading algorithms:

◮ NCO: Nearest Cloudlet Offloading. ◮ FCO: Full Offloading to Cloud

slide-29
SLIDE 29

17/21

Numerical Results: Energy consumption and Completion time

slide-30
SLIDE 30

18/21

Numerical Results: Optimal aum,n

1 5 10 15 20 25 30 35 40

the number of users at the AP

0.00 0.05 0.10 0.15 0.20 0.25 0.30

um, n

  • ffloading zone

non-offloading zone Linpack CPUBENCH PI BENCH 1 2 3 4 5 6 7 8 9 10

ck/fum, n

0.00 0.05 0.10 0.15 0.20

um, n

  • ffloading zone

non-offloading zone Linpack CPUBENCH PI BENCH

slide-31
SLIDE 31

18/21

Numerical Results: Optimal aum,n

0.00 0.25 0.50 0.75 1.00

um, n

0.00 0.05 0.10 0.15 0.20 0.25 0.30

um, n

  • ffloading zone

non-offloading zone Linpack CPUBENCH PI BENCH

slide-32
SLIDE 32

19/21

Conclusion

◮ Mobile Edge computing is a very powerful approach to extend the mobile’s resource. ◮ Mobile apps offloading model has an important role on MEC. ◮ It is very important to consider a dynamic edge server selection. ◮ Offloading cost model play a key role to determine the efficiency of the offloading policy.

slide-33
SLIDE 33

20/21

On going work

We are working on: ◮ Dynamic apps partitioning into offloaded part and local part. ◮ Designing a framework for offloading in MEC. ◮ Introducing the operator part in the optimization problem (Operator cost and pricing model)

slide-34
SLIDE 34

21/21

Thank you