Class dependent departure process from multiclass phase queues: Exact and approximate analyses

In this paper we study class dependent departure processes from phase type queues. When the arrival process for a subset of the classes is a Poisson process, we determine the Laplace-Stieltjes transform of the stationary inter-departure times of the combined output of all the other classes. We also propose and test approximations for the squared coefficient of variation of the stationary inter-departure times of each customer class. The approximations are based on the detailed structure of the second order measures of the aggregate departure process. Finally, we propose renewal approximations for the class dependent departure process that take into account the utilization of the queue that customers next visit.     

Tandem behavior of a telecommunication system with finite buffers and repeated calls

The tandem behavior of a telecommunication system with finite buffers and repeated calls is modeled by the performance of a finite capacityG/M/1 queueing system with general interarrival time distribution, exponentially distributed service time, the first-come-first-served queueing discipline and retrials. In this system a fraction of the units which on arrival at a node of the system find it busy, may retry to be processed, by merging with the incoming arrival units in that node, after a fixed delay time. The performance of this system in steady state is modeled by a queueing network and is approximated by a recursive algorithm based on the isolation method. The approximation outcomes are compared against those from a simulation study. Our numerical results indicate that in steady state the non-renewal superposition arrival process, the non-renewal overflow process, and the non-renewal departure process of the above system can be approximated with compatible renewal processes.     

Renewal processes based on generalized Mittag–Leffler waiting times

The fractional Poisson process has recently attracted experts from several fields of study. Its natural generalization of the ordinary Poisson process made the model more appealing for real-world applications. In this paper, we generalized the standard and fractional Poisson processes through the waiting time distribution, and showed their relations to an integral operator with a generalized Mittag–Leffler function in the kernel. The waiting times of the proposed renewal processes have the generalized Mittag–Leffler and stretched–squashed Mittag–Leffler distributions. Note that the generalizations naturally provide greater flexibility in modeling real-life renewal processes. Algorithms to simulate sample paths and to estimate the model parameters are derived. Note also that these procedures are necessary to make these models more usable in practice. State probabilities and other qualitative or quantitative features of the models are also discussed.     

A class of renewal Interrupted Poisson Processes and applications to queueing systems

Switched Poisson Processes and Interrupted Poisson Processes are often employed to characterize traffic streams in distributed computer and communications systems, especially in investigations of overflow processes in telecommunication networks. With these processes, input streams having inter-segment correlations and high variance as well as state-dependent traffic can properly be modelled. In this paper we first derive an approximation method to describe the Generalized Switched Poisson processes in conjunction with a renewal assumption. As a special case of this class of processes, the class of Interrupted Poisson processes is also included in the investigation. As a result, a generalization of the well-known class of Interrupted Poisson processes is obtained. It is shown that the renewal property is also given for this general class of Interrupted Poisson processes having generally distributed off-phase. To illustrate the accuracy of the presented renewal approximation of Generalized Switched Poisson processes and to show the major properties of the General Interrupted Poisson processes, applications to some basic queueing systems are discussed by means of numerical results.This work was done while the author was with Institute of Communications Switching and Data Technics, University of Stuttgart, Seidenstrasse 36, D-7000 Stuttgart 1, FRG.     

Tandem Behaviour of a Telecommunication System with Repeated Calls: A Markovian Case with Buffers

The performance of a telecommunication system consisting of a set of transmitters with finite capacity buffers is modelled with a Markovian queueing network, and its tandem behaviour is approximated, in steady state. In this system, a fraction of the units which, at the instants of their arrival at each transmitter, find it busy may retry to be processed by merging with the incoming arrival units at the same transmitter after a fixed delay time. The performance of this system is approximated by a recursive algorithm, in steady state. Furthermore, the approximation outcomes are compared against those from a simulation study. In summary, our numerical results indicate that approximating the non-renewal superposition arrival, the non-renewal overflow and the non-renewal departure processes at each node of the network can be approximated with compatible Poisson processes.     

The Geometric Markov Renewal Processes with Application to Finance

