Fluid models of congestion collapse in overloaded switched networks

Queueing Systems

Volumn 69, Issue 2, 2011, Pages 121-143

  Shah, Devavrat ^a   Wischik, Damon ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Bandwidth sharing; Fluid model; Max weight; Overload; Switch

Indexed keywords

PLASMA FLOW; QUEUEING THEORY; SWITCHES;

BANDWIDTH SHARING; CONGESTION COLLAPSE; FLUID MODELING; FLUID MODELS; MAX-WEIGHT; OVERLOAD; WEIGHT ALGORITHM; WEIGHT FUNCTIONS;

SWITCHING NETWORKS;

EID: 80052920343     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-011-9250-1     Document Type: Article

References (17)

1. Bonald, T., Massoulie, L.: Impact of fairness on Internet performance. In: Proceedings of ACM Sigmetrics (2001).
2. Chan, C. W., Armony, M., Bambos, N.: Fairness in overloaded parallel queues. Personal communication (2011).
3. Dai, J. G., Lin, W.: Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2) (2005).
4. Dai, J. G., Lin, W.: Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. 18(6) (2008).
5. Dai, J. G., Prabhakar, B.: The throughput of switches with and without speed-up. In: Proceedings of IEEE Infocom, pp. 556-564 (2000).
6. Egorova, R., Borst, S., Zwart, B.: Bandwidth-sharing networks in overload. Perform. Eval. 64, 978-993 (2007).
7. Georgiadis, L., Tassiulas, L.: Optimal overload response in sensor networks. IEEE Trans. Inf. Theory 52(6), 2684-2696 (2006).
8. Gromoll, H. C., Williams, R. J.: Fluid limits for networks with bandwidth sharing and general document size distributions. Ann. Appl. Probab. 19(1) (2009).
9. Harrison, J. M., Zeevi, A.: A method for staffing large call centers based on stochastic fluid models. Manuf. Serv. Oper. Manag. (2005).
10. Jacobson, V.: Congestion avoidance and control. In: Proceedings of SIGCOMM (1988).
11. 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).
12. 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).
13. Mo, J., Walrand, J.: Fair end-to-end windows-based congestion control. IEEE/ACM Trans. Netw. 8(5), 556-567 (2000).
14. Roberts, J., Massoulie, L.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185-201 (2000).
15. Shah, D., Wischik, D.: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. (2011, to appear).
16. 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).
17. Venkataramanan, V. J., Lin, X.: Structural properties of LDP for queue-length based wireless scheduling algorithms. In: Proceedings of Allerton (2007).