带负顾客和强占优先权的不耐烦信元排队

考虑带有负顾客的两类信元的强占优先权M/M/1排队系统.两类信元及负顾客的到达过程均为泊松过程.两类信元到达后分别在各自有限的缓冲器内排队,第一类信元较第二类信元有强占优先权,同时第一类信元是不耐烦的.负顾客一对一抵消队尾的第一类信元(若有),若系统中无第一类信元,到达的负顾客就自动消失.负顾客不接受服务.采用矩阵分析的方法得到了两类信元各自的稳态分布,并作了相应的性能分析.

Impatient Cells' Queueing with Negative Customers and Preemptive Priority

Consider an M/M/1 preemptive priority queue with two kinds of cells and negative customers.The arrival processes of the two kinds of cell and the negative customers are all Poisson processes.After entering the system,each of the two kinds of cells queues in each finite capacity buffer.We assume the first kind of cells has the preemptive priority on the second kind of cells,and the first kind of cells is impatient.Negative customers remove the first kind of cells only at the end(if present).When a Negative customer arrives,if the system has no the first cells,it will disappear.Negative customers need no services.By using matrix analysis,we gain the steady-state distribution and make some performance evaluations for the two kinds of cells,respectively.