A computer processing queueing system with feedback
نویسندگان
چکیده
منابع مشابه
Computer Networks A simple queueing system
The letter M stands for memoryless, i.e. the Poisson process with exponential distribution. Other possibilities include D for deterministic inter-arrival times, and G denoting a general distribution of inter-arrival times. Therefore, the M/M/1 queueing system consists of customers arriving according to a Poisson process with rate λ, and one server with a service time per customer that is expone...
متن کاملQueueing Models for Computer Communications System Analysis
Modeling and performance prediction are becoming increasingly important issues in the design and operation of computer communications systems. Complexities in their configuration and sophistications in resource sharing found in today’s computer communications demand our intensive ffort to enhance the modeling capability. The present paper is intended to review the state of affairs of analytic m...
متن کاملRobust Feedback Control of a Single Server Queueing System
This paper extends previous work of Ball-Day-Kachroo [2] to control of a model of a simple queueing server. There are n queues of customers to be served by a server who can service only one queue at a time. Each queue is subject to a unknown arrival rate, called a “disturbance” in accord with standard usage from H∞ theory. An H∞-type performance criterion is formulated. The resulting control pr...
متن کاملA Queueing-Inventory System with Repair Center for Defective Items and One-for-One Ordering Policy
In this paper we consider a system consisting of a supplier with a single processing unit, a repair center, and a retailer with Poisson demand. We assume that the retailer applies one-for-one ordering policy with backorders for his inventory control. The retailer’s orders form a queue in the supplier processing unit. We also assume that a certain fraction of the products produced by the supplie...
متن کاملA queueing system with vacations
This paper is devoted to the study of an M/G/1 queue with a particular vacation discipline. The server is due to take a vacation as soon as it has served exactly N customers since the end of the previous vacation. N may be either a constant or a random variable. If the system becomes empty before the server has served N customers, then it stays idle until the next customer arrival. Such a vacat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1970
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(70)90244-5