The M/M/1+M queue with a utility-maximizing server

We consider an M/M/1+M queue with a human server, who is influenced by incentives. Specifically, the server chooses his service rate by maximizing his utility function. Our objective is to guarantee the existence of a unique maximum. The complication is that most sensible utility functions depend on the server utilization, a non-simple expression. We derive a property of the utilization that guarantees quasiconcavity of any utility function that multiplies the server’s concave (including linear) “value” of his service rate by the server utilization.     

��ǿռ��������ȨM/M/n/m�Ŷ�ϵͳ

Concerning the problem that network congestion risk of computer network service system for some data frames having a full priority of transmission, a method about nonpreemptive limited-priority M/M/n/m queuing system model was proposed. Firstly, as the parameter r of limited-priority was introduced into the model, the data frame with full priority was converted to the one with limited priority. Secondly, in order to lower the risk of computer network service system and stabilize the network system further, the fairness among different priorities was studied in the model. Moreover, by making use of Total Probability Theorem, three results of the models, the average waiting time, the average dwelling time and the average queue length were obtained.     

带有负顾客的M/M/c多重工作休假排队

考虑服务台在休假期间不是完全停止工作,而是以相对于正常服务期低些的服务率服务顾客的M/M/c工作休假排队模型.在此模型基础上,针对现实的M/M/c排队模型中可能出现的外来干扰因素,提出了带有负顾客的M/M/c工作休假排队这一新的模型.服务规则为先到先服务.工作休假策略为空竭服务异步多重工作休假.抵消原则为负顾客一对一抵消处于正常服务期的正顾客,若系统中无处于正常服务期的正顾客时,到达的负顾客自动消失,负顾客不接受服务.首先,由该多重休假模型得到其拟生灭过程及生成元矩阵,然后运用矩阵几何方法给出系统队长的稳态分布表达式和若干系统指标.     

M/M/1排队系统中的维修策略

以平均报酬率为目标函数的维修策略问题引入可修排队系统.在M/M/1/模型下,利用几何过程描述服务台随机退化过程,考虑了基于服务台失效次数N的策略,即当失效次数到达N次时,对服务台进行替换.根据更新报酬定理,获得了基于维修次数N的平均报酬率的表达式.     

M/G/1/K queues withN-policy and setup times

A steady-state analysis is given for M/G/1/K queues with combinedN-policy and setup times before service periods. The queue length distributions and the mean waiting times are obtained for the exhaustive service system, the gated service system, the E-limited service system, and the G-limited service system. Numerical examples are also provided.     

动态输入率和服务率设定下的M/M/c模型扩展及其应用

为了解决M/M/c模型中恒定输入率和服务率假设与现实现象不符的问题,本文提出了随系统状态变化的输入概率和服务度,并通过新输入概率与平均输入率以及新服务度与平均服务率的结合分别构造了动态输入率和服务率。基于上述动态输入率和动态服务率,建立了依赖系统当前状态的状态转移过程,从状态转换强度方面优化了排队理论及其度量模型,同时,设计了结合系统实际的后确定法求解动态输入率与服务率的相关参数,从而构建了扩展M/M/c模型。由于输入率和服务率的动态性,扩展M/M/c模型具有比原排队论模型更广的适用范围和精度更高的模拟结果。最后,通过一个生活实例对新模型的有效性和实用性进行验证。     

M/G/1/MLPS compared to M/G/1/PS

Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing.     

M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL

Multilevel processor-sharing (MLPS) disciplines were originally introduced by Kleinrock (in computer applications 1976) but they were forgotten for years. However, due to an application related to the service differentiation between short and long TCP flows in the Internet, they have recently gained new interest. In this paper we show that, if the service time distribution belongs to class IMRL, the mean delay in the M/G/1 queue is reduced when replacing the PS discipline with any MLPS discipline for which the internal disciplines belong to {FB, PS}. This is a generalization of our earlier result where we restricted ourselves to the service time distribution class DHR, which is a subset of class IMRL.     

M/M/1 Queueing systems with inventory

We derive stationary distributions of joint queue length and inventory processes in explicit product form for various M/M/1-systems with inventory under continuous review and different inventory management policies, and with lost sales. Demand is Poisson, service times and lead times are exponentially distributed. These distributions are used to calculate performance measures of the respective systems. In case of infinite waiting room the key result is that the limiting distributions of the queue length processes are the same as in the classical M/M/1/∞-system. All authors were supported by DAAD/KBN grant number D/02/32206.     

