Transient Solution of Multiple Vacation Queue with Discouragement and Feedback

Abstract

The congestion problems with processor vacations have confronted with increasing intricacy, and their explicit transient solutions are exceptionally hard to compute. The transient solution is more significant for studying the dynamical behavior of computing systems over a finite period and predominantly utilizes within the state-of-the-art design architect for a real-time I/O system. Motivated from this, we adopt the mathematical concepts, namely continued fractions and generating function, to derive explicit expressions for transient-state probabilities. Transient-state probabilities of the processing delay problem with a single processor which adopts the multiple vacations policy to save power consumption and thermal trip error with discouragement and feedback are obtained in terms of modified Bessel functions using the properties of the confluent hypergeometric function. Due to the inaccessibility of processor, discouragement behaviors balking and reneging of the job requests are prone to exhibit. Routing back for the service feedback for the processed job request is also critical to maintaining the quality of service (QoS). For the glance of the I/O system performance, the expected value of the state of the computing system using stationary queue-size distribution is also derived.

Optimizing Resource Allocation in M/M/1/N Queues with Feedback, Discouraged Arrivals, and Reneging for Enhanced Service Delivery

“…In the past, many research papers concerning the queueing model of feedback (cf. [3,[5][6][7]). The single-server Markovian queue with discouraged arrivals, commonly found in daily queueing situations, has been extensively studied due to its finite waiting space.…”