PERFORMANCE EVALUATION OF

TELECOMMUNICATION NETWORKS
BASED ON
MULTI-REGIME FLUID QUEUES
by
Hseyin Emre KANKAYA
Ph.D. Defense in Electrical and Electronics
Engineering
Supervisor: Assoc. Prof. Dr. Nail Akar
2
INTRODUCTION
3
INTRODUCTION 1/6
SERVER
Arrival
Process
Service
Process
Queue
Queueing Systems
4
INTRODUCTION 2/6
Performance Evaluation
Arrival Stream
Output Stream
N
u
m
b
e
r

o
f

P
a
c
k
e
t
s

W
o
r
k
l
o
a
d

Time
Time
Delay
Loss
Loss
5
INTRODUCTION 3/6
Overview
A Transformation method to solve the steady-state performance measures of
Telecommunication Networks.
Concerned Queueing System
First-order Multi-Regime
Feedback Fluid Queue (FMFFQ)
Transformation
Computation
Probabilistic measures of FMFFQ
Backward
Transformation
Performance measures of QS
6
Time
T
r
a
n
s
f
r
o
m
e
d

P
r
o
c
e
s
s

Time
U
n
f
i
n
i
s
h
e
d

w
o
r
k

INTRODUCTION 4/6
Transformation-Properties-1
-Not similar to Laplace transform, z- transfrom etc.
-We dont use long lines of proofs, derivations or complex theorems
-A process-to-process type transformation
-We use sample path arguments
7
Solutions are exact
Not applicable for the transient measures (only at steady-state)
INTRODUCTION 5/6
Transformation-Properties-2
FMFFQs are quite well-known
The computation tools are available
Flexible, lots of possible applications
It is not unique, it requires a design process
8
BACKGROUND
FIRST-ORDER MULTI-REGIME FEEDBACK
FLUID QUEUES
FLUID QUEUE-BASED ANALYSIS: General
Ideas and Examples
OFFSET-BASED SERVICE DIFFERENTIATION
IN SINGLE-CHANNEL MULTI-CLASS OBS
SINGLE-WAVELENGTH OPTICAL BUFFERS
HYSTERETIC CONTROL IN FIRST-ORDER
MULTI-REGIME FEEDBACK FLUID QUEUES
METHODOLOGY
APPLICATIONS
OPTICAL NETWORKS
OPTICAL NETWORKS CONT
INTRODUCTION 6/6
OUTLINE
9
FIRST-ORDER MULTI-REGIME
FEEDBACK FLUID QUEUES
10
FIRST-ORDER SINGLE-REGIME FLUID QUEUES 1/12
BACKGROUND
PROCESS
CONTENT
PROCESS
1 2 3
Infinitesimal
Generator: Q
Drifts: R
Upper boundary
point: T
Description
11
FIRST-ORDER SINGLE-REGIME FLUID QUEUES 2/12
1 2 3
Time
C
o
n
t
e
n
t

P
r
o
c
e
s
s

Sample Evolution
12
MARKOVIAN FLUID QUEUES 3/12
FIRST-ORDER FLUID QUEUES ORDER
SECOND-ORDER FLUID QUEUES
SINGLE REGIME FLUID QUEUES
MULTI-REGIME FEEDBACK FLUID QUEUES
CONTINUOUS FEEDBACK FLUID QUEUES
DEPENDENCE ON
OCCUPANCY
Classification
13
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 4/12
(0)
T =0
(1)
T
(2)
T
Regime 1
Regime 2 1 2 3
1 2 3
1 2 3
1 2 3
1 2 3
Description
14
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 5/12
(0)
T =0
(1)
T
(2)
T
Regime 1
Regime 2
(1)
R
(2)
R
(1)
Q
(2)
Q
(0)
Q
(1)
Q
(2)
Q
(0)
R
(1)
R
(2)
R
,
,
,
,
,
Parameters
15
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 6/12
1 2
Time
C
o
n
t
e
n
t

P
r
o
c
e
s
s

Sample Evolution
16
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 7/12
Steady State Solution
Joint Cumulative
Distribution Functions
(Joint CDFs)
Joint Probability
Density Functions
(Joint PDFs)
{ }
( )
( ) lim ( ) , ( )
k
m
t
F y P C t y M t m

= s =
( 1) ( ) k k
T y T

s <
( )
( )
( )
( )
k
k
m
m
dF y
f y
dy
=
( ) ( ) ( ) ( 1) ( )
( ) ( )
k k k k k
m m m
c F T F T

=
Joint Probability
Mass Accumulations
(Joint PMAs)
( 1) ( ) k k
T y T

