The oldest queuing algorithm is PQ, which consists of only four queues (high, medium, normal/default, and low). The scheduler begins by emptying the high queue and begins to service lower queues only when upper queues are completely empty. This basic algorithm proved very successful in handling real-time traffic, but it posed starvation possibilities to lower-priority traffic flows.
A major difference between WFQ and CBWFQ is that, with WFQ, computer network assessment is calculated instantaneously; but with CBWFQ, a minimum bandwidth explicitly is defined and enforced. Additionally, CBWFQ uses Modular QoS CLI (MQC) based class maps for classification, which provide the richest and most granular recognition criteria within the IOS QoS toolset. When class maps are combined with CBWFQ bandwidth statements, minimum-bandwidth guarantees can be provisioned for almost any application
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment