共查询到10条相似文献,搜索用时 78 毫秒
1.
This paper presents an analysis of generalized Order Independent (OI) loss queues serving customers belonging to different types (classes) where limits are placed on the number of customers of each type that may be present in the system. We prove that such queues satisfy partial balance and we present their stationary distribution. OI loss queues can be used to model blocking systems with simultaneous resource possession with the option of queueing blocked customers. The OI loss queue thus extends previous loss models where customers are rejected when processing resources are not available.This work was supported by grants from the Foundation for Research Development. 相似文献
2.
《Indagationes Mathematicae》2023,34(5):1064-1076
This paper considers the cycle maximum in birth–death processes as a stepping stone to characterisation of the asymptotic behaviour of the maximum number of customers in single queues and open Kelly–Whittle networks of queues. For positive recurrent birth–death processes we show that the sequence of sample maxima is stochastically compact. For transient birth–death processes we show that the sequence of sample maxima conditioned on the maximum being finite is stochastically compact.We show that the Markov chain recording the total number of customers in a Kelly–Whittle network is a birth–death process with birth and death rates determined by the normalising constants in a suitably defined sequence of closed networks. Explicit or asymptotic expressions for these normalising constants allow asymptotic evaluation of the birth and death rates, which, in turn, allows characterisation of the cycle maximum in a single busy cycle, and convergence of the sequence of sample maxima for Kelly–Whittle networks of queues. 相似文献
3.
We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show
that for tandem reentrant queues the last-buffer first-served (LBFS) policy stochastically maximizes the departure process.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
4.
We consider a two-station tandem queueing system where customers arrive according to a Poisson process and must receive service
at both stations before leaving the system. Neither queue is equipped with dedicated servers. Instead, we consider three scenarios
for the fluctuations of workforce level. In the first, a decision-maker can increase and decrease the capacity as is deemed
appropriate; the unrestricted case. In the other two cases, workers arrive randomly and can be rejected or allocated to either station. In one case the
number of workers can then be reduced (the controlled capacity reduction case). In the other they leave randomly (the uncontrolled capacity reduction case). All servers are capable of working collaboratively on a single job and can work at either station as long as they
remain in the system. We show in each scenario that all workers should be allocated to one queue or the other (never split
between queues) and that they should serve exhaustively at one of the queues depending on the direction of an inequality.
This extends previous studies on flexible systems to the case where the capacity varies over time. We then show in the unrestricted
case that the optimal number of workers to have in the system is non-decreasing in the number of customers in either queue.
AMS subject classification: 90B22, 90B36 相似文献
5.
This paper introduces a new class of queues which are quasi-reversible and therefore preserve product form distribution when connected in multinode networks. The essential feature leading to the quasi-reversibility of these queues is the fact that the total departure rate in any queue state is independent of the order of the customers in the queue. We call such queues order independent (OI) queues. The OI class includes a significant part of Kelly's class of symmetric queues, although it does not cover the whole class. A distinguishing feature of the OI class is that, among others, it includes the MSCCC and MSHCC queues but not the LCFS queue. This demonstrates a certain generality of the class of OI queues and shows that the quasi-reversibility of the OI queues derives from causes other than symmetry principles. Finally, we examine OI queues where arrivals to the queue are lost when the number of customers in the queue equals an upper bound. We obtain the stationary distribution for the OI loss queue by normalizing the stationary probabilities of the corresponding OI queue without losses. A teletraffic application for the OI loss queue is presented. 相似文献
6.
In this paper we characterize the queue-length distribution as well as the waiting time distribution of a single-server queue
which is subject to service interruptions. Such queues arise naturally in computer and communication problems in which customers
belong to different classes and share a common server under some complicated service discipline. In such queues, the viewpoint
of a given class of customers is that the server is not available for providing service some of the time, because it is busy
serving customers from a different class. A natural special case of these queues is the class of preemptive priority queues.
In this paper, we consider arrivals according the Markovian Arrival Process (MAP) and the server is not available for service
at certain times. The service times are assumed to have a general distribution. We provide numerical examples to show that
our methods are computationally feasible.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
7.
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. 相似文献
8.
We consider a single server system consisting of n queues with different types of customers and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service
facility (head-of-the-line processor-sharing). By means of Loynes’ monotonicity method a stationary work load process is constructed
and using sample path analysis general stability conditions are derived. They allow to decide which queues are stable and,
moreover, to compute the fraction of processor capacity devoted to the permanent customers. In case of a stable system the
constructed stationary state process is the only one and for any initial state the system converges pathwise to the steady
state.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
We introduce a simple approach for the analysis of the M/M/c queues with a single class of customers and constant impatience time by finding simple Markov processes (see (2.1) and (2.15) below), and then by applying this approach we analyze the M/M/1 queues with two classes of customers in which class 1 customers have impatience of constant duration, and class 2 customers have no impatience and lower priority than class 1 customers. 相似文献
10.
In this paper we focus on networks of infinite-server queues with nonhomogeneous Poisson arrival processes. We start by introducing a more general Poisson-arrival-location model (PALM) in which arrivals move independently through a general state space according to a location stochastic process after arriving according to a nonhomogeneous Poisson process. The usual open network of infinite-server queues, which is also known as a linear population process or a linear stochastic compartmental model, arises in the special case of a finite state space. The mathematical foundation is a Poisson-random-measure representation, which can be obtained by stochastic integration. It implies a time-dependent product-form result: For appropriate initial conditions, the queue lengths (numbers of customers in disjoint subsets of the state space) at any time are independent Poisson random variables. Even though there is no dependence among the queue lengths at each time, there is important dependence among the queue lengths at different times. We show that the joint distribution is multivariate Poisson, and calculate the covariances. A unified framework for constructing stochastic processes of interest is provided by stochastically integrating various functionals of the location process with respect to the Poisson arrival process. We use this approach to study the flows in the queueing network; e.g., we show that the aggregate arrival and departure processes at a given queue (to and from other queues as well as outside the network) are generalized Poisson processes (without necessarily having a rate or unit jumps) if and only if no customer can visit that queue more than once. We also characterize the aggregate arrival and departure processes when customers can visit the queues more frequently. In addition to obtaining structural results, we use the stochastic integrals to obtain explicit expressions for time-dependent means and covariances. We do this in two ways. First, we decompose the entire network into a superposition of independent networks with fixed deterministic routes. Second, we make Markov assumptions, initially for the evolution of the routes and finally for the entire location process. For Markov routing among the queues, the aggregate arrival rates are obtained as the solution to a system of input equations, which have a unique solution under appropriate qualifications, but not in general. Linear ordinary differential equations characterize the time-dependent means and covariances in the totally Markovian case. 相似文献