IEEE/ACM Transactions on Networking (TON)
Discrete-time multiserver queues with priorities
Performance Evaluation
Achieving differentiated services through multi-class probabilistic priority scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
A performance analysis of a discrete-time priority queueing system with correlated arrivals
Performance Evaluation
Multi-Server Queueing Systems with Multiple Priority Classes
Queueing Systems: Theory and Applications
A matrix-analytic solution for the DBMAP/PH/1 priority queue
Queueing Systems: Theory and Applications
Analyzing priority queues with 3 classes using tree-like processes
Queueing Systems: Theory and Applications
Analysis of a nonpreemptive priority queue with exponential timer and server vacations
Performance Evaluation
On priority queues with priority jumps
Performance Evaluation
Performance of a partially shared priority buffer with correlated arrivals
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
The transient solution to M/Ek/1 queue
Operations Research Letters
Design and analysis of a bandwidth management framework for ATM-based broadband ISDN
IEEE Communications Magazine
Priority queue schedulers with approximate sorting in output-buffered switches
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Using singularity analysis to approximate transient characteristics in queueing systems
Probability in the Engineering and Informational Sciences
Performance analysis of priority queueing systems in discrete time
Network performance engineering
| Hi-index | 0.00 |
We present the transient analysis of the system content in a two-class discrete-time M^X/D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples.