Mixed queue disciplines in queueing systems with bounded queue
نویسندگان
چکیده
منابع مشابه
Auction-Based Queue Disciplines
Each one of several impatient agents has a job that needs to be processed by a server. The server can process the jobs sequentially, one at a time. Agents are privately informed about the realization of a random variable representing processing time. If the cost of delay is represented by a concave function of waiting time till job completion, the efficient shortest processing time first schedu...
متن کاملContext-Bounded Analysis of Concurrent Queue Systems
We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when individual processes are finite-state recursive programs provided a process dequeues messages only when its local...
متن کاملTo Queue or Not to Queue: Equilibrium Behavior in Queueing Systems
To the memory of my parents, Sara and Avraham Haviv To my mother and late father, Fela and Shimon Hassin Contents Preface xi 1. INTRODUCTION 1 1.1 Basic concepts 2 1.1.1 Strategies, payoffs, and equilibrium 2 1.1.2 Steady-state 4 1.1.3 Subgame perfect equilibrium 5 1.1.4 Evolutionarily stable strategies 5 1.1.5 The Braess paradox 5 1.1.6 Avoid the crowd or follow it? 6 1.2 Threshold strategies ...
متن کاملOn the M/G/1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملQueue-Length Distributions for Multi-Priority Queueing Systems
The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. While the probability generating function for the occupancy distribution of each traffic classes can be readily obtained, the occupancy distributions have been obtainable only rarely. However, the occupancy distribution is of great importance, particularly in those cases where th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1974
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1974.103517