The goal: delinking delay and demand
In GPS-like schedulers, the delay guarantee that can be made to a connection depends upon the bandwidth share reserved for it
But, applications with tight delay-requirements do not always have high bandwidth requirements
- e.g., multimedia: audio versus video
One approach to delink delay and demand: the Earliest Due Date (EDD) algorithms of Ferrari & Verma
- approach similar to the T=(e,d,p) task-model in processor scheduling
- e/p denotes the bandwidth share
- d denotes the delay parameter