Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Method for Staffing Large Call Centers Based on Stochastic Fluid Models
Manufacturing & Service Operations Management
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Optimal overload response in sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Congestion Control for Distributed Hash Tables
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Bandwidth-sharing networks in overload
Performance Evaluation
Dynamic server allocation for unstable queueing networks with flexible servers
Queueing Systems: Theory and Applications
Optimal queue-size scaling in switched networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
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 驴 as 驴驴0.