Instant Service Policy and Its Application to Deficit Round Robin

DOI10.1007/11775096_12MaRDI QIDQ5434391zbMATH OpenOpenAlexFDO

Authors Jinoo Joung, Dongha Shin, Feifei Feng, Hongkyu Jeong

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_12

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An optimal service policy for buffer systems
• Analytical model of a weighted round robin service system
• Determining optimal parameters for expediting policies under service level constraints
• Optimality of the fastest available server policy
• Analyzing weighted round robin policies with a stochastic comparison approach
• A fair service and dynamic round robin scheduling algorithm
• An optimal constant level rationing policy under service level constraints

Cited in

(2)

• A fair service and dynamic round robin scheduling algorithm
• An M/G/1 queuing system with multiple vacations to assess the performance of a simplified deficit round robin model.

This page was built for publication: Instant Service Policy and Its Application to Deficit Round Robin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434391)