Technical Note: TheMAPt/Pht/∞ Queueing System and Multiclass [MAPt/Pht/∞]KQueueing Network
Ira Gerhardt, Barry L. Nelson, Michael R. Taaffe
INFORMS Journal on Computing · 2017 · Volume 29 · Issue 2
Abstract
In this paper we demonstrate how a key adjustment to known numerically exact methods for evaluating time-dependent moments of the number of entities in the Ph t / Ph t /∞ queueing system and [ Ph t / Ph t /∞] K queueing network may be implemented to capture the effect of autocorrelation that may be present in arrivals to the more general MAP t / Ph t /∞ queueing system and multiclass [ MAP t / Ph t /∞] K queueing network. The MAP t is more general than the Ph t arrival process in that it allows for stationary nonrenewal point processes, as well as the time-dependent generalization of nonrenewal point processes. Modeling real-world systems with bursty arrival processes such as those in telecommunications and transportation, for example, necessitate the use of nonrenewal processes. Finally, we show that the covariance of the number of entities at different nodes and times may be described by a single closed differential equation. The online supplement is available at https://doi.org/10.1287/ijoc.2016.0736 .
Keywords
queues, queueing, algorithms, phase-type distribution, nonstationary processes, infinite server, MAPs, queueing networks, time-dependent, transient
Enable JavaScript for citation tools and additional paper interactions.