34 search results - page 4 / 7 » Performance Analysis of a Fluid Queue with Random Service Ra... |
SIGCOMM
1996
ACM
13 years 11 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
EOR
2007
13 years 7 months ago
2007
In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and s...
DSN
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
QUESTA
2006
13 years 7 months ago
2006
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we examine the operation of a node relaying packets from a number of users to a destination node. We assume that the relay does not have packets of its own, the traf...