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 α as α→0.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bonald, T., Massoulie, L.: Impact of fairness on Internet performance. In: Proceedings of ACM Sigmetrics (2001)
Chan, C.W., Armony, M., Bambos, N.: Fairness in overloaded parallel queues. Personal communication (2011)
Dai, J.G., Lin, W.: Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2) (2005)
Dai, J.G., Lin, W.: Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. 18(6) (2008)
Dai, J.G., Prabhakar, B.: The throughput of switches with and without speed-up. In: Proceedings of IEEE Infocom, pp. 556–564 (2000)
Egorova, R., Borst, S., Zwart, B.: Bandwidth-sharing networks in overload. Perform. Eval. 64, 978–993 (2007)
Georgiadis, L., Tassiulas, L.: Optimal overload response in sensor networks. IEEE Trans. Inf. Theory 52(6), 2684–2696 (2006)
Gromoll, H.C., Williams, R.J.: Fluid limits for networks with bandwidth sharing and general document size distributions. Ann. Appl. Probab. 19(1) (2009)
Harrison, J.M., Zeevi, A.: A method for staffing large call centers based on stochastic fluid models. Manuf. Serv. Oper. Manag. (2005)
Jacobson, V.: Congestion avoidance and control. In: Proceedings of SIGCOMM (1988)
Kelly, F.P., Williams, R.J.: Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14, 1055–1083 (2004)
Klemm, F., Boudec, J.Y.L., Aberer, K.: Congestion control for distributed hash tables. In: IEEE Symposium on Network Computing and Applications. http://doi.ieeecomputersociety.org/10.1109/NCA.2006.19 (2006)
Mo, J., Walrand, J.: Fair end-to-end windows-based congestion control. IEEE/ACM Trans. Netw. 8(5), 556–567 (2000)
Roberts, J., Massoulie, L.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185–201 (2000)
Shah, D., Wischik, D.: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. (2011, to appear)
Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37, 1936–1948 (1992)
Venkataramanan, V.J., Lin, X.: Structural properties of LDP for queue-length based wireless scheduling algorithms. In: Proceedings of Allerton (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shah, D., Wischik, D. Fluid models of congestion collapse in overloaded switched networks. Queueing Syst 69, 121–143 (2011). https://doi.org/10.1007/s11134-011-9250-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-011-9250-1