Advances in Mobile Cloud Computing Systems

Virtual Mobile Networks in Clouds 195

where 0

N

is a row vector of all zeros of size 1×N.Vectorb

2

that

satisfies the minimum LS constraints Equation 4.18 is

b

2

= −[Φ

ns

1

,...,Φ

ns

F

]

T

. (4.22)

The minus signs in Equations 4.21 and 4.22 reverses the direc-

tion of the inequality from Φ

ws

f

≥ Φ

ns

f

to −Φ

ws

f

≤−Φ

ns

f

to be in

the general form of BIP constraints.

Consequently, the linear inequality constraints that con-

tain both the allocation and the minimum LS constrains are

expressed as

A =[A

1

,A

2

]

T

(4.23)

and

b =[b

1

,b

2

]

T

(4.24)

4.6 Iterative Scheduling Algorithm

The resource allocation algorithm for assigning RBs to flows of MNOs

in the shared C-RAN was formulated as BIP optimization problem

in previous section. This optimization problem is NP-hard due to

exponential increase ...