一类具有到达损失、可选服务、反馈的M/G/1重试排队系统

考虑一个具有到达损失、可选服务、反馈的M/G/1重试排队系统.在假定重试区域中顾客具有相互独立的指数重试时间的情况下,得到了系统的转移概率矩阵和系统稳态的充分必要条件.列出微分方程,求得稳态时系统队长和重试区域中队长分布及相关指标.     

有两个服务阶段、反馈、强占型的M/G/1重试排队

在假定重试区域中只有队首的顾客允许重试的条件下,重试时间是一般分布时,考虑具有两个服务阶段、反馈、强占型的M／G／1重试排队系统．得到了系统稳态的充要条件．求得稳态时系统队长和重试区域中队长分布及相关指标,并且得到了系统的随机分解性质．     

有启动失败和可选服务的M/G/1重试排队系统

考虑具有可选服务的M/G/1重试排队模型,其中服务台有可能启动失败.系统外新到达的顾客服从参数为λ的泊松过程.重试区域只允许队首顾客重试,重试时间服务一般分布.所有的顾客都必须接受必选服务,然而只有其中部分接受可选服务.通过嵌入马尔可夫链法证明了系统稳态的充要条件.利用补充变量的方法得到了稳态时系统和重试区域中队长分布.我们还得到重试期间服务台处于空闲的概率,重试区域为空的概率以及其他各种指标.并证出在把系统中服务台空闲和修理的时间定义为广义休假情况下也具有随机分解特征.     

带负顾客,反馈,服务台可修的M/G/1重试排队系统

对负顾客的研究可以从不同的角度,不同的方法,不同的机制来进行.本文提出了带负顾客,反馈,服务台可修的M/G/1重试排队系统.其中负顾客的机制是带走正在接受服务的正顾客和使得服务器处于修理状态.在假定重试区域中只有队首的顾客允许重试的情况下,重试时间具有一般分布时,得到了系统稳态的充分必要条件.求得了系统稳态时队长和重试区域中队长分布及一些排队指标和可靠性指标.     

有Bernoulli休假和可选服务的M/G/1重试反馈排队模型

考虑具有可选服务的M/G/1重试反馈排队模型,其中服务台有Bernoulli休假策略.系统外新到达的顾客服从参数为λ的泊松过程.重试区域只允许队首顾客重试,重试时间服从一般分布.所有的顾客都必须接受必选服务,然而只有其中部分接受可选服务.每个顾客每次被服务完成后可以离开系统或者返回到重试区域.服务台完成一次服务以后,可以休假也可以继续为顾客服务.通过嵌入马尔可夫链法证明了系统稳态的充要条件.利用补充变量的方法得到了稳态时系统和重试区域中队长分布.我们还得到了重试期间服务台处于空闲的概率,重试区域为空的概率以及其他各种指标.并证出在系统中服务员休假和服务台空闲的时间定义为广义休假情况下也具有随机分解特征.     

具有不同到达率和负顾客的工作休假Geo/Geo/1重试排队

考虑一个具有不同到达率和负顾客的工作休假Geo/Geo/1重试排队,其中正顾客在正常忙期中和工作休假期中的到达率是不同的.假设重试轨道的顾客以一定的重试率进行重试服务,负顾客到达抵消正在接受服务的正顾客.利用拟生灭过程和母函数方法得到了服务台的状态与重试轨道队长的联合分布的概率母函数,从而求得系统在稳态条件下的队长分布等一系列排队指标,进一步讨论了一些特殊情形.最后通过数值实例讨论系统参数对系统主要性能指标的影响,并说明了稳态队长分布在系统容量的优化设计中的重要价值.     

具有两类服务中断的离散时间重试排队分析

本文考虑了具有破坏性和非破坏性服务中断的离散重试排队系统.两类中断都发生在顾客接受服务的过程中,假设服务台在工作时发生破坏性中断,则正在接受服务的顾客中断服务,进入到重试空间中去,重新尝试以接受服务;若服务台在工作时发生非破坏性中断,则正在接受服务的顾客将等待中断结束后再继续完成剩余的服务量.求出了系统存在稳态的充分必要条件.利用补充变量法,求出了系统稳态时系统和重试区域中队长分布的概率母函数,以及其他一些重要的排队指标,并且给出了对应的连续时间下具有两类服务中断的M/G/1排队的队长分布的概率母函数.最后,通过数值算例研究了各种参数对平均队长的影响.     

