Abstract
We consider a system of parallel servers handling users of various classes, whose service rates depend not only on user classes, but also on the set of active servers. We investigate the stability under two types of allocation strategies: (i) server assignment where the users are assigned to servers based on rates, load, and other considerations, and (ii) coordinated scheduling where the activity states of servers are coordinated. We show how the model may be applied to evaluate the downlink capacity of wireless data networks. Specifically, we examine the potential gains in wireless capacity from the two types of resource allocation strategies.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bender, P., Black, P., Grob, M., Padovani, R., Sindhushayana, N., & Viterbi, A. (2000). CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users. IEEE Communications Magazine, 38(7), 70–77.
Bonald, T., & Proutière, A. (2003). Wireless downlink channels: user performance and cell dimensioning, In Proc. ACM Mobicom.
Bonald, T., Borst, S. C., Hegde, N., & Proutière, A. (2004a). Wireless data performance in multi-cell scenarios. In Proc. ACM sigmetrics/performance 2004 (pp. 378–388).
Bonald, T., Borst, S. C., & Proutière, A. (2004b). How mobility impacts the flow-level performance of wireless data networks. In Proc. IEEE infocom.
Bonald, T., Jonckheere, M., & Proutière, A. (2004c). Insensitive load balancing. In Proc. ACM sigmetrics/performance 2004 (pp. 367–377).
Bonald, T., Borst, S. C., & Proutière, A. (2005). Inter-cell scheduling in wireless data networks. In Proc. European wireless conf.
Bonald, T., Massoulié, L., Proutière, A., & Virtamo, J. (2006). A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Systems, 53, 65–84.
Chernova, N., & Foss, S. (1998). On the stability of a partially accessible multi-station queue with state-dependent routing. Queueing Systems, 29(1), 55–74.
Cohen, J. W. (1984). On a functional relation in three complex variables; three coupled processors. Technical Report 359, Mathematical Institute, University of Utrecht.
Cohen, J. W., & Boxma, O. J. (1983). Boundary value problems in queueing system analysis. Amsterdam: North-Holland.
Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals Applied Probability, 5, 49–77.
Das, S., Viswanathan, H., & Rittenhouse, G. (2003). Dynamic load balancing through coordinated scheduling in packet data systems. In Proc. IEEE infocom.
Fayolle, G., & Iasnogorodski, R. (1979). Two coupled processors: the reduction to a Riemann-Hilbert problem. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 47, 325–351.
Foley, R. D., & McDonald, D. (2001). Join the shortest queue: stability and exact asymptotics. Annals of Applied Probability, 11, 569–707.
Liu, S., & Virtamo, J. (2006). Inter-cell coordination with inhomogeneous traffic distribution. In Proc. second EuroNGI conf. next generation Internet design and engineering, NGI 2006, Valencia, Spain (pp. 64–71).
Mo, J., & Walrand, J. C. (2000). Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8, 556–567.
Sang, A., Wang, X., Madihian, M., & Gitlin, R. D. (2004). Coordinated load balancing, hand off cell-site selection, and scheduling in multi-cell packet data systems. In Proc. ACM Mobicom.
Squillante, M., Xia, C. H., Yao, D., & Zhang, L. (2001). Threshold-based priority policies for parallel-server systems with affinity scheduling. In Proc. IEEE American control conf. (pp. 2992–2999).
Stolyar, A. L. (2005). Optimal routing in output-queued flexible server systems. Probability in the Engineering and Informational Sciences, 19, 141–189.
Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multi-hop radio networks. IEEE Transactions on Automatic Control, 37, 1936–1938.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Borst, S., Hegde, N. & Proutière, A. Interacting queues with server selection and coordinated scheduling—application to cellular data networks. Ann Oper Res 170, 59–78 (2009). https://doi.org/10.1007/s10479-008-0442-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0442-y