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¡Xa 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.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0902100-215433 |
| Date | 02 September 2000 |
| Creators | Lee, Ming-Chi |
| Contributors | Shie-Jue Lee, Tsang-Ling Sheu, Lain-Chyz Hwang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902100-215433 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.1226 seconds