首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the queue becomes empty, whichever occurs first. We consider Poisson batch arrivals and phase-type service times. It is known that these disciplines do not satisfy the well-known branching property in polling systems. Therefore, hardly any exact results exist in the literature. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-lengths at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains.  相似文献   

2.
We consider a single-server cyclic polling system with three queues where the server follows an adaptive rule: if it finds one of queues empty in a given cycle, it decides not to visit that queue in the next cycle. In the case of limited service policies, we prove stability and instability results under some conditions which are sufficient but not necessary, in general. Then we discuss open problems with identifying the exact stability region for models with limited service disciplines: we conjecture that a necessary and sufficient condition for the stability may depend on the whole distributions of the primitive sequences, and illustrate that by examples. We conclude the paper with a section on the stability analysis of a polling system with either gated or exhaustive service disciplines.  相似文献   

3.
In this paper we compare several service disciplines commonly used in polling systems. We present a sample path comparison which allows us to evaluate the efficiency of the different policies based on thetotal amount of work found in the systemat any time. The analysis is carried out for a large variety of polling schemes under fairly general conditions and can be used to construct a hierarchy of the different service schemes.  相似文献   

4.
Consider a polling system withK1 queues and a single server that visits the queues in a cyclic order. The polling discipline in each queue is of general gated-type or exhaustive-type. We assume that in each queue the arrival times form a Poisson process, and that the service times, the walking times, as well as the set-up times form sequences of independent and identically distributed random variables. For such a system, we provide a sufficient condition under which the vector of queue lengths is stable. We treat several criteria for stability: the ergodicity of the process, the geometric ergodicity, and the geometric rate of convergence of the first moment. The ergodicity implies the weak convergence of station times, intervisit times and cycle times. Next, we show that the queue lengths, station times, intervisit times and cycle times are stochastically increasing in arrival rates, in service times, in walking times and in setup times. The stability conditions and the stochastic monotonicity results are extended to the polling systems with additional customer routing between the queues, as well as bulk and correlated arrivals. Finally, we prove that the mean cycle time, the mean intervisit time and the mean station times are invariant under general service disciplines and general stationary arrival and service processes.  相似文献   

5.
6.
This paper considers the stability of BMAP/GI/1 periodic polling models with mixed service disciplines. The server attends the N stations in a repeating sequence of stages. Customers arrive to the stations according to batch Markov arrival processes (BMAPs). The service times of the stations are general independent and identically distributed. The characterization of global stability of the system, the order of instability of stations and the necessary and sufficient condition for the stability are given. Our stability analysis is based on the investigation of the embedded Markovian chains at the polling epochs, which allows a much simpler discussion than the formerly applied approaches. This work can also be seen as a survey on stability of a quite general set of polling models, since the majority of the known results of the field is a special case of the presented ones.  相似文献   

7.
van der Mei  R.D.  Levy  H. 《Queueing Systems》1997,27(3-4):227-250
We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

8.
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that we consider the reneging of customers at polling instants. In more detail, whenever the server starts or ends a visit to a queue, some of the customers waiting in each queue leave the system before having received service. The probability that a certain customer leaves the queue, depends on the queue in which the customer is waiting, and on the location of the server. We show that this system can be analysed by introducing customer subtypes, depending on their arrival periods, and keeping track of the moment when they abandon the system. In order to determine waiting time distributions, we regard the system as a polling model with varying arrival rates, and apply a generalised version of the distributional form of Little??s law. The marginal queue length distribution can be found by conditioning on the state of the system (position of the server, and whether it is serving or switching).  相似文献   

9.
We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the system. For the exhaustive service discipline, we study the batch sojourn-time, which is defined as the time from an arrival epoch until service completion of the last customer in the batch. We obtain exact expressions for the Laplace–Stieltjes transform of the steady-state batch sojourn-time distribution, which can be used to determine the moments of the batch sojourn-time and, in particular, its mean. However, we also provide an alternative, more efficient way to determine the mean batch sojourn-time, using mean value analysis. We briefly show how our framework can be applied to other service disciplines: locally gated and globally gated. Finally, we compare the batch sojourn-times for different service disciplines in several numerical examples. Our results show that the best performing service discipline, in terms of minimizing the batch sojourn-time, depends on system characteristics.  相似文献   

10.
In this paper we present a unified analysis of the BMAP/G/1 cyclic polling model and its application to the gated and exhaustive service disciplines as examples. The applied methodology is based on the separation of the analysis into service discipline independent and dependent parts. New expressions are derived for the vector-generating function of the stationary number of customers and for its mean in terms of vector quantities depending on the service discipline. They are valid for a broad class of service disciplines and both for zero- and nonzero-switchover-times polling models. We present the service discipline specific solution for the nonzero-switchover-times model with gated and exhaustive service disciplines. We set up the governing equations of the system by using Kronecker product notation. They can be numerically solved by means of a system of linear equations. The resulting vectors are used to compute the service discipline specific vector quantities.  相似文献   

11.
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that they are always served before any low priority customers. But high priority customers have a second advantage over low priority customers. Low priority customers are served according to the gated service discipline, i.e. only customers standing in front of the gate are served during this visit. In contrast, high priority customers arriving during the visit period of the queue are allowed to pass the gate and all low priority customers before the gate. We study the cycle time distribution, the waiting time distributions for each customer type, the joint queue length distribution of all priority classes at all queues at polling epochs, and the steady-state marginal queue length distributions for each customer type. Through numerical examples we illustrate that the mixed gated/exhaustive service discipline can significantly decrease waiting times of high priority jobs. In many cases there is a minimal negative impact on the waiting times of low priority customers but, remarkably, it turns out that in polling systems with larger switch-over times there can be even a positive impact on the waiting times of low priority customers.  相似文献   

