Spectral Idleness Minimization in the Elastic Single Link under Incremental Traffic

The paper addresses the problem of minimizing total slot idle time in assigning spectrum to an incremental 2-class traffic. Deadlock avoidance is first shown to be possible in many instances from knowledge of the connection sizes, thus keeping total idleness finite. Then, minimization of the finite residual idleness is shown to be possible with appropriate traffic-aware assignment policies.