共查询到20条相似文献,搜索用时 31 毫秒
1.
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. 相似文献
2.
This paper considers a class of stationary batch-arrival, bulk-service queues with generalized vacations. The system consists of a single server and a waiting room of infinite capacity. Arrivals of customers follow a batch Markovian arrival process. The server is unavailable for occasional intervals of time called vacations, and when it is available, customers are served in groups of fixed size B. For this class of queues, we show that the vector probability generating function of the stationary queue length distribution is factored into two terms, one of which is the vector probability generating function of the conditional queue length distribution given that the server is on vacation. The special case of batch Poisson arrivals is carefully examined, and a new stochastic decomposition formula is derived for the stationary queue length distribution.AMS subject classification: 60K25, 90B22, 60K37 相似文献
3.
We consider an M
[X]/G/1 retrial queue subject to breakdowns where the retrial time is exponential and independent of the number of customers applying
for service. If a coming batch of customers finds the server idle, one of the arriving customers begins his service immediately
and the rest joins a retrial group (called orbit) to repeat his request later; otherwise, if the server is busy or down, all
customers of the coming batch enter the orbit. It is assumed that the server has a constant failure rate and arbitrary repair
time distribution. We study the ergodicity of the embedded Markov chain, its stationary distribution and the joint distribution
of the server state and the orbit size in steady-state. The orbit and system size distributions are obtained as well as some
performance measures of the system. The stochastic decomposition property and the asymptotic behavior under high rate of retrials
are discussed. We also analyse some reliability problems, the k-busy period and the ordinary busy period of our retrial queue. Besides, we give a recursive scheme to compute the distribution
of the number of served customers during the k-busy period and the ordinary busy period. The effects of several parameters on the system are analysed numerically.
I. Atencia’s and Moreno’s research is supported by the MEC through the project MTM2005-01248. 相似文献
4.
An important property of most infinite server systems is that customers are independent of each other once they enter the
system. Though this non-interacting property (NIP) has been instrumental in facilitating excellent results for infinite server systems in the past, the utility of this property
has not been fully exploited or even fully recognized. This paper exploits theNIP by investigating a general infinite server system with batch arrivals following a Markov renewal input process. The batch
sizes and service times depend on the customer types which are regulated by the Markov renewal process. By conditional approaches,
analytical results are obtained for the generating functions and binomial moments of both the continuous time system size
and pre-arrival system size. These results extend the previous results on infinite server queues significantly. 相似文献
5.
Single server retrial queueing models in which customers arrive according to a batch Poisson process are considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit (the orbital customers) try to reach the server subsequently with the inter-retrial times exponentially distributed. Additionally, at each service completion epoch, two different search mechanisms, that is, type I and type II search, to bring the orbital customers by the system to service, are switched on. Thus, when the server is idle, a competition takes place among primary customers, customers who come by retrial and by two types of searches. The type I search selects a single customer whereas the type II search considers a batch of customers from the orbit. Depending on the maximum size of the batch being considered for service by a type II search, two cases are addressed here. In the first case, no restriction on batch size is assumed, whereas in the second case, maximum size of the batch is restricted to a pre-assigned value. We call the resulting models as model 1 and model 2 respectively. In all service modes other than type II search, only a single customer is qualified for service. Service times of the four types of customers, namely, primary, repeated, and those who come by two types of searches are arbitrarily distributed (with different distributions which are independent of each other). Steady state analysis is performed and stability conditions are established. A control problem for model 2 is considered and numerical illustrations are provided. 相似文献
6.
This paper analyzes a discrete-time Geo/Geo/1 queueing system with the server subject to breakdowns and repairs, in which two different possible types of the server breakdowns are considered. In Type 1, the server may break down only when the system is busy, while in Type 2, the server can break down even if the system is idle. The server lifetimes are assumed to be geometrical and the server repair times are also geometric distributions. We model this system by the level-dependent quasi-birth-death (QBD) process and develop computation algorithms of the stationary distribution of the number of customers in the system using the matrix analytic method. The search algorithm for parameter optimization based on a cost model is developed and performed herein. 相似文献
7.
Dieter Claeys Koenraad Laevens Joris Walraevens Herwig Bruneel 《Mathematical Methods of Operations Research》2010,72(1):1-23
Whereas the buffer content of batch-service queueing systems has been studied extensively, the customer delay has only occasionally
been studied. The few papers concerning the customer delay share the common feature that only the moments are calculated explicitly.
In addition, none of these surveys consider models including the combination of batch arrivals and a server operating under
the full-batch service policy (the server waits to initiate service until he can serve at full capacity). In this paper, we
aim for a complete characterisation—i.e., moments and tail probabilities - of the customer delay in a discrete-time queueing
system with batch arrivals and a batch server adopting the full-batch service policy. In addition, we demonstrate that the
distribution of the number of customer arrivals in an arbitrary slot has a significant impact on the moments and the tail
probabilities of the customer delay. 相似文献
8.
This paper studies the operating characteristics of an M[x]/G/1 queueing system under a variant vacation policy, where the server leaves for a vacation as soon as the system is empty. The server takes at most J vacations repeatedly until at least one customer is found waiting in the queue when the server returns from a vacation. If the server is busy or on vacation, an arriving batch balks (refuses to join) the system with probability 1 − b. We derive the system size distribution at different points in time, as well as the waiting time distribution in the queue. Finally, important system characteristics are derived along with some numerical illustration. 相似文献
9.
An infinite server queue is considered where customers have a choice of individual service or batch service. Transient results have been obtained for the first two moments of the system size distribution. Waiting time distribution is important in system evaluation and steady state results are obtained. 相似文献
10.
Jens Baetens Bart Steyaert Dieter Claeys Herwig Bruneel 《Mathematical Methods of Operations Research》2018,88(1):37-57
In this paper, we analyse the delay of a random customer in a two-class batch-service queueing model with variable server capacity, where all customers are accommodated in a common single-server first-come-first-served queue. The server can only process customers that belong to the same class, so that the size of a batch is determined by the length of a sequence of same-class customers. This type of batch server can be found in telecommunications systems and production environments. We first determine the steady state partial probability generating function of the queue occupancy at customer arrival epochs. Using a spectral decomposition technique, we obtain the steady state probability generating function of the delay of a random customer. We also show that the distribution of the delay of a random customer corresponds to a phase-type distribution. Finally, some numerical examples are given that provide further insight in the impact of asymmetry and variance in the arrival process on the number of customers in the system and the delay of a random customer. 相似文献
11.
Refik Güllü 《Operations Research Letters》2004,32(5):431-438
We analyze an M/G/∞ queue with batch arrivals, where jobs belonging to a batch have to be processed by the same server. The number of jobs in the system is characterized as a compound Poisson random variable through a scaling of the original arrival and batch size processes. 相似文献
12.
《随机分析与应用》2013,31(5):1009-1019
Abstract We consider a two‐phase queueing system with server vacations and Bernoulli feedback. Customers arrive at the system according to a Poisson process and receive batch service in the first phase followed by individual services in the second phase. Each customer who completes the individual service returns to the tail of the second phase service queue with probability 1 ? σ. If the system becomes empty at the moment of the completion of the second phase services, the server takes vacations until he finds customers. This type of queueing problem can be easily found in computer and telecommunication systems. By deriving a relationship between the generating functions for the system size at various embedded epochs, we obtain the system size distribution at an arbitrary time. The exhaustive and gated cases for the batch service are considered. 相似文献
13.
We consider a queueing system with two stations served by a single server in a cyclic manner. We assume that at most one customer can be served at a station when the server arrives at the station. The system is subject to service interuption that arises from server breakdown. When a server breakdown occurs, the server must be repaired before service can resume. We obtain the approximate mean delay of customers in the system. 相似文献
14.
《Mathematical and Computer Modelling》2000,31(10-12):225-234
We study an optimal maintenance policy for the server in a queueing system. Customers arrive at the server in a Poisson stream and are served by an exponential server, which is subject to multiple states indicating levels of popularity. The server state transitions are governed by a Markov process. The arrival rate depends on the server state and it decreases as the server loses popularity. By maintenance the server state recovers completely, though the customers in the system are lost at the beginning of maintenance. The customers who arrive during maintenance are also lost. In this paper, two kinds of such systems are considered. The first system receives a unit reward when a customer arrives at the system and pays a unit cost for each lost customer at the start of maintenance. The second system receives a unit reward at departure, and pays nothing for lost customers at the beginning of maintenance. Our objective is to maximize the total expected discounted profit over an infinite time horizon. We use a semi-Markov decision process to formulate the problem and are able to establish some properties for the optimal maintenance policy under certain conditions. 相似文献
15.
We consider a batch arrival finite buffer single server queue with inter-batch arrival times are generally distributed and
arrivals occur in batches of random size. The service process is correlated and its structure is presented through Markovian
service process (MSP). The model is analyzed for two possible customer rejection strategies: partial batch rejection and total batch rejection
policy. We obtain steady-state distribution at pre-arrival and arbitrary epochs along with some important performance measures,
like probabilities of blocking the first, an arbitrary, and the last customer of a batch, average number of customers in the
system, and the mean waiting times in the system. Some numerical results have been presented graphically to show the effect
of model parameters on the performance measures. The model has potential application in the area of computer networks, telecommunication
systems, manufacturing system design, etc.
相似文献
16.
Dieter Claeys Joris Walraevens Koenraad Laevens Herwig Bruneel 《4OR: A Quarterly Journal of Operations Research》2010,8(3):255-269
In this paper, we compute the probability generating functions (PGF’s) of the customer delay for two batch-service queueing
models with batch arrivals. In the first model, the available server starts a new service whenever the system is not empty
(without waiting to fill the capacity), while the server waits until he can serve at full capacity in the second model. Moments
can then be obtained from these PGF’s, through which we study and compare both systems. We pay special attention to the influence
of the distribution of the arrival batch sizes. The main observation is that the difference between the two policies depends
highly on this distribution. Another conclusion is that the results are considerably different as compared to Bernoulli (single)
arrivals, which are frequently considered in the literature. This demonstrates the necessity of modeling the arrivals as batches. 相似文献
17.
This paper concerns a discrete-time Geo/Geo/1 retrial queue with both positive and negative customers where the server is subject to breakdowns and repairs due to negative arrivals. The arrival of a negative customer causes one positive customer to be killed if any is present, and simultaneously breaks the server down. The server is sent to repair immediately and after repair it is as good as new. The negative customer also causes the server breakdown if the server is found idle, but has no effect on the system if the server is under repair. We analyze the Markov chain underlying the queueing system and obtain its ergodicity condition. The generating function of the number of customers in the orbit and in the system are also obtained, along with the marginal distributions of the orbit size when the server is idle, busy or down. Finally, we present some numerical examples to illustrate the influence of the parameters on several performance characteristics of the system. 相似文献
18.
We consider an M X /G/1 queueing system with two phases of heterogeneous service and Bernoulli vacation schedule which operate under a linear retrial policy. In addition, each individual customer is subject to a control admission policy upon the arrival. This model generalizes both the classical M/G/1 retrial queue with arrivals in batches and a two phase batch arrival queue with a single vacation under Bernoulli vacation schedule. We will carry out an extensive stationary analysis of the system , including existence of the stationary regime, embedded Markov chain, steady state distribution of the server state and number of customer in the retrial group, stochastic decomposition and calculation of the first moment. 相似文献
19.
We consider a novel multi-server queueing system that is potentially useful for optimizing real-world systems, in which the objectives of high performance and low power consumption are conflicting. The queueing model is formulated and investigated under the assumption that an arrival flow is defined by a batch Markovian arrival process and random values characterizing customer processing have the phase-type distribution. If the service time of some customer by a server exceeds a certain random bound, this server receives help from a so-called backup server from a finite pool of backup servers. The behavior of the system is described by a quite complicated multi-dimensional continuous-time Markov chain that is successfully analyzed in this paper. Examples of the potential use of the obtained results in managerial decisions are presented. 相似文献
20.
We consider a new class of batch arrival retrial queues. By contrast to standard batch arrival retrial queues we assume if a batch of primary customers arrives into the system and the server is free then one of the customers starts to be served and the others join the queue and then are served according to some discipline. With the help of Lyapunov functions we have obtained a necessary and sufficient condition for ergodicity of embedded Markov chain and the joint distribution of the number of customers in the queue and the number of customers in the orbit in steady state. We also have suggested an approximate method of analysis based on the corresponding model with losses. 相似文献