Advanced Search
DSpace@MIT

Qualitative properties of α-weighted scheduling policies

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Shah, Devavrat
dc.contributor.author Tsitsiklis, John N.
dc.contributor.author Zhong, Yuan
dc.date.accessioned 2011-05-20T21:24:35Z
dc.date.available 2011-05-20T21:24:35Z
dc.date.issued 2010-06
dc.identifier.uri http://hdl.handle.net/1721.1/62864
dc.description.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]. en_US
dc.description.sponsorship National Science Foundation (U.S.) (Project CCF 0728554) en_US
dc.language.iso en_US
dc.publisher Association for Computing Machinery en_US
dc.relation.isversionof http://dx.doi.org/10.1145/1811039.1811067 en_US
dc.rights Creative Commons Attribution-Noncommercial-Share Alike 3.0 en_US
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/ en_US
dc.source MIT web domain en_US
dc.title Qualitative properties of α-weighted scheduling policies en_US
dc.title.alternative Qualitative properties of α-weighted [alpha weighted] scheduling policies en_US
dc.type Article en_US
dc.identifier.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 en_US
dc.contributor.department Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science en_US
dc.contributor.department Massachusetts Institute of Technology. Laboratory for Information and Decision Systems en_US
dc.contributor.department Massachusetts Institute of Technology. Operations Research Center en_US
dc.contributor.approver Tsitsiklis, John N.
dc.contributor.mitauthor Shah, Devavrat
dc.contributor.mitauthor Tsitsiklis, John N.
dc.contributor.mitauthor Zhong, Yuan
dc.relation.journal International Conference on Measurement and Modeling of Computer Systems (2010). ACM SIGMETRICS en_US
dc.identifier.mitlicense OPEN_ACCESS_POLICY en_US
dc.eprint.version Author's final manuscript en_US
dc.type.uri http://purl.org/eprint/type/ConferencePaper en_US
dspace.orderedauthors Shah, Devavrat; Tsitsiklis, John N.; Zhong, Yuan en
dc.identifier.orcid https://orcid.org/0000-0003-0737-3259
dc.identifier.orcid https://orcid.org/0000-0003-2658-8239


Files in this item

Name Size Format
Downloadable Full Text - PDF

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-Noncommercial-Share Alike 3.0 Except where otherwise noted, this item's license is described as Creative Commons Attribution-Noncommercial-Share Alike 3.0
Open Access