A service model in which the server is required to search for customers
A service model in which the server is required to search for customers
复制标题
DOI：
10.2307/3213673
复制
发表时间：
1984-03
影响因子：
1
通讯作者：
M. Neuts;M. F. Ramalhoto
中科院分区：
文献类型：
--
作者：
M. Neuts;M. F. Ramalhoto
客户根据泊松流程进入一个池，并在那里等待被单个服务器发现和处理。连续项目的使用时间是独立的，具有共同的一般分布。连续的服务通过seek阶段分开，在此期间服务器搜索下一个客户。搜索过程是马尔可夫的，在（t, t + dt）中找到客户的概率与时间t时池中客户的数量成正比。该模型的各种平稳概率分布以适合数值计算的显式形式获得。在服务时间为指数的假设下，对顾客可能从池中逃逸的情况，得到了相应的结果。
Customers enter a pool according to a Poisson process and wait there to be found and processed by a single server. The service times of successive items are independent and have a common general distribution. Successive services are separated by seek phases during which the server searches for the next customer. The search process is Markovian and the probability of locating a customer in (t, t + dt) is proportional to the number of customers in the pool at time t. Various stationary probability distributions for this model are obtained in explicit forms well-suited for numerical computation. Under the assumption of exponential service times, corresponding results are obtained for the case where customers may escape from the pool.