Introduction to queueing theory (2nd ed)
Introduction to queueing theory (2nd ed)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
M/M/1 Queue with Impatient Customers of Higher Priority
Queueing Systems: Theory and Applications
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System
Queueing Systems: Theory and Applications
Hard deadline queueing system with application to unified messaging service
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
On the Two-Class M/M/1 System under Preemptive Resume and Impatience of the Prioritized Customers
Queueing Systems: Theory and Applications
Optimal control of parallel queues with impatient customers
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
The Journal of Supercomputing
Stationary delays for a two-class priority queue with impatient customers
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Performance of a speculative transmission scheme for scheduling-latency reduction
IEEE/ACM Transactions on Networking (TON)
Stochastic DVS-based dynamic power management for soft real-time systems
Microprocessors & Microsystems
Fault-aware grid scheduling using performance prediction by workload modeling
The Journal of Supercomputing
The stationary workload of the G/M/1 queue with impatient customers
Queueing Systems: Theory and Applications
Tail asymptotics for waiting time distribution of an M/M/s queue with general impatient time
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
Computers and Electrical Engineering
Journal of Network and Computer Applications
Modeling the impact of control plane losses on the performance of optical burst switched core node
IEEE Communications Letters
A heuristic adaptive QoS prediction scheme in single-hop passive star coupled WDM optical networks
Journal of Network and Computer Applications
Analysis of a dynamic assignment of impatient customers to parallel queues
Queueing Systems: Theory and Applications
Packet skipping and network coding for delay-sensitive network communication
Performance Evaluation
Analysis of an $$M/M/1+G$$M/M/1+G queue operated under the FCFS policy with exact admission control
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We study queueing systems where customers have strict deadlines until the beginning of their service. An analytic method is given for the analysis of a class of such queues, namely, M(n)/M/m/{\rm FCFS} + {\rm G} models. These are queues with state-dependent Poisson arrival process, exponential service times, multiple servers, FCFS service discipline, and general customer impatience. The state of the system is viewed to be the number of customers in the system. The principal measure of performance is the probability measure induced by the offered waiting time. Other measures of interest are the probability of missing deadline and the probability of blocking. Closed-form solutions are derived for the steady-state probabilities of the state process and some important modeling variables and parameters. The efficacy of our method is illustrated through a numerical example.