A note on the discretization of Little's result

DOI10.1016/S0167-6377(01)00112-2MaRDI QIDQ1611995zbMATH OpenFDO

Authors Dieter Fiems, Herwig Bruneel

Publication date 28 August 2002

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6377(01)00112-2

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application
• An analytical interpretation of the discrete approximation for the GI/GI/1 queue¹
• Discrete-time queuing theory
• A note on a pathwise version of Little's formula
• The effect of using discrete time units in queueing simulation

Cites work

• A Proof for the Queuing Formula: L = λW
• A review of L= W and extensions
• scientific article; zbMATH DE number 708985 (Why is no real title available?)
• Rate conservation principle for discrete-time queues

Cited in

(19)

• Delay and partial system contents for a discrete-time G-D-c queue
• Calculation of delay characteristics for multiserver queues with constant service times
• Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation
• A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline
• Class clustering destroys delay differentiation in priority queues
• Effect of global FCFS and relative load distribution in two-class queues with dedicated servers
• The discrete-time preemptive repeat identical priority queue
• Performance analysis of buffers with train arrivals and correlated output interruptions
• On the variances of system size and sojourn time in a discrete-time \(DAR(1)/D/1\) queue
• Discrete-time queues with variable service capacity: a basic model and its analysis
• Impact of class clustering in a multiclass FCFS queue with order-dependent service times
• Periodic Little's law
• A two-class global FCFS discrete-time queueing model with arbitrary-length constant service times
• Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service
• Analysis of a threshold-based priority queue
• Queueing models for the analysis of communication systems
• A preemptive repeat priority queue with resampling: performance analysis
• Analysis of a discrete-time queue with general independent arrivals, general service demands and fixed service capacity
• A queueing model for general group screening policies and dynamic item arrivals

This page was built for publication: A note on the discretization of Little's result

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611995)