Continuous-Service M/M/1 Queuing Systems

In this paper, we look into a novel notion of the standard M/M/1 queueing system. In our study, we assume that there is a single server and that there are two types of customers: real and imaginary customers. Real customers are regular customers arriving into our queueing system in accordance with a Poisson process. There exist infinitely many imaginary customers residing in the system. Real customers have service priority over imaginary customers. Thus, the server always serves real (regular) customers one by one if there are real customers present in the system. After serving all real customers, the server immediately serves, one at a time, imaginary customers residing in the system. A newly arriving real customer presumably does not preempt the service of an imaginary customer and hence must wait in the queue for their service. The server immediately serves a waiting real customer upon service completion of the imaginary customer currently under service. All service times are identically, independently, and exponentially distributed. Since our systems are characterized by continuous service by the server, we dub our systems continuous-service M/M/1 queueing systems. We conduct the steady-state analysis and determine common performance measures of our systems. In addition, we carry out simulation experiments to verify our results. We compare our results to that of the standard M/M/1 queueing system, and draw interesting conclusions. View Full-Tex