Approximations of general discrete time queues by discrete time queues with arrivals modulated by finite chains

DOI10.2307/1427853zbMATH Open0903.60082OpenAlexW4249099662MaRDI QIDQ4385149FDOQ4385149

Authors: Vinod Sharma 

Publication date: 5 January 1999

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427853

Recommendations

• scientific article; zbMATH DE number 4159820
• On a discrete modified $M/GI/c/\infty$ queue
• Approximation of periodic queues
• scientific article; zbMATH DE number 1264423
• Analysis of discrete-time queues with general service demands and finite-support service capacities
• On finite capacity queues with time dependent arrival rates
• Approximations for Superposition Arrival Processes in Queues
• Generating function approach for discrete queueing analysis with decomposable arrival and service markov chains

zbMATH Keywords

marked point processesdiscrete time queuesstationary moments

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (3)

• Markov approximations to D-BMAPs: Information theoretic bounds on queueing performance
• Markovian early arrival discrete time Jackson networks
• Approximation of periodic queues

This page was built for publication: Approximations of general discrete time queues by discrete time queues with arrivals modulated by finite chains

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