A queueing model with independent arrivals, and its fluid and diffusion limits
From MaRDI portal
Publication:2352995
directional derivatives\(M_1\) topologydiffusion limitsfluid limitsdistributional approximationstransient queueing systems
Diffusion processes (60J60) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Brownian motion (60J65) Functional limit theorems; invariance principles (60F17)
Abstract: We introduce the {Delta}(i)/GI/1 queue, a new queueing model. In this model, customers from a given population independently sample a time to arrive from some given distribution F. Thus, the arrival times are an ordered statistics, and the inter-arrival times are differences of consecutive ordered statistics. They are served by a single server which provides service according to a general distribution G, with independent service times. The exact model is analytically intractable. Thus, we develop fluid and diffusion limits for the various stochastic processes, and performance metrics. The fluid limit of the queue length is observed to be a reflected process, while the diffusion limit is observed to be a function of a Brownian motion and a Brownian bridge process, and is given by a 'netput' process and a directional derivative of the Skorokhod reflected fluid netput in the direction of a diffusion refinement of the netput process. We also observe what may be interpreted as a transient Little's law. Sample path analysis reveals various operating regimes where the diffusion limit switches between a free diffusion, a reflected diffusion process and the zero process, with possible discontinuities during regime switches. The weak convergence is established in the M1 topology, and it is also shown that this is not possible in the J1 topology.
Recommendations
- Fluid limit of generalized Jackson queueing networks with stationary and ergodic arrivals and service times
- Fluid approximations for a processor-sharing queue
- Large finite population queueing systems: The single-server model
- A Diffusion Approximation for the G/GI/n/m Queue
- On the fluid limit of the \(M / G /\infty\) queue
Cites work
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 3124312 (Why is no real title available?)
- scientific article; zbMATH DE number 3793182 (Why is no real title available?)
- scientific article; zbMATH DE number 51724 (Why is no real title available?)
- scientific article; zbMATH DE number 3569568 (Why is no real title available?)
- scientific article; zbMATH DE number 3228674 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A many-server fluid limit for the \(G_t/GI/s_t +GI\) queueing model experiencing periods of overloading
- Asymptotic Analysis of the Time Dependent M/M/1 Queue
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Critical epidemics, random graphs, and Brownian motion with a parabolic drift
- Directional derivatives of oblique reflection maps
- Large finite population queueing systems: The single-server model
- On many-server queues in heavy traffic
- Probability. Theory and examples.
- Queues with time-dependent arrival rates. III — A mild rush hour
- Random graph dynamics
- Strategic arrivals into queueing networks: the network concert queueing game
- Strong Approximations for Time-Dependent Queues
- The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue
- The concert queueing game: to wait or to be late
- The final size of a nearly critical epidemic, and the first passage time of a Wiener process to a parabolic barrier
- Time-Dependent Queues
Cited in
(19)- Heavy-traffic analysis through uniform acceleration of queues with diminishing populations
- Diffusion models for double-ended queues with renewal arrival processes
- Big jobs arrive early: from critical queues to random graphs
- An alternative approach to heavy-traffic limits for finite-pool queues
- Subdiffusive load balancing in time-varying queueing systems
- Finite-pool queueing with heavy-tailed services
- On directional derivatives of Skorokhod maps in convex polyhedral domains
- A data-driven model of an appointment-generated arrival process at an outpatient clinic
- A many-server functional strong law for a non-stationary loss model
- Rare events of transitory queues
- Strong embeddings for transitory queueing models
- Infinite server queues in a random fast oscillatory environment
- Weighted Dyck paths and nonstationary queues
- Queues with path-dependent arrival processes
- Asymptotically optimal appointment schedules
- Fluid and diffusion limits for queues in slowly changing environments
- Equilibrium arrival times to a queue with order penalties
- Using robust queueing to expose the impact of dependence in single-server queues
- Heavy-traffic limits for a single-server queue leading up to a critical point
This page was built for publication: A queueing model with independent arrivals, and its fluid and diffusion limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352995)
