Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse
We consider a queueing network in which there are constraints on which queues may be served simultaneously; such networks may be used to model input-queued switches and wireless networks. The scheduling policy for such a network specifies which queues to serve at any point in time. We consider a fam...
Main Authors: | Shah, Devavrat (Contributor), Wischik, Damon (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Mathematical Statistics,
2012-09-28T15:23:22Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Fluid models of congestion collapse in overloaded switched networks
by: Shah, Devavrat, et al.
Published: (2012) -
Interference is not noise
by: Bodas, Shreeshankar, et al.
Published: (2012) -
Message Passing for Maximum Weight Independent Set
by: Sanghavi, Sujay, et al.
Published: (2011) -
Approximating fluid schedules in packet-switched networks
by: Rosenblum, Michael Aaron, 1976-
Published: (2005) -
Qualitative properties of α-weighted scheduling policies
by: Shah, Devavrat, et al.
Published: (2011)