Qualitative properties of α-weighted scheduling policies
Name
Tsitsiklis_Qualitative properties.pdf
Size
219.58 KB
Format
Adobe PDF
Checksum (MD5)
e7ee9590616e9cd0f247024a7d28bce7
Author(s)
Shah, Devavrat
Zhong, Yuan
Tsitsiklis, John N
Alternative Title
Qualitative properties of α-weighted [alpha weighted] scheduling policies
Date Issued
June 2010
Journal
International Conference on Measurement and Modeling of Computer Systems (2010). ACM SIGMETRICS
Publisher
Association for Computing Machinery
Citation
Shah, Devavrat, John N. Tsitsiklis, and Yuan Zhong. “Qualitative properties of α-weighted scheduling policies.” ACM SIGMETRICS Performance Evaluation Review 38.1 (2010) : 239. Copyright 2010 ACM
Version
Author's final manuscript
Abstract
We consider a switched network, a fairly general constrained
queueing network model that has been used successfully to
model the detailed packet-level dynamics in communication
networks, such as input-queued switches and wireless networks.
The main operational issue in this model is that
of deciding which queues to serve, subject to certain constraints.
In this paper, we study qualitative performance
properties of the well known α-weighted [alpha weighted] scheduling policies.
The stability, in the sense of positive recurrence, of these
policies has been well understood. We establish exponential
upper bounds on the tail of the steady-state distribution of
the backlog. Along the way, we prove finiteness of the expected
steady-state backlog when α < 1 [alpha < 1], a property that
was known only for α ≥ 1 [alpha ≥ 1]. Finally, we analyze the excursions
of the maximum backlog over a finite time horizon for
α ≥ 1 [alpha ≥ 1]. As a consequence, for α ≥ 1 [alpha ≥ 1], we establish the full
state space collapse property [17, 18].
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1811039.1811067
