Download Now Free registration required
This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. For a system with arrivals, the policies achieve the optimal throughput, with very weak assumptions on the arrival process. For a system without arrivals, the policies drain all packets in the system in the minimal amount of time (providing an online alternative to the batch approach based on Birkhoff-VonNeumann decompositions). Policies in the class are not constrained to be work conserving in every time slot; it may be possible to add edges to the schedule.
- Format: PDF
- Size: 226.37 KB