Analysis of polling systems
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
We study queuing delays for Weighted Round Robin (WRR) scheduling policies. The delay characteristics of these policies can be estimated through worst-case bounds as other fair queuing scheduling policies. However, these deterministic bounds are in general not accurate and they require that the input process has been shaped. Under Markovian arrival hypothesis, the delay of WRR policies can be evaluated through Markovian numerical analysis. Nevertheless, this analysis is limited to small parameter sizes because of the state space explosion problem. We propose to apply the stochastic comparison approach. We build a bounding model based on the aggregation of sessions, and we show that under the same arrivals, the packet delays in the bounding model are larger in the =