M/G/1重试排队系统的渐近稳定性

用算子半群理论研究了带有重试排队的M/G/1系统.通过解算子方程和预解方程,证明了0是系统算子的本征值,且为虚轴上唯一的谱点.从而得出了当时间趋于无穷时系统时间依赖解收敛于稳态解的结论.     

有Bernoulli休假和可选服务的Geo/G/1重试排队

讨论了有Bernoulli休假策略和可选服务的离散时间Geo/G/1重试排队系统.假定一旦顾客发现服务台忙或在休假就进入重试区域,重试时间服从几何分布.顾客在进行第一阶段服务结束后可以离开系统或进一步要求可选服务.服务台在每次服务完毕后,可以进行休假,或者等待服务下一个顾客.还研究了在此模型下的马尔可夫链,并计算了在稳态条件下的系统的各种性能指标以及给出一些特例和系统的随机分解.     

具有N策略和负顾客的反馈抢占型的M/G/1重试可修排队系统

本文研究了具有N策略和负顾客的反馈抢占型的M/G/1重试可修排队系统.所有顾客(包括正顾客和负顾客)的到达都是泊松过程,服务器是可修的.利用吸收分布,求出了系统存在稳态的充分必要条件.利用补充变量法,求出了系统稳态时系统和重试区域中队长分布的概率母函数,以及其他一些重要的排队指标.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

M/(G1, G2)/1 retrial queue under Bernoulli vacation schedules with general repeated attempts and starting failures

This paper investigates a batch arrival retrial queue with general retrial times, where the server is subject to starting failures and provides two phases of heterogeneous service to all customers under Bernoulli vacation schedules. Any arriving batch finding the server busy, breakdown or on vacation enters an orbit. Otherwise one customer from the arriving batch enters a service immediately while the rest join the orbit. After the completion of two phases of service, the server either goes for a vacation with probability p or may wait for serving the next customer with probability (1 − p). We construct the mathematical model and derive the steady-state distribution of the server state and the number of customers in the system/orbit. Such a model has potential application in transfer model of e-mail system.     

Multiserver queue with addressed retrials

This paper presents a multiserver retrial queueing system with servers kept apart, thereby rendering it impossible for one to know the status (idle/busy) of the others. Customers proceeding to one channel will have to go to orbit if the server in it is busy and retry after some time to some channel, not necessarily the one already tried. Each orbital customer, independently of others, chooses the server randomly according to some specified probability distribution. Further this distribution is identical for all customers. We assume that the same ‘orbit’ is used by all retrial customers, between repeated attempts, to access the servers. We derive the system state probability distribution under Poisson arrival process of external customers, exponentially distributed service times and linear retrial rates to access the servers. Several system state characteristics are obtained and numerical illustrations provided. AMS subject classification: Primary 60K25 60K20     

An M/M/1 retrial queue with unreliable server

We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results.     

Monotonicity properties in various retrial queues and their applications

We consider several multi-server retrial queueing models with exponential retrial times that arise in the literature of retrial queues. The effect of retrial rates on the behavior of the queue length process is investigated via sample path approach. We show that the number of customers in orbit and in the system as a whole are monotonically changed if the retrial rates in one system are bounded by the rates in second one. The monotonicity results are applied to show the convergence of generalized truncated systems that have been widely used for approximating the stationary queue length distribution in retrial queues. AMS subject classifications: Primary 60K25     

具有反馈、不可靠服务台和二次多选择服务M/G/1重试排队系统

An M/G/1 retrial queue with two-phase service and feedback is studied in this paper, where the server is subject to starting failures and breakdowns during service. Primary customers get in the system according to a Poisson process, and they will receive service immediately if the server is available upon arrival. Otherwise, they will enter a retrial orbit and are queued in the orbit in accordance with a first-come-first-served (FCFS) discipline. Customers are allowed to balk and renege at particular times. All customers demand the first "essential"service, whereas only some of them demand the second "multi-optional" service. It is assumed that the retrial time, service time and repair time of the server are all arbitrarily distributed.The necessary and sufficient condition for the system stability is derived. Using a supplementary variable method, the steady-state solutions for some queueing and reliability measures of the system are obtained.