Download now Free registration required
This paper considers a scheduling problem of transmitting B bits over T time slots, where the channel fades independently from slot to slot. During each slot, the scheduler determines how many of the B bits to transmit on the basis of the current channel quality and the number of unserved bits remaining. The scheduler must balance the desire to be opportunistic, i.e., serve many bits when the channel is good, with the hard deadline. As might be expected in multimedia transmission, this setup can be used to model deterministic traffic (e.g., in VoIP systems packets arrive regularly in time and generally have hard deadlines of approximately 50 msec).
- Format: PDF
- Size: 202.89 KB