Skip to main content Accessibility help
×
Home

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

  • Christopher Lott (a1) and Demosthenis Teneketzis (a2)

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.

Copyright

Footnotes

Hide All
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.

Footnotes

Related content

Powered by UNSILO

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

  • Christopher Lott (a1) and Demosthenis Teneketzis (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.