Entropy maximization and NT vacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size

Authors:
Jau-Chuan Ke;Chuen-Horng Lin;Hsin-I Huang
Affiliations:
Department of Applied Statistics, National Taichung Institute of Technology, Taichung, Taiwan, Republic of China;Department of Information Management, National Taichung Institute of Technology, Taichung, Taiwan, Republic of China;Department of Computer Science and Information Engineering, National Taichung Institute of Technology, Taiwan, Republic of China
Venue:
International Journal of Computer Mathematics
Year:
2009

Citing 8
Cited 0

Maximum entropy and the G/G/1/N queue

Acta Informatica
Poisson input queueing system with startup time and under control-operating policy

Computers and Operations Research
Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
A queue with service interruptions in an alternating random environment

Operations Research
A Poisson input queue under N-policy and with a general start up time

Computers and Operations Research
Optimal (N, T)-policy for M/G/1 system with cost structures

Performance Evaluation
The Analysis of a General Input Queue with N Policy and Exponential Vacations

Queueing Systems: Theory and Applications
Sensitivity analysis of the optimal management policy for a queuing system with a removable and non-reliable server

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the control policy of an M/G/1 queueing system with a startup and unreliable server, in which the length of the vacation period is controlled either by the number of arrivals during the idle period, or by a timer. After all the customers have been served in the queue, the server immediately takes a vacation and operates an NT vacation policy: the server reactivates as soon as the number of arrivals in the queue reaches a predetermined threshold N or when the waiting time of the leading customer reaches T units. In such a variant vacation system, the steady-state probabilities cannot be obtained explicitly. Thus, the maximum entropy principle is used to derive the approximate formulas for the steady-state probability distributions of the queue length. A comparitive analysis of two approximation approaches, using the first and the second moments of system size, is studied. Both solutions are compared with the exact results under several service time distributions with specific parameter values. Our numerical investigations demonstrate that the use of the second moment of system size for the available information is, in general, sufficient to obtain more accurate estimations than that of the first moment.