Batch arrival bulk service queue with unreliable server, second optional service, two different vacations and restricted admissibility policy

This paper is concerned with batch arrival queue with an additional second optional service to a batch of customers with dissimilar service rate where the idea of restricted admissibility of arriving batch of customers is also introduced. The server may take two different vacations (i) Emergency vacation-during service the server may go for vacation to an emergency call and after completion of the vacation, the server continues the remaining service to a batch of customers. (ii) Bernoulli vacation-after completion of first essential or second optional service, the server may take a vacation or may remain in the system to serve the next unit, if any. While the server is functioning with first essential or second optional service, it may break off for a short period of time. As a result of breakdown, a batch of customers, either in first essential or second optional service is interrupted. The service channel will be sent to repair process immediately. The repair process presumed to be general distribution. Here, we assumed that the customers just being served before server breakdown wait for the server to complete its remaining service after the completion of the repair process. We derived the queue size distribution at a random epoch and at a departure epoch under the steady state condition. Moreover, various system performance measures, the mean queue size and the average waiting time in the queue have been obtained explicitly. Some particular cases and special cases are determined. A numerical result is also introduced

Time Dependent Solution of Batch Arrival Queue with Second Optional Service, Optional Re-Service and Bernoulli Vacation

This paper deals with an M[X]/G/1 queues with second optional service, optional re-service and Bernoulli vacations. Each customer undergoes first phase of service after completion of service, customer has the option to repeat or not to repeat the first phase of service and leave the system without taking the second phase or take the second phase service. Similarly after the second phase service he has yet another option to repeat or not to repeat the second phase service. After each service completion, the server may take a vacation with probability 1-theta or may continue staying in the system with probability . The service and vacation periods are assumed to be general. The time dependent probability generating functions have been obtained in terms of their Laplace transforms and the corresponding steady state results have been obtained explicitly. Also the average number of customers in the queue and the waiting time are also derived. Keywords: Batch arrival, Second optional service, Optional re-service, Average queue size, Average waiting time

Tail distribution of the delay in a general batch-service queueing model

A

Age-Optimal Updates of Multiple Information Flows

In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense