# Performance Sensitivity to the High-Order Statistics of Time Interval Variables in Cellular Networks

Authors: Felipe A. Cruz-Pérez; Genaro Hernandez-Valdez; Andrés Rico-Páez; Sandra L. Castellanos-López; José R. Miranda-Tello; Grethell G. Pérez-Sánchez; Ernesto R. Vázquez-Cerón
Journal: Mobile Information Systems
 (2020)

---

## Abstract

Cell dwell time (DT) and unencumbered interruption time (IT) are fundamental time interval variables in the teletraffic analysis for the performance evaluation of mobile cellular networks. Although a diverse set of general distributions has been proposed to model these time interval variables, the effect of their moments higher than the expected value on system performance has not been reported in the literature. In this paper, sensitivity of teletraffic performance metrics of mobile cellular networks to the first three standardized moments of both DT and IT is investigated in a comprehensive manner. Mathematical analysis is developed considering that both DT and IT are phase-type distributed random variables. This work includes substantial numerical results for quantifying the dependence of system level performance metrics to the values of the first three standardized moments of both DT and IT. For instance, for a high mobility scenario where DT is modeled by a hyper-Erlang distribution, we found that call forced termination probability decreases around 60% as the coefficient of variation (CoV) and skewness of DT simultaneously change from 1 to 20 and from 60 to 2, respectively. Also, numerical results confirm that as link unreliability increases the forced termination probability increases while both new call blocking and handoff failure probabilities decrease. Numerical results also indicate that for low values of skewness, performance metrics are highly sensitive to changes in the CoV of either the IT or DT. In general, it is observed that system performance is more sensitive to the statistics of the IT than to those of the DT. Such understanding of teletraffic engineering issues is vital for planning, designing, dimensioning, and optimizing mobile cellular networks.


---

## Body

## 1. Introduction

Cell residence/dwell time (DT), unencumbered interruption time (IT), and unencumbered call-holding/service time (ST) are fundamental time interval variables for the mathematical analysis of cellular networks (CNs). These telecommunication time variables allow us to compute key parameters of CNs (i.e., channel holding time, new session blocking, unsuccessful handoff, forced session termination probabilities, handoff rate, and Erlang capacity, among others). For analytical/computational tractability of CNs, the exponential-negative probability distribution function (pdf) was traditionally employed for modeling DT, IT, and ST telecommunication time variables. Under this pdf, only the expected value of these telecommunications time variables is needed for system performance evaluation [1]. Nonetheless, experimental studies have shown that these considerations are not valid for real cellular networks [2–6]. Recently, it has been found that the global effect of cellular size/shape, mobility characteristics of users, link unreliability, handoff mechanisms, and behavior of new type of services can be best captured if these time variables are modeled as random variables (RVs) with general probability distribution functions (pdfs) [2–9]. In this sense, some researchers have employed the gamma, log-normal, Pareto, and Weibull pdfs to model cell residence time [10]. Correspondingly, it has being shown that the Weibull pdf represents a good model for both multimedia applications [11] and session holding time in hierarchical CNs [12]. It has been also shown that the log-normal pdf represents an excellent model for data session holding time in real networks. Nonetheless, the authors in [11, 12] noticed that the Laplace transform of gamma, log-normal, Pareto, and Weibull pdfs cannot be written into a rational form, and thus the Markovian properties of the teletraffic model are lost when these pdfs are employed [3, 5]. It is well known that Markovian properties are indispensable in producing tractable teletraffic models for CNs [2, 13]. To overcome this problem, phase-type pdfs were proposed in [2] for modeling telecommunication time variables. The relevance of phase-type pdfs is two-fold: they offer accurate models for the different telecommunication time variables in CNs and at the same time, the Markovian properties of the teletraffic model are preserved. Furthermore, there exists relevant research work related to fit phase-type pdfs to data collected in real networks (see, for instance, [5] and the references therein). In these research directions, the hyper-Erlang pdf [2, 9] is of distinctive interest due to its universality property (i.e., it can be employed to approximate with an arbitrary degree of precision the comportment of any nonnegative RV). Also, some important phase-type distributions (i.e., negative-exponential, Erlang, hyperexponential, and Coxian) are particular cases of the hyper-Erlang distribution. When experimental data (that represent certain telecommunication time variable) are best fitted with a general pdf, it is of paramount importance to comprehensively study the influence of moments higher than the expected value of this telecommunication time variable on the system performance [14]. This is the topic of research of the present work.There exist many procedures proposed in the literature regarding fitting known pdfs (such as phase-type ones) to data collected from real networks [5]. Nevertheless, this is not the focus of our present work; instead, we are concerned in studying the impact on system performance of moments higher than the first one when general phase-type pdfs are employed to model DT and IT variables. In a related work [14], several experiments were performed by means of a G/G/1 simulation model to investigate the impact of moments of interarrival and service time RVs on queue waiting time. In [14], the gamma, log-normal, Weibull, and Person type 5 pdfs were employed to model service and interarrival time interval variables. The general conclusion obtained in [14] is that pdfs that are completed characterized with two parameters (i.e., mean value and coefficient of variation) are not suitable for modeling these time variables. They notice that even though moments of lower order dominate system performance, it is needed to capture moments of higher order to improve accuracy of numerical results. Under this context, we have identified that a comprehensive study of the impact of moments higher than the mean value on performance of CNs has not been carried out in the literature. The reason of this can be explained as follows: (1) the use of pdfs different to the negative-exponential one to model telecommunication time variables has been just recently proposed and (2) the related research work has been mainly concentrated on developing mathematical paradigms rather than performing numerical evaluations to investigate system performance. Exception of this is our previous work [15, 16]. In [15], it is investigated the effect of DT and IT statistics on forced call-termination probability while in [16], it is investigated the effect of mean value, coefficient of variation, and skewness of both DT and IT on new call blocking probability, forced call termination probability, and carried traffic of CNs. Contrary to [15, 16], in this paper, the impact of DT and IT statistics on the expected value of channel holding time (for handed off and new sessions) is also comprehensively analyzed. Also, in our related research work [10, 17], the functional relationship between DT statistics and channel holding time statistics is investigated. Nonetheless, the effect of both link unreliability and DT statistics on the performance of CNs is not addressed in [10, 17].In this paper, using phase-type pdfs for modeling cell dwell time and unencumbered interruption time random variables, a comprehensive sensitivity study of performance of cellular networks to the first three standardized moments (i.e., mean value, coefficient of variation, and skewness) of both cell dwell time and unencumbered interruption time is carried out. In particular, in this work, hyper-Erlang and hyperexponential pdfs are employed to model cell dwell time and unencumbered interruption time. Even though the concepts presented in this work are essentially well known, the sensitivity analysis to moments higher than the first one is a novel contribution that gives interesting insights into the behavior of cellular networks. On the other hand, from the perspective of mathematical analysis, our contribution is to derive general expressions for several performance metrics (new call blocking probability, handoff failure probability, call forced termination probability, mean channel holding times, handoff rate, and carried traffic) as function of the first three standardized moments of cell dwell time and unencumbered interruption time in cellular networks. As explained in [18], blocking probability is still a useful performance metric in current cellular networks for real-time mobile applications (i.e., video streaming, mobile gaming, and video conferencing). The developed analysis in this paper can be extended for the performance evaluation of other cellular-based systems (i.e., green cellular networks (in [18], a robust and computationally efficient analytical approximation method is proposed to evaluate call blocking probability in green cellular networks considering different base station (BS) sleeping patterns; specifically, the Erlang fixed-point approximation technique is used to provide an accurate and computationally feasible analytical approximation to calculate call blocking probability in cellular networks with or without BS sleeping; contrary to this paper, in [18], both call service time and call sojourn (cell dwell) times are considered to be independent and exponentially distributed random variables) [18] and cognitive cellular networks [19]).The rest of this article is structured as follows. Methods are addressed in Section2, while the system model is described in Section 3. The queuing analysis for the performance evaluation of cellular networks is developed in Section 4. Also, expressions for forced session termination probability and mean channel holding time (for both new and handed off sessions) are obtained in Section 4. In Section 5, numerical results are presented and discussed. Finally, in Section 6, conclusions are exposed.


## 2. Methods

### 2.1. Analytical Method

In this paper, we followed the methods of [15, 16] to analyze sensitivity of DT and IT statistics on system performance of CNs. These methods are summarized as follows.Cell dwell time, unencumbered interruption time, and unencumbered service time are modeled as phase-type distributed random variables. Residual cell dwell time is derived using the excess life theorem [1] (it is shown that the pdf of this time variable is phase type when the cell dwell time is hyper-Erlang distributed).A multicellular system is considered. It is assumed that all cells in the service area are statistically identical; thus, the overall system performance can be analyzed by focusing on only one given cell. The servers represent the channels of the given cell, whereas the clients represent the mobile terminals. Each cell is modeled as a queuing system where new and handoff call arrivals correspond to service requests and the departures correspond to service termination due to either successful call termination, forced termination due to wireless link unreliability, or cell leaving. For this queuing system, the different transition rates and transitions rules are derived as functions of the different system parameters (new call arrival rate, hand-off call arrival rate, mean service time, mean inter-arrival time, and mean unencumbered interruption time, among others). Thus, the steady-state balance equations are obtained by equating rate out to rate in for each state of the system [20]. Finally, based on the steady-state balance equations, the different system performance metrics are derived; in particular, the handoff call rate is calculated using the fixed-point iteration method, as explained in [1].On the other hand, call forced termination probability is derived using the total probability theorem and applying the residue theorem as explained in [15, 16]. Also, the channel holding time for new and for handed off calls is derived using elemental probabilistic functions such as the minimum of a set of independent random variables.


