Comments on “carry-over round robin: a simple cell scheduling mechanism for ATM networks”

Authors:
Verus Pronk;Jan Korst
Affiliations:
Philips Research Laboratories, Eindhoven, The Netherlands;Philips Research Laboratories, Eindhoven, The Netherlands
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2001

Citing 2
Cited 0

Carry-over round robin: a simple cell scheduling mechanism for ATM networks

IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Saha, Mukherjee, and Tripathi [1] present and analyze an ATM cell scheduling algorithm called carry-over round robin. Unfortunately, one of the basic lemmas in their paper, related to the performance of this algorithm, does not hold. This adversely affects the delay and fairness properties that they subsequently derive. To substantiate this, we briefly describe carry-over round robin and present a counterexample to the lemma. We end with some concluding remarks.