A generic quantitative approach to the scheduling of synchronous packets in a shared medium wireless access network

We present a scheme for allocating unsolicited grants to the end hosts of synchronous applications of a wireless access network, in accordance with the condition of the channel, the importance of each packet and the specific loss recovery mechanism employed in the channel. The proposed scheme is generic in the sense that it maximizes the effectiveness of the channel under various conditions and it can he used along with every FEC-based or retransmission-based error recovery strategy

[1]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1997, SIGCOMM '97.

[2]  Insup Lee,et al.  Fair real-time traffic scheduling over a wireless LAN , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[3]  Georg Carle,et al.  Intra-flow loss recovery and control for VoIP , 2001, MULTIMEDIA '01.

[4]  John J. Lemmon.  Wireless Link Statistical Bit Error Model , 2002 .

[5]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[6]  L. B. Milstein,et al.  On the accuracy of a first-order Markov model for data transmission on fading channels , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.

[7]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[8]  Reuven Cohen,et al.  Scheduling algorithms for a cache pre-filling content distribution network , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[10]  N. T. Le,et al.  Selective Packet Prioritization for Wireless Voice over IP , 2001 .