Sciweavers

90 search results - page 13 / 18
» questa 2006
Sort
View
QUESTA
2007
88views more  QUESTA 2007»
13 years 7 months ago
On queues with service and interarrival times depending on waiting times
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...
Onno J. Boxma, Maria Vlasiou
QUESTA
2008
82views more  QUESTA 2008»
13 years 7 months ago
Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
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...
Augustus J. E. M. Janssen, Johan van Leeuwaarden, ...
QUESTA
2008
70views more  QUESTA 2008»
13 years 7 months ago
A note on the event horizon for a processor sharing queue
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...
Robert C. Hampshire, William A. Massey
QUESTA
2008
382views more  QUESTA 2008»
13 years 7 months ago
A note on stable flow-equivalent aggregation in closed networks
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...
Giuliano Casale
QUESTA
2010
89views more  QUESTA 2010»
13 years 5 months ago
Asymptotically optimal importance sampling for Jackson networks with a tree topology
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...
Ali Devin Sezer