Show simple item record

dc.contributor.authorShah, Devavrat
dc.contributor.authorShin, Jinwoo
dc.date.accessioned2012-09-10T19:09:26Z
dc.date.available2012-09-10T19:09:26Z
dc.date.issued2012
dc.date.submitted2011-01
dc.identifier.issn1050-5164
dc.identifier.urihttp://hdl.handle.net/1721.1/72602
dc.description.abstractThere has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling algorithms for constrained queueing network models that arise in the context of emerging communication networks. Here we consider two representative models. One, a queueing network model that captures randomly varying number of packets in the queues present at a collection of wireless nodes communicating through a shared medium. Two, a buffered circuit switched network model for an optical core of future internet to capture the randomness in calls or flows present in the network. The maximum weight scheduling algorithm proposed by Tassiulas and Ephremides [IEEE Trans. Automat. Control 37 (1992) 1936–1948], leads to a myopic and stable algorithm for the packet-level wireless network model. But computationally it is expensive (NP-hard) and centralized. It is not applicable to the buffered circuit switched network due to the requirement of nonpreemption of the calls in the service. As the main contribution of this paper, we present a stable scheduling algorithm for both of these models. The algorithm is myopic, distributed and performs few logical operations at each node per unit time.en_US
dc.description.sponsorshipNational Science Foundation (U.S.). Project (CNS 0546590)en_US
dc.description.sponsorshipNational Science Foundation (U.S.). Project (TF 0728554)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency. Information Theory for Mobile Ad-Hoc Networks Programen_US
dc.description.sponsorshipUnited States. Air Force Office of Scientific Research (Complex networks project)en_US
dc.language.isoen_US
dc.publisherInstitute of Mathematical Statisticsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1214/11-aap763en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourcearXiven_US
dc.titleRandomized Scheduling Algorithm for Queueing Networksen_US
dc.typeArticleen_US
dc.identifier.citationShah, Devavrat, and Jinwoo Shin. “Randomized Scheduling Algorithm for Queueing Networks.” The Annals of Applied Probability 22.1 (2012): 128–171.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverShah, Devavrat
dc.contributor.mitauthorShah, Devavrat
dc.contributor.mitauthorShin, Jinwoo
dc.relation.journalAnnals of Applied Probabilityen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsShah, Devavrat; Shin, Jinwooen
dc.identifier.orcidhttps://orcid.org/0000-0003-0737-3259
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record