The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s ...The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s Routers, the load of any algorithm of them over Router’s CPUs and memory usage, the delay occurred between routers when any algorithm has been used and the network application throughput. This comparison explains that, PQ doesn’t need high specification hardware (memory and CPU) but when used it is not fair, because it serves one application and ignore the other application and FIFO mechanism has smaller queuing delay, otherwise PQ has bigger delay.展开更多
A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queueing algorithms-the packet...A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queueing algorithms-the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue management technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and then solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server’s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.展开更多
文摘The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s Routers, the load of any algorithm of them over Router’s CPUs and memory usage, the delay occurred between routers when any algorithm has been used and the network application throughput. This comparison explains that, PQ doesn’t need high specification hardware (memory and CPU) but when used it is not fair, because it serves one application and ignore the other application and FIFO mechanism has smaller queuing delay, otherwise PQ has bigger delay.
基金National Natural Science Foundation of China ( No.60572157)Sharp Corporation of Japanthe Hi-Tech Research and Development Program(863) of China (No.2003AA123310)
文摘A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queueing algorithms-the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue management technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and then solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server’s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.