Continuity theorems for the M/M/1/n queueing system

In this paper continuity theorems are established for the number of losses during a busy period of the M/M/1/n queue. We consider an M/GI/1/n queueing system where the service time probability distribution, slightly different in a certain sense from the exponential distribution, is approximated by that exponential distribution. Continuity theorems are obtained in the form of one or two-sided stochastic inequalities. The paper shows how the bounds of these inequalities are changed if further assumptions, associated with specific properties of the service time distribution (precisely described in the paper), are made. Specifically, some parametric families of service time distributions are discussed, and the paper establishes uniform estimates (given for all possible values of the parameter) and local estimates (where the parameter is fixed and takes only the given value). The analysis of the paper is based on the level crossing approach and some characterization properties of the exponential distribution. Dedicated to Vladimir Mikhailovich Zolotarev, Victor Makarovich Kruglov, and to the memory of Vladimir Vyacheslavovich Kalashnikov.     

Analysis of the M/Gi/1 →/M/1 queueing model

An M/GI/1 queueing system is in series with a unit with negative exponential service times and infinite waiting room capacity. We determine a closed form expression for the generating function of the joint queue length distribution in steady state. This result is obtained via the solution of a new type of functional equation in two variables.     

带有负顾客且具有反馈的M/M/1/N工作休假排队

研究带反馈的且具有正、负两类顾客的M/M/1/N工作休假排队模型.工作休假策略为空竭服务多重工作休假.负顾客一对一抵消队首正在接受服务的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.完成服务的正顾客以概率p(0相似文献   

An M/G/1 queue with second optional service

We study an M/G/1 queue with second optional service. Poisson arrivals with mean arrival rate (>0) all demand the first essential service, whereas only some of them demand the second optional service. The service times of the first essential service are assumed to follow a general (arbitrary) distribution with distribution function B(v) and that of the second optional service are exponential with mean service time 1/₂ (₂>0). The time-dependent probability generating functions have been obtained in terms of their Laplace transforms and the corresponding steady state results have been derived explicitly. Also the mean queue length and the mean waiting time have been found explicitly. The well-known Pollaczec–Khinchine formula and some other known results including M/D/1, M/E_k/1 and M/M/1 have been derived as particular cases.     

两个修理工的M/M/2可修排队系统

该文研究两个修理工的M/M/2可修排队系统, 系统有两个相同的服务台, 服务台忙时与闲时故障率不同. 文中给出系统的稳态状态概率, 系统的稳态可用度及系统的稳态平均队长, 并给出系统稳态概率存在的条件.     

Continuity of the M/G/c queue

Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller distributions, say F _n , leads to an approximation of the stationary distribution π of the original M/G/c queue by the stationary distributions π _n of the M/G/c queues with service time distributions F _n . Here all approximations are in weak convergence. The argument is based on a representation of M/G/c queues in terms of piecewise deterministic Markov processes as well as some coupling methods.      

Maximum Likelihood Estimates in a M/M/2 Queue with Heterogeneous Servers

Maximum likelihood estimates for the parameters involved in a stationary M/M/2 queueing process with heterogeneous servers are obtained to make inferences about arrival and service rates. The queue is considered to be in a state of equilibrium. One further extension is discussed.     

带有负顾客且具有Bernoulli反馈的M/M/1工作休假排队

本文研究带反馈的具有正、负两类顾客的M/M/1工作休假排队模型.工作休假策略为空竭服务多重工作休假.负顾客一对一抵消队尾的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.完成服务的正顾客以概率p(0相似文献   

An M/G/1 queue with cyclic service times

In this paper we consider a single server queue with Poisson arrivals and general service distributions in which the service distributions are changed cyclically according to customer sequence number. This model extends a previous study that used cyclic exponential service times to the treatment of general service distributions. First, the stationary probability generating function and the average number of customers in the system are found. Then, a single vacation queueing system with aN-limited service policy, in which the server goes on vacation after servingN consecutive customers is analyzed as a particular case of our model. Also, to increase the flexibility of using theM/G/1 model with cyclic service times in optimization problems, an approximation approach is introduced in order to obtain the average number of customers in the system. Finally, using this approximation, the optimalN-limited service policy for a single vacation queueing system is obtained.On leave from the Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran 16844, Iran.     

A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues

We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates.     

带有部分工作休假和休假中断的M/M/c排队

考虑了一个带有部分工作休假和休假中断的多服务台M/M/c排队.在休假期,d(d相似文献