首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 26 毫秒
1.
有两个服务阶段、反馈、强占型的M/G/1重试排队   总被引:1,自引:0,他引:1  
在假定重试区域中只有队首的顾客允许重试的条件下,重试时间是一般分布时,考虑具有两个服务阶段、反馈、强占型的M/G/1重试排队系统.得到了系统稳态的充要条件.求得稳态时系统队长和重试区域中队长分布及相关指标,并且得到了系统的随机分解性质.  相似文献   

2.
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.  相似文献   

3.
Atencia  Ivan  Moreno  Pilar 《Queueing Systems》2004,48(1-2):5-21
We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general distribution and the server, after each service completion, begins a process of search in order to find the following customer to be served. We study the Markov chain underlying the considered queueing system and its ergodicity condition. We find the generating function of the number of customers in the orbit and in the system. We derive the stochastic decomposition law and as an application we give bounds for the proximity between the steady-state distributions for our queueing system and its corresponding standard system. Also, we develop recursive formulae for calculating the steady-state distribution of the orbit and system sizes. Besides, we prove that the M/G/1 retrial queue with general retrial times can be approximated by our corresponding discrete-time system. Finally, we give numerical examples to illustrate the effect of the parameters on several performance characteristics.  相似文献   

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

5.
王晓春  朱翼隽  陈燕 《运筹与管理》2006,15(6):54-59,77
本文考虑了一个具有可选服务、反馈的M/G/1重试排队系统。在假定重试区域中只有队首的顾客允许重试的情况下,重试时间具有一般分布时,得到了系统稳态的充分必要条件。求得稳态时系统队长和重试区域中队长分布及相关指标。  相似文献   

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

7.
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.  相似文献   

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

9.
An M/G/1 retrial queueing system with disasters and unreliable server is investigated in this paper. Primary customers arrive in the system according to a Poisson process, and they receive service immediately if the server is available upon their arrivals. Otherwise, they will enter a retrial orbit and try their luck after a random time interval. We assume the catastrophes occur following a Poisson stream, and if a catastrophe occurs, all customers in the system are deleted immediately and it also causes the server’s breakdown. Besides, the server has an exponential lifetime in addition to the catastrophe process. Whenever the server breaks down, it is sent for repair immediately. It is assumed that the service time and two kinds of repair time of the server are all arbitrarily distributed. By applying the supplementary variables method, we obtain the Laplace transforms of the transient solutions and also the steady-state solutions for both queueing measures and reliability quantities of interest. Finally, numerical inversion of Laplace transforms is carried out for the blocking probability of the system, and the effects of several system parameters on the blocking probability are illustrated by numerical inversion results.  相似文献   

10.
This paper is concerned with a discrete-time Geo/G/1 retrial queue with preferred, impatient customers and general retrial times. We analyze the Markov chain underlying the considered queueing system and derive its ergodicity condition. The system state distribution as well as the orbit size and the system size distributions are obtained in terms of their generating functions. These generating functions yield exact expressions for different performance measures. Besides, the stochastic decomposition property and the corresponding continuous-time queueing system are investigated. Finally, some numerical examples are provided to illustrate the effect of priority and impatience on several performance characteristics of the system.  相似文献   

11.
An M[X]/G/1 retrial G-queue with single vacation and unreliable server is investigated in this paper. Arrivals of positive customers form a compound Poisson process, and positive customers receive service immediately if the server is free upon their arrivals; Otherwise, they may enter a retrial orbit and try their luck after a random time interval. The arrivals of negative customers form a Poisson process. Negative customers not only remove the customer being in service, but also make the server under repair. The server leaves for a single vacation as soon as the system empties. In this paper, we analyze the ergodical condition of this model. By applying the supplementary variables method, we obtain the steady-state solutions for both queueing measures and reliability quantities.  相似文献   

12.
We consider an M/G/1 retrial G-queue with preemptive resume priority and collisions under linear retrial policy subject to the server breakdowns and delayed repairs. A breakdown at the busy server is represented by the arrival of a negative customer which causes the customer being in service to be lost. The stability condition of the system is derived. Using generating function technique, the steady-state distributions of the server state and the number of customers in the orbit are obtained along with some interesting and important performance measures. The stochastic decomposition property is investigated. Further, some special cases of interest are discussed. Finally, numerical illustrations are provided.  相似文献   

