Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
The departure process of an N/G/1 queue
Performance Evaluation
Data networks (2nd ed.)
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
ATM user-network interface specification (version 3.0)
ATM user-network interface specification (version 3.0)
ATM: theory and application
Wide-area traffic: the failure of Poisson modeling
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Computer networks (3rd ed.)
Connection-wise end-to-end performance analysis of queuing networks with MMPP inputs
Performance Evaluation
Teletraffic Technologies in ATM Networks
Teletraffic Technologies in ATM Networks
On the departure process of a leaky bucket system with long-range dependent input traffic
Queueing Systems: Theory and Applications
Wideband local access: wireless LAN and wireless ATM
IEEE Communications Magazine
Matrix-geometric solutions of M/G/1-type Markov chains: a unifying generalized state-space approach
IEEE Journal on Selected Areas in Communications
Departure Processes of BMAP/G/1 Queues
Queueing Systems: Theory and Applications
Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks
Traffic splitting in a network: split traffic models and applications
Computer Communications
| Hi-index | 0.00 |
This paper proposes a unified matrix-analytic approach to characterize the output processes of general discrete-time lossless/lossy queueing systems in which time is synchronized/slotted into fixed length intervals called slots. The arrival process can be continuous- or discrete-time Markovian processes. It can be either renewal or non-renewal. The service of a customer commences at the beginning of a slot, consumes a random number of slots, and completes at the end of a later slot. The service times are independent and follow a common and general distribution. Systems with and without server vacations are both treated in this paper. These queueing systems have potential applications in asynchronous transfer mode (ATM) networks, packet radio networks, etc. Since the output process of a node in a queueing network becomes an input process to some node at the next stage, the results of this paper can be used to facilitate end-to-end performance analysis which has attracted more and more attention in the literature.