### Abstract

We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as CDMA2000 3G1xEV-DO downlink scheduling.) We introduce an algorithm which seeks to optimize a concave utility function ∑ _{i}. H _{i}(R _{i}] of the user throughputs R _{i}, subject to certain lower and upper throughput bounds: R _{i} ^{min} ≤ R _{i} ≤ R _{i} ^{max}. The algorithm, which we call the Gradient algorithm with Minimum/Maximum Rate constraints (GMR) uses a token counter mechanism, which modifies an algorithm solving the corresponding unconstrained problem, to produce the algorithm solving the problem with throughput constraints. Two important special cases of the utility functions are ∑ _{i} log R _{i} and ∑ _{i} R _{i}, corresponding to the common Proportional Fairness and Throughput Maximization objectives. We study the dynamics of user throughputs under GMR algorithm, and show that GMR is asymptotically optimal in the following sense. If, under an appropriate scaling, the throughput vector R(t) converges to a fixed vector R* as time t → ∞ then R* is an optimal solution to the optimization problem described above. We also present simulation results showing the algorithm performance.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies |

Editors | K. Makki, E. Knightly |

Pages | 2415-2424 |

Number of pages | 10 |

DOIs | |

State | Published - Oct 7 2005 |

Externally published | Yes |

Event | IEEE INFOCOM 2005 - Miami, FL, United States Duration: Mar 13 2005 → Mar 17 2005 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

Volume | 4 |

ISSN (Print) | 0743-166X |

### Other

Other | IEEE INFOCOM 2005 |
---|---|

Country | United States |

City | Miami, FL |

Period | 3/13/05 → 3/17/05 |

### Fingerprint

### Keywords

- 3G
- CDMA
- Gradient algorithm
- Guaranteed rate
- Maximum throughput
- Proportional fair
- QoS
- Rate constraints
- Scheduling
- Time varying channel
- Wireless

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies*(pp. 2415-2424). (Proceedings - IEEE INFOCOM; Vol. 4). https://doi.org/10.1109/INFCOM.2005.1498527