### 2.2. Simulation Method

The analytical teletraffic model developed in Section4 is validated by a wide set of discrete-event computer simulation results for a variety of evaluation scenarios. To simulate a large cellular network in which the boundary effect is eliminated and each cell within the cellular-layout has exactly six neighboring cells, a wraparound hexagonal mesh (H-mesh) topology is used [13]. In this paper, a wrapped H-mesh topology with four cells per peripheral edge of the mesh is considered (i.e., the simulation model comprises 37 total cells) [13]. A macroscopic mobility model is used to capture user mobility. Under this mobility model, a user terminal stays in the coverage area of a base station for a period of time that has the selected phase-type distribution used to model DT (for ongoing calls) or RDT (for new call arrivals). It is assumed that a handed off terminal moves to any of the current cell’s neighbors with equal probability. The developed discrete event-driven computer simulator considers the following basic events: arrival of a new call requests, handoff attempts of ongoing call to a neighbor cell, transition of the stage of the DT (or RDT), successful call completion, and call termination due to either resource insufficiency or link unreliability. Every event is associated with an event-time stamp representing the instant when the event occurs [21]. All unprocessed events are inserted in an ordered list of future events. Events are processed in chronological order according to their event-time stamps. Once an event is executed, it is removed from the list of pending events and system statistics are collected. For obtaining good estimates of the different performance metrics, each simulation study was run for more than one million of new calls. Simulation results have shown perfect agreement with analytical results.


## 2.1. Analytical Method

In this paper, we followed the methods of [15, 16] to analyze sensitivity of DT and IT statistics on system performance of CNs. These methods are summarized as follows.Cell dwell time, unencumbered interruption time, and unencumbered service time are modeled as phase-type distributed random variables. Residual cell dwell time is derived using the excess life theorem [1] (it is shown that the pdf of this time variable is phase type when the cell dwell time is hyper-Erlang distributed).A multicellular system is considered. It is assumed that all cells in the service area are statistically identical; thus, the overall system performance can be analyzed by focusing on only one given cell. The servers represent the channels of the given cell, whereas the clients represent the mobile terminals. Each cell is modeled as a queuing system where new and handoff call arrivals correspond to service requests and the departures correspond to service termination due to either successful call termination, forced termination due to wireless link unreliability, or cell leaving. For this queuing system, the different transition rates and transitions rules are derived as functions of the different system parameters (new call arrival rate, hand-off call arrival rate, mean service time, mean inter-arrival time, and mean unencumbered interruption time, among others). Thus, the steady-state balance equations are obtained by equating rate out to rate in for each state of the system [20]. Finally, based on the steady-state balance equations, the different system performance metrics are derived; in particular, the handoff call rate is calculated using the fixed-point iteration method, as explained in [1].On the other hand, call forced termination probability is derived using the total probability theorem and applying the residue theorem as explained in [15, 16]. Also, the channel holding time for new and for handed off calls is derived using elemental probabilistic functions such as the minimum of a set of independent random variables.


## 2.2. Simulation Method

The analytical teletraffic model developed in Section4 is validated by a wide set of discrete-event computer simulation results for a variety of evaluation scenarios. To simulate a large cellular network in which the boundary effect is eliminated and each cell within the cellular-layout has exactly six neighboring cells, a wraparound hexagonal mesh (H-mesh) topology is used [13]. In this paper, a wrapped H-mesh topology with four cells per peripheral edge of the mesh is considered (i.e., the simulation model comprises 37 total cells) [13]. A macroscopic mobility model is used to capture user mobility. Under this mobility model, a user terminal stays in the coverage area of a base station for a period of time that has the selected phase-type distribution used to model DT (for ongoing calls) or RDT (for new call arrivals). It is assumed that a handed off terminal moves to any of the current cell’s neighbors with equal probability. The developed discrete event-driven computer simulator considers the following basic events: arrival of a new call requests, handoff attempts of ongoing call to a neighbor cell, transition of the stage of the DT (or RDT), successful call completion, and call termination due to either resource insufficiency or link unreliability. Every event is associated with an event-time stamp representing the instant when the event occurs [21]. All unprocessed events are inserted in an ordered list of future events. Events are processed in chronological order according to their event-time stamps. Once an event is executed, it is removed from the list of pending events and system statistics are collected. For obtaining good estimates of the different performance metrics, each simulation study was run for more than one million of new calls. Simulation results have shown perfect agreement with analytical results.


## 3. System Model

Next, the system model assumptions and definitions of the different time interval variables involved in the teletraffic analysis are presented. Notations and symbols employed in the rest of the paper are summarized in Table1.Table 1
Symbols and notation used throughout the paper.
Variable
Description
α
i
h
Probability of choosing the phasei (for i=1,2,…,mh) of the hyper-Erlang distribution of m(n) phases used to characterize the cell dwell time.
α
i
n
Probability of choosing the phasei (for i=1,2,…,mn) of the hyper-Erlang distribution of m(n) phases used to characterize the residual cell dwell time.
η
i
h
Inverse of the mean sojourn time in every stage of thei-th phase of the hyper-Erlang distribution used to characterize the cell dwell time.
η
i
n
Inverse of the mean sojourn time in every stage of thei-th phase of the hyper-Erlang distribution used to characterize the residual cell dwell time.
1/η
Mean value ofXdj.
λ
n (λh)
Mean arrival rate for new calls (handoff attempts).
1/μ
Mean value of unencumbered service time.
Σ
U
h
Total number of stages of the hyper-Erlang distribution used to characterize the cell dwell time.
Σ
U
n
Total number of stages of the hyper-Erlang distribution used to characterize the residual cell dwell time.
a
c
Carried traffic.
CDF
Cumulative distribution function.
DT
Cell dwell time.
CHTh
Channel holding time for handed off calls.
CHTn
Channel holding time for new calls.
f
X
r
t
Probability density function ofXr.
F
X
d
t
Cumulative probability distribution function (CDF) ofXd
K
=
K
n
,
K
h
State variables vector.
pdf
Probability density function.
N
Total number of reserved channels per cell for handoff prioritization.
P
h
Handoff failure probability.
P
n
New call blocking probability.
P
f
t
j
Forced call termination probability in cellj.
P
f
t
Global forced call termination probability.
RDT
Residual cell dwell time.
S
Total number of channels per cell in the system.
u
i
h
Number of stages of thei-th phase of the hyper-Erlang distribution used to characterize the cell dwell time.
u
i
n
Number of stages of thei-th phase of the hyper-Erlang distribution used to characterize the residual cell dwell time.
IT
Unencumbered interruption time.
x
c
j
Channel holding time in thej-th handed off cell (for j = 0, 1, …).
x
d
j
Cell dwell time in thej-th handed off cell (for j = 0, 1, …) irrespective of whether it is engaged in a call or not.
X
d
j
Random variables used to represent the cell dwell time.
x
i
j
Unencumbered call interruption time.
X
i
j
Random variables used to represent the unencumbered call interruption time.
x
r
Residual cell dwell time.
X
r
Random variable used to represent the residual cell dwell time.
x
s
Call holding time per call.
X
s
The random variable used to represent the call holding time.


### 3.1. Link Unreliability

Call forced termination probability is one of the most important quality of service (QoS) metrics for the performance evaluation of mobile communication networks (in packet switched mobile communication networks, call forced termination probability is especially important for the performance evaluation of real-time services (i.e., voice, audio, music, videophone, videoconference, etc.) [15, 22, 23]). In cellular networks, resource insufficiency and link unreliability are the two fundamental causes of call forced termination (link unreliability occurs when signal to interference ratio (SIR) is lower than a minimum required value for more than a certain time interval; for an ongoing call, the physical link between access point and user’s equipment may suffer link unreliability due to propagation impairments such as multipath fading, shadowing, path loss, and interference [7]). Nevertheless, in cellular networks in operation, handoff failure can be an insignificant event [24]. In contrast, link unreliability has been shown to be the main reason of call forced termination [24–26]. The model proposed in [7] to characterize the effect of link unreliability on the system level performance is employed in this work. In [7], the effect of link unreliability is captured by the so called “unencumbered call interruption time.” This time variable is defined in the next section.


### 3.2. Assumptions and Definitions

