差分

ナビゲーションに移動 検索に移動
918行目: 918行目:     
</syntaxhighlight>Step 2.             Match the label value to the queue or threshold that it is associated with, using the following command.
 
</syntaxhighlight>Step 2.             Match the label value to the queue or threshold that it is associated with, using the following command.
 +
 +
'''ステップ 2.''' ラベルの値がキューかしきい値に該当させるために、次のコマンドを使用します。
 +
 +
[[ファイル:C90-QoS-0c.png|フレームなし]]
 +
 +
●     Weighted Random Early Discard (WRED)
 +
 +
WRED is an algorithm for discarding frames in oversubscribed port queues randomly before the queue is full. WRED is based on the RED (random early discard) algorithm.
 +
 +
Before we look at RED and WRED, let’s quickly revisit TCP flow management. Flow management ensures that the TCP sender does not overwhelm the network. The “TCP slow-start” algorithm (defined in <nowiki>RFC 2001</nowiki>) is part of the solution to address this. It dictates that when a flow starts, a single packet is sent, and then it waits for an Acknowledgment (ACK). When the ACK is received, the TCP endpoint will send two packets and wait for the next ACK before sending more data. The number of packets sent each time gradually increases. This will continue until the flow reaches a transmission level (that is, send x number of packets) that the network can handle without the load incurring congestion. Should congestion occur, the slow-start algorithm will throttle back the window size (that is, the number of packets sent before waiting for an ACK). This will normalize transmission to a set number of frames that the network can handle without dropping them.
 +
 +
* ウェイテッド・ランダム・アーリー・ディスカード (WRED)
 +
 +
WRED はキューがいっぱいになるために、帯域を超過したポートのキューで、ランダムにフレームを廃棄するためのアルゴリズムです。WRED はランダム・アーリー・ディスカード (RED) アルゴリズムがベースになっています。
    
=== 階層型 QoS ===
 
=== 階層型 QoS ===

案内メニュー