Hierarchical service-curve based scheduling
Aim to guarantee the service curves of all the leaf classes at all times, while minimizing the discrepancy between the actual service allocated to each interior class, and its fair service according to the curve
How achieved: “clunky.” Use two schedulers
- one a RT scheduler -- looks at all leaf packets which are eligible
- if no packet is eligible, then use a second scheduler that does hierchical sharing