d 64 (packets) (pkts matched/bytes matched) 121/120844 (depth/total drops/no-buffer drops) 0/12/0 Class-map: class-default (match-any) 490613498 packets, 221802649874 bytes 5 minute offered rate 10374000 bps, drop rate o bps Match: any Queueing Flow Based Fair Queueing Maximum Number of Hashed Queues 256 (total queued/total drops/no-buffer drops) 0/0/0 Remember that there are practically infinite ways to configure QoS, and this solution may not work for you. In my experience, though, this type of QoS application has served me well. Scenario 2: Frame Relay Speed Mismatch Now let's take a look at how we solved the Frame Relay speed mismatch problem from Chapter 31. Figure 32-2 shows the network in question. This solution works because the Frame Relay network incorporates private virtual cir- cuits (PVCs) between each branch and the main office. Thus, logically, the network looks like Figure 32-3. This is an important distinction, because we're going to use the subinterfaces created for each branch to apply our traffic shaping. Chapter 32: Designing QoS Branch Branch Branch Branch Main Office Branch Branches Branch Branch Branch DS3 (45 Mbps) Various Frame Relay T1 speeds ranging from 256k to full T1 Figure 32-2. Frame Relay mismatched speeds Branch Branch Branch Branch Main Office Branch Branches Branch Branch Branch Figure 32-3. Logical Frame Relay with PVCs Because MPLS does not have a logical segregation of links at the head end (the main office, in this case) like Frame Relay does, this solution would not be directly applicable. Still, I believe this is extremely valuable information to learn, and you never know when a scenario will present itself that can be solved in such a way. Traffic-Shaping Scenarios Traffic-shaping terminology The following terms pop up in the context of traffic-shaping math. This can be pretty painful when you first start to deal with it, but for our uses, it will be pretty simple, SO hang in there: Committed information rate in bits per second Committed burst size in bits (not bps!) Us