article

Decentralized Proportional Load Balancing

Authors:

N. S. WaltonAuthors Info & Claims

SIAM Journal on Applied Mathematics, Volume 76, Issue 1

Pages 391 - 410

https://doi.org/10.1137/140969361

Published: 01 January 2016 Publication History

Abstract

Load balancing is a powerful technique commonly used in communication and computer networks to improve system performance, robustness and fairness. In this paper, we consider a general model capturing the performance of communication and computer networks, and on top of it we propose a decentralized algorithm for balancing load among multiple network paths. The proposed algorithm is inspired by the modus operandi of the processor-sharing queue and on each network entry point operates as follows: every time a unit of load completes its service on a path, it increases by one unit the load of that path and decreases by one unit the load of a path selected at random with probability proportional to the amount of load on each of the available paths. We develop a dynamical system to argue that our load-balancer achieves a desirable network-wide utility optimization.

References

[1]

J. Anselmi and G. Casale, Heavy-traffic revenue maximization in parallel multiclass queues, Perform. Eval., 70 (2013), pp. 806-821.

[2]

J. Anselmi, B. D'Auria, and N. Walton, Closed queueing networks under congestion: Nonbottleneck independence and bottleneck convergence, Math. Oper. Res., 38 (2013), pp. 469- 491.

[3]

T. Bonald and L. Massoulié, Impact of fairness on internet performance, Proc. ACM Sigmetrics, 29 (2001), pp. 82-91.

[4]

O. Bonaventure, Apple Seems to Also Believe in Multipath TCP, http://perso.uclouvain.be/olivier.bonaventure/blog/html/2013/09/18/mptcp.html (2013).

[5]

Y. Cao, M. Xu, and X. Fu, Delay-based congestion control for multipath TCP, in Proceedings of the 2012 20th IEEE International Conference on Network Protocols (ICNP), Washington, DC, 2012, IEEE, Piscataway, NJ, 2012, pp. 1-10.

[6]

A. Ford, C. Raiciu, M. Handley, and O. Bonaventure, TCP Extensions for Multipath Operation with Multiple Addresses, IETF, RFC 6824, 2013.

[7]

R. J. Gibbens, F. P. Kelly, and P. B. Key, Dynamic alternative routing, in Routing in Communications Networks, Prentice Hall, Englewood Cliffs, NJ, 1995, pp. 13-47.

[8]

T. J. Hacker, B. D. Athey, and B. Noble, The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network, IPDPS '02, Washington, DC, 2002, IEEE Computer Society, Los Alamitos, CA, 2002.

[9]

H. Han, S. Shakkottai, C. V. Hollot, R. Srikant, and D. Towsley, Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity on the internet, IEEE/ACM Trans. Netw., 14 (2006), pp. 1261-1271.

[10]

M. Honda, Y. Nishida, L. Eggert, P. Sarolahti, and H. Tokuda, Multipath congestion control for shared bottleneck, in 7th International Workshop on Protocols for Future, Large-Scale and Diverse Network Transports (PFLDNeT), JSPS, Tokyo, 2009.

[11]

D. R. Karger and M. Ruhl, Simple efficient load balancing algorithms for peer-to-peer systems, in Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2004, pp. 36-43.

[12]

F. P. Kelly, Charging and rate control for elastic traffic, Eur. Trans. Telecomm., 8 (1997), pp. 33-37.

[13]

F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, Rate control in communication networks: Shadow prices, proportional fairness and stability, J. Oper. Res. Soc., 49 (1998), pp. 237- 252.

[14]

F. P. Kelly and T. Voice, Stability of end-to-end algorithms for joint routing and rate control, SIGCOMM Comput. Commun. Rev., 35 (2005), pp. 5-12.

[15]

F. P. Kelly and R. J. Williams, Fluid model for a network operating under a fair bandwidth-sharing policy, Ann. Appl. Probab., 14 (2004), pp. 1055-1083.

[16]

P. Key, L. Massoulié, and D. Towsley, Path selection and multipath congestion control, in Proc. IEEE INFOCOM, IEEE, Piscataway, NJ, 2007.

[17]

R. Khalili, N. Gast, M. Popovic, and J.-Y. L. Boudec, MPTCP is not Pareto-optimal: Performance issues and a possible solution, IEEE/ACM Trans. Netw., 21 (2013), pp. 1651- 1665.

[18]

L. Kleinrock, Time-shared systems: A theoretical treatment, J. ACM, 14 (1967), pp. 242-261.

[19]

S. Kullback and R. A. Leibler, On information and sufficiency, Ann. Math. Statist., 22 (1951), pp. 79-86.

[20]

H. Kushner and P. Whiting, Convergence of proportional-fair sharing algorithms under general conditions, IEEE Trans. Wireless Commun., 3 (2004), pp. 1250-1259.

[21]

C. N. Laws, Resource pooling in queueing networks with dynamic routing, Adv. Appl. Probab., 24 (1992), pp. 699-726.

[22]

T.-A. Le, Improving the performance of multipath congestion control over wireless networks, in 2013 International Conference on Advanced Technologies for Communications (ATC), IEEE, Piscataway, NJ, 2013, pp. 60-65.

[23]

X. Lin and N. Shroff, Utility maximization for communication networks with multipath routing, IEEE Trans. Automat. Control, 51 (2006), pp. 766-781.

[24]

J. Little, A proof of the queueing formula L = ¿ W, Oper. Res., 9 (1961), pp. 383-387.

