A fair scheduling policy for wireless channels with intermittent connectivity

Loading...
Thumbnail Image
Penn collection
Departmental Papers (ESE)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Aram, A.
Kzouhani, M.H. R.
Tassiulas, L.
Contributor
Abstract

We consider a system of parallel queues with the constraint that only one queue can be served at a time. Each queue can be served through a wireless channel with intermittent connectivity. We propose a policy which serves the longest connected queue when the lengths of all connected are below a given threshold, and serves the connected queue that exceeds the threshold and has received the least service so far, otherwise. We prove that this simple policy (a) maximizes the aggregate service rate of all queues (b) maximizes the minimum service rate attained by any queue and (c) attains the stability region of the network.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2008-03-19
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Copyright 2008 IEEE. Reprinted from 42nd Annual Conference on Computer Sciences and Systems, CISS 2008, March 2008, pages 503-508. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Recommended citation
Collection