Undesired/desired service states;
Random threshold clock;
D O I:
10.1007/978-3-319-30843-2_11
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
We study an M/M/1 queue with a set of services in undesired states and a desired state. Arrivals are according to a Poisson process with mean rate lambda. An arrival enters into desired service with probability theta, otherwise goes to one of the undesired services with complementary probability depending on the environmental factors. When the service time in undesired states exceeds a threshold random variable, the customer is pushed out of the system. Otherwise the customer, after recognizing that the current service is not the right one moves to desired service state. We discuss the case of n undesired services and a desired service.