(N, n)-preemptive-priority M/G/1 queues with finite and infinite buffers
From MaRDI portal
Publication:2138338
Recommendations
- scientific article; zbMATH DE number 6747326
- A preemptive discrete-time priority buffer system with partial buffer sharing
- Analysis of a finite buffer with non-preemptive priority scheduling
- Analysis of preemptive loss priority queues with preemption distance
- scientific article; zbMATH DE number 1783878
Cites work
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- A queueing system with probabilistic joining strategy for priority customers
- Influence of real-time queue capacity on system contents in DiffServ's expedited forwarding per-hop-behavior
- Investigation of the \(M_2/G_2/1/\infty ,N\) queue with restricted admission of priority customers and its application to HSDPA mobile systems
- Reducing Delay in Preemptive Repeat Priority Queues
- The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System
- \(T\)-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks
Cited in
(4)- \(T\)-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks
- On the \(M_2/G/_2/1/\infty\) queue with relative dynamic priorities
- scientific article; zbMATH DE number 7736698 (Why is no real title available?)
- Analysis of the M/M/N/N queue with two types of arrival process: applications to future mobile radio systems
This page was built for publication: \((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138338)
