Fluid models of congestion collapse in overloaded switched networks
Author(s)
Shah, Devavrat; Wischik, Damon
DownloadShah_Fluid models.pdf (297.3Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We consider a switched network (i.e. a queueing network in which there are constraints on which queues may be served simultaneously), in a state of overload. We analyse the behaviour of two scheduling algorithms for multihop switched networks: a generalized version of max-weight, and the α-fair policy. We show that queue sizes grow linearly with time, under either algorithm, and we characterize the growth rates. We use this characterization to demonstrate examples of congestion
collapse, i.e. cases in which throughput drops as the switched network becomes more overloaded.We further show that the loss of throughput can be made arbitrarily small by the max-weight algorithm with weight function f (q) = q[superscript α] as α→0.
Date issued
2011-07Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Queueing Systems
Publisher
Springer-Verlag
Citation
Shah, Devavrat, and Damon Wischik. “Fluid Models of Congestion Collapse in Overloaded Switched Networks.” Queueing Systems 69.2 (2011): 121–143.
Version: Author's final manuscript
ISSN
0257-0130
1572-9443