Multipoint communication by hierarchically encoded data
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Statistical multiplexing of VBR sources: a matrix-analytic approach
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
The BMAP/G/1 QUEUE: A Tutorial
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Time-dependent performance analysis of a discrete-time priority queue
Performance Evaluation
A traffic based decomposition of two-class queueing networks with priority service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exact tail asymptotics in a priority queue--characterizations of the preemptive model
Queueing Systems: Theory and Applications
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
Performance Analysis of a Block-Structured Discrete-Time Retrial Queue with State-Dependent Arrivals
Discrete Event Dynamic Systems
Time and space priority in a partially shared priority queue
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Exact tail asymptotics in a priority queue--characterizations of the non-preemptive model
Queueing Systems: Theory and Applications
Probability in the Engineering and Informational Sciences
Efficient analysis of the queue length moments of the MMAP/MAP/1 preemptive priority queue
Performance Evaluation
| Hi-index | 0.00 |
Priority queueing models have been commonly used in telecommunication systems. The development of analytically tractable models to determine their performance is vitally important. The discrete time batch Markovian arrival process (DBMAP) has been widely used to model the source behavior of data traffic, while phase-type (PH) distribution has been extensively applied to model the service time. This paper focuses on the computation of the DBMAP/PH/1 queueing system with priorities, in which the arrival process is considered to be a DBMAP with two priority levels and the service time obeys a discrete PH distribution. Such a queueing model has potential in performance evaluation of computer networks such as video transmission over wireless networks and priority scheduling in ATM or TDMA networks. Based on matrix-analytic methods, we develop computation algorithms for obtaining the stationary distribution of the system numbers and further deriving the key performance indices of the DBMAP/PH/1 priority queue.