Analysis of single working vacation in GI\(/M/1/N\) and GI\(/M/1/\infty \) queueing systems

DOI10.1504/IJOR.2010.032111zbMath1185.90039OpenAlexW2088139910MaRDI QIDQ969390

Abhijit Datta Banik

Publication date: 7 May 2010

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2010.032111

zbMATH Keywords

communication networkssingle working vacationqueueing modelsfinite bufferscomputer networksGI\(/M/1\) queueinfinite buffers

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (2)

Performance analysis of a Markovian queue with impatient customers and working vacation ⋮ A recursive algorithm for state dependent \(GI/M/1/N\) queue with Bernoulli-schedule vacation

This page was built for publication: Analysis of single working vacation in GI\(/M/1/N\) and GI\(/M/1/\infty \) queueing systems