Fluid models of congestion collapse in overloaded switched networks
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 poli...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2012-10-02T12:20:03Z.
|
| Subjects: | |
| Online Access: | Get fulltext |