動態權值循環：一個在網際網路上的分封排序機制

Abstract

由於網際網路上不同服務對品質的需求大量增加，如何提供服務品質是一個重要的課題。傳統的FIFO機制很簡單，但是無法提供有效的服務品質。雖然EDF機制可以提供好的服務品質，但是複雜度過高，因此不適合應用於高速網路中。所以在這篇論文中，我們提出動態權值循環排序機制，這是DRR的改良版本，因此具備DRR的簡單性。模擬結果顯示動態權值循環排序機制可以有效的改善服務品質；包括延遲，封包丟棄率以及時閃。Because of the quality of different services is hugely required on the Internet, how to provide the quality of service (QoS) is an important issue. Traditionally, the first-in first-out (FIFO) scheme is very simple, but it can’t provide effective QoS. Although the Earliest deadline first (EDF) can provide good QoS, it is too complex to be implemented in high-speed networks. In this paper, we proposed the dynamic weighted round robin (DWRR) scheme, a modified version of deficit round robin (DRR), so the implementation of DWRR scheme is the simple as the DRR scheme. The simulation results show the DWRR scheme can effectively improve the QoS regarding delay, packet loss rate add jitter.