List of Figures
Figure I.1 Traffic‐load in a link of three trunks (Example I.1)
Figure I.2 Qualitative relationships between traffic‐load, system capacity and GoS
Figure I.3 Call generation process
Figure I.4 Poisson distribution with rate 
calls/hour
Figure I.5 Superposition and decomposition of Poisson processes
Figure I.6 Exponential distribution 
Figure I.7 Markov/memoryless property
Figure I.8 Representation of service systems
Figure I.9 Service systems of full and restricted availability (Example I.19)
Figure I.10 An access network as a queuing system (Example I.21)
Figure I.11 The CS policy (Example I.26)
Figure I.12 A CS policy with ordering constraint (Example I.27)
Figure I.13 The TH policy (Example I.28)
Figure I.14 Comparison of the BR policy with the CS policy (Example I.29)
Figure I.15 System states in the CS and the BR policies (Example I.29)
Figure I.16 Visualization of (a) random/quasi‐random and (b) batch Poisson arrivals
Figure I.17 Visualization of (a) fixed and (b) elastic bandwidth requirements
Figure I.18 Visualization of (a) stream, (b) elastic, and (c) ON–OFF traffic
Figure I.19 (a) Resource separation (
QoS‐aware flows) and (b) resource sharing (two QoS classes)
Figure 1.1 State transition diagram for the Erlang loss model (
/
/
/0)
Figure 1.2 
/
/
/
FIFO – state transition diagram for 
(Example 1.2)
Figure 1.3 Quantitative relationships between traffic‐load, system capacity, and CBP
Figure 1.4 Trunk efficiency for various values of GoS and 
Figure 1.5 A service system of 
b.u. and two service‐classes under the CS policy (Example 1.6)
Figure 1.6 The state space 
(CS policy) and the state transition diagram (Example 1.6)
Figure 1.7 State transition diagram of the EMLM
Figure 1.8 GB in the system of Example 1.6 (Example 1.7)
Figure 1.9 Sets 
and 
for the EMLM of two service‐classes, under the CS policy
Figure 1.10 The Kaufman–Roberts recursion as a birth–death process
Figure 1.11 Visualization of CBP calculation
Figure 1.12 CBP oscillations in the EMLM (CS policy) (Example 1.14)
Figure 1.13 An example of the EMLM under the BR policy
Figure 1.14 The state space 
of the EMLM under the BR policy (Example 1.15)
Figure 1.15 The one‐dimensional Markov chain of the EMLM/BR (Roberts' assumption, Example 1.18)
contribute in 
by transferring the population of service‐class 
to state 
service‐classes of Poisson input (Example 1.22)
service‐classes of Poisson input described by the EMLM/TH (Example 1.22)Figure 1.20 The state space 
of system under the TH policy (Example 1.23)
Figure 1.21 Comparison of the EMLM, the EMLM/BR, and the EMLM/TH (Example 1.23)
Figure 1.22 The state space 
of the three link network (Example 1.24)
Figure 1.23 Two service‐classes accommodated in a fixed routing network of two links (Example 1.25)
Figure 1.24 Application of the RLA method in a telephone network of three links (Example 1.26)
Figure 1.25 A ring network supporting service‐classes under the BR policy (Example 1.28)
Figure 2.1 Service system of the SRM
Figure 2.2 The CAC mechanism for a new call in the SRM
Figure 2.3 The state space 
(CS policy) and the state transition diagram (Example 2.1)
Figure 2.4 The state space 
(BR policy) and the state transition diagram (Example 2.3)
Figure 2.5 CBP in the SRM and EMLM, for various values of 
(Example 2.5)
Figure 2.6 Link utilization in the SRM and EMLM (Example 2.5)
Figure 2.7 CBP in the SRM/BR and the EMLM/BR for various values of 
(Example 2.5)
Figure 2.8 The state space 
(CS policy) and the state transition diagram (Example 2.6)
Figure 2.9 The state space 
(BR policy) and the state transition diagram (Example 2.8)
Figure 2.11 CBP of service‐class 4 in the MRM, SRM, and EMLM for various values of 
(Example 2.10)
Figure 2.12 Equalized CBP in the MRM/BR and EMLM/BR for various values of (Example 2.10)
Figure 2.13 The state space 
(CS policy) and the state transition diagram (Example 2.11)
Figure 2.14 The state space 
(BR policy) and the state transition diagram (Example 2.13)
. Right: The corresponding graphs for service‐classes 3, 4 (Example 2.15)Figure 2.16 CBP in the STM/BR and SRM/BR versus 
and two values of 
(Example 2.15)
Figure 2.17 The MTM principle of operation
Figure 2.20 The CDTM principle of operation
Figure 2.21 The service system (Example 2.17)
Figure 2.22 Graphical representation of the LB equations 2.63 (left) and 2.64 (right)
Figure 2.23 Migration and upward migration spaces (Example 2.18)
Figure 2.24 Thresholds and bandwidth requirements of service‐classes 3 and 4 (Example 2.20)
Figure 2.25 Recurrent determination of the resource share (Example 2.21)
Figure 2.26 Excerpt of the state transition diagram (Example 2.22)
Figure 2.27 Migration and upward migration space (Example 2.22)
Figure 3.1 The state space 
and the state transition diagram (Example 3.1)
Figure 3.2 State transition diagram of four adjacent states (Example 3.2)
Figure 3.3 The state space 
and the modified state transition diagram (Example 3.3)
Figure 3.4 State transition diagram of the E‐EMLM
Figure 3.5 CBP of both service‐classes in the E‐EMLM (Example 3.5)
Figure 3.6 Link utilization in the E‐EMLM (Example 3.5)
Figure 3.7 The state space 
and the state transition diagram (Example 3.6)
Figure 3.8 The state space 
and the modified state transition diagram (Example 3.6)
Figure 3.9 CBP of service‐class 1 (EMLM, E‐EMLM) (Example 3.8)
Figure 3.10 CBP of service‐class 2 (EMLM, E‐EMLM) (Example 3.8)
Figure 3.11 Equalized CBP (EMLM/BR, E‐EMLM/BR) (Example 3.8)
Figure 3.12 Link utilization for all models (Example 3.8)
Figure 3.13 The state space 
and the state transition diagram (Example 3.9)
Figure 3.14 The state space 
and the modified state transition diagram (Example 3.9)
Figure 3.15 The loss system of Example 3.9 as an access tree network (Example 3.11)
Figure 3.16 CBP of service‐class 1, when 
(Example 3.12)
Figure 3.17 CBP of service‐class 2, when 
(Example 3.12)
Figure 3.18 CBP of service‐class 3, when 
(Example 3.12)
Figure 3.19 Link utilization (Example 3.12)
Figure 3.20 CBP of the first service‐class, when 
and 
(Example 3.12)
Figure 3.21 CBP of the second service‐class, when 
and 
(Example 3.12)
Figure 3.22 CBP of the third service‐class, when 
and 
(Example 3.12)
Figure 3.23 The state space 
and the state transition diagram (Example 3.13)
Figure 3.24 CBP of both service‐classes in the EA‐EMLM (Example 3.16)
Figure 3.25 Link utilization in the EA‐EMLM (Example 3.16)
Figure 3.26 The state space 
and the state transition diagram (Example 3.17)
Figure 3.27 Equalized CBP of the EA‐EMLM/BR and CBP per service‐class of the EA‐EMLM (Example 3.19)
Figure 3.28 The state space 
and the state transition diagram (Example 3.20)
Figure 3.29 CBP of service‐class 1, when 
and 5 (Example 3.22)
Figure 3.30 CBP of service‐class 2, when 
, and 
(Example 3.22)
Figure 3.31 CBP of service‐class 3, when 
, and 
(Example 3.22)
Figure 3.32 SDN/NFV based next‐generation network architecture
Figure 3.33 Layering concept in SDN
Figure 4.1 The state space 
and the state transition diagram (Example 4.1)
Figure 4.2 The state space 
and the modified state transition diagram (Example 4.2)
Figure 4.3 The state space 
and the state transition diagram (Example 4.4)
Figure 4.4 The state space 
and the modified state transition diagram (Example 4.4)
Figure 4.5 CBP of service‐class 1 (MRM, E‐MRM) (Example 4.12)
Figure 4.6 CBP of service‐class 2 (MRM, E‐MRM) (Example 4.12)
Figure 4.7 CBP of service‐class 3 (MRM, E‐MRM) (Example 4.12)
Figure 4.8 Equalized CBP (MRM/BR, E‐MRM/BR) (Example 4.12)
Figure 4.9 The state space 
and the state transition diagram (Example 4.13)
Figure 4.10 The state space 
and the state transition diagram (Example 4.16)
Figure 4.11 CBP of service‐class 1 (MRM, MRM/BR, EA‐MRM, EA‐MRM/BR) (Example 4.24)
Figure 4.12 CBP of service‐class 2 (MRM, MRM/BR, EA‐MRM, EA‐MRM/BR) (Example 4.24)
Figure 4.13 CBP of service‐class 3 (MRM, MRM/BR, EA‐MRM, EA‐MRM/BR) (Example 4.24)
Figure 4.14 Link utilization (MRM/BR, EA‐MRM/BR) (Example 4.24)
Figure 5.1 The service model of ON–OFF calls
Figure 5.2 The mechanisms of call and burst blocking in the ON–OFF model
Figure 5.3 The state transition diagram of the ON–OFF model
Figure 5.4 Basic assumption (approximation) for the determination of BBP
Figure 5.5 Analytical CBP when 
b.u. (Example 5.6)
Figure 5.6 Analytical CBP when 
b.u. (Example 5.6)
Figure 5.7 The fixed routing network with two links and three service‐classes (Example 5.7)
Figure 5.8 Analytical CBP for the three service‐classes (Example 5.7)
Figure 5.9 Total utilization for the first link (Example 5.7.)
Figure 5.10 Total utilization for the second link (Example 5.7)
Figure 5.11 BBP for all service‐classes when 
and 
(Example 5.7)
Figure 5.12 A WDM‐TDMA PON servicing ON–OFF traffic
Figure 6.1 State transition diagram for the Engset loss model 
Figure 6.2 The state space 
and the state transition diagram (Example 6.4)
Figure 6.3 State transition diagram of the EnMLM
Figure 6.4 TC probabilities (Example 6.9)
Figure 6.5 TC probabilities of service‐class 1 (Example 6.12)
Figure 6.6 TC probabilities of service‐class 2 (Example 6.12)
Figure 6.7 TC probabilities of service‐class 3 (Example 6.12)
Figure 6.8 Link utilization (Example 6.12)
Figure 6.9 TC probabilities of service‐class 1 for various numbers of sources (Example 6.12)
Figure 6.10 TC probabilities of service‐class 2 for various numbers of sources (Example 6.12)
Figure 6.11 TC probabilities of service‐class 3 for various numbers of sources (Example 6.12)
Figure 6.12 The S1 interface and the X2 interface between source and target eNBs
Figure 7.1 The state space 
and the state transition diagram (Example 7.1)
Figure 7.2 The state space 
and the state transition diagram (Example 7.4)
Figure 7.3 The state space 
and the state transition diagram (Example 7.6)
Figure 7.4 The state space 
and the state transition diagram (Example 7.8)
Figure 7.5 The state space 
and the state transition diagram (Example 7.11)
Figure 7.6 The state space 
and the state transition diagram (Example 7.14)
Figure 8.1 The state space 
and the state transition diagram (Example 8.1)
Figure 8.2 The state space 
and the state transition diagram (Example 8.2)
Figure 8.3 The state space 
and the state transition diagram (Example 8.4)
Figure 8.4 The state space 
and the modified state transition diagram (Example 8.4)
Figure 8.5 The state space 
and the state transition diagram (Example 8.6)
Figure 8.6 The state space 
and the state transition diagram (Example 8.9)
Figure 8.7 TC probabilities for service‐class 1 
b.u.) (Example 8.11)
Figure 8.8 TC probabilities for service‐class 1 (
b.u.) (Example 8.11)
Figure 8.9 TC probabilities for service‐class 2 (T = 90 b.u.) (Example 8.11)
Figure 8.10 TC probabilities for service‐class 2 (T = 100 b.u.) (Example 8.11)
Figure 8.11 TC probabilities for service‐class 3 (T = 90 b.u.) (Example 8.11)
Figure 8.12 TC probabilities for service‐class 3 (T = 100 b.u.) (Example 8.11)
Figure 8.13 The reference C‐RAN architecture
Figure 8.14 Enabling a hybrid SON
Figure 9.1 The state transition diagram of the f‐ON–OFF model
Figure 9.2 TC probabilities for service‐class 1 when a) 
, (b) 
, and (c) 
(Example 9.4)
Figure 9.3 TC probabilities for service‐class 2 when (a) 
, (b) 
, and (c) 
(Example 9.4)
Figure 9.4 BBP for both service‐classes when (a) 
and (b) 
(Example 9.4)
Figure 9.5 A basic configuration of an OCDMA PON
Figure 10.1 Call arrivals according to (a) a Poisson process and (b) a batched Poisson process
Figure 10.2 The state transition diagram in (a) the EMLM and (b) the BP‐EMLM (Example 10.1)
Figure 10.3 Graphical representation of 10.13 (Example 10.3)
Figure 10.4 Difference between CC and TC probabilities (Example 10.5)
Figure 10.5 TC probabilities of service‐class 1 (Example 10.11)
Figure 10.6 CC probabilities of service‐class 1 (Example 10.11)
Figure 10.7 TC probabilities of service‐class 2 (Example 10.11)
Figure 10.8 CC probabilities of service‐class 2 (Example 10.11)
Figure 10.9 A rectangular cell model for the LEO‐MSS network
Figure 11.1 Equalized TC probabilities (Example 11.5)
Figure 11.2 CC probabilities for service‐class 1 (Example 11.5)
Figure 11.3 CC probabilities for service‐class 2 (Example 11.5)
Figure 11.4 CC probabilities for service‐class 3 (Example 11.5)
Figure 11.5 Equalized TC probabilities (Example 11.10)
Figure 11.6 CC probabilities for service‐class 1 (Example 11.10)
Figure 11.7 CC probabilities for service‐class 2 (Example 11.10)
Figure 11.8 CC probabilities for service‐class 3 (Example 11.10)
Figure 11.9 CC probabilities for service‐class 4 (Example 11.10)
Figure 11.10 Link utilization (in b.u.) (Example 11.10)
Figure 11.11 Congestion probabilities of all service‐classes (elastic/adaptive) (Example 11.10)
Figure A.1 Interdependency of the teletraffic models of Part I of this book
Figure A.2 Interdependency of the teletraffic models of Part II of this book
Figure A.3 Interdependency of the teletraffic models of Part III of this book