共查询到20条相似文献,搜索用时 15 毫秒
1.
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. 相似文献
2.
In queueing theory, most models are based on time-homogeneous arrival processes and service time distributions. However, in communication networks arrival rates and/or the service capacity usually vary periodically in time. In order to reflect this property accurately, one needs to examine periodic rather than homogeneous queues. In the present paper, the periodic BMAP/PH/c queue is analyzed. This queue has a periodic BMAP arrival process, which is defined in this paper, and phase-type service time distributions. As a Markovian queue, it can be analysed like an (inhomogeneous) Markov jump process. The transient distribution is derived by solving the Kolmogorov forward equations. Furthermore, a stability condition in terms of arrival and service rates is proven and for the case of stability, the asymptotic distribution is given explicitly. This turns out to be a periodic family of probability distributions. It is sketched how to analyze the periodic BMAP/M
t
/c queue with periodically varying service rates by the same method. 相似文献
3.
We consider a discrete time single server queueing system where the arrival process is governed by a discrete autoregressive
process of order p (DAR(p)), and the service time of a customer is one slot. For this queueing system, we give an expression for the mean queue size,
which yields upper and lower bounds for the mean queue size. Further we propose two approximation methods for the mean queue
size. One is based on the matrix analytic method and the other is based on simulation. We show, by illustrations, that the
proposed approximations are very accurate and computationally efficient. 相似文献
4.
Ioannis Stavrakakis 《Annals of Operations Research》1994,49(1):79-100
A discrete-time, two-server queueing system is studied in this paper. The service time of a customer (cell) is fixed and equal to one time unit. Server 1 provides for periodic service of the queue (periodT). Server 2 provides for service only when server 1 is unavailable and provided that the associated service credit is nonzero. The resulting system is shown to model the queueing behavior of a network user which is subject to traffic regulation for congestion avoidance in high speed ATM networks. A general methodology is developed for the study of this queueing system, based on renewal theory. The dimensionality of the developed model is independent ofT;T increases with the network speed. The cell loss probabilities are computed in the case of finite capacity queue.Research supported by the National Science Foundation under grant NCR-9011962. 相似文献
5.
We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server
not only serves customers, but also performs acquisition of new customers. The server has to divide its energy between both
activities. The number of newly acquired customers is uncertain, and the effect of the server’s acquisition efforts can only
be seen after some fixed time period δ (delay).
The acquisition queue constitutes a (δ+1)-dimensional Markov chain. The limiting queue length distribution is derived in terms of its probability generating function,
and an exact expression for the mean queue length is given. For large values of δ the numerical procedures needed for calculating the mean queue length become computationally cumbersome. We therefore complement
the exact expression with a fluid approximation.
One of the key features of the acquisition queue is that the server performs more acquisition when the queue is small. Together
with the delay, this causes the queue length process to show a strongly cyclic behavior. We propose and investigate several
ways of planning the acquisition efforts. In particular, we propose an acquisition scheme that is designed specifically to
reduce the cyclic behavior of the queue length process.
This research was financially supported by the European Network of Excellence Euro-NGI. The work of the second author was
supported in part by a TALENT grant from the Netherlands Organisation for Scientific Research (NWO). 相似文献
6.
Louiza Bouallouche-Medjkoune Djamil Aissani 《Mathematical Methods of Operations Research》2006,63(2):341-356
In this work, we apply the strong stability method to obtain an estimate for the proximity of the performance measures in the M/G/1 queueing system to the same performance measures in the M/M/1 system under the assumption that the distributions of the service time are close and the arrival flows coincide. In addition to the proof of the stability fact for the perturbed M/M/1 queueing system, we obtain the inequalities of the stability. These results give with precision the error, on the queue size stationary distribution, due to the approximation. For this, we elaborate from the obtained theoretical results, the STR-STAB algorithm which we execute for a determined queueing system: M/Coxian − 2/1. The accuracy of the approach is evaluated by comparison with simulation results. 相似文献
7.
Tsuyoshi Katayama 《Queueing Systems》2007,57(4):169-178
We consider a multi-class priority queueing system with a non-preemptive time-limited service controlled by an exponential
timer and multiple (or single) vacations. By reducing the service discipline to the Bernoulli schedule, we obtain an expression
for the Laplace-Stieltjes transform (LST) of the waiting time distribution via an iteration procedure, and a recursive scheme
to calculate the first two moments. It is noted that we have to select embedded Markov points based on the service beginning
epochs instead of the service completion epochs adopted for most of M/G/1 queueing analyses. Through the queue-length analysis, we obtain a decomposition form for the LST of the waiting time in
each queue having the exhaustive service.
相似文献
8.
Kuo-Hsiung Wang Li-Ping Wang Jau-Chuan Ke Gang Chen 《Mathematical Methods of Operations Research》2005,61(3):505-520
In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate steady-state probability distributions of the queue length in the M/G(G)/1 queueing system, where the second and the third symbols denote service time and repair time distributions, respectively. A study of the derived approximate results, compared to the exact results for the M/M(M)/1, M/E2(E3)/1, M/H2(H3)/1 and M/D(D)/1 queueing systems, suggest that the maximum entropy principle provides a useful method for solving complex queueing systems. Based on the simulation results, we demonstrate that the N policy M/G(G)/1 queueing model is sufficiently robust to the variations of service time and repair time distributions. 相似文献
9.
We study a discrete-time GI/Geo/1 queue with server vacations. In this queueing system, the server takes vacations when the system does not have any waiting customers at a service completion instant or a vacation completion instant. This type of discrete-time queueing model has potential applications in computer or telecommunication network systems. Using matrix-geometric method, we obtain the explicit expressions for the stationary distributions of queue length and waiting time and demonstrate the conditional stochastic decomposition property of the queue length and waiting time in this system. 相似文献
10.
Diffusion Approximations for Queues with Markovian Bases 总被引:2,自引:0,他引:2
Toshikazu Kimura 《Annals of Operations Research》2002,113(1-4):27-40
Consider a base family of state-dependent queues whose queue-length process can be formulated by a continuous-time Markov process. In this paper, we develop a piecewise-constant diffusion model for an enlarged family of queues, each of whose members has arrival and service distributions generalized from those of the associated queue in the base. The enlarged family covers many standard queueing systems with finite waiting spaces, finite sources and so on. We provide a unifying explicit expression for the steady-state distribution, which is consistent with the exact result when the arrival and service distributions are those of the base. The model is an extension as well as a refinement of the M/M/s-consistent diffusion model for the GI/G/s queue developed by Kimura [13] where the base was a birth-and-death process. As a typical base, we still focus on birth-and-death processes, but we also consider a class of continuous-time Markov processes with lower-triangular infinitesimal generators. 相似文献
11.
《Optimization》2012,61(3):259-281
In this paper we are concerned with several random processes that occur in M/G2/l queue with instantaneous feedback in which the feedback decision process is a pair of independent Bernoulli processes. The stationary distribution of the output process has been obtained. Results for particular queues with feedback and without feedback are obtained. Some operating characteristics are derived for this queue. Some interesting results are obtained for departure processes. Optimum service rate is obtained. Numerical examples are provided to test the feasibility of the queueing model 相似文献
12.
Che Soong Kim Moon Ho Lee Alexander Dudin Valentina Klimenok 《Annals of Operations Research》2008,162(1):57-68
In this paper, we consider an N-server queueing model with homogeneous servers in which customers arrive according to a stationary Poisson arrival process.
The service times are exponentially distributed. Two new customer’s service disciplines assuming simultaneous service of arriving
customer by all currently idle servers are discussed. The steady state analysis of the queue length and sojourn time distribution
is performed by means of the matrix analytic methods. Numerical examples, which illustrate advantage of introduced disciplines
comparing to the classical one, are presented. 相似文献
13.
In this paper we consider a queueing model that results from at least two apparently unrelated areas. One motivation to study a system of this type results from a test case of a computer simulation factor screening technique calledfrequency domain methodology. A second motivation comes from manufacturing, where due to cyclic scheduling of upstream machines, the arrival process to downstream machines is periodic. The model is a single server queue with FIFO service discipline and exponential interarrival and service times where the arrival and/or service rates are deterministic cyclic functions of the customer sequence number. We provide steady state results for the mean number in the system for the model with cyclic arrival and fixed service rates and for the model with fixed arrival and cyclic service rates. For the model with both cyclic arrival and service rates, upper and lower bounds are developed for the steady state mean waiting time in the system. Throughout the paper various implications and/or insights derived from the results of this study are discussed for frequency domain methodology.The authors acknowledge the financial support of the CBA/GSB Faculty Research Committee of the College of Business Administration, The University of Texas at Austin. 相似文献
14.
We first consider a single-server queue that serves a tagged MMPP-2 stream and a background MMPP-2 stream in a FIFO manner. The service time is exponentially distributed. For this queueing system, we obtain the CDF of the tagged inter-departure time, from which we can calculate the jitter, defined as a percentile of the inter-departure time. The formulation is exact, but the solution is obtained numerically, which introduces an error that has been found to be negligible. Subsequently, we consider a tandem queueing network consisting of N tandem queues, which is traversed by the MMPP-2 tagged stream, and where each queue also serves a local MMPP-2 background stream. For this queueing network, we obtain an upper bound on the CDF of the inter-departure time from the Nth queue using a heavy traffic approximation, and we verify it by simulation. 相似文献
15.
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. 相似文献
16.
Rosario Delgado 《Mathematical Methods of Operations Research》2010,72(3):477-499
We study the stability of subcritical multi-class queueing networks with feedback allowed and a work-conserving head-of-the-line
service discipline. Assuming that the fluid limit model associated to the queueing network satisfies a state space collapse condition, we show that the queueing network is stable provided that any solution of an associated linear Skorokhod problem
is attracted to the origin in finite time. We also give sufficient conditions ensuring this attraction in terms of the reflection
matrix of the Skorokhod problem, by using an adequate Lyapunov function. State space collapse establishes that the fluid limit of the queue process can be expressed in terms of the fluid limit of the workload process
by means of a lifting matrix. 相似文献
17.
The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (a) To introduce new derivations
of some well-known results, and (b) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service.
Dedicated to Arie Hordijk on his 65th birthday, in friendship and admiration. 相似文献
18.
19.
This paper deals with an MX/G/1 queueing system with a vacation period which comprises an idle period and a random setup period. The server is turned
off each time when the system becomes empty. At this point of time the idle period starts. As soon as a customer or a batch
of customers arrive, the setup of the service facility begins which is needed before starting each busy period. In this paper
we study the steady state behaviour of the queue size distributions at stationary (random) point of time and at departure
point of time. One of our findings is that the departure point queue size distribution is the convolution of the distributions
of three independent random variables. Also, we drive analytically explicit expressions for the system state probabilities
and some performance measures of this queueing system. Finally, we derive the probability generating function of the additional
queue size distribution due to the vacation period as the limiting behaviour of the MX/M/1 type queueing system.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
20.
We consider anM/G/1 priority retrial queueing system with two types of calls which models a telephone switching system and a cellular mobile communication system. In the case that arriving calls are blocked due to the server being busy, type I calls are queued in a priority queue of finite capacityK whereas type II calls enter the retrial group in order to try service again after a random amount of time. In this paper we find the joint generating function of the numbers of calls in the priority queue and the retrial group in closed form. When 1=0, it is shown that our results are consistent with the known results for a classical retrial queueing system. 相似文献