Low Complexity Packet Scheduling Algorithm: Adaptive Fair Queuing with Round-Robin

• Main Authors: Kun-Xuan Lin, 林琨絢
• Other Authors: Ching-Lung Chang
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/58810698448679516700

碩士 === 國立雲林科技大學 === 電子與資訊工程研究所 === 94 === The rapid growths of Internet bandwidth and Internet user have increased the complexity of network management. At the same time the contents of transmission in Internet trends to be pluralistic. It is not enough of only relying on the original best-effort IP protocol to support the required quality of service (QoS) for each application. In order to offer steady communication environment and QoS, the moderately bandwidth management is considered in network design. In general, the network bandwidth management can be classified into two parts of packet buffer management and packet scheduling. In this thesis, we target on the design of packet scheduling for the network bandwidth management and propose an Adaptive Fair Queuing with Round Robin (AFQRR) scheme. Based on Round Robin technique, the AFQRR has the properties of lower complexity and higher accuracy. According to the assigning weight of flows, the AFQRR can fairly to allocate the corresponding bandwidth for each flow. In the part of complexity, the computation of both the amount of allowing transmission for each flow and the next transmission flow selection are all of O(1). With the NS2 simulation tool, the simulation results reveal that the AFQRR scheduling algorithm has a better performance in the part of fair bandwidth allocation and of packet delay.