Finite-buffer polling systems with threshold-based switching policy
نویسندگان
چکیده
منابع مشابه
Finite-buffer polling systems with threshold-based switching policy
We consider a system of two separate finite-buffer M/M/1 queues served by a single server, where the switching mechanism between the queues is thresholdbased, determined by the queue which is not being served. Applications may be found in data centers, smart traffic-light control and human behavior. Specifically, whenever the server attends queue i (Qi ) and the number of customers in the other...
متن کاملPolling Models with Threshold Switching
We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T , either preemptively or non-preemptively. All switches are insta...
متن کاملFinite buffer polling models with routing
This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant result of the analysis is the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue length...
متن کاملTwo-Queue Polling Systems with Switching Policy Based on the Queue which is Not Being Served
We study a system of two non-identical and separate M/M/1/• queues with capacities (buffers) C1 < ∞ and C2 = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the se...
متن کاملOn the Optimal Policy for Deterministic and Exponential Polling Systems
In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2016
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-015-0408-6