| Summary: | 碩士 === 國立成功大學 === 資訊工程研究所 === 88 === With the rapidly growth of the network technology, everyone wants to develop broadband systems, so bandwidth becomes the most important property in the network. However, the most widely-adopted scheduling algorithm is still the simplest “Best Effort”, which processes nothing, regardless of QoS mechanism. If we can bring up a better scheduling algorithm, maybe we do not have to spend so much time and money to expand the bandwidth. With some simple and effective QoS mechanisms, we woud be able to substantially improve the bandwidth utilization and service quality.
In this thesis, we propose an adaptive bandwidth allocation mechanism to solve the problem mentioned above. This algorithm will dynamically look into the usage of each queue, and adaptively allocate the resources of the network by a weight-adjusting mechanism that comprises priorities. In this algorithm, we not only consider the priority of each queue, but also will not waste the bandwidth if some queue got empty.
To prove our theory, we implement our algorithm on the Linux platform. The result shows that our scheduling algorithm indeed improves the bandwidth utilization and comprises the priority mechanism.
|
|---|
