Related papers: Queuing models with Mittag-Leffler inter-event tim…
In this article a special case of an M/G/2-queue is considered, where the two servers are exposed to two types of jobs that are distributed among the servers via a random switch. In this model the asymptotic behaviour of the workload buffer…
This work focuses on quantitative representation of transport in systems with quenched disorder. Explicit mapping of the quenched trap model to continuous time random walk is presented. Linear temporal transformation: $t\to…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
We study the non-equilibrium dynamics of the Luttinger model after a quantum quench, when the initial state is a finite temperature thermal equilibrium state. The diagonal elements of the density matrix in the steady state show thermal…
Animals learn the timing between consecutive events very easily. Their precision is usually proportional to the interval to time (Weber's law for timing). Most current timing models either require a central clock and unbounded accumulator…
We reinterpret and generalize conjectures of Lam and Williams as statements about the stationary distribution of a multispecies exclusion process on the ring. The central objects in our study are the multiline queues of Ferrari and Martin.…
Given two probability measures on sequential data, we investigate the transport problem with time-inconsistent preferences in a discrete-time setting. Motivating examples are nonlinear objectives, state-dependent costs, and regularized…
We investigate a traffic model in which cars either move freely with quenched intrinsic velocities or belong to clusters formed behind slower cars. In each cluster, the next-to-leading car is allowed to pass and resume free motion. The…
The totally asymmetric exclusion process (TASEP) with periodic boundaries is considered as traffic flow model. The large-L approximation of the stationary state is used for the derivation of the time-headway distribution (an important…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
The presented study elaborates a multi-server priority queueing model considering the pre-emptive repeat policy and phase-type distribution (PH) for retrial process. The incoming heterogeneous calls are categorized as handoff calls and new…
The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…
We investigate the tail behaviour of the steady state distribution of a stochastic recursion that generalises Lindley's recursion. This recursion arises in queuing systems with dependent interarrival and service times, and includes…
We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…
Aggregations are emergent features common to many biological systems. Mathematical models to understand their emergence are consequently widespread, with the aggregation-diffusion equation being a prime example. Here we study the…
Exact analytic calculations in spin-1/2 XY chains, show the presence of long-time tails in the asymptotic dynamics of spatially inhomogeneous excitations. The decay of inhomogeneities, for $t\to \infty $, is given in the form of a power law…
In this paper we study a class of Quasi-Skipfree (QSF) processes where the transition rate submatrices in the skipfree direction have a column times row structure. Under homogeneity and irreducibility assumptions we show that the stationary…
We analyze opportunistic schemes for transmission scheduling from one of $n$ homogeneous queues whose channel states fluctuate independently. Considered schemes consist of the LCQ policy, which transmits from a longest connected queue in…
We consider the problem of packet scheduling in single-hop queueing networks, and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric we use the delay stability of traffic flows: a…
We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class…