A homogeneous multicellular system with omnidirectional antennas and a fixed numberS of radio channels per cell is considered. Then, all cells are statistically identical (i.e., the underlying processes and parameters for all cells are the same). N channels in each cell are reserved to prioritize handoff call attempts over new call requests. Typical assumptions in the related literature [4] that both new call arrivals and handoff call attempts follow independent Poisson processes with arrival rate, respectively, λn and λh per cell, are here adopted. Some other relevant assumptions and definitions are specified below.Unencumbered service timexs (a.k.a. requested call holding time [5] or call holding duration [6]) is the amount of time that a call would remain in progress if it is not forced to terminate. In the literature, it has been widely accepted that the unencumbered service time for voice service is properly modeled by a random variable exponentially distributed [1]. The random variable used to represent the unencumbered service time is Xs, and it has mean value E{Xs} = 1/μ.On the other hand, cell dwell time or cell residence time xdj is the time that a user is within the coverage area of the j-th (for j = 0, 1, …) handed off cell irrespective of whether he has an ongoing call (or session) or not. Let Xdj (for j = 0, 1, …) be independent and identically distributed random variables used to represent these times. For homogeneous multicellular networks, this is a typical assumption in the literature [1, 4–6]. In this paper, the random variables Xdj (for j = 0, 1, …) are considered to be independent phase-type identically distributed with mean value 1/η.Moreover,residual cell dwell time xr is the time between the moment that a new call of a user is initiated in a given cell and the moment that the user leaves the cell. Note that residual cell dwell time is associated only to users with new calls. The random variable Xr is used to represent the residual cell dwell time. According to the excess life theorem [1], the probability density function (pdf) of the residual cell dwell time Xr, denoted by fXrt can be obtained in terms of the probability distribution of the cell dwell time Xd by(1)fXrt=1EXd1−FXdt.The mean and cumulative probability distribution function (CDF) of the cell dwell timeXd are given by EXd and FXdt, respectively.Besides,unencumbered call interruption time xij is the amount of time from the moment a user begins to be served by the base station of the j-th handed off cell (for j = 0, 1, 2, …) to the moment his call would be dropped due to link unreliability if both the unencumbered service time and cell dwell time were large enough [7]. The random variables Xij (for j = 0, 1, 2, …) are used to represent the unencumbered call interruption times, and they are assumed to be independent and phase-type distributed [7].Lastly,channel holding time xcj is the amount of time a user with an ongoing call occupies a radio channel in the j-th (for j = 0, 1, …) handed off cell before his call is either successfully completed, successfully handed off to another cell, or interrupted due to either wireless channel unreliability or handoff failure.The general architecture of the considered multicellular communication network is shown in Figure1. Figure 1 also illustrates the relationship among the different time variables defined in this section.Figure 1
General architecture of the system and time variables involved in the teletraffic analysis: (a) scenario of a successfully terminated call; (b) scenario of a forced call termination due to link unreliability.
(a)
(b)


### 3.3. Teletraffic Model

Teletraffic analysis in Section4 is developed by following the approach proposed in [8, 9] to capture the general distributions of both DT and IT.For the sake of space and to facilitate the understanding of the mathematical analysis, the teletraffic analyses developed in Section4 consider the next case: (1) DT is hyper-Erlang distributed and IT is exponentially distributed. Nonetheless, teletraffic analyses are also developed considering the following cases: (2) DT is hyperexponentially distributed and IT is hyperexponentially distributed and (3) DT is exponentially distributed and IT is hyper-Erlang distributed. Notice that the evaluation scenario when DT is exponentially distributed and IT is hyperexponentially distributed represents a subcase of both the case (2) and case (3). Furthermore, the evaluation scenario when DT is hyperexponentially distributed and IT is exponentially distributed is a subcase of both the case (1) and case (2). Evidently, the evaluation scenario when both DT and IT are exponentially distributed is obtained from any of the previous cases. Nonetheless, to simplify interpretation of the numerical results and to evaluate the effect of each time variable (i.e., DT and IT) on the system performance, only some evaluation scenarios are considered. In particular, numerical results for the evaluation scenarios, (a) DT is exponentially distributed and IT is either hyperexponentially distributed or hyper-Erlang distributed and (b) DT is either hyperexponentially distributed or hyper-Erlang distributed and IT is exponentially distributed, are shown and analyzed.


### 3.4. Residual Cell Dwell Time Characterization

Due to the fact that DT is considered to be hyper-Erlang distributed, it is necessary to derive the distribution of theresidual cell dwell time (RDT). This is obtained in this section.Assume DT follows anm(h)-th order hyper-Erlang distribution with shape and rate parameters uih and ηih (for i = 1, 2, …, m(h)). The rate parameters ηih are related to the inverse of the mean DT (η) as follows: ηih=ηuih [2]. Considering that αih represents the probability of choosing the phase i of the hyper-Erlang distribution (for i=1,2,…,mh), the pdf of Xd can be expressed as(2)fXdt=∑i=1mhαihηihuihtuih−1uih−1!e−ηiht;ηih>0,t≥0,0≤αih≤1,∑i=1mhαih=1,where uih is a positive integer and ηih is a positive constant. Note that the hyper-Erlang distribution is a mixture of m(h) different Erlang distributions, and each of them has a shape parameter uih and a rate parameter ηih. The value αih represents the weight of each Erlang distribution. Using (1), the pdf of RDT is given by(3)fXrt=1∑i=1mhαihuih/ηih∑i=1mh∑j=0uih−1αjhηihtjj!e−ηiht.This pdf can be rewritten as(4)fXrt=∑i=1mnαinηinuintuin−1uin−1!e−ηint,where(5)α∑x=1i−1uxh+jn=αih∏l=1∩l≠imhηlh∑k=1mhαkhukh∏l=1∩l≠kmhηlh,u∑x=1i−1uxh+jn=j,η∑x=1i−1uxh+jn=ηih,mn=∑i=1mhuih,for i=1,2,…,mh,j=1,2,…,uih.From (4), it is noticed that RDT has an m(n)-th order hyper-Erlang distribution with shape and rate parameters, respectively, uin and ηin (for i = 1, 2, …, m(n)). The probability of choosing the phase i of the hyper-Erlang distribution is represented by αin (for i = 1, 2, …, m(n)). The diagrams of phases of the hyper-Erlang distributed random variables Xd and Xr are shown in Figure 2. In Figure 2, when y = n, it represents the diagram for Xr, while when y = h, it represents the diagram for Xd.Figure 2
General phase and stage diagram for the probability distribution function of residual cell residence time (y = n) and cell residence time (y = h).


## 3.1. Link Unreliability

Call forced termination probability is one of the most important quality of service (QoS) metrics for the performance evaluation of mobile communication networks (in packet switched mobile communication networks, call forced termination probability is especially important for the performance evaluation of real-time services (i.e., voice, audio, music, videophone, videoconference, etc.) [15, 22, 23]). In cellular networks, resource insufficiency and link unreliability are the two fundamental causes of call forced termination (link unreliability occurs when signal to interference ratio (SIR) is lower than a minimum required value for more than a certain time interval; for an ongoing call, the physical link between access point and user’s equipment may suffer link unreliability due to propagation impairments such as multipath fading, shadowing, path loss, and interference [7]). Nevertheless, in cellular networks in operation, handoff failure can be an insignificant event [24]. In contrast, link unreliability has been shown to be the main reason of call forced termination [24–26]. The model proposed in [7] to characterize the effect of link unreliability on the system level performance is employed in this work. In [7], the effect of link unreliability is captured by the so called “unencumbered call interruption time.” This time variable is defined in the next section.


## 3.2. Assumptions and Definitions

A homogeneous multicellular system with omnidirectional antennas and a fixed numberS of radio channels per cell is considered. Then, all cells are statistically identical (i.e., the underlying processes and parameters for all cells are the same). N channels in each cell are reserved to prioritize handoff call attempts over new call requests. Typical assumptions in the related literature [4] that both new call arrivals and handoff call attempts follow independent Poisson processes with arrival rate, respectively, λn and λh per cell, are here adopted. Some other relevant assumptions and definitions are specified below.Unencumbered service timexs (a.k.a. requested call holding time [5] or call holding duration [6]) is the amount of time that a call would remain in progress if it is not forced to terminate. In the literature, it has been widely accepted that the unencumbered service time for voice service is properly modeled by a random variable exponentially distributed [1]. The random variable used to represent the unencumbered service time is Xs, and it has mean value E{Xs} = 1/μ.On the other hand, cell dwell time or cell residence time xdj is the time that a user is within the coverage area of the j-th (for j = 0, 1, …) handed off cell irrespective of whether he has an ongoing call (or session) or not. Let Xdj (for j = 0, 1, …) be independent and identically distributed random variables used to represent these times. For homogeneous multicellular networks, this is a typical assumption in the literature [1, 4–6]. In this paper, the random variables Xdj (for j = 0, 1, …) are considered to be independent phase-type identically distributed with mean value 1/η.Moreover,residual cell dwell time xr is the time between the moment that a new call of a user is initiated in a given cell and the moment that the user leaves the cell. Note that residual cell dwell time is associated only to users with new calls. The random variable Xr is used to represent the residual cell dwell time. According to the excess life theorem [1], the probability density function (pdf) of the residual cell dwell time Xr, denoted by fXrt can be obtained in terms of the probability distribution of the cell dwell time Xd by(1)fXrt=1EXd1−FXdt.The mean and cumulative probability distribution function (CDF) of the cell dwell timeXd are given by EXd and FXdt, respectively.Besides,unencumbered call interruption time xij is the amount of time from the moment a user begins to be served by the base station of the j-th handed off cell (for j = 0, 1, 2, …) to the moment his call would be dropped due to link unreliability if both the unencumbered service time and cell dwell time were large enough [7]. The random variables Xij (for j = 0, 1, 2, …) are used to represent the unencumbered call interruption times, and they are assumed to be independent and phase-type distributed [7].Lastly,channel holding time xcj is the amount of time a user with an ongoing call occupies a radio channel in the j-th (for j = 0, 1, …) handed off cell before his call is either successfully completed, successfully handed off to another cell, or interrupted due to either wireless channel unreliability or handoff failure.The general architecture of the considered multicellular communication network is shown in Figure1. Figure 1 also illustrates the relationship among the different time variables defined in this section.Figure 1
General architecture of the system and time variables involved in the teletraffic analysis: (a) scenario of a successfully terminated call; (b) scenario of a forced call termination due to link unreliability.
(a)
(b)


## 3.3. Teletraffic Model

