A direct approach to sojourn times in a busy period of an M/M/1 queue
From MaRDI portal
Publication:2432276
DOI10.1007/S11134-006-6989-XzbMATH Open1120.90007OpenAlexW2046788383MaRDI QIDQ2432276FDOQ2432276
Authors: Arzad A. Kherani 
Publication date: 25 October 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-006-6989-x
Recommendations
- scientific article; zbMATH DE number 4070005
- A new approach to the busy period of the M/M/1 queue
- On the Busy Period of an M/G/1/K Queue
- Evaluating mean sojourn time estimates for the \(M/M/1\) queue
- About the sojourn time process in multiphase queueing systems
- On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
- Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Services within a busy period of an M/M/1 queue and Dyck paths
- The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions
- Impact of mobility on the performance of relaying in ad hoc networks - extended version
Cited In (4)
- Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
- An Approximate Analysis of Sojourn Times in the M/G/1 Queue With Round-Robin Service Discipline
- A new approach to the busy period of the M/M/1 queue
- Services within a busy period of an M/M/1 queue and Dyck paths
This page was built for publication: A direct approach to sojourn times in a busy period of an \(M/M/1\) queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432276)
