Stateless Datacenter Load-balancing with Beamer

被引:0
|
作者
Olteanu, Vladimir [1 ]
Agache, Alexandru [1 ]
Voinescu, Andrei [1 ]
Raiciu, Costin [1 ]
机构
[1] Univ Politehn Bucuresti, Bucharest, Romania
基金
欧盟地平线“2020”;
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Datacenter load balancers (or muxes) steer traffic destined to a given service across a dynamic set of backend machines. To ensure consistent load balancing decisions when backends come or leave, existing solutions make a load balancing decision per connection and then store it as per-connection state to be used for future packets. While simple to implement, per-connection state is brittle: SYN-flood attacks easily fill state memory, preventing muxes from keeping state for good connections. We present Beamer, a datacenter load-balancer that is designed to ensure stateless mux operation. The key idea is to leverage the connection state already stored in backend servers to ensure that connections are never dropped under churn: when a server receives a mid-connection packet for which it doesn't have state, it forwards it to another server that should have state for the packet. Stateless load balancing brings many benefits: our software implementation of Beamer is twice faster than Google's Maglev, the state of the art software load balancer, and can process 40Gbps of HTTP uplink traffic on 7 cores. Beamer is simple to deploy both in software and in hardware as our P4 implementation shows. Finally, Beamer allows arbitrary scale-out and scale-in events without dropping any connections.
引用
收藏
页码:125 / 139
页数:15
相关论文
共 50 条
  • [21] A Fair and Dynamic Load-Balancing Mechanism
    Larroca, Federico
    Rougier, Jean-Louis
    TRAFFIC MANAGEMENT AND TRAFFIC ENGINEERING FOR THE FUTURE INTERNET, 2009, 5464 : 36 - 52
  • [22] Multiple Service Load-Balancing with OpenFlow
    Koerner, Marc
    Kao, Odej
    2012 IEEE 13TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2012,
  • [23] A hierarchical routing method for load-balancing
    Bak, S
    HIGH PERFORMANCE COMPUTING - HIPC 2003, 2003, 2913 : 142 - 151
  • [24] Load-Balancing in Distributed Selective Search
    Kim, Yubin
    Callan, Jamie
    Culpepper, J. Shane
    Moffat, Alistair
    SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 905 - 908
  • [25] Load balancing for heterogeneous traffic in datacenter networks
    Wang, Jin
    Rao, Shuying
    Liu, Ying
    Sharma, Pradip Kumar
    Hu, Jinbin
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2023, 217
  • [26] Dynamic load-balancing for BSP time warp
    Low, MYH
    35TH ANNUAL SIMULATION SYMPOSIUM, PROCEEDINGS, 2002, : 267 - 274
  • [27] Minimum-Cost Load-Balancing Partitions
    Boris Aronov
    Paz Carmi
    Matthew J. Katz
    Algorithmica, 2009, 54 : 318 - 336
  • [28] Load-balancing routing for wireless access networks
    Hsiao, PH
    Hwang, A
    Kung, HT
    Vlah, D
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 986 - 995
  • [29] The convergence of realistic distributed load-balancing algorithms
    Cedo, F.
    Cortes, A.
    Ripoll, A.
    Senar, M. A.
    Luque, E.
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (04) : 609 - 618
  • [30] Improved Analysis of Deterministic Load-Balancing Schemes
    Berenbrink, Petra
    Klasing, Ralf
    Kosowski, Adrian
    Mallmann-Trenn, Frederik
    Uznanski, Przemyslaw
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (01)