搜索结果: 1-13 共查到“管理学 M/M/1 Queue”相关记录13条 . 查询时间(0.063 秒)
Convex Optimization of Output Link Scheduling and Active Queue Management in QoS Constrained Packet Switches
Convex Optimization Output Link Scheduling Active Queue Management QoS Constrained Packet Switches
2015/7/10
We present two novel algorithms at the ingress and egress of packet switches with QoS provisioning and fairness constraints. We first provide a suite of generalized weighted fair queuing formulations ...
Nonparametric Estimation of Tail Probabilities for the Single-Server Queue
Nonparametric Estimation Tail Probabilities Single-Server Queue
2015/7/8
We consider the estimation of tail probabilities in queues via the nonparametric estimator constructed by simple computing the observed fraction of time that the queue is out in the tail. We show that...
Parametric Estimation of Tail Probabilities for the Single-Server Queue
Parametric Estimation Tail Probabilities Single-Server Queue
2015/7/8
In this chapter, we consider the question of how long the arrival process to the single-server queue needs to be observed in order to accurately estimate the long-run fraction of time that the workloa...
On the Maximum Workload of a Queue Fed by Fractional Brownian Motion
Long-range dependence queues fractional Brownian motion extreme values
2015/7/8
Consider a queue with a stochastic fluid input process modeled as fractional Brownian motion (fBM). When the queue is stable, we prove that the maximum of the workload process observed over an interva...
A Diffusion Approximation for a Markovian Queue with Reneging
Markovian queues reneging impatience deadlines refl ected Ornstein–Uhlenbeck process
2015/7/8
Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establ...
A Diffusion Approximation with a GI/GI/1 Queue with Balking or Reneging
deadlines reneging balking impatience GI/GI/1-GI queue Ornstein-Uhlenbeck process
2015/7/6
Consider a single-server queue with a renewal arrival process and generally distributed processing times in which each customer independently reneges if service has not begun within a generally distri...
Fluid Heuristics, Lyapunov Bounds, and Efficient Importance Sampling for a Heavy-tailed G/G/1 Queue
State-dependent importance sampling Rare-event simulation Heavy-tails
2015/7/6
We develop a strongly efficient rare-event simulation algorithm for computing the tail of the steady-state waiting time in a single server queue with regularly varying service times. Our algorithm is ...
On the Dynamics of a Finite Buffer Queue Conditioned on the Amount of Loss
Dynamics Finite Buffer Queue Conditioned Amount of Loss
2015/7/6
This paper is concerned with computing large deviations asymptotics for the loss process in a stylized queueing model that is fed by a Brownian input process. In addition, the dynamics of the queue, c...
Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times
Uniform approximations M/G/1 queue subexponential distributions heavy traffi c heavy tails Cram′er series
2015/7/6
This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflo...
On the Transition from Heavy Traffic to Heavy Tails for the M/G/1 Queue: The Regularly Varying Case
M/G/1 queue heavy traffi c heavy tails uniform approximations large deviations
2015/7/6
Two of the most popular approximations for the distribution of the steady-state waiting time, W∞, of the M/G/1 queue are the socalled heavy-traffic approximation and heavy-tailed asymptotic, respectiv...
Large Deviations for the Empirical Mean of an M/M/1 Queue
Large Deviations Empirical Mean M/M/1 Queue
2015/7/6
The theory of large deviations for random walks is important both in its own right and as a starting point for establishing large deviations for more complex models (such as ìsmall noiseîdi§usion...
Heavy traffic limit theorems for a queue with Poisson ON/OFF long-range dependent sources and general service time distribution
reflecting fractional Brownian motion reflecting Gaussian process longrange dependence queueing process weak convergence
2011/6/21
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 pr...
The M-G-1 retrial queue：An information theoretic approach
Principle of maximum entropy M-G-1 retrial queue limiting distribution busy period waiting time
2009/2/23
In this paper, we give a survey of the use of information theoretic techniques for the estimation of the main performance characteristics of the M/G/1 retrial queue. We focus on the limiting distribut...