A queueing model for optimal control of partial buffer sharing in ATM
From MaRDI portal
Publication:1265846
DOI10.1016/S0305-0548(97)00044-0zbMath0906.90066MaRDI QIDQ1265846
Publication date: 27 September 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00044-0
90B18: Communication networks in operations research
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic models of space priority mechanisms with Markovian arrival processes
- A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
- A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
- Priority queues
- Computing steady state probabilities in λ(n)/G/1/K queue
- Poisson Arrivals See Time Averages
- Analysis of a finite buffer queue with different scheduling and push-out schemes