Results 1  10
of
678
Queues with WorkloadDependent Arrival and Service Rates
"... We consider two types of queues with workloaddependent arrival rate and service speed. Our study is motivated by queueing scenarios where the arrival rate and/or speed of the server depends on the amount of work present, like production systems and the Internet. First, in the M/G/1 case, we compare ..."
Abstract
 Add to MetaCart
We consider two types of queues with workloaddependent arrival rate and service speed. Our study is motivated by queueing scenarios where the arrival rate and/or speed of the server depends on the amount of work present, like production systems and the Internet. First, in the M/G/1 case, we
Queues with workloaddependent arrival and service rates. Queueing Systems 2004
"... TU/e technische universiteit eindhoven ..."
Finitebuffer queues with workloaddependent service and arrival rates. Queueing Systems
"... We consider M/G/1 queues with workloaddependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer im ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider M/G/1 queues with workloaddependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer
Queueing for ergodic arrivals and services
, 709
"... In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger than exponential tail. ..."
Abstract
 Add to MetaCart
In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger than exponential tail.
On queues with Markovmodulated service rates. Queueing Systems
 Queueing Systems
, 2005
"... In this paper, we consider a queue whose service speed changes according to an external environment that is governed by a Markov process. It is possible that the server changes its service speed many times while serving a customer. We derive first and second moments of the service time of customers ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
in system using first step analysis to obtain an insight on the service process. In fact, we obtain an intriguing result in that the moments of service time actually depend on the arrival process! We also show that the mean service rate is not the reciprocal of the mean service time. Further, since
Maximizing Queueing Network Utility Subject to Stability: Greedy Primaldual algorithm
 Queueing Systems
, 2005
"... We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has assoc ..."
Abstract

Cited by 204 (9 self)
 Add to MetaCart
associated \traditional " queueing control eect, i.e., it determines traÆc (customer) arrival rates, service rates at the nodes, and random routing of processed customers among the nodes. The problem is to nd a dynamic control strategy which maximizes a concave utility function H(X), where X
A Queue with Periodic Arrivals and Constant Service Rate
 In Chapter 10 of Probability, Statistics and Optimization a Tribute
, 1994
"... : Consider a queueing system in which K sources each generate 1=M units of work once every time unit. The phases of the sources are mutually independent, and each phase is uniformly distributed over the unit interval. The queue is served at unit rate. The distribution of the typical work and the max ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
: Consider a queueing system in which K sources each generate 1=M units of work once every time unit. The phases of the sources are mutually independent, and each phase is uniformly distributed over the unit interval. The queue is served at unit rate. The distribution of the typical work
Optimal Selection of Arrival and Service Rates in Tandem Queues
, 2004
"... AbstractWe consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue k (k = 1, 2, …, n 1) must go on to queue k + 1 after finishing service at server ..."
Abstract
 Add to MetaCart
AbstractWe consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue k (k = 1, 2, …, n 1) must go on to queue k + 1 after finishing service
Matching output queueing with a combined input output queued switch
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS). Each problem can be solved independently: switches and routers can be made faster by using inputqueued crossbars, instead ..."
Abstract

Cited by 191 (21 self)
 Add to MetaCart
The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS). Each problem can be solved independently: switches and routers can be made faster by using inputqueued crossbars
Estimating queue length distributions for queues with random arrivals
 SIGMETRICS Perform. Eval. Rev
, 2012
"... ABSTRACT This work develops an accurate and efficient twomoment approximation for the queue length distribution in the M/G/1 queue. Queue length distributions can provide insight into the impact of system design changes that go beyond simple averages, but conventional queueing theory lacks efficie ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
be obtained for most realworld systems. Finally, the approximation is accurate for a wide range of lighttailed service time distributions with high and low coefficients of variation. DERIVATION Consider an M/G/1 queue with average service time x, Poisson arrival rate λ, and a squared coefficient
Results 1  10
of
678