Fluid models of congestion collapse in overloaded switched networks
Name
Shah_Fluid models.pdf
Size
297.33 KB
Format
Adobe PDF
Checksum (MD5)
b3f79cf274c19a37147d9aa709543214
Author(s)
Shah, Devavrat
Wischik, Damon
Date Issued
July 2011
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11134-011-9250-1
