Title page for etd-0902100-215433


[Back to Results | New Search]

URN etd-0902100-215433
Author Ming-Chi Lee
Author's Email Address m8731660@student.nsysu.edu.tw
Statistics This thesis had been viewed 5334 times. Download 2015 times.
Department Electrical Engineering
Year 1999
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A simple cell scheduling mechanishm for ATM networks
Date of Defense 2000-07-18
Page Count 52
Keyword
  • complexity
  • scheduling
  • fairness
  • Abstract In this thesis, we propose a cell scheduling mechanism to overcome some drawback of Carry-Over Round Robin (CORR) algorithm. Compare with CORR, the modified scheme reduces complexity of implementation and allocates bandwidth more fairly. In general, it simplifies CORR algorithm, which applies some design to maintain the maximum frame size. We prove that the maximum frame size is not necessary for deriving end-to-end delay. We also show that it results in fair distribution of bandwidth.
    As long as the schedulers and traffic shapers work independently, significant underutilization is expected. In order to solve this problem, we borrow the concept of CORR which divides each allocation cycle into two subcycles—a major cycle and a minor cycle. By designing some information feedback to shapers, schedulers can transmit more cells in minor cycles. Hence we can improve bandwidth utilization successfully.
    Advisory Committee
  • Tsang-Ling Sheu - chair
  • Lain-Chyz Hwang - co-chair
  • Shie-Jue Lee - advisor
  • Files
  • 畢業論文.pdf
  • indicate access worldwide
    Date of Submission 2000-09-02

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys