Академический Документы
Профессиональный Документы
Культура Документы
Urgaonkar et al. [5] • Tailored for Multi-tier ✓ High flexibility and/or Its computational
Internet Services generality. complexity depends on the
• Closed queueing network, ✓ Reduced set of input number of active sessions
MVA based model paramters. O(K NU).
A packet flow utilizes the
resources at exactly one
tier [5].
Bi et al. [14] • DRP for virtualized Multi- ✓ Its computational Limited flexibility and/or
tier Internet Apps. complexity is O(K). generality.
• Open queueing network, ✓ Reduced set of input
Jackson’s network based parameters.
model ✓ Resources held
simultaneously at multiple
Prados et al. [6] • Dimensioning for a vMME
tiers.
with a three-tier design.
• Open queueing network,
Jackson’s network based
model
VNFC2
VNFC3
VNFC1 VNFC2 FE
VNFC3 DB
VNFC2 W
VNF
University of Granada - Analytical Modeling for Virtualized Network Functions 7/19
Analytical model
Queueing model
To model a VNF we employ an open
network of K G/G/m queues
𝑄1 , 𝑄2 , … , 𝑄𝐾 .
Each queue represents a VNFC
instance running on a VM.
Each server of a queue represents an
instance of the computational resource
acting as the bottleneck.
For the transitions between queues, we
assume probabilistic routing. This
approach allows us to model the path
of any packet flow. Figure: A VNF with a three-tier design.
For simplicity, we assume only one instance for the FE and DB:
1−𝑝0𝐹𝐸 1−𝑝0𝐹𝐸
0 ⋯ 0
𝐾𝑊 𝐾𝑊
𝑁ഥ𝑝𝑝 2
ഥ𝑝𝑝 +2
0 … 0 ഥ𝑝𝑝 +2
𝑁 𝑁
1
𝑃= ⋮ ⋮ ⋮ ⋮ ⋮ 𝑝0𝐹𝐸 = 2 or, equivalently, ഥ𝑝𝑝 ; 𝑉𝑊 =
𝑉𝐹𝐸 = 2; 𝑉𝐷𝐵 = 2/𝑁 ഥ𝑝𝑝 )
(1 + 2/𝑁
ഥ𝑝𝑝 𝐾𝑊
𝑁 2
ഥ𝑝𝑝 +2
0 … 0 ഥ
𝑁 𝑁𝑝𝑝 +2
1 1
0 … 0
𝐾𝑊 𝐾𝑊
QNA has a time complexity O(K) (similar to Jackson’s networks analysis), where K is the
number of queues in the network.
For cellular scenarios, where there might be a large number of active sessions, MVA
might take longer than the simulation.
We validate our model by simulation and compare it with other baseline models based on
queueing theory.
Our model exhibits an estimation error approximately equal to 10%, whereas for the considered baseline
models it ranges roughly from 60% to 90%.
The computational complexity of our model is similar to the method for analyzing Jackson’s networks.
However, further work is required…