Abstract
Spatial and temporal load variations, e.g. flash overloads and traffic hot spots that persist for minutes to hours, are intrinsic features of wireless networks, and give rise to potentially huge performance repercussions. Dynamic load balancing strategies provide a natural mechanism for dealing with load fluctuations and alleviating the performance impact. In the present paper we propose a distributed shadow-price-based approach to dynamic load balancing in wireless data networks. We examine two related problem versions: (i) minimizing a convex function of the transmitter loads for given user throughput requirements; and (ii) maximizing a concave function of the user throughputs subject to constraints on the transmitter loads. As conceptual counterparts, these two formulations turn out to be amenable to a common primal-dual decomposition framework. Numerical experiments show that dynamic load balancing yields significant performance gains in terms of user throughputs and delays, even in scenarios where the long-term loads are perfectly balanced.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andrews, D.M., Qian, L., Stolyar, A.L.: Optimal utility-based multi-user throughput allocation subject to throughput constraints. In: Proc. Infocom 2005 (2005)
Bejerano, Y., Han, S.-J., Li, L.: Fairness and load balancing in wireless LAN’s using association control. In: Proc. ACM MobiCom 2004, pp. 315–329. ACM Press, New York (2004)
Bonald, T., Massoulié, L., Proutière, A., Virtamo, J.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Systems 53, 65–84 (2006)
Borst, S.C., Jonckheere, M.: Flow-level stability of channel-aware scheduling algorithms. In: Proc. WiOpt ’06 Conf (2006)
Chaponniere, E.F., Black, P.J., Holtzman, J.M., Tse, D.N.C.: Transmitter directed code division multiple access system using path diversity to equitably maximize throughput. US Patent 6, 449–490 (2002)
Borst, S.C., Hampel, G., Saniee, I., Whiting, P.A.: Load balancing in cellular wireless networks. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunication, Springer, Heidelberg (2006)
Bu, T., Li, L., Ramjee, R.: Generalized Proportional Fair scheduling in third-generation wireless networks. In: Proc. Infocom 2006 (2006)
Das, S., Viswanathan, H., Rittenhouse, G.: Dynamic load balancing through coordinated scheduling in packet data systems. In: Proc. Infocom 2003 (2003)
Eryilmaz, E., Srikant, R.: Fair resource allocation in wireless networks using queue length based scheduling and congestion control. In: Proc. Infocom 2005 (2005)
Han, H., Shakkottai, S., Hollot, C.V., Srikant, R., Towsley, D.: Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the Internet. IEEE/ACM Trans. Netw. 14, 1260–1271 (2006)
Hurwicz, L., Arrow, K., Uzawa, H.: Studies in Linear and Non-Linear Programming. Stanford University Press, Stanford (1958)
Kelly, F.P., Maulloo, A., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness, and stability. J. Oper. Res. Soc. 49, 237–252 (1998)
Kelly, F.P., Voice, T.: Stability of end-to-end algorithms for joint routing and rate control. Comp. Commun. Rev. 35, 5–12 (2005)
Lin, X., Shroff, N.B.: Utility maximization for communication networks with multi-path routing. IEEE Trans. Aut. Control 51, 766–781 (2003)
Liu, X., Chong, E.K.P., Shroff, N.B.: A framework for opportunistic scheduling in wireless networks. Comp. Netw. 41, 451–474 (2003)
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Trans. Netw. 8, 556–567 (2000)
Neely, M.J., Modiano, E., Li, C.: Fairness and optimal stochastic control for heterogeneous networks. In: Proc. Infocom 2005 (2005)
Sang, A., Wang, X., Madihian, M., Gitlin, R.D.: Coordinated load balancing / cell-site selection and scheduling in multi-cell packet data systems. In: Proc. ACM Mobicom 2004, ACM Press, New York (2004)
Srinivasan, V., Chiasserini, C., Nuggehalli, P., Rao, R.: Optimal rate allocation for energy-efficient multi-path routing in wireless ad hoc networks. IEEE Trans. Wireless Commun. 3, 891–899 (2005)
Stolyar, A.L.: Maximizing queueing network utility subject to stability: greedy primal-dual algorithm. Queueing Systems 50, 401–457 (2005)
Stolyar, A.L.: On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation. Oper. Res. 53, 12–25 (2005)
Wang, W.H., Palaniswami, M., Low, S.H.: Optimal flow control and routing in multi-path networks. Perf. Eval. 52, 119–132 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borst, S., Saniee, I., Whiting, P. (2007). Distributed Dynamic Load Balancing in Wireless Networks. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_88
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)