Teletraffic analysis in Section4 is developed by following the approach proposed in [8, 9] to capture the general distributions of both DT and IT.For the sake of space and to facilitate the understanding of the mathematical analysis, the teletraffic analyses developed in Section4 consider the next case: (1) DT is hyper-Erlang distributed and IT is exponentially distributed. Nonetheless, teletraffic analyses are also developed considering the following cases: (2) DT is hyperexponentially distributed and IT is hyperexponentially distributed and (3) DT is exponentially distributed and IT is hyper-Erlang distributed. Notice that the evaluation scenario when DT is exponentially distributed and IT is hyperexponentially distributed represents a subcase of both the case (2) and case (3). Furthermore, the evaluation scenario when DT is hyperexponentially distributed and IT is exponentially distributed is a subcase of both the case (1) and case (2). Evidently, the evaluation scenario when both DT and IT are exponentially distributed is obtained from any of the previous cases. Nonetheless, to simplify interpretation of the numerical results and to evaluate the effect of each time variable (i.e., DT and IT) on the system performance, only some evaluation scenarios are considered. In particular, numerical results for the evaluation scenarios, (a) DT is exponentially distributed and IT is either hyperexponentially distributed or hyper-Erlang distributed and (b) DT is either hyperexponentially distributed or hyper-Erlang distributed and IT is exponentially distributed, are shown and analyzed.


## 3.4. Residual Cell Dwell Time Characterization

Due to the fact that DT is considered to be hyper-Erlang distributed, it is necessary to derive the distribution of theresidual cell dwell time (RDT). This is obtained in this section.Assume DT follows anm(h)-th order hyper-Erlang distribution with shape and rate parameters uih and ηih (for i = 1, 2, …, m(h)). The rate parameters ηih are related to the inverse of the mean DT (η) as follows: ηih=ηuih [2]. Considering that αih represents the probability of choosing the phase i of the hyper-Erlang distribution (for i=1,2,…,mh), the pdf of Xd can be expressed as(2)fXdt=∑i=1mhαihηihuihtuih−1uih−1!e−ηiht;ηih>0,t≥0,0≤αih≤1,∑i=1mhαih=1,where uih is a positive integer and ηih is a positive constant. Note that the hyper-Erlang distribution is a mixture of m(h) different Erlang distributions, and each of them has a shape parameter uih and a rate parameter ηih. The value αih represents the weight of each Erlang distribution. Using (1), the pdf of RDT is given by(3)fXrt=1∑i=1mhαihuih/ηih∑i=1mh∑j=0uih−1αjhηihtjj!e−ηiht.This pdf can be rewritten as(4)fXrt=∑i=1mnαinηinuintuin−1uin−1!e−ηint,where(5)α∑x=1i−1uxh+jn=αih∏l=1∩l≠imhηlh∑k=1mhαkhukh∏l=1∩l≠kmhηlh,u∑x=1i−1uxh+jn=j,η∑x=1i−1uxh+jn=ηih,mn=∑i=1mhuih,for i=1,2,…,mh,j=1,2,…,uih.From (4), it is noticed that RDT has an m(n)-th order hyper-Erlang distribution with shape and rate parameters, respectively, uin and ηin (for i = 1, 2, …, m(n)). The probability of choosing the phase i of the hyper-Erlang distribution is represented by αin (for i = 1, 2, …, m(n)). The diagrams of phases of the hyper-Erlang distributed random variables Xd and Xr are shown in Figure 2. In Figure 2, when y = n, it represents the diagram for Xr, while when y = h, it represents the diagram for Xd.Figure 2
General phase and stage diagram for the probability distribution function of residual cell residence time (y = n) and cell residence time (y = h).


## 4. Teletraffic Analysis

