Ease of Implementation
Scheduling choices are made per-packet
- map packet to flow/connection
- want O(1) not O(N) scaling [N connections]
Execution time considerations
- algorithm itself may run fast
- issue is amount of scheduling state (variables, records, pointers, etc) and how long it takes to access these…
- memory bandwidth/latency issues