相关论文: Gaussian Limits for Scheduled Traffic with Super-H…

A "scheduled" arrival process is one in which the n th arrival is scheduled for time n, but instead occurs at a different time. The difference between the scheduled time and the arrival time is called the perturbation. The sequence of…

A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…

Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail,…

We consider the FCFS G/G/n queue in the Halfin-Whitt regime, in the presence of heavy-tailed distributions (i.e. infinite variance). We prove that under minimal assumptions, i.e. only that processing times have finite 1 + epsilon moment and…

The infinite source Poisson arrival model with heavy-tailed workload distributions has attracted much attention, especially in the modeling of data packet traffic in communication networks. In particular, it is well known that under…

In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service…

We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is…

Fractional Brownian motion is a Gaussian process x(t) with zero mean and two-time correlations <x(t)x(s)> ~ t^{2H} + s^{2H} - |t-s|^{2H}, where H, with 0<H<1 is called the Hurst exponent. For H = 1/2, x(t) is a Brownian motion, while for H…

Fractional Brownian motion is a non-Markovian Gaussian process $X_t$, indexed by the Hurst exponent $H$. It generalises standard Brownian motion (corresponding to $H=1/2$). We study the probability distribution of the maximum $m$ of the…

Fractional Brownian motion (fBm) emerged as a useful model for self-similar and long-range dependent Internet traffic. Approximate performance measures are known from large deviations theory for single queuing systems with fBm through…

We consider a model for transitory queues in which only a finite number of customers can join. The queue thus operates over a finite time horizon. In this system, also known as the $\Delta_{(i)}/G/1$ queue, the customers decide…

We investigate first and second order fluctuations of additive functionals of a fractional Brownian motion (fBm) of the form \begin{align}\label{eq:abstractmain} Z_n=\left\{\int_{0}^{t}f(n^{H}(B_{s}-\lambda))ds\ ; t\geq 0 \right\}…

We prove a heavy traffic scaling limit for a shortest remaining processing time queue. We are interested in the case where the processing time distribution has a tail that decays rapidly, i.e., has light tails. In particular, we revisit the…

Fractional Brownian motion (fBm) is an important scale-invariant Gaussian non-Markovian process with stationary increments, which serves as a prototypical example of a system with long-range temporal correlations and anomalous diffusion.…

Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic…

We study a single server queue operating under the shortest remaining processing time (SRPT) scheduling policy; that is, the server preemptively serves the job with the shortest remaining processing time first. In this work we are…

We consider a stationary fluid queue with fractional Brownian motion input. Conditional on the workload at time zero being greater than a large value $b$, we provide the limiting distribution for the amount of time that the workload process…

We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…

We study a single-server Markovian queueing model with $N$ customer classes in which priority is given to the shortest queue. Under a critical load condition, we establish the diffusion limit of the workload and queue length processes in…

We consider the FCFS $GI/GI/n$ queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exist $\epsilon_1,…