Technical Note: The MAP t / Ph t /∞ Queueing System and Multiclass [ MAP t / Ph t /∞] K Queueing Network

Ira Gerhardt (), Barry L. Nelson () and Michael R. Taaffe ()
Additional contact information
Ira Gerhardt: Department of Mathematics, Manhattan College, Riverdale, New York 10471
Barry L. Nelson: Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208
Michael R. Taaffe: Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, Virginia 24061

INFORMS Journal on Computing, 2017, vol. 29, issue 2, 367-376

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.

Keywords: queues; queueing; algorithms; phase-type distribution; nonstationary processes; infinite server; MAP s; queueing networks; time-dependent; transient (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1287/ijoc.2016.0736 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:29:y:2017:i:2:p:367-376

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().