Delay and partial system contents for a discrete-time G-D-c queue

DOI10.1007/S10288-007-0043-7zbMath1165.90393OpenAlexW1997173722MaRDI QIDQ1029555

Sabine Wittevrongel, Herwig Bruneel, Peixia Gao

Publication date: 13 July 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0043-7

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ Computational procedures for a class of GI/D/\(k\) systems in discrete time ⋮ Sample-path analysis of general arrival queueing systems with constant amount of work for all customers ⋮ Pricing and setup/closedown policies in unobservable queues with strategic customers

Cites Work

• Unnamed Item
• Unnamed Item
• A review of \(L=\lambda W\) and extensions
• Multiprocessor systems with reserves and preferences
• Analysis of discrete-time multiserver queueing models with constant service times
• A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
• A note on the discretization of Little's result
• A Proof for the Queuing Formula: L = λW
• Deriving delay characteristics from queue length statistics in discrete-time queues with multiple servers
• The Distributional Little's Law and Its Applications
• Technical Note—A Last Word on L = λW
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• On the relation between customer and time averages in queues

This page was built for publication: Delay and partial system contents for a discrete-time G-D-c queue