< <
Long,
Difficult to trace
Short,
Accessible
17
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 8/12
A sample in CDF Representation
( )
( )
( )
( ) ( ) ( ) ( ) ( 1) ( )
( ) ( 1) ( 1) ( 1) ( 1)
( 1) ( 1) ( 1) ( 2) ( 1)
( ) ( ) ( )
( ) ( )
( ) ( )


k k k k k k
k k k k k
k k k k k
d
F y R F y F T Q
dy
F T F T Q
F T F T Q

=
+
+
( )
(1) (1) (1) (0) (1)
(1) (0) (0) ( 1) ( )
( ) ( )
( ) , , 1
k k
F T F T Q
F T Q T y T k K

+
+ < < s s
18
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 9/12
Solution in PDF-PMA Representation
System of Ordinary Differential Equations
Boundary Conditions
( ) ( ) ( ) ( ) ( 1) ( )
( ) ( ) , , 1
k k k k k k
d
f y R f y Q T y T k K
dy

= < < s s
( )
( ) ( )
0
(0) (1) (0) (0)
( 1) ( 1) ( 1) ( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) ( )
0
( 1) ( ) (
0
0, ,
(0 ) ,
( ) ( ) , 1 1,
( ) ,
( ) 0, , 1 1,
( ) 0,
k k
m
k k k k k k k k
K K K K K
k k k k k
m
k k k
m
c m S
f R c Q
f T R f T R c Q k K
f T R c Q
f T m S S S k K
f T m S
+ + +
+
+
= e
+ =
+ = s s
=
= e s s
+ = e
( )
( )
( 1)
) ( ) ( 1)
( ) ( )
1 1 0
, 1 1,
( ) 1.
k
k
k k
T
M K K
k k
m m
m k k
T
S S k K
f x dx c

+
+

= = =
+
s s
| |
+ = |
|
\ .

}
19
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 10/12
Previous Solution
20
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 11/12
Our Solution
21
FIRST-ORDER MULTI-REGIME FEEDBACK FLUID QUEUES 12/12
General Solution Form
General Solution Form
( ) ( ) ( ) ( ) ( 1) ( )
( ) exp( ) , , 1
k k k k k k
i i i
i
f y a y T y T k K |

= < < s s

( )
( ) ( )
,
k k
i i
|
( )
1
( ) ( ) k k
Q R

SPECTRAL SOLUTION
ORDERED SCHUR FACTORZATION
Solution
Approaches
22
FLUID QUEUE-BASED ANALYSIS
23
FLUID QUEUE-BASED ANALYSIS 1/9
M/M/1 Queue Waiting Time Distribution
PROCESSOR
Interarrival time: X~exp(1/)
Service time: Y~exp(1/)
Time
Arrival Stream
U
n
f
i
n
i
s
h
e
d

W
o
r
k

Y
Y
Y
Y
Y
Y
X X X
X
X X
24
FLUID QUEUE-BASED ANALYSIS 2/9
Classical Solution
{ } { }
{ }
1
1
1
0
(1 )
0
( )
0
service completions in (0, ] | arrival finds customers in the system
( )
1 (1 )
( 1)!
1 (1 )
1
q q
n
n
x
n
n y
n
x
y
x
P T x P T
P n x n p
y
e dy
n
e dy
e

=


s = = +
= +

= +
=

}
}
25
FLUID QUEUE-BASED ANALYSIS 3/9
FSFQ-based Solution
Y
X X
X
X X X
Time
T
r
a
n
s
f
o
r
m
e
d

P
r
o
c
e
s
s

Y
Y
Y
Y
Y
X X X X X
Time
Y Y Y Y Y
U
n
f
i
n
i
s
h
e
d

W
o
r
k

Y
Y
Y
Y
Y
26
FLUID QUEUE-BASED ANALYSIS 4/9
FSFQ-Based Solution
T
r
a
n
s
f
o
r
m
e
d

P
r
o
c
e
s
s

X X X X X
Time
Y Y Y Y Y
X~exp(1/) Y~exp(1/)
Q

