A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM

DOI10.1016/S0305-0548(98)00059-8zbMath0933.90015OpenAlexW2038366847MaRDI QIDQ1302725

V. Pereyra

Publication date: 22 September 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00059-8

zbMATH Keywords

discrete-time queueing systemloss probabilitiessteady-state probabilitiesbuffer control

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (6)

The queue GeoX/G/1/N+1 revisited ⋮ A discrete-time queue with preferred customers and partial buffer sharing ⋮ The queue \(\mathrm{Geo}/\mathrm{G}/1/N + 1\) revisited ⋮ Analysis of the discrete-time bulk-service queue Geo/G\(^Y\)/1/N+B. ⋮ A preemptive discrete-time priority buffer system with partial buffer sharing ⋮ Performance analysis of finite buffer discrete-time queue with bulk service

This page was built for publication: A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM