Analyzing weighted round robin policies with a stochastic comparison approach

DOI10.1016/j.cor.2006.12.007zbMath1176.90115OpenAlexW2032116027MaRDI QIDQ2471218

Nihal Pekergin, Jean-Michel Fourneau, Mouad Ben Mamoun

Publication date: 22 February 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.12.007

zbMATH Keywords

stochastic comparisonsample-path stochastic orderingweighted round robin scheduling policies

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing weighted round robin policies with a stochastic comparison approach