Sciweavers

794 search results - page 9 / 159
» A push-pull queueing system
Sort
View
WSC
2008
14 years 12 months ago
Queueing models for single machine manufacturing systems with interruptions
Queueing theory is a well-known method for evaluating the performance of manufacturing systems. When we want to analyze the performance of a single machine, M/M/1 queues or approx...
Kan Wu, Leon F. McGinnis, Bert Zwart
COR
2010
124views more  COR 2010»
14 years 9 months ago
On tandem blocking queues with a common retrial queue
We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available...
Konstantin Avrachenkov, Uri Yechiali
QUESTA
2006
115views more  QUESTA 2006»
14 years 9 months ago
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study prio...
Benny Van Houdt, Chris Blondia
QUESTA
2007
170views more  QUESTA 2007»
14 years 9 months ago
Priority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
Tom Maertens, Joris Walraevens, Herwig Bruneel
65
Voted
SODA
2004
ACM
83views Algorithms» more  SODA 2004»
14 years 11 months ago
Caching queues in memory buffers
Motivated by the need for maintaining multiple, large queues of data in modern high-performance systems, we study the problem of caching queues in memory under the following simpl...
Rajeev Motwani, Dilys Thomas