A queueing model for optimal control of partial buffer sharing in ATM
From MaRDI portal
Recommendations
Cites work
- 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
- Analysis of a finite buffer queue with different scheduling and push-out schemes
- Computing steady state probabilities in λ(n)/G/1/K queue
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- Poisson Arrivals See Time Averages
- Priority queues
- Stochastic models of space priority mechanisms with Markovian arrival processes
Cited in
(10)- A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM
- Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy
- A queueing model for error control of partial buffer sharing in ATM
- A general analytical model of queuing system for Internet of Things applications
- Discrete-time queueing models with feedback for input-buffered ATM switches
- Study on optimal queue-length-threshold scheduling policy for an ATM multiplexer with finite buffers and batch Poisson arrivals
- A new charging scheme for ATM based on QoS
- ANALYSIS OF A DYNAMIC ASSIGNMENT QUEUEING MODEL WITH POISSON CLUSTER ARRIVAL PROCESSES
- scientific article; zbMATH DE number 2247801 (Why is no real title available?)
- A preemptive discrete-time priority buffer system with partial buffer sharing
This page was built for publication: A queueing model for optimal control of partial buffer sharing in ATM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265846)