12.
van der Mei  R.D. 《Queueing Systems》2000,36(4):381-404
Consider an asymmetric cyclic polling system with general service-time and switch-over time distributions, and with general mixtures of exhaustive and gated service, in heavy traffic. We obtain explicit expressions for all moments of the steady-state delay at each of the queues, under heavy-traffic scalings. The expressions are strikingly simple: they depend on only a few system parameters, and moreover, can be expressed as finite products of simple known terms. The exact results provide new and useful insights into the behavior of polling systems in heavy traffic. In addition, the results suggest simple and fast approximations for the moments of the delay in stable polling systems. Numerical experiments demonstrate the usefulness of the approximations for moderately and heavily loaded systems.  相似文献   

13.
S. C. Borst 《Queueing Systems》1995,20(3-4):369-393
We consider polling systems with multiple coupled servers. We explore the class of systems that allow an exact analysis. For these systems we present distributional results for the waiting time, the marginal queue length, and the joint queue length at polling epochs. The class in question includes several single-queue systems with a varying number of servers, two-queue two-server systems with exhaustive service and exponential service times, as well as infinite-server systems with an arbitrary number of queues, exhaustive or gated service, and deterministic service times.  相似文献   

14.
Monotonicity and stability of periodic polling models   总被引:2,自引:2,他引:0  
This paper deals with the stability of periodic polling models with a mixture of service policies. Customers arrive according to independent Poisson processes. The service times and the switchover times are independent with general distributions. The necessary and sufficient condition for the stability of such polling systems is established. The proof is based on the stochastic monotonicity of the state process at the polling instants. The stability of only a subset of the queues is also analyzed and, in case of heavy traffic, the order of explosion of the queues is given. The results are valid for a model with set-up times, and also when there is a local priority rule at the queues.This work was supported in part by a Fellowship of the Netherlands Organization for Scientific Research NWO-ECOZOEK.  相似文献   

15.
In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals with a system consisting of two queues, one of which has gated service, while the other receives 1-limited service. The second open problem concerns polling systems with general (renewal) arrivals and deterministic switch-over times that become infinitely large. We discuss related, known results for both problems, and the difficulties encountered when trying to solve them.  相似文献   

16.
In this paper we focus on a class of polling systems encountered while modeling the ferry based wireless local area network (FWLAN). A moving ferry, while walking in a predetermined cyclic path, communicates with the static nodes (or users) of the network via a wireless link. The ferry is assumed to stop and communicate with a node that has a packet to send or to receive, when it is closest to that node. The location distribution of the node to which or from which a packet arrives is assumed to have a support of positive Lebesgue measure. These features imply that polling models with finite number of queues cannot be used to model the system. We study in this paper the continuous polling systems with service disciplines that model the use of the FWLAN (and that are more complex than the classical exhaustive or gated services). Our approach is based on discretization of the continuous polling model. We propose a special way of discretizing the continuous system such that: (1)?the known Pseudo conservation laws can be applied to obtain the stationary expected workload of the discrete systems; (2)?the limit, of these ??discretized' expected workloads, equals the stationary expected workload of the continuous system. Our results rely heavily on fixed point analysis of infinite dimensional operators.  相似文献   

17.
An iterative numerical technique for the evaluation of queue length distributions is applied to multi-queue systems with one server and cyclic service discipline with Bernoulli schedules. The technique is based on power-series expansions of the state probabilities as functions of the load of the system. The convergence of the series is accelerated by applying a modified form of the epsilon algorithm. Attention is paid to economic use of memory space.  相似文献   

18.
In this paper we derive decomposition results for the number of customers in polling systems under arbitrary (dynamic) polling order and service policies. Furthermore, we obtain sharper decomposition results for both the number of customers in the system and the waiting times under static polling policies. Our analysis, which is based on distributional laws, relaxes the Poisson assumption that characterizes the polling systems literature. In particular, we obtain exact decomposition results for systems with either Mixed Generalized Erlang (MGE) arrival processes, or asymptotically exact decomposition results for systems with general renewal arrival processes under heavy traffic conditions. The derived decomposition results can be used to obtain the performance analysis of specific systems. As an example, we evaluate the performance of gated Markovian polling systems operating under heavy traffic conditions. We also provide numerical evidence that our heavy traffic analysis is very accurate even for moderate traffic. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

19.
For multitype branching processes with immigration evolving in a random environment and producing a final product, we find the tail distribution of the size of the final product accumulated in the process for a life period. Using this result, we investigate the tail distributions of the busy periods of the queueing polling systems of branching type with random service disciplines and random positive switch-over times.  相似文献   

20.
We consider a multi-access communication channel such as a centrally-controlled polling system, a distributed token-based ring, or a bus network. A message priority-based polling procedure is used to control the access to the channel. This procedure requires the server to have no advance information concerning the number of messages resident at a station prior to its visit to the station. Messages arriving at each station belong to one of two priority classes: class-1 (high priority) and class-2 (low priority). Class-1 messages are served under an exhaustive service discipline, while class-2 messages are served under a limited service discipline. Class-1 messages have non-preemptive priority over class-2 messages resident at the same station. Using a fully symmetric system model, an exact expression for the sum of the mean waiting times of class-1 and class-2 messages is first derived. Upper and lower bounds for the mean message waiting times for each individual message class are then obtained.This work was supported by NFS Grant No. NCR-8914690, Pacific-Bell and MICRO Grant No. 90-135 and US West Contract No. D890701.  相似文献   

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

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