Fair Scheduling in Networks Through Packet Election

We consider the problem of designing a fair scheduling algorithm for discrete-time constrained queuing networks. Each queue has dedicated exogenous packet arrivals. There are constraints on which queues can be served simultaneously. This model effectively describes important special instances like n...

Full description

Bibliographic Details
Main Authors: Jagabathula, Srikanth, Shah, Devavrat
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2012
Online Access:http://hdl.handle.net/1721.1/72604
https://orcid.org/0000-0003-0737-3259