We introduce the geometric Markov renewal processes as a model for a security market and study this processes in a series scheme. We consider its approximations in the form of averaged, merged and double averaged geometric Markov renewal processes. Weak convergence analysis and rates of convergence of ergodic geometric Markov renewal processes are presented. Martingale properties, infinitesimal operators of geometric Markov renewal processes are presented and a Markov renewal equation for expectation is derived. As an application, we consider the case of two ergodic classes. Moreover, we consider a generalized binomial model for a security market induced by a position dependent random map as a special case of a geometric Markov renewal process.     

A Markov Renewal Based Model for Wireless Networks

We propose a queueing network model which can be used for the integration of the mobility and teletraffic aspects that are characteristic of wireless networks. In the general case, the model is an open network of infinite server queues where customers arrive according to a non-homogeneous Poisson process. The movement of a customer in the network is described by a Markov renewal process. Moreover, customers have attributes, such as a teletraffic state, that are driven by continuous time Markov chains and, therefore, change as they move through the network. We investigate the transient and limit number of customers in disjoint sets of nodes and attributes. These turn out to be independent Poisson random variables. We also calculate the covariances of the number of customers in two sets of nodes and attributes at different time epochs. Moreover, we conclude that the arrival process per attribute to a node is the sum of independent Poisson cluster processes and derive its univariate probability generating function. In addition, the arrival process to an outside node of the network is a non-homogeneous Poisson process. We illustrate the applications of the queueing network model and the results derived in a particular wireless network.     

Approximation of optimal stopping problems

We consider optimal stopping of independent sequences. Assuming that the corresponding imbedded planar point processes converge to a Poisson process we introduce some additional conditions which allow to approximate the optimal stopping problem of the discrete time sequence by the optimal stopping of the limiting Poisson process. The optimal stopping of the involved Poisson processes is reduced to a differential equation for the critical curve which can be solved in several examples. We apply this method to obtain approximations for the stopping of iid sequences in the domain of max-stable laws with observation costs and with discount factors.     

The departure process of discrete-time queueing systems with Markovian type inputs

This paper proposes a unified matrix-analytic approach to characterize the output processes of general discrete-time lossless/lossy queueing systems in which time is synchronized/slotted into fixed length intervals called slots. The arrival process can be continuous- or discrete-time Markovian processes. It can be either renewal or non-renewal. The service of a customer commences at the beginning of a slot, consumes a random number of slots, and completes at the end of a later slot. The service times are independent and follow a common and general distribution. Systems with and without server vacations are both treated in this paper. These queueing systems have potential applications in asynchronous transfer mode (ATM) networks, packet radio networks, etc. Since the output process of a node in a queueing network becomes an input process to some node at the next stage, the results of this paper can be used to facilitate end-to-end performance analysis which has attracted more and more attention in the literature. This revised version was published online in June 2006 with corrections to the Cover Date.     

Zur Überlagerung von Erneuerungsprozessen

Summary If a finite sequence of independent (not necessarily stationary) renewal processes is given, a superposition process can easily be defined as the union of all point sequences represented by the given processes. The properties of such superposition processes are investigated. First, a necessary and sufficient condition for a superposition process to be a renewal process is given. Essentially, this condition reads thus: the given processes must be Poisson processes. The main result given in this paper is a limit theorem for superposition processes which shows that, even with largely arbitrary renewal processes superimposed, the superposition process has local properties which approach the properties of the Poisson process as the number of given processes increases. The theorem contains some well-known special theorems of this type [e.g. Khintchine, 1960; Franken, 1963].

---

---

Von der Fakultät für Allgemeine Wissenschaften der T. H. München angenommene Habilitationsschrift (Auszug).     

Beyond the Poisson renewal process: A tutorial survey

After sketching the basic principles of renewal theory and recalling the classical Poisson process, we discuss two renewal processes characterized by waiting time laws with the same power asymptotics defined by special functions of Mittag–Leffler and of Wright type. We compare these three processes with each other.     

Poisson过程作为更新过程的若干新的特征刻画

本文将给出Poisson过程作为更新过程的一系列新的特征刻画．这些刻画是借助于更新过程中所有关键量的条件概率分布或条件期望来表述的．所给的条件是至任一指定时刻发生的抵达敷为已知．     

Finite-size corrections to Poisson approximations in general renewal-success processes

