Waiting times in discrete-time cyclic-service systems
نویسندگان
چکیده
منابع مشابه
An Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service
The cyclic server system has been the subject of considerable research over the last few years. Interest in analyzing such systems has gained momentum due to their application in the performance analysis of token ring networks. In this paper we consider cyclic server systems with nonexhaustive service discipline. The performance measures of interest here are the mean waiting times at the nodes ...
متن کاملWaiting times in polling systems with various service disciplines
We consider a polling system of N queues Q1, . . . , QN , cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Qi, i = 1, . . . , N , it serves a number of customers according to a certain visit discipline. This discipline is assumed to belong to the class of bran...
متن کاملWaiting-time Approximations for Cyclic-service Systems with Mixed Service Strategies
An approximation method for mean waiting times in cyclic-service systems with a mixture of exhaustive/ gated/ I-limited service strategies is presented. The method provides a unification and generalization of some known good approximations for single strategies. The results of an exact analysis of the two-queue case where one queue is served exhaustively and the other queue I-limited, support t...
متن کاملWaiting time characteristics in cyclic queues
In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.
متن کاملDiscrete-time multiserver queues with geometric service times
In this paper, a discrete-time multiserver queueing system with in4nite bu5er size and general independent arrivals is considered. The service times of packets are assumed to be independent and identically distributed according to a geometric distribution. Each packet gets service from only one server. In the paper, the behavior of the queueing system is studied analytically by means of a gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1988
ISSN: 0090-6778
DOI: 10.1109/26.2746