共查询到20条相似文献,搜索用时 15 毫秒
1.
Peter Sendfeld 《Methodology and Computing in Applied Probability》2008,10(4):557-558
We consider an open queueing network consisting of two queues with Poisson arrivals and exponential service times and having
some overflow capability from the first to the second queue. Each queue is equipped with a finite number of servers and a
waiting room with finite or infinite capacity. Arriving customers may be blocked at one of the queues depending on whether
all servers and/or waiting positions are occupied. Blocked customers from the first queue can overflow to the second queue
according to specific overflow routines. Using a separation method for the balance equations of the two-dimensional server
and waiting room demand process, we reduce the dimension of the problem of solving these balance equations substantially.
We extend the existing results in the literature in three directions. Firstly, we allow different service rates at the two
queues. Secondly, the overflow stream is weighted with a parameter p ∈ [0,1], i.e., an arriving customer who is blocked and overflows, joins the overflow queue with probability p and leaves the system with probability 1 − p. Thirdly, we consider several new blocking and overflow routines.
An erratum to this article can be found at 相似文献
2.
《European Journal of Operational Research》2006,168(2):509-519
We consider a system of parallel queues with dedicated arrival streams. At each decision epoch a decision-maker can move customers from one queue to another. The cost for moving customers consists of a fixed cost and a linear, variable cost dependent on the number of customers moved. There are also linear holding costs that may depend on the queue in which customers are stored. Under very mild assumptions, we develop stability (and instability) conditions for this system via a fluid model. Under the assumption of stability, we consider minimizing the long-run average cost. In the case of two-servers the optimal control policy is shown to prefer to store customers in the lowest cost queue. When the inter-arrival and service times are assumed to be exponential, we use a Markov decision process formulation to show that for a fixed number of customers in the system, there exists a level S such that whenever customers are moved from the high cost queue to the low cost queue, the number of customers moved brings the number of customers in the low cost queue to S. These results lead to the development of a heuristic for the model with more than two servers. 相似文献
3.
To investigate the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number
of waiting customers in an M/D/s queue as s→∞. In the Halfin-Whitt regime, it is well known that this random variable converges to the supremum of a Gaussian random
walk. This paper develops methods that yield more accurate results in terms of series expansions and inequalities for the
probability of an empty queue, and the mean and variance of the queue length distribution. This quantifies the relationship
between the limiting system and the queue with a small or moderate number of servers. The main idea is to view the M/D/s queue through the prism of the Gaussian random walk: as for the standard Gaussian random walk, we provide scalable series
expansions involving terms that include the Riemann zeta function.
相似文献
4.
Refael Hassin 《Queueing Systems》2009,62(3):243-254
Consider two servers of equal service capacity, one serving in a first-come first-served order (FCFS), and the other serving
its queue in random order. Customers arrive as a Poisson process and each arriving customer observes the length of the two
queues and then chooses to join the queue that minimizes its expected queueing time. Assuming exponentially distributed service
times, we numerically compute a Nash equilibrium in this system, and investigate the question of which server attracts the
greater share of customers. If customers who arrive to find both queues empty independently choose to join each queue with
probability 0.5, then we show that the server with FCFS discipline obtains a slightly greater share of the market. However,
if such customers always join the same queue (say of the server with FCFS discipline) then that server attracts the greater
share of customers.
This research was supported by the Israel Science Foundation grant No. 526/08. 相似文献
5.
C. Blondia 《Queueing Systems》1989,5(4):313-330
In this paper, we study an M/G/1 multi-queueing system consisting ofM finite capacity queues, at which customers arrive according to independent Poisson processes. The customers require service times according to a queue-dependent general distribution. Each queue has a different priority. The queues are attended by a single server according to their priority and are served in a non-preemptive way. If there are no customers present, the server takes repeated vacations. The length of each vacation is a random variable with a general distribution function. We derive steady state formulas for the queue length distribution and the Laplace transform of the queueing time distribution for each queue. 相似文献
6.
Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always
been taken to be either a long wait already experienced at a queue, or a long wait anticipated by a customer upon arrival.
In this paper we consider systems with servers vacations where customers’ impatience is due to an absentee of servers upon arrival. Such a model, representing frequent behavior by waiting customers in service systems, has never
been treated before in the literature. We present a comprehensive analysis of the single-server, M/M/1 and
M/G/1 queues, as well as of the multi-server M/M/c queue, for both the multiple and the single-vacation cases, and obtain various closed-form results. In particular, we show
that the proportion of customer abandonments under the single-vacation regime is smaller than that under the multiple-vacation
discipline.
This work was supported by the Euro-Ngi network of excellence. 相似文献
7.
We consider two coupled queues, with each having a finite capacity of customers. When both queues are nonempty they evolve independently, but when one becomes empty the service rate in the other changes. Such a model corresponds to a generalized processor sharing (GPS) discipline. We study the joint distribution p(m, n) of finding (m, n) customers in the (first, second) queue, in the steady state. We study the problem in an asymptotic limit of “heavy traffic,” where also the arrival rate to the second queue is assumed to be small relative to that of the first. The capacity of the first queue is scaled to be large, while that of the second queue is held constant. We consider several different scalings, and in each case obtain limiting differential and/or difference equation for p(m, n), and these we explicitly solve. We show that our asymptotic approximations are quite accurate numerically. This work supplements previous investigations into this GPS model, which assumed infinite capacities/buffers. The present model corresponds to a random walk in a lattice rectangle, where p(m, n) satisfies a different boundary condition on each edge. 相似文献
8.
研究了带有止步和中途退出的Mx/M/R/N同步休假排队系统.顾客成批到达.到达的顾客如果看到服务员正在休假或者全忙,他或者以概率b决定进入队列等待服务,或者以概率1-b止步(不进入系统).系统根据一定的原则以概率nk在未止步的k个顾客中选择n个进入系统.在系统中排队等待服务的顾客可能因为等待的不耐烦而在没有接受服务的情况下离开系统(中途退出).系统中一旦没有顾客,R个服务员立即进行同步多重休假.首先,利用马尔科夫过程理论建立了系统稳态概率满足的方程组.其次,在证明了相关矩阵可逆性的基础上,利用矩阵解法求出了系统稳态概率的明显表达式,并得到了系统的平均队长、平均等待队长及顾客的平均损失率等性能指标. 相似文献
9.
In a queueing system with preemptive loss priority discipline, customers disappear from the system immediately when their service is preempted by the arrival of another customer with higher priority. Such a system can model a case in which old requests of low priority are not worthy of deferred service. This paper is concerned with preemptive loss priority queues in which customers of each priority class arrive in a Poisson process and have general service time distribution. The strict preemption in the existing model is extended by allowing the preemption distance parameterd such that arriving customers of only class 1 throughp — d can preempt the service of a customer of classp. We obtain closed-form expressions for the mean waiting time, sojourn time, and queue size from their distributions for each class, together with numerical examples. We also consider similar systems with server vacations. 相似文献
10.
This paper studies the heavy-traffic behavior of a closed system consisting of two service stations. The first station is
an infinite server and the second is a single server whose service rate depends on the size of the queue at the station. We
consider the regime when both the number of customers, n, and the service rate at the single-server station go to infinity while the service rate at the infinite-server station is
held fixed. We show that, as n→∞, the process of the number of customers at the infinite-server station normalized by n converges in probability to a deterministic function satisfying a Volterra integral equation. The deviations of the normalized
queue from its deterministic limit multiplied by √n converge in distribution to the solution of a stochastic Volterra equation.
The proof uses a new approach to studying infinite-server queues in heavy traffic whose main novelty is to express the number
of customers at the infinite server as a time-space integral with respect to a time-changed sequential empirical process.
This gives a new insight into the structure of the limit processes and makes the end results easy to interpret. Also the approach
allows us to give a version of the classical heavy-traffic limit theorem for the G/GI/∞ queue which, in particular, reconciles the limits obtained earlier by Iglehart and Borovkov.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
11.
Motivated by applications in manufacturing systems and computer networks, in this paper, we consider a tandem queue with feedback.
In this model, the i.i.d. interarrival times and the i.i.d. service times are both exponential and independent. Upon completion
of a service at the second station, the customer either leaves the system with probability p or goes back, together with all customers currently waiting in the second queue, to the first queue with probability 1−p. For any fixed number of customers in one queue (either queue 1 or queue 2), using newly developed methods we study properties
of the exactly geometric tail asymptotics as the number of customers in the other queue increases to infinity. We hope that
this work can serve as a demonstration of how to deal with a block generating function of GI/M/1 type, and an illustration
of how the boundary behaviour can affect the tail decay rate. 相似文献
12.
《Optimization》2012,61(6):883-892
Customers arrive in a renewal process at a queue which is served by an exponential and a two-stage Erlangian server. We prove the optimal policy for assignment of customers to the servers which for any t maximizes the expected number of served customers in [0,t]. 相似文献
13.
In this paper, we consider an optimization problem for a parallel queueing system with two heterogeneous servers. Each server has its own queue and customers arrive at each queue according to independent Poisson processes. Each service time is independent and exponentially distributed. When a customer arrives at queue 1, the customers in queue 1 can be transferred to queue 2 by paying an assignment cost which is proportional to the number of moved customers. Holding cost is a function of the pair of queue lengths of the two servers. Our objective is to minimize the expected total discounted cost. We use the dynamic programming approach for this problem. Considering the pair of queue lengths as a state space, we show that the optimal policy has a switch over structure under some conditions on the holding cost. 相似文献
14.
《European Journal of Operational Research》1998,110(2):392-406
In this paper, we consider GI/M/c queues with two classes of vacation mechanisms: Station vacation and server vacation. In the first one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is a group vacation for all servers. This phenomenon occurs in practice, for example, when the system consists of a set of machines monitored by a single operator, or the system consists of inseparable interconnected parallel machines. In such situations the whole station has to be treated as a single entity for vacation when the system is utilized for a secondary task. For the second class of vacation mechanisms, each server takes its own vacation whenever it complexes a service and finds no customers waiting in the queue, which occurs, for instance in the post office, when each server is a relatively independent working unit, and can itself be used for other purposes. For both models, we derive steady state probabilities that have matrix geometric form, and develop computational algorithms to obtain numerical solutions. We also analyze and make comparisons of these models based on numerical observations. 相似文献
15.
Koichi Nakade Masamitsu Ohnishf Toshihide Ibaraki Katsuhisa Ohno 《Queueing Systems》1992,11(3):241-254
We consider a parallel queueing system with identical exponential servers. Customers arrive according to a renewal process and upon arrival are immediately assigned to those queues. The problem is to find an optimal assignment policy minimizing the longrun average expected cost, without information about the current queue lengths, but with the initial queue-length distributions and information about the past arrival process and assignment of customers. In this paper, it is shown that the so-called circular assignment policy is optimal under mild conditions on the initial queue-length distributions and the holding cost. 相似文献
16.
In this article, we consider a single-server, finite-capacity queue with random bulk service rule where customers arrive according to a discrete-time Markovian arrival process (D-MAP). The model is denoted by D-MAP/G Y /1/M where server capacity (bulk size for service) is determined by a random variable Y at the starting point of services. A simple analysis of this model is given using the embedded Markov chain technique and the concept of the mean sojourn time of the phase of underlying Markov chain of D-MAP. A complete solution to the distribution of the number of customers in the D-MAP/G Y /1/M queue, some computational results, and performance measures such as the average number of customers in the queue and the loss probability are presented. 相似文献
17.
Philippe Nain 《Statistical Inference for Stochastic Processes》2002,5(3):307-320
The impact of bursty traffic on queues is investigated in this paper. We consider a discrete-time single server queue with
an infinite storage room, that releases customers at the constant rate of c customers/slot. The queue is fed by an M/G/∞ process. The M/G/∞ process can be seen as a process resulting from the superposition
of infinitely many ‘sessions’: sessions become active according to a Poisson process; a station stays active for a random
time, with probability distribution G, after which it becomes inactive. The number of customers entering the queue in the time-interval [t, t + 1) is then defined as the number of active sessions at time t (t = 0,1, ...) or, equivalently, as the number of busy servers at time t in an M/G/∞ queue, thereby explaining the terminology. The M/G/∞ process enjoys several attractive features: First, it can
display various forms of dependencies, the extent of which being governed by the service time distribution G. The heavier the tail of G, the more bursty the M/G/∞ process. Second, this process arises naturally in teletraffic as the limiting case for the aggregation
of on/off sources [27]. Third, it has been shown to be a good model for various types of network traffic, including telnet/ftp
connections [37] and variable-bit-rate (VBR) video traffic [24]. Last but not least, it is amenable to queueing analysis due
to its very strong structural properties. In this paper, we compute an asymptotic lower bound for the tail distribution of
the queue length. This bound suggests that the queueing delays will dramatically increase as the burstiness of the M/G/∞ input
process increases. More specifically, if the tail of G is heavy, implying a bursty input process, then the tail of the queue length will also be heavy. This result is in sharp
contrast with the exponential decay rate of the tail distribution of the queue length in presence of ‘non-bursty’ traffic
(e.g. Poisson-like traffic).
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
18.
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with exponential service times. A fixed number \(N\) of customers cycle through this network. We determine the joint sojourn time distribution of a tagged customer in, first, the general queue and, then, the exponential queue. Subsequently, we indicate how the approach toward this closed system also allows us to study the joint sojourn time distribution of a tagged customer in the equivalent open two-queue system, consisting of FCFS single server queues with general and exponential service times, respectively, in the case that the input process to the first queue is a Poisson process. 相似文献
19.
Alexander L. Stolyar 《Queueing Systems》2011,67(2):111-126
We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate λ at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of the next queue n+1. The question addressed is how steady-state queues scale as N→∞. We show that the answer depends on whether λ is below or above the critical value 1/4: in the former case the queues remain uniformly stochastically bounded, while otherwise
they grow to infinity. 相似文献
20.
In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The
system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition
of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according
to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the
overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. 相似文献