(
=
(

(1, 1) R diag =
T =
State 1:
State 2:
FSFQ!!!!
27
FLUID QUEUE-BASED ANALYSIS 5/9
FSFQ-Based Solution
(1)
1
(1)
(1) (1)
1
1 2
(1)
(1) (1)
2
1 2
(1) (0) (0)
1 1 2
(1) (0) (0)
2 1 2
(0)
1
(1) (1) (0) (0)
1 2 1 2
0
(1) (1) (1) (1) (1
1 2 1 1 2
( )
( ) ( )
( )
( ) ( )
(0 )
(0 )
0
( ( ) ( )) 1
( ) ( )
x
df x
f x f x
dx
df x
f x f x
dx
f c c
f c c
c
f x f x dx c c
f x f x a e a

+
= +
=
+ = +
+ =
=
+ + + =
( = +

}
(1)
2
) (1)
2
x
e
A

|



(
=
(

Differential Equations
Boundary Conditions
General Solution
28
FLUID QUEUE-BASED ANALYSIS 6/9
FSFQ-Based Solution
(1) (1) ( )
1 2
(0)
2
(0) (1)
2 2
( )
0
(0) (1)
2 2
0
( ) ( )
( )
( ) 1
( )
x
x
x
f x f x e
c
c f x dx
G x e
c f x dx

= =
+

=
+
+
= =
+
}
}
29
FLUID QUEUE-BASED ANALYSIS 7/9
Normalization
Probability of being in the interval: 9/28
U
n
f
i
n
i
s
h
e
d

w
o
r
k

T
r
a
n
s
f
r
o
m
e
d

p
r
o
c
e
s
s

55 points: 28 on blue line, 27 on red line
28 points
Probability of being in this interval and at state 2: 9/55
Probability of being at state 2: 28/55
9/28=(9/55)/(28/55)=Probability of being in this interval given that state is 2
30
FLUID QUEUE-BASED ANALYSIS 8/9
MOTIVATION
FSFQ-based Analysis Limited (three parameters)
Markovian->Markovian
Lots of drift and infinitesimal generator
Combinations (mixed processes)
Non-Markovian->Markovian
Standard solutions are known
(FSFQ-based solutions are longer)
Engineering Applications
New Solutions
Replace each jump with a linearly
increasing sample path part
FMFFQ-based Analysis
Advanced transformations techiques
31
FLUID QUEUE-BASED ANALYSIS 9/9
SAMPLE PATH-1
Time
1
2
3
4
5
6
7
F
M
F
F
Q
-
H

C
o
n
t
e
n
t

1
2
3
4
5
6
7
F
M
F
F
Q

C
o
n
t
e
n
t

SR1
SR2
SR1
SR2
LRR
URR
HR
32
OPTICAL NETWORKS
33
OPTICAL NETWORKS 1/9
OPTICAL CIRCUIT SWITCHING (OCS)
OPTICAL PACKET SWITCHING (OPS)
OPTICAL BURST SWITCHING (OBS)
34
OPTICAL BURST SWITCHING
Electronic
Optical
Electronic
Ingress Node
Egress Node
Core Nodes
Optical
OPTICAL NETWORKS 4/9
OPTICAL BURST SWITCHING
35
Ingress Node
OPTICAL NETWORKS 5/9
Burst Assembly
EO Conversion
Signaling
Core Nodes
Routing
Contention Resolution
Egress Node
Burst Disassembly
OE Conversion
OBS OPERATIONS
36
Ingress Node
OPTICAL NETWORKS 6/9
Burst Assembly
EO Conversion
Signaling
OBS OPERATIONS
Electronic Buffer (RAM)
1. Threshold Based
Electronic Buffer (RAM)
2. Timer Based
Electronic Buffer (RAM)
3. Mixture of Timer and Threshold Based Policies
37
Ingress Node
OPTICAL NETWORKS 7/9
Burst Assembly
EO Conversion
Signaling
OBS OPERATIONS
CONTROL CHANNEL
B
C
P

Tell-And-Wait (TAW)
A
C
K

CONTROL CHANNEL
B
C
P

Advance Reservation Schemes
38
OPTICAL NETWORKS 8/9
Advance Reservation Schemes
BCP Arrival Stream
0
Reserved
Non-Reserved
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
27
28
29
x,y
x:offset time
y:burst length
2,4 4,3 2,4 4,3

2,1
Just-Enough-Time (JET)
Horizon-based
BCP Arrival Stream
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
27
28
29
2,4 4,3 2,4 4,3

2,1
accepted rejected
Core Nodes
Void filling isnt allowed
39
OPTICAL NETWORKS 9/9
Horizon Parameter
Horizon-based
BCP Arrival Stream
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
27
28
29
2,4 4,3 2,4 4,3

2,1
accepted rejected
Time
H
o
r
i
z
o
n

1
2
3
4
5
6
7
Core Nodes
Reserved
Non-Reserved
x,y
x:arrival time
y:burst length
2
4 4 3 2 4 3 2
Void filling isnt allowed
40
EXACT ANALYSIS OF OFFSET-BASED
SERVICE DIFFERENTIATION IN
SINGLE-CHANNEL MULTI-CLASS OBS
41
DIFFERENTIATION 9/9
Horizon Parameter
Horizon-based
BCP Arrival Stream
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
27
28
29
2,4 4,3 2,4 4,3

2,1
accepted rejected
Time
H
o
r
i
z
o
n

1
2
3
4
5
6
7
Core Nodes
Reserved
Non-Reserved
x,y
x:arrival time
y:burst length
2
4 4 3 2 4 3 2
Void filling isnt allowed
42
DIFFERENTIATION 1/8
Stochastic Model and Assumptions
Time
H
o
r
i
z
o
n

1
2
3
4
5
6
7
A generic number of classes
Offset times can be anything real
Poisson arrival stream of BCPs for each burst class
Horizon at a single output port
Service times: Distinct PH-type distribution for each class
PH-type
43
DIFFERENTIATION 2/8
Phase Type Distribution
1
2
3
A
T
r
a
n
s
i
e
n
t

S
t
a
t
e
s

Absorbing
state
p1
p2
p3
p1+ p2+ p3=1
0
PH-type distribution
1
2
3
A
p1
p2
p3
1
2
3
A
1
Exponential Distribution
Erlang Distribution
1 A
1
Hyper-exponential Distribution
44
DIFFERENTIATION 3/8
Transformation idea
Time
1
2
3
4
5
6
7
Time
1
2
3
4
5
6
7
Horizon Process
Transformed Process
45
DIFFERENTIATION 4/8
Transformation idea
Regime 1
Regime 2
Regime 3
BP 1
BP 0
BP 2
Time
1
2
3
4
5
6
7
BP at infinity
State p State 1 State 2
Drifts
p
1
2
R1 R2 R3
BP0
BP1 BP2
-1 -1 -1 -1 -1 0
1 1 1 1 1 1
1 1 1 1 1 1
p
p
1
2
1 2 p
p
1
2
1 2 p
p
1
2
1 2
Regime 1
Regime 2 Regime 3
-(1+2) 1 2 2 -2 0 0 0
0 0 0
0 0 0
0
0 0 0
0
0
0 1 -1 1 -1
2 -2
Infinitesimal Generators
Service times: Exponential
46
1 2 3 4 5 6
0
0.2
0.4
0.6
x
f
(
x
)

1
=0.01,
2
=0.02, Simulation

1
=0.1,
2
=0.2, Simulation

1
=1,
2
=2, Simulation

1
=0.01,
2
=0.02, Analysis

1
=0.1,
2
=0.2, Analysis

1
=1,
2
=2, Analysis
DIFFERENTIATION 5/8
Transformation
Mean:1, CoV:2
47
DIFFERENTIATION 6/8
Transformation
1 2
0.1, 0.2 = =
Mean: 1
48
DIFFERENTIATION 7/8
Transformation
49
0.5 1 1.5 2 2.5 3 3.5 4
0
5
10
15
20
25
30
Mean Packet Length
M
i
n
i
m
u
m

R
e
q
u
i
r
e
d


O
f
f
s
e
t





D
i
f
f
e
r
e
n
c
e


f
o
r

9
9
%

I
s
o
l
a
t
i
o
n

2
=0.01

2
=0.05

2
=0.1

2
=0.2

2
=0.5

2
=1
DIFFERENTIATION 8/8
Transformation
1
0.1 =
Mean Burst Length
50
OPTICAL NETWORKS Cont
51
Ingress Node
OPTICAL NETWORKS 7/9
Burst Assembly
EO Conversion
Signaling
OBS OPERATIONS
CONTROL CHANNEL
B
C
P

Tell-And-Wait (TAW)
A
C
K

CONTROL CHANNEL
B
C
P

Advance Reservation Schemes
52
Busy Idle
OPTICAL NETWORKS
CONTENTION RESOLUTION
Core Nodes
Routing
Contention
Resolution
Electronic Networks
RAM
Optical Networks
1. Deflection Routing
3. Fiber Delay Lines (FDLs)
2. Wavelength Conversion
53
Optical Buffer
Output
Buffer Manager
.
.
.
O
p
t
i
c
a
l

S
w
i
t
c
h

D
2D
.
.
.
OPTICAL NETWORKS
FDL
Core Nodes
Routing
Contention
Resolution
B.D
54
OPTICAL NETWORKS
FDL
Core Nodes
Routing
Contention
Resolution
Burst Arrival Stream
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
27
28
29
4 3 3

1
accepted rejected
Time
1
2
3
4
5
6
7
1
x
x: burst length
S
c
h
e
d
u
l
i
n
g

H
o
r
i
z
o
n

55
OPTICAL BUFFERS
56
FIBER DELAY LINES
MODEL ASSUMPTIONS
Time
1
2
3
4
5
6
7
S
c
h
e
d
u
l
i
n
g

H
o
r
i
z
o
n

A generic number of FDLs
Delays can be any real number
MAP arrival stream of bursts
Service times: PH distribution
Single output port
57
MARKOVIAN ARRIVAL PROCESS (MAP)
FIBER DELAY LINES
1
2
3
1
2
3
1
2
3
1
2
3

Stage 1 Stage 2 Stage 3 Stage 4

58
TRANSFORMATION
Time
1
2
3
4
5
6
7
S
c
h
e
d
u
l
i
n
g

H
o
r
i
z
o
n

1
2
3
4
5
6
7
F
M
F
F
Q

FIBER DELAY LINES
59
SOLUTION
1
2
3
4
5
6
7
F
M
F
F
Q

2 FDL, 1 direct line, D=2, Service times: Exponential, Arrivals: Poisson
Regime 1
Regime 2
Regime 3
Boundary points: 0, D, 2D,
State p
State 1
State 2
Drifts
p
1
2
R1 R2 R3 BP0 BP1 BP2
-1 -1 -1 -1 -1 0
1 1 -1 1 0 0
1 1 1 1 1 1
FIBER DELAY LINES
60
SOLUTION
1
2
3
4
5
6
7
F
M
F
F
Q

2 FDL, 1 direct line, D=2, Service times: Exponential (1/), Arrivals: Poisson()
Regime 1
Regime 2
Regime 3
p
p
1
2
1 2 p
p
1
2
1 2
BP 1 R 2
0 - - 0


0 -
1
0
0 0 -1 0 0
-
Infinitesimal Generators
p
p
1
2
1 2 p
p
1
2
1 2
BP 0 R 1
- - 0 0
0 -
0
0
0 0 0 0 0
-
p
p
1
2
1 2 p
p
1
2
1 2
BP 2 R 3
0 - 0 0 0
0 -
1
0
0 0 -1 0 0
-
State p
State 1
State 2
FIBER DELAY LINES
61
PH-type Service Times
1
2
3
4
5
6
7
F
M
F
F
Q

State p
State 1
State 2
1
2
3
A
T
r
a
n
s
i
e
n
t

S
t
a
t
e
s

Absorbing
state
p1
p2
p3
p1+ p2+ p3=1
FIBER DELAY LINES
62
MAP Arrival Stream
1
2
3
4
5
6
7
F
M
F
F
Q

State p
State 1
State Group 2
p1+ p2+ p3=1
1
2
3
1
2
3
1
2
3
1
2
3

Stage 1 Stage 2 Stage 3 Stage 4

X n
X n
X n
FIBER DELAY LINES
63
FIBER DELAY LINES
64
FIBER DELAY LINES
65
FIBER DELAY LINES
Packet Lengths:
exponential with mean 1
Autocovariance function
of the interarrival times:
k
Ao
66
FIBER DELAY LINES
D*: Optimal D maximizing the throughput under a desired blocking probability
K: Number of FDLs
67
FIRST-ORDER MULTI REGIME FEEDBACK
FLUID QUEUES WITH HYSTERETIC CONTROL
68
1 2
Time
C
o
n
t
e
n
t

P
r
o
c
e
s
s

FMFFQ-H
FMFFQ Sample Path
69
1 2
Time
C
o
n
t
e
n
t

P
r
o
c
e
s
s

FMFFQ-H
Hysteresis
Regime
FMFFQ-H Sample Path
70
1 2
FMFFQ-H
Hysteretic
Regime
SOLUTION
Static
Regime-1
Static
Regime-2
LRR
SR 1
SR 2
URR
1 2 1 2 1 2 1 2
M states
4M states
71
FMFFQ-H
SAMPLE PATH-1
Time
1
2
3
4
5
6
7
F
M
F
F
Q
-
H

C
o
n
t
e
n
t

1
2
3
4
5
6
7
F
M
F
F
Q

C
o
n
t
e
n
t

SR1
SR2
SR1
SR2
LRR
URR
HR
72
FMFFQ-H
SAMPLE PATH-2
Time
1
2
3
4
5
6
7
F
M
F
F
Q
-
H

C
o
n
t
e
n
t

1
2
3
4
5
6
7
F
M
F
F
Q

C
o
n
t
e
n
t

SR1
SR2
SR1
SR2
LRR
URR
HR
73
FMFFQ-H
M/M/1 EXAMPLE
PROCESSOR
U
L
SR2
SR1
HR
FMFFQ-H
FMFFQ
74
FMFFQ-H
75
FMFFQ-H
76
FMFFQ-H
77
FMFFQ-H
PROCESSOR
U=2
L