A Discrete-Time Queueing Model with Service Upgrade

Article Preview

Abstract:

In this paper we analyze a discrete-time queueing system where the server decides whento upgrade the service depending on the information carried by the incoming message. We carry outan extensive analysis of the system developing recursive formulae and generating functions for thestationary distribution of the number of customers in the queue, the system, the busy period and thesojourntimeas well as some numerical examples.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

806-811

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] H. Bruneel and B.G. Kim: Discrete-time Models for Communication Systems Including ATM. Kluwer Academic Publishers, Boston. (1993).

Google Scholar

[2] M.E. Woodward: Communication and Computer Networks: Modelling with Discrete-time Queues. IEEE Computer Society Press, California. (1994).

Google Scholar

[3] T. Meisling: Discrete time queueing theory. Operations Research. V. 6. (1958). pp.96-105.

Google Scholar

[4] T. Birdsall, M. Ristenbatt and S. Weinstein: Analysis of asynchronous time multiplexing of speech sources. IRE Transactions on Communication Systems. V. 10. (1962). pp.390-397.

DOI: 10.1109/tcom.1962.1088694

Google Scholar

[5] J. Hunter: Mathematical Techniques of Applied Probability. Operations Research and Industrial Engineering. Academic Press, New York. V. 1. (1983).

Google Scholar

[6] J. Hunter: Mathematical Techniques of Applied Probability, Discrete-Time Models: Techniques and Applications. Operations Research and Industrial Engineering. Academic Press, New York, V. 2. (1983).

Google Scholar

[7] I. Atencia and A. V. Pechinkin: A discrete-time queueing system with optional LCFS discipline. Ann Oper Res. 202, (2012). pp.3-17.

DOI: 10.1007/s10479-012-1097-2

Google Scholar

[8] P.P. Bocharov, C. D'Apice, A.V. Pechinkin and S. Salerno: Queueing Theory. Utrecht, Boston: VSP (2004). pp.22-29.

Google Scholar