[25]

S. H. Low and D. E. Lapsley, Optimization flow control, I: Basic algorithm and convergence, IEEE/ACM Trans. Netw., 7 (1999), pp. 861-874.

[26]

S. H. Low, L. L. Peterson, and L. Wang, Understanding TCP Vegas: A duality model, J. ACM, 49 (2002), pp. 207-235.

[27]

J. Mo and J. Walrand, Fair end-to-end window-based congestion control, IEEE/ACM Trans. Netw., 8 (2000), pp. 556-567.

[28]

C. Paasch, G. Detal, F. Duchene, C. Raiciu, and O. Bonaventure, Exploring mobile/wifi handover with multipath TCP, in Proceedings of the 2012 ACM SIGCOMM Workshop on Cellular Networks: Operations, Challenges, and Future Design, CellNet '12, ACM, New York, 2012, pp. 31-36.

[29]

Q. Peng, A. Walid, and S. H. Low, Multipath TCP algorithms: Theory and design, SIGMETRICS '13, New York, ACM, 2013, pp. 305-316.

[30]

C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley, Improving datacenter performance and robustness with multipath TCP, in SIGCOMM '11, ACM, New York, 2011, pp. 266-277.

[31]

C. Raiciu, M. Handley, and D. Wischik, Coupled Congestion Control for Multipath Transport Protocols, IETF RFC 6356, http://tools.ietf.org/html/rfc6356 (2011).

[32]

C. Raiciu, C. Paasch, S. Barré, A. Ford, M. Honda, F. Duchene, O. Bonaventure, and M. Handley, How hard can it be? designing and implementing a deployable multipath TCP, in USENIX Symposium of Networked Systems Design and Implementation (NSDI'12), San Jose, CA, USENIX Association, Berkeley, CA, 2012.

[33]

P. Schweitzer, Bottleneck determination in networks of queues, in Applied Probability-Computer Science: The Interface, Boca Raton, FL, Birkhäuser, Boston, 1981, pp. 471-485.

[34]

P. J. Schweitzer, Approximate analysis of multiclass closed networks of queues, in Proceedings of the International Conference on Stochastic Control and Optimization, North-Holland, Amsterdam, 1979.

[35]

R. Srikant, The Mathematics of Internet Congestion Control, Birkhäuser, Boston, 2004.

[36]

B. Urgaonkar, G. Pacifici, P. Shenoy, M. Spreitzer, and A. Tantawi, An analytical model for multi-tier internet services and its applications, in ACM SIGMETRICS, ACM, New York, 2005, pp. 291-302.

[37]

P. Viswanath, D. Tse, and R. Laroia, Opportunistic beamforming using dumb antennas, IEEE Trans. Inform. Theory, 48 (2002), pp. 1277-1294.

[38]

N. Walton, Concave switching in single and multihop networks, in ACM SIGMETERICS. ACM, New York, 2014, pp. 139-151.

[39]

N. S. Walton, Proportional fairness and its relationship with multi-class queueing networks, Ann. Appl. Probab., 22 (2009), pp. 2301-2333.

[40]

W.-H. Wang, M. Palaniswami, and S. H. Low,Optimal flow control and routing in multi-path networks, Perform. Eval., 52 (2003), pp. 119-132.

[41]

D. Wischik, M. Handley, and M. B. Braun, The resource pooling principle, ACM SIGCOMM Comput. Commun. Rev., 38 (2008), pp. 47-52.

[42]

D. Wischik, C. Raiciu, A. Greenhalgh, and M. Handley, Design, implementation and evaluation of congestion control for multipath TCP, in Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, NSDI'11, USENIX Association, Berkeley, CA, 2011, pp. 99-112.

[43]

Y. Yi and M. Chiang, Stochastic network utility maximisation, Eur. Trans. Telecomm., 19 (2008), pp. 421-442.

[44]

S.-Y. Yun and A. Proutiere, Distributed load balancing in heterogeneous systems, eprint, arXiv:1403.4075, 2014.

Cited By

Lu YChen GLi BTan KXiong YCheng PZhang JChen EMoscibroda TSeshan SBanerjee S(2018)Multi-path transport for RDMA in datacentersProceedings of the 15th USENIX Conference on Networked Systems Design and Implementation10.5555/3307441.3307472(357-371)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.5555/3307441.3307472

Index Terms

Decentralized Proportional Load Balancing

Index terms have been assigned to the content through auto-classification.

Recommendations

Elastic Load Balancing Classic Load Balancers
Elastic Load Balancing Application Load Balancers
Threshold load balancing with weighted tasks
Abstract
We study threshold-based load balancing protocols for weighted tasks. We are given an arbitrary graph G with n nodes (resources, bins) and m ≥ n tasks (balls). Initially the tasks are distributed arbitrarily over the n nodes. The ...
Highlights
- We study threshold-based load balancing protocols for weighted tasks in graphs.

Comments

Information & Contributors

Information

Published In

cover image SIAM Journal on Applied Mathematics

SIAM Journal on Applied Mathematics Volume 76, Issue 1

ISSN:0036-1399

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 2016

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lu YChen GLi BTan KXiong YCheng PZhang JChen EMoscibroda TSeshan SBanerjee S(2018)Multi-path transport for RDMA in datacentersProceedings of the 15th USENIX Conference on Networked Systems Design and Implementation10.5555/3307441.3307472(357-371)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.5555/3307441.3307472

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents