Title
An approximation algorithm for a queuing model with bursty heterogeneous input processes
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.
Year
DOI
Venue
2004
10.1007/978-3-540-30497-5_40
CIS
Keywords
Field
DocType
single server queue,arrival process,bursty heterogeneous input process,n bursty different input,aggregation technique,simulation result,constant service rate,markov chain,input process,approximation algorithm,interrupted bernoulli process,discrete time,queuing system,state space
Approximation algorithm,Mathematical optimization,Arrival process,Computer science,Queue,Bernoulli process,Markov chain,Algorithm,Queueing theory,Queue management system,State space
Conference
Volume
ISSN
ISBN
3314
0302-9743
3-540-24127-2
Citations 
PageRank 
References 
0
0.34
5
Authors
5
Name
Order
Citations
PageRank
Sugwon Hong1447.90
Tae-Sun Chung280870.33
Yeonseung Ryu313618.93
Hyuksoo Jang492.97
Chung Ki Lee562.44