13.
We consider a single server retrial queuing model in which customers arrive according to a batch Markovian arrival process. Any arriving batch finding the server busy enters into an orbit. Otherwise one customer from the arriving batch enters into service immediately while the rest join the orbit. The customers from the orbit try to reach the service later and the inter-retrial times are exponentially distributed with intensity depending (generally speaking) on the number of customers on the orbit. Additionally, the search mechanism can be switched-on at the service completion epoch with a known probability (probably depending on the number of customers on the orbit). The duration of the search is random and also probably depending on the number of customers in the orbit. The customer, which is found as the result of the search, enters the service immediately if the server is still idle. Assuming that the service times of the primary and repeated customers are generally distributed (with possibly different distributions), we perform the steady state analysis of the queueing model.  相似文献   

14.
In this paper, we consider a Geo/Geo/1 retrial queue with non-persistent customers and working vacations. The server works at a lower service rate in a working vacation period. Assume that the customers waiting in the orbit request for service with a constant retrial rate, if the arriving retrial customer finds the server busy, the customer will go back to the orbit with probability q (0≤q≤1), or depart from the system immediately with probability $\bar{q}=1-q$ . Based on the necessary and sufficient condition for the system to be stable, we develop the recursive formulae for the stationary distribution by using matrix-geometric solution method. Furthermore, some performance measures of the system are calculated and an average cost function is also given. We finally illustrate the effect of the parameters on the performance measures by some numerical examples.  相似文献   

15.
M. Martín  A. Gómez-Corral 《TOP》1995,3(2):285-305
Summary This paper is concerned with the study of a newM/G/1 retrial queueing system in which the delays between retrials are exponentially distributed random variables with linear intensityg(n)=α+nμ, when there aren≥1 customers in the retrial group. This new retrial discipline will be calledlinear control policy. We carry out an extensive analysis of the model, including existence of stationary regime, stationary distribution of the embedded Markov chain at epochs of service completions, joint distribution of the orbit size and the server state in steady state and busy period. The results agree with known results for special cases.  相似文献   

16.
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  相似文献   

17.
Consider a Geo/Geo/1 retrial queue with working vacations and vacation interruption, and assume requests in the orbit try to get service from the server with a constant retrial rate. During the working vacation period, customers can be served at a lower rate. If there are customers in the system after a service completion instant, the vacation will be interrupted and the server comes back to the normal working level. We use a quasi birth and death process to describe the considered system and derive a condition for the stability of the model. Using the matrix-analytic method, we obtain the stationary probability distribution and some performance measures. Furthermore, we prove the conditional stochastic decomposition for the queue length in the orbit. Finally, some numerical examples are presented.  相似文献   

18.
We consider a discrete-time Geo/G/1 retrial queue with preemptive resume, collisions of customers and general retrial times. We analyze the Markov chain underlying the considered queueing system and derive its ergodicity condition. Using generating function technique, the system state distribution as well as the orbit size and the system size distributions are studied. Some interesting and important performance measures are obtained. Besides, the stochastic decomposition property is investigated. Finally, some numerical examples are provided.  相似文献   

19.
This paper studies a discrete-time Geo/G/1 retrial queue where the server is subject to starting failures. We analyse the Markov chain underlying the regarded queueing system and present some performance measures of the system in steady-state. Then, we give two stochastic decomposition laws and find a measure of the proximity between the system size distributions of our model and the corresponding model without retrials. We also develop a procedure for calculating the distributions of the orbit and system size as well as the marginal distributions of the orbit size when the server is idle, busy or down. Besides, we prove that the M/G/1 retrial queue with starting failures can be approximated by its discrete-time counterpart. Finally, some numerical examples show the influence of the parameters on several performance characteristics. This work is supported by the DGINV through the project BFM2002-02189.  相似文献   

20.
We consider a single server retrial queue with waiting places in service area and three classes of customers subject to the server breakdowns and repairs. When the server is unavailable, the arriving class-1 customer is queued in the priority queue with infinite capacity whereas class-2 customer enters the retrial group. The class-3 customers which are also called negative customers do not receive service. If the server is found serving a customer, the arriving class-3 customer breaks the server down and simultaneously deletes the customer under service. The failed server is sent to repair immediately and after repair it is assumed as good as new. We study the ergodicity of the embedded Markov chains and their stationary distributions. We obtain the steady-state solutions for both queueing measures and reliability quantities. Moreover, we investigate the stochastic decomposition law, the busy period of the system and the virtual waiting times. Finally, an application to cellular mobile networks is provided and the effects of various parameters on the system performance are analyzed numerically.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号