Mathematical Model For Forwarding Packets In Communication Network

In recent years, SDN technology has been applied to several networks such as wide area network (WAN). IT provides many benefits, such as: enhancing data transfer, promoting Application performance and reducing deployment costs. Software Defined-WAN networks lack studies and references. This paper introduced a system for SD-WAN network using PH/PH/C queues. It concentrates on the study of algebraic estimates the probability distribution of the system states. The Matrix-Geometric solution procedure of a phase type distribution queue with first-come first-served discipline is used.

Concentrated matrix exponential distributions with real eigenvalues

Concentrated random variables are frequently used in representing deterministic delays in stochastic models. The squared coefficient of variation ( $\mathrm {SCV}$ ) of the most concentrated phase-type distribution of order $N$ is $1/N$ . To further reduce the $\mathrm {SCV}$ , concentrated matrix exponential (CME) distributions with complex eigenvalues were investigated recently. It was obtained that the $\mathrm {SCV}$ of an order $N$ CME distribution can be less than $n^{-2.1}$ for odd $N=2n+1$ orders, and the matrix exponential distribution, which exhibits such a low $\mathrm {SCV}$ has complex eigenvalues. In this paper, we consider CME distributions with real eigenvalues (CME-R). We present efficient numerical methods for identifying a CME-R distribution with smallest SCV for a given order $n$ . Our investigations show that the $\mathrm {SCV}$ of the most concentrated CME-R of order $N=2n+1$ is less than $n^{-1.85}$ . We also discuss how CME-R can be used for numerical inverse Laplace transformation, which is beneficial when the Laplace transform function is impossible to evaluate at complex points.

Queuing-Inventory Models with MAP Demands and Random Replenishment Opportunities

Combining the study of queuing with inventory is very common and such systems are referred to as queuing-inventory systems in the literature. These systems occur naturally in practice and have been studied extensively in the literature. The inventory systems considered in the literature generally include (s,S)-type. However, in this paper we look at opportunistic-type inventory replenishment in which there is an independent point process that is used to model events that are called opportunistic for replenishing inventory. When an opportunity (to replenish) occurs, a probabilistic rule that depends on the inventory level is used to determine whether to avail it or not. Assuming that the customers arrive according to a Markovian arrival process, the demands for inventory occur in batches of varying size, the demands require random service times that are modeled using a continuous-time phase-type distribution, and the point process for the opportunistic replenishment is a Poisson process, we apply matrix-analytic methods to study two of such models. In one of the models, the customers are lost when at arrivals there is no inventory and in the other model, the customers can enter into the system even if the inventory is zero but the server has to be busy at that moment. However, the customers are lost at arrivals when the server is idle with zero inventory or at service completion epochs that leave the inventory to be zero. Illustrative numerical examples are presented, and some possible future work is highlighted.

A Phase-Type Distribution for the Sum of Two Concatenated Markov Processes Application to the Analysis Survival in Bladder Cancer

Stochastic processes are useful and important for modeling the evolution of processes that take different states over time, a situation frequently found in fields such as medical research and engineering. In a previous paper and within this framework, we developed the sum of two independent phase-type (PH)-distributed variables, each of them being associated with a Markovian process of one absorbing state. In that analysis, we computed the distribution function, and its associated survival function, of the sum of both variables, also PH-distributed. In this work, in one more step, we have developed a first approximation of that distribution function in order to avoid the calculation of an inverse matrix for the possibility of a bad conditioning of the matrix, involved in the expression of the distribution function in the previous paper. Next, in a second step, we improve this result, giving a second, more accurate approximation. Two numerical applications, one with simulated data and the other one with bladder cancer data, are used to illustrate the two proposed approaches to the distribution function. We compare and argue the accuracy and precision of each one of them by means of their error bound and the application to real data of bladder cancer.

Priority Multi-Server Queueing System with Heterogeneous Customers

In this paper, we analyze a multi-server queueing system with heterogeneous customers that arrive according to a marked Markovian arrival process. Customers of two types differ in priorities and parameters of phase type distribution of their service time. The queue under consideration can be used to model the processes of information transmission in telecommunication networks in which often the flow of information is the superposition of several types of flows with correlation of inter-arrival times within each flow and cross-correlation. We define the process of information transmission as the multi-dimensional Markov chain, derive the generator of this chain and compute its stationary distribution. Expressions for computation of various performance measures of the system, including the probabilities of loss of customers of different types, are presented. Output flow from the system is characterized. The presented numerical results confirm the high importance of account of correlation in the arrival process. The values of important performance measures for the systems with the correlated arrival process are essentially different from the corresponding values for the systems with the stationary Poisson arrival process. Measurements in many real world systems show poor approximation of real flows by such an arrival process. However, this process is still popular among the telecommunication engineers due to the evident existing gap between the needs of adequately modeling the real life systems and the current state of the theory of algorithmic methods of queueing theory.

Analysis of an M/PH/1 Retrial Queueing-Inventory System with Level Dependent Retrial Rate

We analyze a queueing-inventory system which can model airline and railway reservation systems. An arriving customer to an idle server joins for service immediately with exactly one item from inventory at the moment of service completion if there are some on-hand inventory, or else he accesses to a buffer of varying size (the buffer capacity varies and equals to the number of the items in the inventory with maximum size S). When the buffer overflows, the customer joins an orbit of infinite capacity with probability p or is lost forever with probability 1−p. Arrivals form a Poisson process, and service time has phase type distribution. The time between any two successive retrials of the orbiting customer is exponentially distributed with parameter depending on the number of customers in the orbit. In addition, the items have a common life time with exponentially distributed. Cancellation of orders is possible before their expiry and intercancellation times are assumed to be exponentially distributed. The stability condition and steady-state probability vector have been studied by Neuts–Rao truncation method using the theory of Level Dependent Quasi-Birth-Death (LDQBD) processes. Several stationary performance measures are also computed. Furthermore, we provide numerical illustration of the system performance with variation in values of underlying parameters and analyze an optimization problem.

A Parameter Estimation Method of Shock Model Constructed with Phase-Type Distribution on the Condition of Interval Data

The phase-type distribution (also known as PH distribution) has mathematical properties of denseness and closure in calculation and is, therefore, widely used in shock model constructions describing occurrence time of a shock or its damage. However, in the case of samples with only interval data, modeling with PH distribution will cause decoupling issues in parameter estimation. Aiming at this problem, an approximate parameter estimation method based on building PH distribution with dynamic order is proposed. Firstly, the shock model established by PH distribution and the likelihood function under samples with only interval data are briefly introduced. Then, the principle and steps of the method are introduced in detail, and the derivation processes of some related formulas are also given. Finally, the performance of the algorithm is illustrated by a case with three different types of distributions.