Technical Note: The MAPt
          /Pht
        /8 Queueing System and Multiclass [MAPt
      /Pht
    /8]
    K
   Queueing Network

Technical Note: The MAPt /Pht /8 Queueing System and Multiclass [MAPt /Pht /8] K Queueing Network

0.00 Avg rating0 Votes
Article ID: iaor20171393
Volume: 29
Issue: 2
Start Page Number: 367
End Page Number: 376
Publication Date: May 2017
Journal: INFORMS Journal on Computing
Authors: , ,
Keywords: queues: theory, networks, programming: network
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 Pht /Pht /∞ queueing system and [Pht /Pht /∞] K queueing network may be implemented to capture the effect of autocorrelation that may be present in arrivals to the more general MAPt /Pht /∞ queueing system and multiclass [MAPt /Pht /∞] K queueing network. The MAPt is more general than the Pht 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.

Reviews

Required fields are marked *. Your email address will not be published.