Service-Curve Earliest Deadline scheduling

Given a service curve Si(t), a deadline curve Di(t) is computed:

A packet pik that becomes the head of connection i’s queue at time t is assigned a deadline Di-1(wi(t) + lik)

SCED scheduling: schedule according to earliest deadlines

Previous slide

Next slide

Back to first slide

View graphic version