Search Results

1 - 4 of 4 items :

  • "single vacation" x
Clear All
A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

References Bratiichuk, M.S. (2000). Exact formulas for Eθ/G/1/N-type queueing systems, Ukrainian Mathematical Journal 8(52): 1034-1044. Bratiichuk, M.S. and Kempa, W.M. (2003). Application of the superposition of renewal processes to the study of batch arrival queues, Queueing Systems 1(44): 51-67. Choudhury, G. (2002). A batch arrival queue with a vacation time under single vacation policy, Computers and Operations Research 13(29): 1941-1955. Chydziński, A. and Chróst, Ł. (2011). Analysis of AQM

Open access
Performance and economic analysis of Markovian Bernoulli feedback queueing system with vacations, waiting server and impatient customers

Abstract

This paper concerns the analysis of a Markovian queueing system with Bernoulli feedback, single vacation, waiting server and impatient customers. We suppose that whenever the system is empty the sever waits for a random amount of time before he leaves for a vacation. Moreover, the customer’s impatience timer depends on the states of the server. If the customer’s service has not been completed before the impatience timer expires, the customer leaves the system, and via certain mechanism, impatient customer may be retained in the system. We obtain explicit expressions for the steady-state probabilities of the queueing model, using the probability generating function (PGF). Further, we obtain some important performance measures of the system and formulate a cost model. Finally, an extensive numerical study is illustrated.

Open access
Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping

processor sharing and limited memory under control of the AQM mechanism, Automation and Remote Control 76(10): 1784-1796. Woźniak, M., Kempa, W.M., Gabryel, M. and Nowicki, R.K. (2014). A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning, International Journal of Applied Mathematics and Computer Science 24(4): 887-900, DOI: 10.2478/amcs-2014-0065. Xiong, N., Yang, Y., Defago, X. and He, Y. (2005). LRC-RED: A self-tuning robust and adaptive AQM scheme, Proceedings of the 6th International

Open access
From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times

Journal on Selected Areas in Communications 29(4): 757-769. White, H. and Christie, L. (1958). Queuing with preemptive priorities or with breakdown, Operations Research 6(1): 79-95. Woźniak, M., Kempa, W.M., Gabryel, M. and Nowicki, R.K. (2014). A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning, International Journal of Applied Mathematics and Computer Science 24(4): 887-900, DOI: 10.2478/amcs-2014-0065. Wu, K., McGinnis, L. and Zwart, B. (2011). Queueing models for a

Open access