109 search results - page 1 / 22 » On queues with service and interarrival times depending on w... |
QUESTA
2007
13 years 4 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
2006
13 years 4 months ago
2006
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
QUESTA
2011
12 years 7 months ago
2011
Motivated by service levels in terms of the waiting-time distribution seen in e.g. call centers, we consider two models for systems with a service discipline that depends on the w...
SIGMETRICS
2010
ACM
13 years 3 months ago
2010
ACM
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...
QEST
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--In this paper we study a broad class of semiMarkovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue an...