Well-posedness of M/G/1 queueing model with single vacations. (Q1416313)

In M/G/1 queueing system with single vacations, the server takes exactly one vacation immediately after each busy period. If it finds no customers waiting upon returning from the vacation, it becomes idle until a customer arrives. When a customer arrives, it immediately starts to serve it. By using \(C_0\)-semigroup theory of linear operators, it is proved that the M/G/1 queueing model with single vacations has a unique nonnegative time-dependent solution which satisfies probability condition.