Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Scheduling real-time traffic with deadlines over a wireless channel
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
Downlink scheduling in CDMA data networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Channel-aware VoIP packet scheduling in cdma2000 1x EV-DO networks
Computer Communications
| Hi-index | 0.00 |
As the delay is a critical QoS factor, packet scheduling over a wireless access link that often becomes congested needs to have the objective of meeting each user's delay requirement. To incorporate the delay into the scheduler design, we consider the objective of maximizing the total utility (U_T). However, since a utility-based scheduler that concerns delay requires high complexity, we introduce the concept of marginal utility. Representing the objective as minimizing the total marginal utility (M_T), we develop some related properties for maximizing U_T and minimizing M_T. For the case with fixed service time, we show that the outcome of M_T minimization becomes equivalent to that of U_T maximization. For the more complicated case of varying service time, the M_T minimization sheds light on the design of a simple scheduler. Overall, the marginal utility requires significantly low complexity for packet scheduling compared to the ordinary utility. Through simulations, we confirm that the marginal utility gives a way of flexible scheduling in meeting various delay requirements.