Download now Free registration required
It is well known that the Generalized Max-Weight Matching (GMWM) scheduling policy, and in general throughput optimal scheduling policies, often require the solution of a complex optimization problem, making their implementation prohibitively difficult in practice. This has motivated many researchers to develop distributed sub-optimal algorithms that approximate the GMWM policy. One major assumption commonly shared in this context is that the time required to find an appropriate schedule vector is negligible compared to the length of a timeslot.
- Format: PDF
- Size: 270.1 KB