Name
Title | ||
|---|---|---|
Comments on “carry-over round robin: a simple cell scheduling mechanism for ATM networks” |
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/90.929858 | IEEE/ACM Trans. Netw. |
Keywords | Field | DocType |
Round robin,Delay,Algorithm design and analysis,Scheduling algorithm,Jitter | Algorithm design,Deficit round robin,Scheduling (computing),Computer science,Computer network,Asynchronous Transfer Mode,Counterexample,Packet switching,Atmosphere (unit),Lemma (mathematics),Distributed computing | Journal |
Volume | Issue | ISSN |
9 | 3 | 1063-6692 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||