H-FSC Complexity
Theoretically, worst case complexity O(log n), but can be improved taking advantage of timestamp properties
All service curves are two-piece linear
- enough to decouple bandwidth & delay allocation
Computing e, d, and v requires one comparison, division
E( ), D( ), V( ) are updated only when session becomes active
- updating D( ) and V( ) requires in the worst case three multiplications, one division and several additions, subtractions
- updating E( ) requires at most one addition