Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-23T09:21:07.817Z Has data issue: false hasContentIssue false
  • English
  • Français

ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES

Published online by Cambridge University Press:  01 July 2000

Christopher Lott  and
Demosthenis Teneketzis
Christopher Lott
Affiliation:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, E-mail: [email protected]
Demosthenis Teneketzis
Affiliation:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We model a single-hop mobile network under centralized control with N service classes as a system of N weighted cost parallel queues with M (1 ≤ M < N) servers, arrivals, varying binary connectivity, and Bernoulli service success at each queue. We consider scheduling problems in this system and, under various assumptions on arrivals and connectivity, derive conditions sufficient, but not necessary, to guarantee the optimality of an index policy.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 14 , Issue 3 , July 2000 , pp. 259 - 297
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This research was supported in part by ARO grant DAAH04-96-1-0377 and AFOSR grants F49620-96-1-0028 and F49620-98-1-0370.