A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
We consider packet scheduling for the downlink in a wireless network, where each packet's service preferences are captured by a utility function that depends on the packet's delay. The goal is to schedule packet transmissions to maximize the total utility. We examine a simple gradient-based scheduling algorithm, theUR-rule, which is a type of generalized cµ-rule (Gcµ) that takes into account both a user's channel condition and derived utility. We study the performance of this scheduling ruledoi:10.1109/cdc.2004.1428984 fatcat:3xs6bobzpvbypn2nfgzrwjakwe