90 search results - page 13 / 18 » questa 2006 |
101
click to vote
QUESTA
2007
14 years 12 months ago
2007
We consider an extension of the standard G/G/1 queue, described by the equation W D = max{0, B − A + Y W}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model red...
QUESTA
2008
14 years 11 months ago
2008
To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s . I...
QUESTA
2008
14 years 11 months ago
2008
In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshi...
135
click to vote
QUESTA
2008
14 years 11 months ago
2008
We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically st...
104
Voted
QUESTA
2010
14 years 10 months ago
2010
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...