Further comparisons of direct methods for computing stationary distributions of Markov chains
SIAM Journal on Algebraic and Discrete Methods
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Processor-shared service systems with queue-dependent processors
Computers and Operations Research
Analyzing Weighted Round Robin policies with a stochastic comparison approach
Computers and Operations Research
Monotonicity and efficient computation of bounds with time parallel simulation
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
| Hi-index | 0.00 |
We propose to apply the stochastic comparison method to evaluate the delay characteristics of generalized processor sharing (GPS)-related fair queuing (FQ) policies in a stochastic setting. These policies have complex dynamics, and their delays are evaluated through deterministic worst-case bounds under the leaky bucket-constrained traffics. Our approach consists to define "bounding" weighted round robin (WRR)-related policies for some GPS-related policies: under the same arrival process, the departure instants under the bounding policy are later or equal to the departure instants under the FQ policy for each cell. This sample-path comparison allows us to establish the stochastic comparison of delay distributions in the strong stochastic ordering sense. By defining WRR-related policies as bounding policies, we are able to carry out the Markovian analysis. Since our approach lets us to take into account explicitly the arrival process, the proposed bounds give more insight on delay characteristics than the deterministic bounds.