In this section, the teletraffic analysis for the system-level performance evaluation of the multicellular cellular network described in Section3 is presented. From the mathematical analysis point of view, our merit is to derive general expressions for a number of performance metrics as function of the first three standardized moments of DT and IT in mobile cellular networks. This in turn has allowed us to investigate in detail the sensitivity of system performance to statistics of both DT and IT. In this way, we found rather important insights into the behavior of mobile cellular networks not previously reported in the literature.As stated in Section3.3 and without loss of generality, in this section, the special case when IT is exponential distributed and DT is hyper-Erlang distributed is considered. The mean value of IT is denoted by 1/γ. A total number of ∑x=1mnuxn+∑x=1mhuxh state variables are needed to model this system by means of a multidimensional birth and death process. Let us define k∑x=1i−1uxy+jy as the number of users in stage i and phase j of residual cell dwell time (y = n) and cell dwell time (y = h).To simplify mathematical notation, the following vectors and parameters are defined. VectorK(y) is defined as follows:(6)Ky=k1y,k2y,…,k∑i=1myuiyy.Note thaty = n or y = h when new calls or handoff calls are involved, respectively. Let eiy be a unit vector of size m(y) whose all entries are 0 except i-th entry which is 1 (for i=1,2,…,∑i=1myuiy) . Finally, the parameters N(n) and N(h) are defined as follows: N(n) = N and N(h) = 0.VectorK=Kn,Kh represents the state of the analyzed cell. Table 2 shows the transition rates from the current reference state to the different successor states and the transition rules. As stated before, we assume that all the cells are probabilistically equivalent. That is, the new call arrival rate is the same in each cell, and the rate at which mobiles enter a given cell is equal to the rate at which they interrupt its connection (due to either a handed off call event or link unreliability) in that cell. Thus, equating rate out to rate in for each state, the steady-state balance equations are given by [20](7)PK=gan+gbn+gcn+gdn+gah+gbh+gch+gdh∑i=1mnainK+∑i=1mn∑j=1uin−1bu^xnnK+∑i=1mncinK+∑i=1mn∑j=1uin−1du^xnnK+∑i=1mh∑j=1uih−1bu^xhhK+∑i=1mhaihK+∑i=1mhcihK+∑i=1mh∑j=1uih−1du^xhhK,where(8)u^xn=∑x=1i−1uxn−1+j,u^xh=∑x=1i−1uxh−1+j.Table 2
Transition rates and transition rules for the case when the DT is hyper-Erlang distributed and IT is negative exponentially distributed.
Event
Successor state
Rate
A new call enters first stage of phasei of Xr (i = 1, 2, ..., m(n))
K
n
+
e
∑
x
=
1
i
−
1
u
x
n
+
1
n
,
K
h
a
i
n
K
n
,
K
h
A new call leaves stagej of phase i and enters stage j + 1 of phase i of Xr (i = 1, 2,..,m(n)), (j=1,…uin−1)
K
n
−
e
∑
x
=
1
i
−
1
u
x
n
+
j
n
+
e
∑
x
=
1
i
−
1
u
x
n
+
j
+
1
n
,
K
h
b
∑
x
=
1
i
−
1
u
x
n
−
1
+
j
n
K
n
,
K
h
A new call leaves last stage of phasei of Xr (i = 1, 2, ..., m(n))
K
n
−
e
∑
x
=
1
i
u
x
n
n
,
K
h
c
i
n
K
n
,
K
h
A new call leaves stage of phasei of Xr (i = 1, 2, ..., m(n))
K
n
−
e
∑
x
=
1
i
u
x
n
+
j
n
,
K
h
d
∑
x
=
1
i
−
1
u
x
n
−
1
+
j
n
K
n
,
K
h
A handed off call enters first stage of phasei of Xd (i = 1, 2, ..., m(h))
K
n
,
K
h
+
e
∑
x
=
1
i
−
1
u
x
h
+
1
h
a
i
h
K
n
,
K
h
A handed off call leaves stagej of phase i and enters stage j + 1 of phase i of Xd (i = 1, 2, ..., m(h)) (j=1,…,uih−1)
K
n
,
K
h
−
e
∑
x
=
1
i
−
1
u
x
h
+
j
h
+
e
∑
x
=
1
i
−
1
u
x
h
+
j
+
1
h
b
∑
x
=
1
i
−
1
u
x
h
−
1
+
j
h
K
n
,
K
h
A handed off call leaves last stage of phasei of Xd (i = 1, 2, ..., m(h))
K
n
,
K
h
−
e
∑
x
=
1
i
u
x
h
h
c
i
h
K
n
,
K
h
A handed off call leaves stage of phasei of Xd (i = 1, 2, ..., m(n))
K
n
,
K
h
−
e
∑
x
=
1
i
u
x
h
+
j
h
d
∑
x
=
1
i
−
1
u
x
h
−
1
+
j
h
K
n
,
K
hThe conditional incoming state transition rate from the statesKn−e∑x=1i−1uxn+1n,Kh (for i = 1, ..., m(n)) to the reference state K, due to arrival of new call requests, is given by(9)gan=∑i=1mnainKn−e∑x=1i−1uxn+1n,KhPKn−e∑x=1i−1uxn+1n,Kh.The conditional incoming state transition rate from the statesKn+e∑x=1i−1uxn+jn−e∑x=1i−1uxn+j+1n,Kh (for i = 1, ..., m(n) and j=1,…uin−1) to the reference state K, due to the interstage transitions in every phase of the hyper-Erlang distribution used to characterize the residual cell dwell time, is given by(10)gbn=∑i=1mn∑j=1uin−1b∑x=1i−1uxn−1+jnKn+e∑x=1i−1uxn−1+jn−e∑x=1i−1uxn+j+1n,KhPKn+e∑x=1i−1uxn+jn−e∑x=1i−1uxn+j+1n,Kh.The conditional incoming state transition rate from the statesKn+e∑x=1iuxnn,Kh (for i = 1, ..., m(n)) to the reference state K, due to channel release because of either call completion, call interruption due to link unreliability, or cell leaving, is given by(11)gcn=∑i=1mncinKn+e∑x=1iuxnn,KhPKn+e∑x=1iuxnn,Kh.The conditional incoming state transition rate from the statesKn+e∑x=1i−1uxn+jn,Kh (for i = 1, ..., m(n) and j=1,…,uin−1) to the reference state K, due to channel release because of either call completion or call interruption due to link unreliability, is given by(12)gdn=∑i=1mn∑j=1uin−1d∑x=1i−1uxn−1+jnKn+e∑x=1i−1uxn+jn,KhPKn+e∑x=1i−1uxn+jn,Kh.The conditional incoming state transition rate from the statesKn,Kh−e∑x=1i−1uxh+1h (for i = 1, ..., m(h)) to the reference state K, due to arrival of handoff call attempts, is given by(13)gah=∑i=1mhaihKn,Kh−e∑x=1i−1uxh+1hPKn,Kh−e∑x=1i−1uxh+1h.The conditional incoming state transition rate from the statesKn,Kh+e∑x=1i−1uxh+jh−e∑x=1i−1uxh+j+1h (for i = 1, ..., m(h) and j=1,…,uih−1) to the reference state K, due to the interstage transitions in every phase of the hyper-Erlang distribution used to characterize the cell dwell time, is given by(14)gbh=∑i=1mh∑j=1uih−1b∑x=1i−1uxh−1+jhKn,Kh+e∑x=1i−1uxh+jh−e∑x=1i−1uxh+j+1hPKn,Kh+e∑x=1i−1uxh+jh−e∑x=1i−1uxh+j+1h.The conditional incoming state transition rate from the statesKn,Kh+e∑x=1i−1uxhh (for i = 1, ..., m(h)) to the reference state K, due to channel release because of either call completion, call interruption due to link unreliability, or cell leaving, is given by(15)gch=∑i=1mhcihKn,Kh+e∑x=1iuxhhPKn,Kh+e∑x=1iuxhh.The conditional incoming state transition rate from the statesKn,Kh+e∑x=1i−1uxh+jh (for i = 1, ..., m(h) and j=1,…,uih−1) to the reference state K, due to channel release because of either call completion or call interruption due to link unreliability, is given by(16)gdh=∑i=1mh∑j=1uih−1d∑x=1i−1uxh−1+jhKn,Kh+e∑x=1i−1uxh+jhPKn,Kh+e∑x=1i−1uxh+jh.The state transition ratesain and cin (i = 1, ..., m(n)), aih and cih (i = 1, ..., m(h)), b∑x=1i−1uxn−1+jn and d∑x=1i−1uxn−1+jn (for i = 1, ..., m(n) and j=1,…,uin−1), and b∑x=1i−1uxh−1+jh and d∑x=1i−1uxh−1+jh (for i = 1, ..., m(h) and j=1,…,uih−1) are detailed below.Of course, the state probabilities must satisfy the normalization equation given by(17)∑k1n=0S−N⋯∑kΣUnn=0S−N∑k1h=0S⋯∑kΣUhh=0SPK=1KK∈Ω,where ΣUn=∑x=1mnuxn and ΣUh=∑x=1mhuxh are, respectively, the total number of stages of the hyper-Erlang distributions used to characterize the residual cell dwell time and the cell dwell time and Ω is the valid states space given by(18)Ω=K∑i=1ΣUnkin+∑i=1ΣUhkih≤S∩∑i=1ΣUnkin≤S−N.All states involved in (7) and (17) must be valid states. The corresponding steady-state probabilities are calculated by means of the well-known Gauss–Seidel relaxation method [20].It is straightforward to show that the transition rates defined in Table2 can be mathematically expressed as follows (notice that y = n when new calls are involved and y = h when handed off calls are involved). The state transition rate from the reference state K to the state Kn+e∑x=1i−1uxn+1n,Kh (or Kn,Kh+e∑x=1i−1uxh+1h) (for i = 1, ..., m(y)), due to arrival of new (or handoff) call requests in the i-th phase of the hyper-Erlang distribution used to characterize the residual cell dwell time (or cell dwell time), is given by(19)aiyK=αiyλy;∑l=1∑x=1mnuxnkln+∑l=1∑x=1mhuxhklh<S−Ny∩k∑x=1i−1uxy+1y≥0,0;otherwise.The state transition rate from the reference stateK to the state Kn−e∑x=1i−1uxn+jn+e∑x=1i−1uxn+j+1n,Kh (or Kn,Kh−e∑x=1i−1uxh+jh+e∑x=1i−1uxh+j+1h) (for i = 1, ..., m(y) and j = 1, ..., ui(y)-1), due to the transition from the stage j to the stage j+1 of the i-th phase of the hyper-Erlang distribution used to characterize the residual cell dwell time (or cell dwell time), is given by(20)b∑x=1i−1uxy−1+jyK=k∑x=1i−1uxy+jyηiy;∑l=1∑x=1mnuxnkln+∑l=1∑x=1mhuxhklh≤S∩k∑x=1i−1uxy+jy>0∩k∑x=1i−1uxy+j+1y≥0,0;otherwise.The state transition rate from the reference stateK to the state Kn−e∑x=1iuxnn,Kh (or Kn−e∑x=1iuxhh,Kh (for i = 1, ..., m(y)), due to channel release because of either call completion, call interruption due to link unreliability, or cell leaving with the i-th phase of the hyper-Erlang distribution used to characterize the residual cell dwell time (or cell dwell time), is given by(21)ciyK=k∑x=1iuxyyμ+ηiy+γ;∑l=1∑x=1mnuxnkln+∑l=1∑x=1mhuxhklh≤S∩k∑x=1iuxyy>0,0;otherwise.The transition rate from the reference stateK to the state Kn−e∑x=1iuxn+jn,Kh (or Kn,Kh−e∑x=1iuxh+jh) (for i = 1, ..., m(y) and j=1,…,uiy−1), due to channel release because of either call completion or call interruption due to link unreliability when the user is in the j-th stage of the i-th phase of the hyper-Erlang distribution used to characterize the residual cell dwell time (or cell dwell time), is given by(22)d∑x=1i−1uxy−1+jyK=k∑x=1i−1uxy+jyμ+γ;∑l=1∑x=1mnuxnkln+∑l=1∑x=1mhuxhklh≤S∩k∑x=1i−1uxy+jy>0∩k∑x=1i−1uxy+j+1y≥0,0;otherwise.New call blocking probability,Pn, is the sum of the probabilities of states that cannot accommodate more new arrival requests, and handoff failure probability, Ph, is the sum of the probabilities of states that cannot accommodate more handed off call requests. These probabilities can be computed using(23)Py=∑k1n=0S−Ny⋯∑kΣUnn=0S−Ny∑k1h=0S⋯∑kΣUhh=0SPK;fory=n,h,KS−Ny≤∑i=1ΣUnkin+∑i=1ΣUhkih≤S.Carried traffic (ac) is given by(24)ac=∑k1n=0S−Ny⋯∑kΣUnn=0S−Ny∑k1h=0S⋯∑kΣUhh=0S∑l=1ΣUnkln+∑l=1ΣUhklhPK,K∑i=1ΣUnkin+∑i=1ΣUhkih≤S.The handoff call rate is calculated using the fixed point iteration method, as explained in [1]. Call forced termination probability and channel holding time are derived in Sections 4.1 and 4.2, respectively.


### 4.1. Forced Termination Probability

Call forced termination may result due to either wireless link unreliability or handoff failure (resource insufficiency). In general, a dropped call experiencesj (j = 0, 1, 2, …) successful handoffs previously to be interrupted (due to either a handoff failure or link unreliability). Thus, call forced termination probability after j successful handoffs is given by(25)Pftj=PXr≤minXs,Xr+PXr≤minXs,XiPh;j=0,PXr≤minXs,Xi1−Ph×PXi≤minXs,Xd+PXd≤minXs,XiPh;j=1,PXr≤minXs,XrPXd≤minXs,Xij−11−Phj×PXi≤minXs,Xd+PXd≤minXs,Xi;j<1,where PXi≤minXs,Xr and PXi≤minXs,Xd represent interruption probabilities due to link unreliability for new and handed off calls, respectively. Function min⋅,⋅ returns the smallest random variable.Call forced termination occurs after a random number of successful handoffs. Then, by employing the total probability theorem, call forced termination probability can be expressed as follows:(26)Pft=∑j=0∞Pftj=PXi≤minXs,Xr+PXr≤minXs,XiPh+PXr≤minXs,Xi1−PhPXi≤minXs,Xd+PXd≤minXs,XiPh1−PXd≤minXs,Xi1−Ph.By lettingZsw=minXs,Xw with w = {r, i, d} and using the residue theorem, the different probabilities in (26) can be calculated by using the following relationship for the nonnegative independent random variables Xw and Zsw (see [3]):(27)PXw≤Zsw=12πi∫σ−i∞σ+i∞fXw∗ssfZsw∗−sds=−∑p∈σPRess=pfX∗ssfZsw∗−s,where fXw∗s and fZsw∗s represent the Laplace transform of Xw and Zsw, respectively, with w = {r, i, d}. σP is the set of poles of fZsw∗−s. Equation (27) is valid when the probability density functions of Xw and Zsw are proper rational functions [3]. For the different considered evaluation scenarios in this paper, the probability density functions of Xw and Zsw are proper rational functions.


### 4.2. Channel Holding Time

In order to model channel holding time, it is necessary to express it as a function of the unencumbered service, cell dwell, and unencumbered call interruption time variables. The random variableXcj, which models channel holding time in the j-th handed off cell, is defined as follows:(28)Xcj=minXij,Xs,Xr;j=0,minXij,Xs,Xdj;j>0.Thus, channel holding time should be defined for the following type of calls: new calls [j = 0 in (28)] and handed off calls [j > 0 in (28)]. Let us denote by Xcn and Xch the channel holding time for new calls and handed off calls, respectively.Assuming that the different involved time variables are independent, the cumulative distribution function (CDF) of the channel holding time for new and handed off calls is, respectively, given by(29)FXcnt=1−1−FXit1−FXst1−FXrt;FXcht=1−1−FXit1−FXst1−FXdt.Table3 provides the CDF of channel holding time for new and handed off calls for the cases when both DT and IT are negative-exponential, hyperexponential, or hyper-Erlang distributed. Notice that all the cases considered in this paper are special cases of the third entry of Table 3 (that is, when both DT and IT are modeled by a hyper-Erlang distribution). In [17], we perform a comprehensive study on the functional relationship between cell dwell time and channel holding time statistics. Nonetheless, the impact of the wireless channel unreliability is ignored in [17]. Finally, given the mathematical expressions for the CDF of channel holding time for new and handed off calls, it is straightforward to obtain the mean value of these time variables.Table 3
Examples of corresponding distributions forxcn and xch.
Cell dwell/unencumbered call interruption time probability density
pdf of channel holding time for new and handed off calls
Both DT and IT are negative exponential distributed:fXdt=ηe−ηtfXit=γe−γt
F
X
c
n
t
=
1
−
e
−
μ
+
η
+
γ
t
F
X
c
h
t
=
1
−
e
−
μ
+
η
+
γ
t
Both DT and IT are hyperexponentially distributed:fXdt=∑k=1mαkηke−ηktfXit=∑l=1nβlγle−γlt
F
X
c
n
t
=
1
−
1
/
∑
k
=
1
m
α
k
/
η
k
∑
k
=
1
m
∑
l
=
1
n
α
k
/
η
k
β
l
e
−
μ
+
η
k
+
γ
l
t
F
X
c
h
t
=
1
−
∑
k
=
1
m
∑
l
=
1
n
α
k
β
l
e
−
μ
+
η
k
+
γ
l
t
Both DT and IT are hyper-Erlang distributed:fXdt=∑k=1mαkηkuktuk−1/uk−1!e−ηktfXit=∑l=1nβlγlvltvl−1/vl−1!e−γlt
F
X
c
n
t
=
1
−
1
/
∑
k
=
1
m
α
k
u
k
/
η
k
∑
k
=
1
m
∑
l
=
1
n
∑
i
=
0
u
k
−
1
∑
j
=
0
v
l
−
1
∑
q
=
0
i
α
k
/
η
k
β
l
η
k
t
q
/
q
!
γ
l
t
j
/
j
!
e
−
μ
+
η
k
+
γ
l
t
F
X
c
n
t
=
1
−
∑
k
=
1
m
∑
l
=
1
n
∑
i
=
0
u
k
−
1
∑
j
=
0
v
l
−
1
α
k
β
l
η
k
t
q
/
i
!
γ
l
t
j
/
j
!
e
−
μ
+
η
k
+
γ
l
t


## 4.1. Forced Termination Probability

Call forced termination may result due to either wireless link unreliability or handoff failure (resource insufficiency). In general, a dropped call experiencesj (j = 0, 1, 2, …) successful handoffs previously to be interrupted (due to either a handoff failure or link unreliability). Thus, call forced termination probability after j successful handoffs is given by(25)Pftj=PXr≤minXs,Xr+PXr≤minXs,XiPh;j=0,PXr≤minXs,Xi1−Ph×PXi≤minXs,Xd+PXd≤minXs,XiPh;j=1,PXr≤minXs,XrPXd≤minXs,Xij−11−Phj×PXi≤minXs,Xd+PXd≤minXs,Xi;j<1,where PXi≤minXs,Xr and PXi≤minXs,Xd represent interruption probabilities due to link unreliability for new and handed off calls, respectively. Function min⋅,⋅ returns the smallest random variable.Call forced termination occurs after a random number of successful handoffs. Then, by employing the total probability theorem, call forced termination probability can be expressed as follows:(26)Pft=∑j=0∞Pftj=PXi≤minXs,Xr+PXr≤minXs,XiPh+PXr≤minXs,Xi1−PhPXi≤minXs,Xd+PXd≤minXs,XiPh1−PXd≤minXs,Xi1−Ph.By lettingZsw=minXs,Xw with w = {r, i, d} and using the residue theorem, the different probabilities in (26) can be calculated by using the following relationship for the nonnegative independent random variables Xw and Zsw (see [3]):(27)PXw≤Zsw=12πi∫σ−i∞σ+i∞fXw∗ssfZsw∗−sds=−∑p∈σPRess=pfX∗ssfZsw∗−s,where fXw∗s and fZsw∗s represent the Laplace transform of Xw and Zsw, respectively, with w = {r, i, d}. σP is the set of poles of fZsw∗−s. Equation (27) is valid when the probability density functions of Xw and Zsw are proper rational functions [3]. For the different considered evaluation scenarios in this paper, the probability density functions of Xw and Zsw are proper rational functions.


## 4.2. Channel Holding Time

In order to model channel holding time, it is necessary to express it as a function of the unencumbered service, cell dwell, and unencumbered call interruption time variables. The random variableXcj, which models channel holding time in the j-th handed off cell, is defined as follows:(28)Xcj=minXij,Xs,Xr;j=0,minXij,Xs,Xdj;j>0.Thus, channel holding time should be defined for the following type of calls: new calls [j = 0 in (28)] and handed off calls [j > 0 in (28)]. Let us denote by Xcn and Xch the channel holding time for new calls and handed off calls, respectively.Assuming that the different involved time variables are independent, the cumulative distribution function (CDF) of the channel holding time for new and handed off calls is, respectively, given by(29)FXcnt=1−1−FXit1−FXst1−FXrt;FXcht=1−1−FXit1−FXst1−FXdt.Table3 provides the CDF of channel holding time for new and handed off calls for the cases when both DT and IT are negative-exponential, hyperexponential, or hyper-Erlang distributed. Notice that all the cases considered in this paper are special cases of the third entry of Table 3 (that is, when both DT and IT are modeled by a hyper-Erlang distribution). In [17], we perform a comprehensive study on the functional relationship between cell dwell time and channel holding time statistics. Nonetheless, the impact of the wireless channel unreliability is ignored in [17]. Finally, given the mathematical expressions for the CDF of channel holding time for new and handed off calls, it is straightforward to obtain the mean value of these time variables.Table 3
Examples of corresponding distributions forxcn and xch.
Cell dwell/unencumbered call interruption time probability density
pdf of channel holding time for new and handed off calls
Both DT and IT are negative exponential distributed:fXdt=ηe−ηtfXit=γe−γt
F
X
c
n
t
=
1
−
e
−
μ
+
η
+
γ
t
F
X
c
h
t
=
1
−
e
−
μ
+
η
+
γ
t
Both DT and IT are hyperexponentially distributed:fXdt=∑k=1mαkηke−ηktfXit=∑l=1nβlγle−γlt
F
X
c
n
t
=
1
−
1
/
∑
k
=
1
m
α
k
/
η
k
∑
k
=
1
m
∑
l
=
1
n
α
k
/
η
k
β
l
e
−
μ
+
η
k
+
γ
l
t
F
X
c
h
t
=
1
−
∑
k
=
1
m
∑
l
=
1
n
α
k
β
l
e
−
μ
+
η
k
+
γ
l
t
Both DT and IT are hyper-Erlang distributed:fXdt=∑k=1mαkηkuktuk−1/uk−1!e−ηktfXit=∑l=1nβlγlvltvl−1/vl−1!e−γlt
F
X
c
n
t
=
1
−
1
/
∑
k
=
1
m
α
k
u
k
/
η
k
∑
k
=
1
m
∑
l
=
1
n
∑
i
=
0
u
k
−
1
∑
j
=
0
v
l
−
1
∑
q
=
0
i
α
k
/
η
k
β
l
η
k
t
q
/
q
!
γ
l
t
j
/
j
!
e
−
μ
+
η
k
+
γ
l
t
F
X
c
n
t
=
1
−
∑
k
=
1
m
∑
l
=
1
n
∑
i
=
0
u
k
−
1
∑
j
=
0
v
l
−
1
α
k
β
l
η
k
t
q
/
i
!
γ
l
t
j
/
j
!
e
−
μ
+
η
k
+
γ
l
t


## 5. Results and Discussion

In this section, the impact of mean value, coefficient of variation, and skewness of cell dwell/residence time (DT) and unencumbered interruption time (IT) on performance of a cellular network (CN) is presented. Numerical results presented in this section demonstrate the applicability, robustness, and accuracy of the mathematical paradigm developed in Section4. In order to attain good understandings on the sensitivity study carried out in this section, a hyper-Erlang pdf with two phases and two stages and a 2nd order hyperexponential pdf are employed. Note that the label “HErl-2” denotes the hyper-Erlang pdf with two phases and two stages and the label “HExp-2” represents the 2nd order hyperexponential pdf. The following parameters are considered in this section: mean service time (1/μ) is equal to 180 s, total number of channels per cell (S) is equal to 8, offered traffic per cell is equal to 4.4 Erlangs, and total number of channels reserved for handoff prioritization (N(n)) is equal to 1.Figures3–7 illustrate, respectively, forced termination, new session blocking, handoff failure probabilities, handoff rate, and carried traffic versus coefficient of variation and skewness of IT. On the other hand, Figures 8–12 plot, respectively, forced call termination, new session blocking probabilities, carried traffic, mean channel holding time for new calls, and mean channel holding time for handoff calls versus coefficient of variation and skewness of DT. A particular case is presented in Figures 3–7 when IT is modeled with either hyper-Erlang pdf with two phases and two stages or 2nd order hyperexponentially pdf and DT is negative-exponentially distributed. In contrast, Figures 8–12 present numerical results for the particular case when DT is modeled with either hyper-Erlang pdf with two phases and two stages or 2nd order hyperexponential pdf and IT is negative-exponentially distributed. In Figures 3–7, two different values of the mean IT time are considered and compared, say 1500 s (which represents a low reliability scenario) and 5000 s (which represents a high reliability scenario) (note that both considered values of the mean IT are significantly greater than the mean DT; this is due to the fact that telecommunication systems are designed to be reliable; to this end, mean IT should be typically greater than both mean unencumbered service time and mean cell residence/dwell time). Moreover, in Figures 8–12, two different values of the mean DT are evaluated, say 100 s (which represents a high mobility scenario) and 900 s (which represents a low mobility scenario).Figure 3
Forced session termination probability against skewness and coefficient of variation of unencumbered interruption time, with the probability density function type and expected value of unencumbered interruption time as parameters.Figure 4
New session blocking probability against skewness and coefficient of variation of unencumbered interruption time, with the probability density function type and expected value of unencumbered interruption time as parameters.Figure 5
Handoff failure probability against skewness and coefficient of variation of unencumbered interruption time, with the probability density function type and expected value of unencumbered interruption time as parameters.Figure 6
Handoff rate against skewness and coefficient of variation of unencumbered interruption time, with the probability density function type and expected value of unencumbered interruption time as parameters.Figure 7
Carried traffic against skewness and coefficient of variation of unencumbered interruption time, with the probability density function type and expected value of unencumbered interruption time as parameters.Figure 8
Forced session termination probability against skewness and coefficient of variation of cell residence time, with the probability density function type and mean value of cell residence time as parameters.Figure 9
New session blocking probability against skewness and coefficient of variation of cell residence time, with the probability density function type and mean value of cell residence time as parameters.
(a)
(b)Figure 10
Carried traffic against skewness and coefficient of variation of cell residence time, with the probability density function type and expected value of cell residence time as parameters.Figure 11
Mean channel holding time for new calls against skewness and coefficient of variation of cell residence time, with the probability density function type and expected value of cell residence time as parameters.Figure 12
Mean channel holding time for handed off calls against skewness and coefficient of variation of cell residence time, with the probability density function type and expected value of cell residence time as parameters.


### 5.1. Influence of Unencumbered Interruption Time Statistics

The influence of the expected value, coefficient of variation, and skewness of unencumbered interruption time on the performance of a CN is studied in this section.Figure3 illustrates that while the mean value of the IT decreases, the forced session termination probability increases. This fact indicates an adverse effect of link unreliability on the performance of CNs (remember that physically, the mean value of IT represents a direct measure of link reliability). In contrast, from Figures 4 and 5, it is perceived that as link unreliability grows (i.e., when the mean unencumbered call interruption time decreases), both new session blocking and handoff failure probabilities decrease, indicating a positive impact of channel unreliability (from the perspective of radio resource insufficiency) on the performance of CNs. This is due to the fact that as link unreliability increases, more ongoing calls are forced to terminate due to wireless channel impairments. This fact contributes to reducing the handoff rate as it is illustrated in Figure 6. Consequently, more radio resources are available for new and handed off sessions, reducing in this way both new session blocking and handoff failure probabilities.Figures3–5 also show that the forced session termination probability increases and both new call blocking and handoff failure probabilities decrease as CoV of IT augments. Let us explain this comportment. Firstly, observe that as the CoV augments, the probability that IT takes smaller values augments. Consequently, more sessions are forced to terminate due to link unreliability. Simultaneously, as more ongoing sessions are forced to terminate due to link unreliability, the handoff rate diminishes and, as a consequence, the handoff failure probability decreases as well. The overall effect of these facts is to increase the forced call termination probability and, at the same time, both new call blocking and handoff failure probabilities decrease. Furthermore, from Figures 3 and 4, the following interesting result can be extracted: for the scenarios where skewness takes values less than 20, it is observed that forced session termination probability due to resource insufficiency is significantly augmented and new session blocking probability is decreased as the CoV is raised. For instance, Figures 3 and 4 show that for scenarios of low reliability where skewness is equal to 2 and the IT is hyper-Erlang distributed, forced termination probability due to resource insufficiency increases around 700% and blocking probability decreases 67% as the CoV of IT moves from 1 to 20. The scenario where skewness is equal to 2 and CoV is equal to 1 corresponds to the case when IT is negative-exponentially distributed. Figures 3 and 4 show that forced call termination probability due to resource insufficiency is a monotonically decreasing function of skewness, while the opposite behavior is observed for the new call blocking probability.Alternatively, Figure7 shows that the carried traffic is an increasing function of both the skewness and mean value of IT. Also, Figure 7 shows that for values of skewness smaller than around 30, carried traffic decreases as CoV of IT increases. These observations indicate a detrimental effect of link unreliability on carried traffic. Moreover, it is noted that for values of skewness greater than around 30 and for the same mean value and type of distribution of IT, the carried traffic is almost insensitive to the CoV of IT. The reason is as follows. Consider that the mean value, CoV, and distribution type of IT remain without change. Then, as the skewness of IT increases, the tail on the right side of the IT distribution function becomes longer (that is, the probability that IT takes higher values increases and, consequently, less calls are interrupted due to link unreliability). That is, the influence of skewness on forced termination probability becomes negligible. At the same time, because link unreliability is not considered to accept a call, the blocking probability is not sensitive to changes on neither skewness nor CoV of IT statistics. As the carried traffic directly depends on both blocking and forced call termination probabilities, the combined effect of these two facts is observed in Figure 7.An interesting study of the results illustrated in Figures3–7 is that for a given scenario with the same skewness and CoV, a nonnegligible difference is observed between the values taken by the different performance metrics when IT is modeled by the hyper-Erlang pdf and the corresponding values when IT is modeled by the hyperexponential pdf. Thus, it is apparent that moments higher than the first one used to characterize IT have a relevant impact on the performance of CNs.


### 5.2. Influence of Cell Dwell Time Statistics

In this section, it is investigated the influence of the expected value, coefficient of variation, and skewness of cell dwell time on system performance. Figure8 illustrates that the forced session termination probability is augmented as the mean value of the DT is decreased, indicating a negative impact of user mobility on the performance of CNs. This fact is explained as follows. When the mean value of DT is diminished, the average number of handoffs per call is augmented; consequently, the forced termination probability due to resource insufficiency is increased. On the other hand, Figure 9 shows that the blocking probability increases as the mean value of DT increases. This is because as the mean DT becomes larger, users with ongoing calls remain for a longer period of time inside the cell. Consequently, the rate at which radio resources are released decreases, causing a detrimental effect on blocking probability.Figure8 also shows that forced session termination probability is practically insensitive to skewness and CoV of DT for the low mobility scenario. The reason of this conduct is explained by the fact that under scenarios with low mobility, most of the ongoing sessions are successfully completed in the cell where those sessions were originated; consequently, the expected number of handoffs per call is small in benefit of forced session termination probability. Additionally, from Figure 8 it is noted that for scenarios with high mobility and regardless of skewness, forced session termination probability diminished as CoV of DT augments. This behavior can be explained by the fact that as the CoV of DT rises, the variability of the DT augments, that is, the values of cell residence time spread out over a larger range. The overall effect is controlled by larger values of DT, that is, a diminution of mobility takes place. Consequently, the expected number of handoffs per call is reduced, which has a beneficial impact on forced session termination probability.Additionally, from Figure8, it is interesting to note that under scenarios with high mobility and values of skewness less than 20, forced session termination probability is considerably reduced as CoV of DT rises. For example, Figure 8 shows that under the scenario with high mobility and cell dwell time hyper-Erlang distributed, forced session termination probability is reduced 60% as the CoV and skewness of DT move, respectively, from 1 to 20 and from 60 to 2. Observe that the scenario where CoV is equal to 1 and skewness is equal to 2 resembles the case when DT is negative-exponentially distributed.On the other hand, Figures8 and 9 reveal that for scenarios with high mobility, both forced session termination and blocking probabilities are monotonically increasing functions of skewness of DT. The reason is as follows. Consider that the mean value, CoV, and distribution type of DT remain without change. Then, as the skewness of DT rises, the tail on the right side of the DT pdf becomes longer (that is, the probability that cell dwell time takes higher values augments and, consequently, less active sessions move to another cell). In this manner, the rate at which channels are used by handed off calls diminishes in benefit of both blocking and handoff failure probabilities. This behavior contributes to augment carried traffic in concordance with the results presented in Figure 10. Figure 10 reveals that carried traffic is a decreasing function of skewness of DT. Figure 10 also shows that carried traffic rises as CoV of DT augments. These remarks indicate a beneficial effect of the variability of DT on carried traffic.Figures11 and 12 reveal that the qualitative behavior of the mean value of both channel holding time for new calls (CHTn) and channel holding time for handed off calls (CHTh) is very similar for the cases where cell dwell time is modeled by either hyper-Erlang or hyperexponential distributions. The small quantitative difference among them is attributed to moments higher than the third one.It is important to remark that the situation when cell residence time is negative-exponential distributed is represented for a single point in all the plots presented in Section4. That is, the situation when the coefficient of variation equals 1 and skewness equals 2 corresponds to the case when either IT or DT is modeled by the negative-exponential pdf. Thus, as far as real distributions of telecommunication time interval variables are best modeled by general distributions, numerical results presented in Section 4 evidence the inefficiency of the negative-exponential model and emphasize the relevance of considering the impact of moments higher than the expected value.Finally, the results illustrated in Figures8–12 reveal that for the same scenario and same mean value, skewness, and CoV of DT, there exists a small but nonnegligible difference between the values taken by the different performance metrics when DT is modeled by the hyper-Erlang pdf and the corresponding values when DT is modeled by the hyperexponential one. Evidently, these differences are due to the certainly dissimilar values between moments higher than the third one of hyper-Erlang and hyperexponential distribution models. Therefore, it is important to investigate the influence of moments higher than the third one (of both DT and IT) on the performance of mobile cellular networks. This important task represents a topic of our current research.


## 5.1. Influence of Unencumbered Interruption Time Statistics

The influence of the expected value, coefficient of variation, and skewness of unencumbered interruption time on the performance of a CN is studied in this section.Figure3 illustrates that while the mean value of the IT decreases, the forced session termination probability increases. This fact indicates an adverse effect of link unreliability on the performance of CNs (remember that physically, the mean value of IT represents a direct measure of link reliability). In contrast, from Figures 4 and 5, it is perceived that as link unreliability grows (i.e., when the mean unencumbered call interruption time decreases), both new session blocking and handoff failure probabilities decrease, indicating a positive impact of channel unreliability (from the perspective of radio resource insufficiency) on the performance of CNs. This is due to the fact that as link unreliability increases, more ongoing calls are forced to terminate due to wireless channel impairments. This fact contributes to reducing the handoff rate as it is illustrated in Figure 6. Consequently, more radio resources are available for new and handed off sessions, reducing in this way both new session blocking and handoff failure probabilities.Figures3–5 also show that the forced session termination probability increases and both new call blocking and handoff failure probabilities decrease as CoV of IT augments. Let us explain this comportment. Firstly, observe that as the CoV augments, the probability that IT takes smaller values augments. Consequently, more sessions are forced to terminate due to link unreliability. Simultaneously, as more ongoing sessions are forced to terminate due to link unreliability, the handoff rate diminishes and, as a consequence, the handoff failure probability decreases as well. The overall effect of these facts is to increase the forced call termination probability and, at the same time, both new call blocking and handoff failure probabilities decrease. Furthermore, from Figures 3 and 4, the following interesting result can be extracted: for the scenarios where skewness takes values less than 20, it is observed that forced session termination probability due to resource insufficiency is significantly augmented and new session blocking probability is decreased as the CoV is raised. For instance, Figures 3 and 4 show that for scenarios of low reliability where skewness is equal to 2 and the IT is hyper-Erlang distributed, forced termination probability due to resource insufficiency increases around 700% and blocking probability decreases 67% as the CoV of IT moves from 1 to 20. The scenario where skewness is equal to 2 and CoV is equal to 1 corresponds to the case when IT is negative-exponentially distributed. Figures 3 and 4 show that forced call termination probability due to resource insufficiency is a monotonically decreasing function of skewness, while the opposite behavior is observed for the new call blocking probability.Alternatively, Figure7 shows that the carried traffic is an increasing function of both the skewness and mean value of IT. Also, Figure 7 shows that for values of skewness smaller than around 30, carried traffic decreases as CoV of IT increases. These observations indicate a detrimental effect of link unreliability on carried traffic. Moreover, it is noted that for values of skewness greater than around 30 and for the same mean value and type of distribution of IT, the carried traffic is almost insensitive to the CoV of IT. The reason is as follows. Consider that the mean value, CoV, and distribution type of IT remain without change. Then, as the skewness of IT increases, the tail on the right side of the IT distribution function becomes longer (that is, the probability that IT takes higher values increases and, consequently, less calls are interrupted due to link unreliability). That is, the influence of skewness on forced termination probability becomes negligible. At the same time, because link unreliability is not considered to accept a call, the blocking probability is not sensitive to changes on neither skewness nor CoV of IT statistics. As the carried traffic directly depends on both blocking and forced call termination probabilities, the combined effect of these two facts is observed in Figure 7.An interesting study of the results illustrated in Figures3–7 is that for a given scenario with the same skewness and CoV, a nonnegligible difference is observed between the values taken by the different performance metrics when IT is modeled by the hyper-Erlang pdf and the corresponding values when IT is modeled by the hyperexponential pdf. Thus, it is apparent that moments higher than the first one used to characterize IT have a relevant impact on the performance of CNs.


## 5.2. Influence of Cell Dwell Time Statistics

In this section, it is investigated the influence of the expected value, coefficient of variation, and skewness of cell dwell time on system performance. Figure8 illustrates that the forced session termination probability is augmented as the mean value of the DT is decreased, indicating a negative impact of user mobility on the performance of CNs. This fact is explained as follows. When the mean value of DT is diminished, the average number of handoffs per call is augmented; consequently, the forced termination probability due to resource insufficiency is increased. On the other hand, Figure 9 shows that the blocking probability increases as the mean value of DT increases. This is because as the mean DT becomes larger, users with ongoing calls remain for a longer period of time inside the cell. Consequently, the rate at which radio resources are released decreases, causing a detrimental effect on blocking probability.Figure8 also shows that forced session termination probability is practically insensitive to skewness and CoV of DT for the low mobility scenario. The reason of this conduct is explained by the fact that under scenarios with low mobility, most of the ongoing sessions are successfully completed in the cell where those sessions were originated; consequently, the expected number of handoffs per call is small in benefit of forced session termination probability. Additionally, from Figure 8 it is noted that for scenarios with high mobility and regardless of skewness, forced session termination probability diminished as CoV of DT augments. This behavior can be explained by the fact that as the CoV of DT rises, the variability of the DT augments, that is, the values of cell residence time spread out over a larger range. The overall effect is controlled by larger values of DT, that is, a diminution of mobility takes place. Consequently, the expected number of handoffs per call is reduced, which has a beneficial impact on forced session termination probability.Additionally, from Figure8, it is interesting to note that under scenarios with high mobility and values of skewness less than 20, forced session termination probability is considerably reduced as CoV of DT rises. For example, Figure 8 shows that under the scenario with high mobility and cell dwell time hyper-Erlang distributed, forced session termination probability is reduced 60% as the CoV and skewness of DT move, respectively, from 1 to 20 and from 60 to 2. Observe that the scenario where CoV is equal to 1 and skewness is equal to 2 resembles the case when DT is negative-exponentially distributed.On the other hand, Figures8 and 9 reveal that for scenarios with high mobility, both forced session termination and blocking probabilities are monotonically increasing functions of skewness of DT. The reason is as follows. Consider that the mean value, CoV, and distribution type of DT remain without change. Then, as the skewness of DT rises, the tail on the right side of the DT pdf becomes longer (that is, the probability that cell dwell time takes higher values augments and, consequently, less active sessions move to another cell). In this manner, the rate at which channels are used by handed off calls diminishes in benefit of both blocking and handoff failure probabilities. This behavior contributes to augment carried traffic in concordance with the results presented in Figure 10. Figure 10 reveals that carried traffic is a decreasing function of skewness of DT. Figure 10 also shows that carried traffic rises as CoV of DT augments. These remarks indicate a beneficial effect of the variability of DT on carried traffic.Figures11 and 12 reveal that the qualitative behavior of the mean value of both channel holding time for new calls (CHTn) and channel holding time for handed off calls (CHTh) is very similar for the cases where cell dwell time is modeled by either hyper-Erlang or hyperexponential distributions. The small quantitative difference among them is attributed to moments higher than the third one.It is important to remark that the situation when cell residence time is negative-exponential distributed is represented for a single point in all the plots presented in Section4. That is, the situation when the coefficient of variation equals 1 and skewness equals 2 corresponds to the case when either IT or DT is modeled by the negative-exponential pdf. Thus, as far as real distributions of telecommunication time interval variables are best modeled by general distributions, numerical results presented in Section 4 evidence the inefficiency of the negative-exponential model and emphasize the relevance of considering the impact of moments higher than the expected value.Finally, the results illustrated in Figures8–12 reveal that for the same scenario and same mean value, skewness, and CoV of DT, there exists a small but nonnegligible difference between the values taken by the different performance metrics when DT is modeled by the hyper-Erlang pdf and the corresponding values when DT is modeled by the hyperexponential one. Evidently, these differences are due to the certainly dissimilar values between moments higher than the third one of hyper-Erlang and hyperexponential distribution models. Therefore, it is important to investigate the influence of moments higher than the third one (of both DT and IT) on the performance of mobile cellular networks. This important task represents a topic of our current research.


## 6. Conclusions

Relevant insights into the performance sensitivity of mobile cellular systems to the first three standardized moments of both cell dwell time (DT) and unencumbered interruption time (IT) were found in this paper. Despite the fact that the numerical results presented in this work were obtained from particular situations with certain set of system parameter values, these results reveal that there exist important sensitive questions concerning moments higher than the expected value of both DT and IT. It was found that cellular system performance is more sensitive to the statistics of the IT than to those of the DT. Numerical results demonstrate that performance metrics are greatly influenced by smaller values of the skewness of either the IT or DT. Also of importance, it was found that, for the same mobility/unreliability scenario and matching the first three standardized moments, there exists significant differences among the values taken by the different system performance metrics when IT is modeled by the hyperexponential distribution and the corresponding values when IT is modeled by the hyper-Erlang distribution (a similar behavior was observed when DT was considered.) The small quantitative difference between the hyper-Erlang and hyperexponential cases is due to moments higher than the third one. Analyzing the impact of moments of both DT and IT distributions higher than the third one on system performance metrics represents a topic of our current research.



---

*Source: 1347601-2020-01-30.xml*