A Versatile Packet Arrival Process and Its Second Order Properties

1993 ◽  
Vol 7 (4) ◽  
pp. 495-513 ◽  
Author(s):  
Teunis J. Ott

In this paper we describe a class of discrete time processes that can be used to model packet arrival streams in packetized communication. Mathematically, (K(t)) can be seen as a discrete time self-exciting point process, as a multitype branching process, or as an epidemic with immigration of infected people. The purpose of this paper is to show that this class of models simultaneously is quite useful and analytically more tractable than is obvious at first glance. It is shown that certain probabilities can reliably be computed using generating function methods, and expressions are given for the second order properties and for the asymptotic index of dispersion.

Author(s):  
Umesh Chandra Gupta ◽  
Nitin Kumar ◽  
Sourav Pradhan ◽  
Farida Parvez Barbhuiya ◽  
Mohan L Chaudhry

Discrete-time queueing models find a large number of applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems and computer networks. In this paper, we analyze an infinite-buffer queueing model with discrete Markovian arrival process. The units on arrival are served in batches by a single server according to the general bulk-service rule, and the service time follows general distribution with service rate depending on the size of the batch being served. We mathematically formulate the model using the supplementary variable technique and obtain the vector generating function at the departure epoch. The generating function is in turn used to extract the joint distribution of queue and server content in terms of the roots of the characteristic equation. Further, we develop the relationship between the distribution at the departure epoch and the distribution at arbitrary, pre-arrival and outside observer's epochs, where the first is used to obtain the latter ones. We evaluate some essential performance measures of the system and also discuss the computing process extensively which is demonstrated by some numerical examples.


Consider a cascade or random branching process, with discrete time, with a positive integral number s , of female sexes, and where the reproductive behaviour of the individuals depends on time. Starting with any number of individuals of the various types in the zeroth generation, the joint p.g.f. (probability generating function) will be obtained for the numbers of individuals in each of the first n generations. The power of the result will be shown by the ease with which several deductions can be made.


Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 246
Author(s):  
Manuel Molina-Fernández ◽  
Manuel Mota-Medina

This research work deals with mathematical modeling in complex biological systems in which several types of individuals coexist in various populations. Migratory phenomena among the populations are allowed. We propose a class of mathematical models to describe the demographic dynamics of these type of complex systems. The probability model is defined through a sequence of random matrices in which rows and columns represent the various populations and the several types of individuals, respectively. We prove that this stochastic sequence can be studied under the general setting provided by the multitype branching process theory. Probabilistic properties and limiting results are then established. As application, we present an illustrative example about the population dynamics of biological systems formed by long-lived raptor colonies.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias

Abstract In this note we study the probability and the mean time for absorption for discrete time Markov chains. In particular, we are interested in estimating the mean time for absorption when absorption is not certain and connect it with some other known results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets A 1 , A 2 , … , A k {A_{1},A_{2},\dots,A_{k}} .


1997 ◽  
Vol 34 (4) ◽  
pp. 898-907 ◽  
Author(s):  
Aihua Xia

This note gives the rate for a Wasserstein distance between the distribution of a Bernoulli process on discrete time and that of a Poisson process, using Stein's method and Palm theory. The result here highlights the possibility that the logarithmic factor involved in the upper bounds established by Barbour and Brown (1992) and Barbour et al. (1995) may be superfluous in the true Wasserstein distance between the distributions of a point process and a Poisson process.


Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 868
Author(s):  
Khrystyna Prysyazhnyk ◽  
Iryna Bazylevych ◽  
Ludmila Mitkova ◽  
Iryna Ivanochko

The homogeneous branching process with migration and continuous time is considered. We investigated the distribution of the period-life τ, i.e., the length of the time interval between the moment when the process is initiated by a positive number of particles and the moment when there are no individuals in the population for the first time. The probability generating function of the random process, which describes the behavior of the process within the period-life, was obtained. The boundary theorem for the period-life of the subcritical or critical branching process with migration was found.


1995 ◽  
Vol 32 (01) ◽  
pp. 1-10
Author(s):  
Ziad Taib

The functional differential equation y′(x) = ay(λx) + by(x) arises in many different situations. The purpose of this note is to show how it arises in some multitype branching process cell population models. We also show how its solution can be given an intuitive interpretation as the probability density function of an infinite sum of independent but not identically distributed random variables.


Sign in / Sign up

Export Citation Format

Share Document