Queueing systems with feedback
نویسندگان
چکیده
منابع مشابه
The ‘Concert Queueing Game’ with Feedback Routing
The objective of this paper is to dilate the interplay between feedback routing and strategic arrival behavior in single class queueing networks. We study a variation of the ‘Network Concert Queueing Game,’ wherein a fixed but large number of strategic users arrive at a network of queues where they can be routed to other nodes in the network following a fixed routing matrix, or potentially fedb...
متن کاملFair Queueing with Feedback-Based Policing
End-to-end congestion control is an important reason why the Internet is robust, scalable and simple to use. Unfortunately, purely end-to-end congestion control algorithms are incapable of preventing the unfair bandwidth allocations and congestion collapse caused by unresponsive applications, which are becoming increasingly prevalent in the Internet. In this paper, we propose a new mechanism ca...
متن کاملQueueing Systems with
Queueing Systems with Customer Abandonments and Retrials by Song Deng Doctor of Philosophy in Engineering Industrial Engineering & Operations Research University of California, Berkeley Assistant Professor Ying-Ju Chen , Co-chair Professor Zuo-Jun “Max” Shen , Co-chair In queueing theory, the phenomenon that customers get impatient and renege from the system when the waiting time exceeds their ...
متن کاملOn-line Sensitivity Analysis of Feedback Controlled Queueing Systems
This paper develops a new method to on-line estimate performance sensitivities between the nominal system and the perturbed systems. In this method, the performance measures of the nominal system are rst obtained by observing a sample path of the nominal system. Then, estimators which utilize the proportional relationship between the steady state probabilities of the nominal and perturbed syste...
متن کاملQueueing Systems with Synergistic Servers
We consider tandem lines with finite buffers and flexible, heterogeneous servers who are synergistic in that they work more effectively in teams than on their own. Our objective is to determine how the servers should be assigned dynamically to tasks in order to maximize the long-run average throughput. In particular, we investigate when it is better to take advantage of synergy among servers, r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1971
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-12-4-373-384