Abstract
We show a discrete-time queuing model to represent a single server queue with constant service rate and N bursty different input processes. The arrival process is modeled by an Interrupted Bernoulli Process. We propose an approximation algorithm to solve this queuing system. The algorithm is based on aggregation technique of input processes, reducing the state space of the Markov Chain. We validate the algorithm by comparing the results with simulation results. In addition, we explain briefly a continuous-time queuing model of the same case. © Springer-Verlag 2004.
Cite
CITATION STYLE
Hong, S., Chung, T. S., Ryu, Y., Jang, H. S., & Lee, C. K. (2004). An Approximation Algorithm for a Queuing Model with Bursty Heterogeneous Input Processes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3314, 252–257. https://doi.org/10.1007/978-3-540-30497-5_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
