• DocumentCode
    1503973
  • Title

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

  • Author

    Pronk, Verus ; Korst, Jan

  • Author_Institution
    Philips Res. Lab., Eindhoven, Netherlands
  • Volume
    9
  • Issue
    3
  • fYear
    2001
  • fDate
    6/1/2001 12:00:00 AM
  • Firstpage
    373
  • Lastpage
    374
  • Abstract
    Saha, Mukherjee, and Tripathi (see ibid., vol.6, no.6, p.779-796, 1998) 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 describe carry-over round robin and present a counterexample to the lemma. We end with some concluding remarks.
  • Keywords
    asynchronous transfer mode; delays; packet switching; telecommunication networks; ATM cell scheduling algorithm; ATM networks; algorithm performance; carry-over round robin; cell scheduling mechanism; delay; fairness; Algorithm design and analysis; Delay; Jitter; Round robin; Scheduling algorithm;
  • fLanguage
    English
  • Journal_Title
    Networking, IEEE/ACM Transactions on
  • Publisher
    ieee
  • ISSN
    1063-6692
  • Type

    jour

  • DOI
    10.1109/90.929858
  • Filename
    929858
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1503973