Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
KPC-Toolbox: best recipes toward automatization of workload fitting
ACM SIGMETRICS Performance Evaluation Review
Trace data characterization and fitting for Markov modeling
Performance Evaluation
KPC-Toolbox: Best recipes for automatic trace fitting using Markovian Arrival Processes
Performance Evaluation
Quasi-birth-and-death processes with restricted transitions and its applications
Performance Evaluation
Optimal threshold control by the robots of web search engines with obsolescence of documents
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probability in the Engineering and Informational Sciences
An EM algorithm for platoon arrival processes in discrete time
Operations Research Letters
Hi-index | 0.00 |
We show that the autocorrelation sequence of interarrival times for a Markovian arrival process (MAP) of order two is geometric. We determine the set of feasible values for the autocorrelation decay parameter and the first two or three moments of the interarrival time distribution. A method is derived for matching these parameters to a MAP of order two and some numerical examples are included to illustrate approximating higher dimensional MAPs by two dimensional ones. The numerical examples have helped us pose important questions regarding the significance of correlation in a MAP of order two when it is used as input to a queueing model.