Consider a renewal process, and let K?0 denote the random duration of a typical renewal cycle. Assume that on any renewal cycle, a rare event called “success” can occur. Such successes lend themselves naturally to approximation by Poisson point processes. If each success occurs after a random delay, however, Poisson convergence can be relatively slow, because each success corresponds to a time interval, not a point. If K is an arithmetic variable, a “finite-size correction” (FSC) is known to speed Poisson convergence by providing a second, subdominant term in the appropriate asymptotic expansion. This paper generalizes the FSC from arithmetic K to general K. Genomics applications require this generalization, because they have already heuristically applied the FSC to p-values involving absolutely continuous distributions. The FSC also sharpens certain results in queuing theory, insurance risk, traffic flow, and reliability theory.     

Itô and Stratonovich integrals on compound renewal processes: the normal/Poisson case

Continuous-time random walks, or compound renewal processes, are pure-jump stochastic processes with several applications in insurance, finance, economics and physics. Based on heuristic considerations, a definition is given for stochastic integrals driven by continuous-time random walks, which includes the Itô and Stratonovich cases. It is then shown how the definition can be used to compute these two stochastic integrals by means of Monte Carlo simulations. Our example is based on the normal compound Poisson process, which in the diffusive limit converges to the Wiener process.     

Semi-Markov modulated Poisson process: probabilistic and statistical analysis

We consider a Poisson process that is modulated in such a way that the arrival rate at any time depends on the state of a semi-Markov process. This presents an interesting generalization of Poisson processes with important implications in real life applications. Our analysis concentrates on the transient as well as the long term behaviour of the arrival count and the arrival time processes. We discuss probabilistic as well as statistical issues related to various quantities of interest.     

A Poisson bridge between fractional Brownian motion and stable Lévy motion

We study a non-Gaussian and non-stable process arising as the limit of sums of rescaled renewal processes under the condition of intermediate growth. The process has been characterized earlier by the cumulant generating function of its finite-dimensional distributions. Here, we derive a more tractable representation for it as a stochastic integral of a deterministic function with respect to a compensated Poisson random measure. Employing the representation we show that the process is locally and globally asymptotically self-similar with fractional Brownian motion and stable Lévy motion as its tangent limits.     

A numerically efficient method for the MAP/D/1/K queue via rational approximations

The Markovian Arrival Process (MAP), which contains the Markov Modulated Poisson Process (MMPP) and the Phase-Type (PH) renewal processes as special cases, is a convenient traffic model for use in the performance analysis of Asynchronous Transfer Mode (ATM) networks. In ATM networks, packets are of fixed length and the buffering memory in switching nodes is limited to a finite numberK of cells. These motivate us to study the MAP/D/1/K queue. We present an algorithm to compute the stationary virtual waiting time distribution for the MAP/D/1/K queue via rational approximations for the deterministic service time distribution in transform domain. These approximations include the well-known Erlang distributions and the Padé approximations that we propose. Using these approximations, the solution for the queueing system is shown to reduce to the solution of a linear differential equation with suitable boundary conditions. The proposed algorithm has a computational complexity independent of the queue storage capacityK. We show through numerical examples that, the idea of using Padé approximations for the MAP/D/1/K queue can yield very high accuracy with tractable computational load even in the case of large queue capacities.This work was done when the author was with the Bilkent University, Ankara, Turkey and the research was supported by TÜBITAK under Grant No. EEEAG-93.     

Ruin probabilities for a risk model with two classes of claims

In this paper we consider a risk model with two kinds of claims, whose claims number processes are Poisson process and ordinary renewal process respectively. For this model, the surplus process is not Markovian, however, it can be Markovianized by introducing a supplementary process, We prove the Markov property of the related vector processes. Because such obtained processes belong to the class of the so-called piecewise-deterministic Markov process, the extended infinitesimal generator is derived, exponential martingale for the risk process is studied. The exponential bound of ruin probability in iafinite time horizon is obtained.     

Ruin probability in the dual risk model with two revenue streams

The dual risk model describes the surplus of a company with fixed expense rate and occasional random income inflows, called gains. Consider the dual risk model with two streams of gains. Type I gains arrive according to a Poisson process, and type II gains arrive according to a general renewal process. We show that the survival probability of the company can be expressed in terms of the survival probability in a dual risk process with renewal arrivals with initial reserve 0, and the survival probability in the dual risk process with Poisson arrivals in finite time.