Vitalice K. Oduol and C. Ardil
System OverflowBlocking Transients For Queues with Batch Arrivals Using a Family of Polynomials Resembling Chebyshev Polynomials
731 - 737
2012
6
7
International Journal of Electrical and Computer Engineering
https://publications.waset.org/pdf/3687
https://publications.waset.org/vol/67
World Academy of Science, Engineering and Technology
The paper shows that in the analysis of a queuing system with fixedsize batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomials of the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to note is the proportion of the overflow (or blocking) probability resident in the transient component, which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significance of transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads.
Open Science Index 67, 2012