References

• 2003THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM1,993 cited
• 1999Introduction to Matrix Analytic Methods in Stochastic Modeling1,988 cited
• 1998Queueing Networks and Markov Chains938 cited
• 2006Queueing Networks and Markov Chains932 cited
• 1987Introduction to Queueing Networks688 cited
• 1988A stable recursion for the steady state vector in markov chains of m/g/1 type285 cited
• 2000Introduction to Matrix Analytic Methods in Stochastic Modeling285 cited
• 1993Marked point processes as limits of Markovian arrival streams234 cited
• 1979Some Extensions to Multiclass Queueing Network Analysis166 cited
• 2007A minimal representation of Markov arrival processes and a moments matching method152 cited
• 1998Markov chains with marked transitions11This research was supported in part by Grant No. DMI-930628 from the National Science Foundation and the K.C. Wang Education Foundation.129 cited
• 2006Structured Markov chains solver73 cited
• 1998Matrix-geometric solution of discrete time MAP/PH/1 priority queue67 cited
• 2001The Versatility of MMAP[K] and the MMAP[K]/G[K]/1 Queue36 cited
• 2005Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation