Related papers: Tempered Erlang Queue with Multiple Arrivals
Time lags are ubiquitous in biophysiological processes and more generally in real-world complex networks. It has been recently proposed to use information-theoretic tools such as transfer entropy to detect and estimate a possible delay in…
Experimental observations of typical kinds of synchronization transitions are reported in unidirectionally coupled time-delay electronic circuits with a threshold nonlinearity and two time delays, namely feedback delay $\tau_1$ and coupling…
Probabilistic interpretation of transition from the dispersive transport regime to the quasi-Gaussian one in disordered semiconductors is given in terms of truncated Levy distributions. Corresponding transport equations with fractional…
In this work we use tempered fractional advection-diffusion equations to model the dispersive transport in disordered materials. A numerical method is derived to approximate the solution of such differential models and we prove that it is…
Queues that feature multiple entities arriving simultaneously are among the oldest models in queueing theory, and are often referred to as "batch" (or, in some cases, "bulk") arrival queueing systems. In this work we study the affect of…
Dynamical systems with complex delayed interactions arise commonly when propagation times are significant, yielding complicated oscillatory instabilities. In this Letter, we introduce a class of systems with multiple, hierarchically long…
We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has $c$ identical servers and can accommodate the maximal number of $K$ jobs. If a…
Because of the finiteness of the life span and boundedness of the physical space, the more reasonable or physical choice is the tempered power-law instead of pure power-law for the CTRW model in characterizing the waiting time and jump…
In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…
Long-term memory is a feature observed in systems ranging from neural networks to epidemiological models. The memory in such systems is usually modeled by the time delay. Furthermore, the nonlocal operators, such as the "fractional order…
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and…
This paper considers a particular renewal-reward process with multivariate discounted rewards (inputs) where the arrival epochs are adjusted by adding some random delays. Then this accumulated reward can be regarded as multivariate…
Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy…
We develop accurate approximations of the delay distribution of the MArP/G/1 queue that cap- ture the exact tail behavior and provide bounded relative errors. Motivated by statistical analysis, we consider the service times as a mixture of…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
We study the impact of competing time delays in coupled stochastic synchronization and coordination problems. We consider two types of delays: transmission delays between interacting elements and processing, cognitive, or execution delays…
Time plays a special role in Standard Quantum Theory. The concept of time observable causes many controversies there. In Event Enhanced Quantum Theory (in short: EEQT) Schroedinger's differential equation is replaced by a em piecewise…
We consider queueing models, where customers arrive according to a continuous-time binomial process on a finite interval. In this arrival process, a total of $K$ customers arrive in the finite time interval $[0,T]$, where arrival times of…
We present a new framework for designing nonpreemptive and job-size oblivious scheduling policies in the multiserver-job queueing model. The main requirement is to identify a static and balanced sub-partition of the server set and ensure…
We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete…