A Simple Steady-State Analysis of Load Balancing Algorithms in the Sub-Halfin-Whitt Regime

2018/04/08 by Xin Liu, Lei Ying, Liu, Xin +1 · 1 citation
Business, Management and Accounting · Computer Science · Decision Sciences · #Advanced Queuing Theory Analysis #Distributed systems and fault tolerance #FOS: Mathematics #Probability (math.PR) #Probability and Risk Models

paper · pdf · doi:10.48550/arxiv.1804.02622

openalex publication_date 2018/04/08 · openalex created_date 2018/04/13 · openalex updated_date 2026/07/28

Abstract

This paper studies a class of load balancing algorithms for many-server (N servers) systems assuming finite buffer with size b-1 (i.e. a server can have at most one job in service and b-1 jobs in queue). We focus on steady-state performance of load balancing algorithms in the heavy traffic regime such that the load of system is λ= 1 - N^-α for 0

Cited by

• Transform Method for Stochastic Processing and Matching Networks

Related

• Steady-State Analysis of Load Balancing with Coxian-2 Distributed Service Times
• Zero-Waiting Load Balancing with Heterogeneous Servers in Heavy Traffic
• On Universal Scaling of Distributed Queues under Load Balancing
• Large-System Insensitivity of Zero-Waiting Load Balancing Algorithms
• Flexible Load Balancing with Multi-dimensional State-space Collapse: Throughput and Heavy-traffic Delay Optimality